1-optimality of static BSP computations: scheduling independent chains as a case study-Reference-Cited by-同舟云学术

1-optimality of static BSP computations: scheduling independent chains as a case study

Published:2003-01 Issue:3 Volume:290 Page:1331-1359
ISSN:0304-3975
Container-title:Theoretical Computer Science
language:en
Short-container-title:Theoretical Computer Science

Author:

Goldman Alfredo,Mounie Gregory,Trystram Denis

Publisher

Elsevier BV

Subject

General Computer Science,Theoretical Computer Science

Reference26 articles.

1. M. Adler, W. Dittrich, B. Juurlink, M. Kutylowski, I. Rieping, Communication-optimal parallel minimum spanning tree algorithms, 10th Ann. ACM Symp. on Parallel Algorithms And Architectures (SPAA 98), Puerto Vallarta, Mexico, June 28–July 2 1998.

2. R.J. Anderson, P. Beame, W.L. Ruzzo, Low overhead parallel schedules for task graphs (extended abstract), SPAA: Ann. ACM Symp. on Parallel Algorithms and Architectures, 1990.

3. O. Bonorden, B. Juurlink, I. von Otte, I. Rieping, The Paderborn University bsp (pub) library—design, implementation and performance, Proc. 13th Internat. Parallel Process. Sympos. & 10th Sympos. on Parallel and Distributed Processing (IPPS/SPDP), San Juan, Puerto Rico, April 1999. url:http://www.uni-paderborn.de/~pub.

4. Efficient parallel graph algorithms for coarse grained multicomputers and BSP;Caceres,1997

5. Bulk synchronous parallel scheduling of uniform dags;Calinescu,1996

Cited by 3 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A scalable algorithm for homomorphic computing on multi-core clusters;2022 21st International Symposium on Parallel and Distributed Computing (ISPDC);2022-07

2. On approximation of the bulk synchronous task scheduling problem;IEEE Transactions on Parallel and Distributed Systems;2003-11

3. Portable and architecture independent parallel performance tuning using BSP;Parallel Computing;2002-11