Compile-time partitioning and scheduling of parallel programs
SIGPLAN '86 Proceedings of the 1986 SIGPLAN symposium on Compiler construction
Scheduling precedence graphs in systems with interprocessor communication times
SIAM Journal on Computing
A comparison of list schedules for parallel processing systems
Communications of the ACM
Hypertool: A Programming Aid for Message-Passing Systems
IEEE Transactions on Parallel and Distributed Systems
Analysis of Macro-Dataflow Dynamic Scheduling on Nonuniform Memory Access Architectures
IEEE Transactions on Parallel and Distributed Systems
Static task scheduling and grain packing in parallel processing systems
Static task scheduling and grain packing in parallel processing systems
A comparative analysis of static parallel schedulers where communication costs are significant
A comparative analysis of static parallel schedulers where communication costs are significant
Scheduling optimization through iterative refinement
PACT '95 Proceedings of the IFIP WG10.3 working conference on Parallel architectures and compilation techniques
Performance evaluation of routing algorithms under various network configuration parameters
International Journal of Network Management
Performance of Evolutionary Approaches for Parallel Task Scheduling under Different Representations
Proceedings of the Applications of Evolutionary Computing on EvoWorkshops 2002: EvoCOP, EvoIASP, EvoSTIM/EvoPLAN
A Performance Evaluation of CP List Scheduling Heuristics for Communication Intensive Task Graphs
IPPS '98 Proceedings of the 12th. International Parallel Processing Symposium on International Parallel Processing Symposium
| Hi-index | 0.00 |
Using knowledge on computation, communication, and multiprocessor topology, a class of global priority-based scheduling heuristics, called generalized list scheduling (GLS) isproposed. Task-priority is defined as the completion time of the task following backwardscheduling the computation over the multiprocessor by using the best local heuristic. GLS scheduling consists of using the task-priority in forward, graph-driven scheduling.Evaluation of local (ETF) and GLS heuristics is carried out by altering over thecommunication, parallelism, and system topology. Analysis shows that local heuristics rely on locally maximizing the efficiency and gives acceptable solutions only when theparallelism is large enough to cover the communication (bounded speedup). GLSscheduling outperforms the local approaches versus change in parallelism, communication, and network topology. The time complexity of GLS heuristics is O(pn/sup 2/), where p and n are the number of processors and that of the tasks, respectively.