On the effectiveness of D-BSP as a bridging model of parallel computation?

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

Volumn 2074, Issue , 2001, Pages 579-588

  Bilardi, Gianfranco ^a   Fantozzi, Carlo ^a   Pietracaprina, Andrea ^a   Pucci, Geppino ^a  

^a UNIVERSITY OF PADOVA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84957894563     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45718-6_63     Document Type: Conference Paper

References (25)

1. A. Bäumker, W. Dittrich, and F. Meyer auf der Heide. Truly efficient parallel algorithms: c-optimal multisearch for and extension of the BSP model. In Proc. of the 3rd European Symposium on Algorithms, pages 17–30, 1995.
2. G.E. Blelloch, P.B. Gibbons, Y. Matias, and M. Zagha. Accounting for memory bank contention and delay in high-bandwidth multiprocessors. In Proc. of the 7th ACM Symp. on Parallel Algorithms and Architectures, pages 84–94, Santa Barbara, CA, July 1995.
3. G. Bilardi, K.T. Herley, A. Pietracaprina, G. Pucci, and P. Spirakis. BSP vs LogP. In Proc. of the 8th ACM Symp. on Parallel Algorithms and Architectures, pages 25–32, 1996. To appear in Algorithmica, Special Issue on Coarse Grained Parallel Algorithms.
4. G. Bilardi, K. Herley, A. Pietracaprina, and G. Pucci. On stalling in LogP. In Proc. of the Workshop on Advances in Parallel and Distributed Computational Models, LNCS 1800, pages 109–115, May 2000.
5. G. Bilardi, A. Pietracaprina, and G. Pucci. A quantitative measure of portability with application to bandwidth-latency models for parallel computing. In Proc. of EUROPAR 99, LNCS 1685, pages 543–551, September 1999.
6. D.E. Culler, R. Karp, D. Patterson, A. Sahay, E. Santos, K.E. Schauser, R. Subramonian, and T.V. Eicken. LogP: A practical model of parallel computation. Communications of the ACM, 39(11):78–85, November 1996.
7. A. Czumaj, F. Meyer auf der Heide, and V. Stemann. Shared memory simulations with triple-logarithmic delay. In Proc. of the 3rd European Symposium on Algorithms, pages 46–59, 1995.
8. J.L. Carter and M.N. Wegman. Universal classes of hash functions. Journal of Computer and System Sciences, 18:143–154, 1979.
9. P. De laTorre and C.P. Kruskal. Submachine locality in the bulk synchronous setting. In Proc. of EUROPAR 96, LNCS 1124, pages 352–358, August 1996.
10. C. Fantozzi, A. Pietracaprina, and G. Pucci. Implementing shared memory on clustered machines. In Proc. of 2nd International Parallel and Distributed Processing Symposium, 2001. To appear.
11. M.T. Goodrich. Communication-efficient parallel sorting. In Proc. of the 28th ACM Symp. on Theory of Computing, pages 247–256, Philadelphia, Pennsylvania USA, May 1996.
12. M. Hall Jr. Combinatorial Theory. John Wiley & Sons, New York NY, second edition, 1986.
13. J. JáJá. An Introduction to Parallel Algorithms. Addison Wesley, Reading MA, 1992.
14. B.H.H. Juurlink and H.A.G. Wijshoff. The E-BSP model: Incorporating general locality and unbalanced communication into the BSP model. In Proc. of EUROPAR 96, LNCS 1124, pages 339–347, August 1996.
15. B.H.H. Juurlink and H.A.G. Wijshoff. A quantitative comparison of paralle computation models. In Proc. of the 8th ACM Symp. on Parallel Algorithms and Architectures, pages 13–24, June 1996.
16. F.T. Leighton. Introduction to Parallel Algorithms and Architectures: Arrays • Trees • Hypercubes. Morgan Kaufmann, San Mateo, CA, 1992.
17. F.T. Leighton, B.M. Maggs, and A.W. Richa. Fast algorithms for finding O(congestion + dilation) packet routing schedules. Combinatorica, 19(3):375–401, 1999.
18. F.T. Leighton and S. Rao. Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms. Journal of the ACM, 46(6):787–832, 1999.
19. R. Motwani and P. Raghavan. Randomized Algorithms. Cambridge University Press, Cambridge MA, 1995.
20. K. Mehlhorn and U. Vishkin. Randomized and deterministic simulations of PRAMs by parallel machines with restricted granularity of parallel memories. Acta Informatica, 21:339–374, 1984.
21. A. Pietracaprina, G. Pucci, and J. Sibeyn. Constructive, deterministic implementation of shared memory on meshes. SIAM Journal on Computing, 30(2):625–648, 2000.
22. A.G. Ranade. How to emulate shared memory. Journal of Computer and System Sciences, 42:307–326, 1991.
23. J.F. Sibeyn and M. Kaufmann. Deterministic 1-k routing on meshes, with application to hot-potato worm-hole routing. In Proc. of the 11th Symp. on Theoretical Aspects of Computer Science, LNCS 775, pages 237–248, 1994.
24. E. Upfal and A. Widgerson. How to share memory in a distributed system. Journal of the ACM, 34(1):116–127, 1987.
25. L.G. Valiant. A bridging model for parallel computation. Communications of the ACM, 33(8):103–111, August 1990.