Sciweavers

306 search results - page 1 / 62
» A New Heuristic for Scheduling Parallel Programs on Multipro...
Sort
View
IEEEPACT
1998
IEEE
13 years 8 months ago
A New Heuristic for Scheduling Parallel Programs on Multiprocessor
In this paper, we present an efficient algorithm, called CASS-II, for task clustering without task duplication. Unlike the DSC algorithm, which is empirically the best known algor...
Jing-Chiou Liou, Michael A. Palis
CEC
2005
IEEE
13 years 6 months ago
Heterogeneous multiprocessor scheduling with differential evolution
The problem of scheduling a parallel program given by a Directed Acyclic Graph (DAG) of tasks is a well-studied area. We present a new approach which employs Differential Evolution...
Krzysztof Rzadca, Franciszek Seredynski
IPPS
1994
IEEE
13 years 8 months ago
A Comparison of Heuristics for Scheduling DAGs on Multiprocessors
Many algorithms to schedule DAGs on multiprocessors have been proposed, but there has been little work done to determine their effectiveness. Since multi-processor scheduling is a...
Carolyn McCreary, A. A. Khan, J. J. Thompson, M. E...
CCGRID
2008
IEEE
13 years 11 months ago
Scheduling Asymmetric Parallelism on a PlayStation3 Cluster
Understanding the potential and implications of asymmetric multi-core processors for cluster computing is necessary, as these processors are rapidly becoming mainstream components...
Filip Blagojevic, Matthew Curtis-Maury, Jae-Seung ...
TPDS
1998
124views more  TPDS 1998»
13 years 4 months ago
Using Recorded Values for Bounding the Minimum Completion Time in Multiprocessors
—The way the processes in a parallel program are scheduled on the processors of a multiprocessor system affects the performance significantly. Finding a schedule of processes to ...
Lars Lundberg, Håkan Lennerstad