Abstract
A runtime system is described here for dynamic DAG execution. A large D A G while 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. © 2000 Springer-Verlag Berlin Heidelberg.
Cite
CITATION STYLE
Wu, M. Y., Shu, W., & Chen, Y. (2000). A runtime system for dynamic DAG programming. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1800 LNCS, pp. 1192–1199). Springer Verlag. https://doi.org/10.1007/3-540-45591-4_164
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
