A universal approach for task scheduling for distributed memory multiprocessors
- 17 December 2002
- proceedings article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 16, 577-584
- https://doi.org/10.1109/shpcc.1994.296693
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Mapping to reduce contention in multiprocessor architecturesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- A MAPPING STRATEGY FOR MIMD COMPUTERSInternational Journal of High Speed Computing, 1993
- A generalized scheme for mapping parallel algorithmsIEEE Transactions on Parallel and Distributed Systems, 1993
- A comparison of clustering heuristics for scheduling directed acyclic graphs on multiprocessorsJournal of Parallel and Distributed Computing, 1992
- Scheduling parallel program tasks onto arbitrary target machinesJournal of Parallel and Distributed Computing, 1990
- Multiprocessor scheduling with interprocessor communication delaysOperations Research Letters, 1988
- A Mapping Strategy for Parallel ProcessingIEEE Transactions on Computers, 1987
- A Shortest Tree Algorithm for Optimal Assignments Across Space and Time in a Distributed Processor SystemIEEE Transactions on Software Engineering, 1981
- A comparison of list schedules for parallel processing systemsCommunications of the ACM, 1974
- Parallel Sequencing and Assembly Line ProblemsOperations Research, 1961