On linear schedules of task graphs for generalized LogP-machines

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1300 LNCS, Issue , 1997, Pages 895-904

  Löwe, Welf ^a   Zimmermann, Wolf ^a   Eisenbiegler, Jörn ^a  

^a UNIVERSITY OF KARLSRUHE   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

CLUSTERING ALGORITHMS;

CLUSTERINGS; COMMUNICATION COST; CONSTANT PARAMETERS; DIFFERENT SIZES; LOGP MODEL; NUMBER OF CLUSTERS; TASK GRAPH; UPPER TIME BOUNDS;

SCHEDULING ALGORITHMS;

EID: 84882599243     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0002832     Document Type: Conference Paper

References (15)

1. A. Alexandrov, M. Ionescu, K. E. Schauser, and C. Scheimann. Loggp: Incorporating long messages into the logp-model - one step closer towards a realistic model for parallel computation. In 7th Annual Symposium on Parallel Algorithms and Architectures, pages 95-105. ACM Press, 1995.
2. D. Culler, R. Karp, D. Patterson, A. Sahay, K. E. Schauser, E. Santos, R. Subramonian, and T. von Eicken. LogP: Towards a realistic model of parallel computation. In 4th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (PPOPP 93), pages 1-12, 1993. published in: SIGPLAN Notices (28) 7.
3. D. Culler, R. Karp, D. Patterson, A. Sahay, K. E. Schauser, E. Santos, R. Subramonian, and T. von Eicken. LogP: A practical model of parallel computation. Communications of the ACM, 39(11): 78-85, 1996.
4. B. Di Martino and G. Ianello. Parallelization of non-simultaneous iterative methods for systems of linear equations. In Parallel Processing: CONPAR 94 - VAPP VI, volume 854 of Lecture Notes in Computer Science, pages 253-264. Springer, 1994.
5. Jörn Eisenbiegler, Welf Löwe, and Andreas Wehrenpfennig. On the optimization by redundancy using an extended LogP model. In International Conference on Advances in Parallel and Distributed Computing (APDC'97), pages 149-155. IEEE Computer Society Press, 1997.
6. A. Gerasoulis and T. Yang. On the granularity and clustering of directed acyclic task graphs. IEEE Transactions on Parallel and Distributed Systems, 4: 686-701, June 1993.
7. 5/2 algorithm for maximum matchings in bipartite graphs. SIAM Journal on Computing, 2(4): 225-231, 1973.
8. R. M. Karp, A. Sahay, E. E. Santos, and K. E. Schauser. Optimal broadcast and summation in the LogP model. In 5th Annual ACM Symposium on Parallel Algorithms and Architectures, pages 142-153. ACM, 1993.
9. W. Löwe, J. Eisenbiegler, and W. Zimmermann. Optimizing parallel programs on machines with fast communication. In 9. International Conference on Parallel and Distributed Computing Systems, pages 100-103, 1996.
10. W. Löwe, M. Middendorf, and W. Zimmermann. Scheduling inverse trees under the communication model of the logp-machine. Theoretical Computer Science, 1997. Submitted, currently under revision.
11. W. Löwe and W. Zimmermann. On finding optimal clusterings in task graphs. In N. Mirenkov, editor, Parallel Algorithms/Architecture Synthesis pAs'95, pages 241-247. IEEE, 1995.
12. W. Löwe and W. Zimmermann. Programming data-parallel - executing process parallel. In P. Fritzson and L. Finmo, editors, Parallel Programming and Applications, pages 50-64. IOS Press, 1995.
13. C.H. Papadimitriou and M. Yannakakis. Towards an architecture-independent analysis of parallel algorithms. SIAM Journal on Computing, 19(2): 322-328, 1990.
14. T. Yang and A. Gerasoulis. DSC: Scheduling parallel tasks on an unbounded number of processors. IEEE Transactions on Parallel and Distributed Systems, 5(9): 951-967, 1994.
15. W. Zimmermann and W. Löwe. An approach to machine-independent parallel programming. In Parallel Processing: CONPAR 94 - VAPP VI, volume 854 of Lecture Notes in Computer Science, pages 277-288. Springer, 1994.