๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Parallel Processing of Robot Dynamics Simulation Using Optimal Multiprocessor Scheduling Algorithms

โœ Scribed by Hironori Kasahara; Masahiko Iwata; Seinosuke Narita; Hirofumi Fujii

Book ID
112205790
Publisher
John Wiley and Sons
Year
1988
Tongue
English
Weight
695 KB
Volume
19
Category
Article
ISSN
0882-1666

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Optimization of job scheduling on parall
Optimization of job scheduling on parallel machines by simulated annealing algorithms
โœ Zhen-Ping Lo; B. Bavarian ๐Ÿ“‚ Article ๐Ÿ“… 1992 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 536 KB

ln this paper, we consider the problem of scheduling a set of simultaneously available jobs on several parallel machines. Specifically, the minimization of the time to finish all the jobs assigned to all machines under job deadline constraints for n jobs, m machines problem is formulated in this pap

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