✦ LIBER ✦

Generating Self-Scheduling Code for Nonloop Parallelism

✍ Scribed by Carl J. Beckmann

Publisher: Elsevier Science
Year: 1996
Tongue: English
Weight: 443 KB
Volume: 39
Category: Article
ISSN: 0743-7315
DOI: 10.1006/jpdc.1996.0161

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Approximation algorithms for general par

Approximation algorithms for general parallel task scheduling

✍ Oh-Heum Kwon; Kyung-Yong Chwa 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 281 KB

A general parallel task scheduling problem is considered. A task can be processed in parallel on one of several alternative subsets of processors. The processing time of the task depends on the subset of processors assigned to the task. We first show the hardness of approximating the problem for bot

Parallel code generation for super-scala

Parallel code generation for super-scalar architectures

✍ Edil S.T. Fernandes; Claudson F. Bornstein; Claudia M.D. Pereira 📂 Article 📅 1992 🏛 Elsevier Science ⚖ 223 KB

Processor self-scheduling for parallel l

Processor self-scheduling for parallel loops in preemptive environments

✍ Yang Xuejun; Chen Haibo; Ci Yungui; Chen Fujie; Chen Lijie 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 450 KB

Parallel genetic algorithms for the earl

Parallel genetic algorithms for the earliness-tardiness job scheduling problem with general penalty weights

✍ Chae Y. Lee; Seok J. Kim 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 863 KB

A column generation based decomposition

A column generation based decomposition algorithm for a parallel machine just-in-time scheduling problem

✍ Zhi-Long Chen; Warren B. Powell 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 162 KB