On mapping parallel algorithms into parallel architectures
Journal of Parallel and Distributed Computing
Scheduling parallel program tasks onto arbitrary target machines
Journal of Parallel and Distributed Computing - Special issue: software tools for parallel programming and visualization
Introduction to parallel computing
Introduction to parallel computing
PYRROS: static task scheduling and code generation for message passing multiprocessors
ICS '92 Proceedings of the 6th international conference on Supercomputing
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
A taxonomy of scheduling in general-purpose distributed computing systems
IEEE Transactions on Software Engineering
Lu decomposition on a multiprocessing system with communications delay
Lu decomposition on a multiprocessing system with communications delay
Static task scheduling and grain packing in parallel processing systems
Static task scheduling and grain packing in parallel processing systems
Static scheduling algorithms for allocating directed task graphs to multiprocessors
ACM Computing Surveys (CSUR)
CASCH: A Tool for Computer-Aided Scheduling
IEEE Concurrency
Hindsight Helps: Deterministic Task Scheduling with Backtracking
ICPP '97 Proceedings of the international Conference on Parallel Processing
An Automatic Scheduler for Parallel Machines (Research Note)
Euro-Par '02 Proceedings of the 8th International Euro-Par Conference on Parallel Processing
Automatic Parallelization and Scheduling of Programs on Multiprocessors using CASCH
ICPP '97 Proceedings of the international Conference on Parallel Processing
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
Dynamic mapping of cooperating tasks to nodes in a distributed system
Future Generation Computer Systems
Automatic choice of scheduling heuristics for parallel/distributed computing
Scientific Programming
Dynamic mapping of cooperating tasks to nodes in a distributed system
Future Generation Computer Systems
PCI'01 Proceedings of the 8th Panhellenic conference on Informatics
EURO-PDP'00 Proceedings of the 8th Euromicro conference on Parallel and distributed processing
| Hi-index | 0.00 |
Parallax, a scheduling tool that incorporates seven traditional and nontraditional scheduling heuristics and lets developers compare their performance for real applications on real parallel machines, is discussed. Of the seven heuristics, two simple ones consider only task execution time, two consider both task execution and message-passing delay times, two use task duplication to reduce communication delay, and one considers communication delays, task execution time, and target machine characteristics such as interconnection network topology and overhead due to message-passing and process creation. Two examples of parallel applications of Parallax are described.