Optimization of parallel programs on machines with expensive communication

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

Volumn 1124, Issue , 1996, Pages 602-610

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

^a UNIVERSITY OF KARLSRUHE   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; COMPUTERS;

ON-MACHINES; PARALLEL PROGRAM; PARSYTEC; SCHEDULING TECHNIQUES; TARGET MACHINES; WORKSTATION CLUSTERS; XPLORER;

ARTIFICIAL INTELLIGENCE;

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

References (14)

1. 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.
2. B. Di Martino and G. Ianello. Parallelization of non-simultaneous iterative methods for systems of linear equations. In LNCS 854, Parallel Processing: CONPAR’94-VAPP VI, pages 254-264. Springer, 1994.
3. 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.
4. R. M. Karp and V. Ramachandran. Parallel algorithms for shared memory machines. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science Vol. A, pages 871-941. MIT-Press, 1990.
5. R. M. Karp, A. Sahay, E. E. Santos, and K. E. Schauser. Optimal broadcast and summation in the Log P model. In 5th Annual ACM Symposium on Parallel Algorithms and Architectures, pages 142-153. ACM, 1993.
6. W. Löwe. Optimization of pram-programs with input-dependent memory access. In S. Haridi and K. Ali, editors, EUROPAR’ 95. Parallel Processing, volume 966 of Lecture Notes in Computer Science, pages 243-254, 1995.
7. 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.
8. 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.
9. W. Löwe and W. Zimmermann. Upper time bounds for executing pramprograms on the logp-machine. In M. Wolfe, editor, Proceedings of the 9th ACM International Conference on Supercomputing, pages 41-50. ACM, 1995.
10. C.H. Papadimitriou and M. Yannakakis. Towards an architecture-independent analysis of parallel algorithms. SIAM Journal on Computing, 19(2):322-328, 1990.
11. H. Saran and V. Vazirani. Finding k-cuts within twice the optimal. In Proceedings of the 32 Ann. IEEE Symp. on Foundations of Computer Science, pages 743-751. IEEE Compute Society, 1991.
12. 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.
13. 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.
14. W. Zimmermann, W. Löwe, and J. Gottlieb. On the design and implementation of parallel algorithms for solving inverse problems. In Workshop on Parameter Identification and Inverse Problems in Hydrology, Geology, and Ecology, 1996. to appear.