Author:
Cérin Christophe,Gaudiot Jean Luc
Publisher
Springer Berlin Heidelberg
Reference9 articles.
1. H. Shi and J. Schaeffer, “Parallel sorting by regular sampling,” Journal of Parallel and Distributed Computing, vol. 14, no. 4, pp. 361–372, 1992.
2. O. Bonorden, B. Juurlink, I. von Otte, and I. Rieping, “The paderborn university bsp (pub) library-design, implementation and performance,” in 13th International Parallel Processing Symposium and 10th Symposium on Parallel and Distributed Processing, 12-16 April, 1999, San Juan, Puerto Rico, available electronically through IEEE Computer Society, 1999.
3. N. S. Afonso Ferreira, “A randomized bsp/cgm algorithm for the maximal independent set problem,” Parallel Processing Letters, vol. 9, no. 3, pp. 411–422, 1999.
4. C. Cérin and J.-L. Gaudiot, “Algorithms for stable sorting to minimize communications in networks of workstations and their implementations in bsp,” in IEEE Computer Society International Wokshop on Cluster Computing (IWCC’99), pp. 112–120, 1999.
5. G. Blelloch, C. Leiserson, and B. Maggs, “A Comparison of Sorting Algorithms for the Connection Machine CM-2,” in Proceedings of the ACM Symposium on Parallel Algorithms and Architectures, July 1991.
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献