A Runtime System for Dynamic DAG Programming
- 381 Downloads
A runtime system is described here for dynamic DAG execution. A large DAG which represents an application program can be executed on a parallel system without consuming large amount of memory space. A DAG scheduling algorithm has been parallelized to scale to large systems. Inaccurate estimation of task execution time and communication time can be tolerated. Implementation of this parallel incremental system demonstrates the feasibility of this approach. Preliminary results show that it is superior to other approaches.
KeywordsSchedule Algorithm Memory Space Gaussian Elimination Task Graph Source Domain
Unable to display preview. Download preview PDF.
- 1.I. Ahmad, Y.K. Kwok, and M. Y. Wu. Performance comparison of algorithms for static scheduling of DAGs to multiprocessors. In Second Australasian Conference on Parallel and Real-time Systems, pages 185–192, September 1995.Google Scholar
- 2.M. Cosnard, E. Jeannnot, and L. Rougeot. Low memory cost dynamic scheduling of large coarse grain task graphs. In International Parallel Processing Symposium, April 1998.Google Scholar
- 3.H. El-Rewini and T. G. Lewis. Scheduling parallel program tasks onto arbitrary target machines. Journal of Parallel and Distributed Computing, June 1990.Google Scholar
- 4.M.R. Gary and D.S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman and Company, 1979.Google Scholar
- 8.M. Y. Wu, W. Shu, and Y. Chen. Incremental scheduling and execution of dags. In IASTED International Conference on Parallel and Distributed Computing Systems, November 1999.Google Scholar