UET scheduling with unit interprocessor communication delays
Discrete Applied Mathematics
Processor Allocation for Horizontal and Vertical Parallelism and Related Speedup Bounds
IEEE Transactions on Computers
Scheduling precedence graphs in systems with interprocessor communication times
SIAM Journal on Computing
Introduction to Algorithms: A Creative Approach
Introduction to Algorithms: A Creative Approach
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
HiPC '01 Proceedings of the 8th International Conference on High Performance Computing
Static Scheduling of Instructions on Micronet-based Asynchronous Processors
ASYNC '96 Proceedings of the 2nd International Symposium on Advanced Research in Asynchronous Circuits and Systems
| Hi-index | 0.00 |
This paper addresses the problem of assigning inter-dependent tasks to processing elements in parallel and distributed computers. We consider tasks with non-uniform execution and communication times. We present a new heuristic scheme to assign dependency graphs nonpreemptively. The heuristics are based on satisfying two properties: independent tasks execute on distinct processors and dependent tasks execute on the same processor. The algorithm is based on the so-called depth-first breadth-next (DFBN) search. We show that the time complexity of our scheme is at least one order less compared to other related schemes.