A general approach to multiprocessor scheduling
A general approach to multiprocessor scheduling
Task assignment in a multiprocessor system
Microprocessing and Microprogramming
Scheduling parallel program tasks onto arbitrary target machines
Journal of Parallel and Distributed Computing - Special issue: software tools for parallel programming and visualization
Scheduling of precedence-constrained tasks on multiprocessors
The Computer Journal - Special issue on parallel computing
Analysis and evaluation of heuristic methods for static task scheduling
Journal of Parallel and Distributed Computing
A comparison of list schedules for parallel processing systems
Communications of the ACM
Partitioning and Scheduling Parallel Programs for Multiprocessors
Partitioning and Scheduling Parallel Programs for Multiprocessors
Parallelism in Production Systems
Parallelism in Production Systems
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Grain Size Determination for Parallel Processing
IEEE Software
Hypertool: A Programming Aid for Message-Passing Systems
IEEE Transactions on Parallel and Distributed Systems
Static scheduling algorithms for allocating directed task graphs to multiprocessors
ACM Computing Surveys (CSUR)
IEEE Transactions on Parallel and Distributed Systems
Duplication-Based Scheduling Algorithm for Interconnection-Constrained Distributed Memory Machines
HiPC '02 Proceedings of the 9th International Conference on High Performance Computing
A fast task-to-processor assignment heuristic for real-time multiprocessor DSP applications
Computers and Operations Research
IEEE Transactions on Parallel and Distributed Systems
Scheduling Communication-Aware Tasks on Distributed Heterogeneous Computing Systems
ICDCSW '04 Proceedings of the 24th International Conference on Distributed Computing Systems Workshops - W7: EC (ICDCSW'04) - Volume 7
ICPADS '06 Proceedings of the 12th International Conference on Parallel and Distributed Systems - Volume 1
Automatic choice of scheduling heuristics for parallel/distributed computing
Scientific Programming
A dominant predecessor duplication scheduling algorithm for heterogeneous systems
The Journal of Supercomputing
Communication-Aware Scheduling Algorithm Based on Heterogeneous Computing Systems
ICCS '07 Proceedings of the 7th international conference on Computational Science, Part I: ICCS 2007
Journal of Parallel and Distributed Computing
Scheduling parallel tasks onto NUMA multiprocessors with inter-processor communication overhead
ISPA'03 Proceedings of the 2003 international conference on Parallel and distributed processing and applications
TELE-INFO'06 Proceedings of the 5th WSEAS international conference on Telecommunications and informatics
A novel task scheduling algorithm for distributed heterogeneous computing systems
PARA'04 Proceedings of the 7th international conference on Applied Parallel Computing: state of the Art in Scientific Computing
Energy- and performance-aware scheduling of tasks on parallel and distributed systems
ACM Journal on Emerging Technologies in Computing Systems (JETC)
| Hi-index | 0.00 |
The multiprocessor scheduling problem is the problem of scheduling the tasks of aprecedence constrained task graph (representing a parallel program) onto the processorsof a multiprocessor in a way that minimizes the completion time. Since this problem isknown to be NP-hard in the strong sense in all but a few very restricted eases, heuristicalgorithms are being developed which obtain near optimal schedules in a reasonableamount of computation time. We present an efficient heuristic algorithm for schedulingprecedence constrained task graphs with nonnegligible intertask communication ontomultiprocessors taking contention in the communication channels into consideration. Ouralgorithm for obtaining satisfactory suboptimal schedules is based on the classical listscheduling strategy. It simultaneously exploits the schedule-holes generated in theprocessors and in the communication channels during the scheduling process in order toproduce better schedules. We demonstrate the effectiveness of our algorithm bycomparing with two competing heuristic algorithms available in the literature.