✦ LIBER ✦

Practical multiprocessor scheduling algorithms for efficient parallel processing

✍ Scribed by Hironori Kasahara; Seinosuke Narita

Book ID: 112205426
Publisher: John Wiley and Sons
Year: 1985
Tongue: English
Weight: 790 KB
Volume: 16
Category: Article
ISSN: 0882-1666
DOI: 10.1002/scj.4690160202

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Approximation algorithm for multiprocess

Approximation algorithm for multiprocessor parallel job scheduling

✍ Chen, Song-qiao ;Huang, Jin-gui ;Chen, Jian-er 📂 Article 📅 2002 🏛 Chinese Electronic Periodical Services 🌐 English ⚖ 415 KB

Parallel Processing of Robot Dynamics Si

Parallel Processing of Robot Dynamics Simulation Using Optimal Multiprocessor Scheduling Algorithms

✍ Hironori Kasahara; Masahiko Iwata; Seinosuke Narita; Hirofumi Fujii 📂 Article 📅 1988 🏛 John Wiley and Sons 🌐 English ⚖ 695 KB

A parallel algorithm of simulated anneal

A parallel algorithm of simulated annealing for multiprocessor scheduling

✍ A. V. Kalashnikov; V. A. Kostenko 📂 Article 📅 2008 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 240 KB

Barely Random Algorithms for Multiproces

Barely Random Algorithms for Multiprocessor Scheduling

✍ Steve Seiden 📂 Article 📅 2003 🏛 Springer US 🌐 English ⚖ 179 KB

An efficient parallel sorting algorithm

An efficient parallel sorting algorithm for shared memory multiprocessors

✍ M. Wheat; D.J. Evans 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 498 KB

Efficient Scheduling of Arbitrary Task G

Efficient Scheduling of Arbitrary Task Graphs to Multiprocessors Using a Parallel Genetic Algorithm

✍ Yu-Kwong Kwok; Ishfaq Ahmad 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 492 KB

Given a parallel program represented by a task graph, the objective of a scheduling algorithm is to minimize the overall execution time of the program by properly assigning the nodes of the graph to the processors. This multiprocessor scheduling problem is NP-complete even with simplifying assumptio