Efficient routing and message bounds for optimal parallel algorithms
- 19 November 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
No abstract availableThis publication has 14 references indexed in Scilit:
- On contention resolution protocols and associated probabilistic phenomenaPublished by Association for Computing Machinery (ACM) ,1994
- Scalable parallel geometric algorithms for coarse grained multicomputersPublished by Association for Computing Machinery (ACM) ,1993
- LogP: towards a realistic model of parallel computationPublished by Association for Computing Machinery (ACM) ,1993
- Efficient optical communication in parallel computersPublished by Association for Computing Machinery (ACM) ,1992
- Fast randomized algorithms for distributed edge coloringPublished by Association for Computing Machinery (ACM) ,1992
- A comparison of shared and nonshared memory models of parallel computationProceedings of the IEEE, 1991
- Probabilistic recurrence relationsPublished by Association for Computing Machinery (ACM) ,1991
- Faster optimal parallel prefix sums and list rankingInformation and Computation, 1989
- A more practical PRAM modelPublished by Association for Computing Machinery (ACM) ,1989
- Towards an architecture-independent analysis of parallel algorithmsPublished by Association for Computing Machinery (ACM) ,1988