Duplication-Based Scheduling Algorithm for Interconnection-Constrained Distributed Memory Machines
Duplication-based scheduling techniques are more appropriate for fine grain task graphs and for networks with high communication latencies. However, most of the algorithms are developed under the assumption of fully connected processor network and with prohibitively high O(v4) time complexity. An insertion based duplication algorithm is proposed for precedence constrained task graphs, for working with limited interconnection constrained processors. It duplicates only the most important immediate parents of a task, that too if critical. Results are presented for benchmark random task graphs, having widely varying shape and cost parameters for the clique, Hypercube and an extensible and fault tolerant binary de Bruijn (undirected) multiprocessor network. The average performance degradation, due to interconnection constraints, is about 21% in comparison to fully connected processor network. Further, the schedules generated on the fixed degree binary de-Bruijn network are within 5% of the schedules on Hypercube network, whose degree keeps on increasing with size.
Unable to display preview. Download preview PDF.
- 2.Kruatrachue, B., Lewis, T.G.: Grain Size Determination for Parallel Processing. IEEE Transactions on Software Engineering(1988) 23–32Google Scholar
- 3.Sih, G.C., Lee, E.A.: A Compile-Time Scheduling Heuristic for Interconnection Constrained Heterogeneous Processor Architectures. IEEE Transactions on Parallel and Distributed Systems.4 (1993) 75–87Google Scholar
- 4.Rewini, H.El., Lewis, T.G., Ali, H.H.: Task Scheduling in Parallel and Distributed Systems. Prentice Hall, NJ (1994)Google Scholar
- 5.Ahmed, I., Kwok, Y.K.: On Exploiting Task Duplication in Parallel Program Scheduling. IEEE Transactions on Parallel and Distributed Systems (1998) 872–892Google Scholar
- 6.Dikaiakos, M.D., et. al.: A Comparative Study of Heuristics for Mapping Parallel Algorithms to Message Passing Multiprocessors. Tech. Report Princeton University (1994)Google Scholar
- 7.Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness, W.H. Freeman and Co. (1979)Google Scholar
- 10.Sevalkumar, S., Ramamoorthy, C.V.: Scheduling Precedence Constrained Task Graphs with Non-Negligible Inter Task Communication onto Multiprocessors. IEEE Transactions on Parallel and Distributed Systems (1994) 328–336Google Scholar
- 11.Darbha, S., Agrawal, D.P.: Optimal Scheduling Algorithm for Distributed Memory Machines, IEEE Transactions on Parallel and Distributed systems (1998) 87–95Google Scholar
- 15.Bansal, S., Kumar, P., Singh, K.: A Cost-effective Scheduling Algorithm for Message Passing Multiprocessor Systems. (Accepted for publication in Proc. PDCS-2002, Louisville, Kentucky, USA, Sept. 19-21, 2002)Google Scholar