
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Ibraheem Alfuriah, Srinivas Aluru, Sanjay Goil, Sanjay Ranka, "Practical Algorithms for Selection on CoarseGrained Parallel Computers," IEEE Transactions on Parallel and Distributed Systems, vol. 8, no. 8, pp. 813824, August, 1997.  
BibTex  x  
@article{ 10.1109/71.605768, author = {Ibraheem Alfuriah and Srinivas Aluru and Sanjay Goil and Sanjay Ranka}, title = {Practical Algorithms for Selection on CoarseGrained Parallel Computers}, journal ={IEEE Transactions on Parallel and Distributed Systems}, volume = {8}, number = {8}, issn = {10459219}, year = {1997}, pages = {813824}, doi = {http://doi.ieeecomputersociety.org/10.1109/71.605768}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Parallel and Distributed Systems TI  Practical Algorithms for Selection on CoarseGrained Parallel Computers IS  8 SN  10459219 SP813 EP824 EPD  813824 A1  Ibraheem Alfuriah, A1  Srinivas Aluru, A1  Sanjay Goil, A1  Sanjay Ranka, PY  1997 KW  Coarsegrained KW  hypercubes KW  load balancing KW  median finding KW  meshes KW  randomized algorithms KW  selection KW  parallel algorithms KW  parallel computers. VL  8 JA  IEEE Transactions on Parallel and Distributed Systems ER   
Abstract—In this paper, we consider the problem of selection on coarsegrained distributed memory parallel computers. We discuss several deterministic and randomized algorithms for parallel selection. We also consider several algorithms for load balancing needed to keep a balanced distribution of data across processors during the execution of the selection algorithms. We have carried out detailed implementations of all the algorithms discussed on the CM5 and report on the experimental results. The results clearly demonstrate the role of randomization in reducing communication overhead.
[1] M. Ajtai, J. Komlo's, W.L. Steiger, and E. Szemere'di, "Deterministic Selection in O(log log N) Parallel Time," Proc. 18th Ann. ACM Symp. n Theory of Computing, pp. 188195, 1986.
[2] S.G. Akl, The Design and Analysis of Parallel Algorithms. Orlando, Fl.: Academic Press, 1989.
[3] S.G. Akl, "Parallel Selection in O(log log n) Time Using O(n/log log n) Processors," Technical Report 88221, Dept. of Computing and Information Science, Queen's Univ., Kingston, Ontario, Mar. 1988.
[4] S.G. Akl, "An Optimal Algorithm for Parallel Selection," Information Processing Letters, vol. 19, no. 1, pp. 4750, 1984.
[5] D.A. Bader and J. J'aJ'a, "Practical Parallel Algorithms for Dynamic Data Redistribution, Median Finding and Selection," Technical Report CSTR3494, School of Computer Science, Univ. of Maryland, July 1995.
[6] Berthomi, A. Ferreira, B.M. Maggs, S. Perennes, and C.G. Plaxton, "SortingBased Selection Algorithms for Hypercubic Networks," Proc. Seventh Int'l Parallel Processing Symp., pp. 8995, 1993.
[7] G.E. Blelloch, "Prefix Sums and Their Applications," Technical Report CMUCS90190, School of Computer Science, Carnegie Mellon Univ., Nov. 1990.
[8] M. Blum, R.W. Floyd, V.R. Pratt, R.L. Rivest, and R.E. Tarjan, "Time Bounds for Selection," J. Computer and System Sciences, vol. 7, no. 4, pp. 448461, 1972.
[9] R. Cole and C.K. Yap, "A Parallel Median Algorithm," Information Processing Letters, vol. 20, no. 3, pp. 137139, 1985.
[10] T.H. Cormen,C.E. Leiserson, and R.L. Rivest,Introduction to Algorithms.Cambridge, Mass.: MIT Press/McGrawHill, 1990.
[11] G. Cybenko, "Dynamic Load Balancing for Distributed Memory Multiprocessors," J. Parallel and Distributed Computing, vol. 7, pp. 279301, 1989.
[12] R.W. Floyd and R.L. Rivest, "Expected Time Bounds for Selection," Comm. ACM, vol. 18, no. 3, pp. 165172, 1975.
[13] E. Hao, P.D. MacLenzie, and Q.F. Stout, "Selection on the Reconfigurable Mesh," Proc. Fourth Symp. Frontiers of Massively Parallel Computation, pp. 3845, 1992.
[14] J. J'aJ'a, An Introduction to Parallel Algorithms.New York: AddisonWesley, 1992.
[15] V. Kumar, A. Grama, A. Gupta, and G. Karypis, Introduction to Parallel Computing: Design and Analysis of Algorithms. Benjamin Cummings, 1994.
[16] C.G. Plaxton, "Efficient Computation on Sparse Interconnection Networks," PhD thesis, Dept. of Computer Science, Stanford Univ., 1989.
[17] S. Rajasekharan, W. Chen, and S. Yooseph, "Unifying Themes for Parallel Selection," Proc. Fifth Int'l Symp. Algorithms and Computation, SpringerVerlag Lecture Notes in Computer Science 834, pp. 92100,Beijing, China, 1994.
[18] S. Rajasekharan and J.H. Reif, "Derivation of Randomized Sorting and Selection Algorithms," Parallel Algorithm Derivation and Program Transformation, R. Paige, J.H. Reif, and R. Watcher, eds., pp. 187205, Kluwer Academic, 1993.
[19] S. Rajasekharan, "Randomized Parallel Selection," Proc. Symp. Foundations of Software Technology and Theoretical Computer Science, pp. 215224, 1990.
[20] S. Ranka, R.V. Shankar, and K.A. Alsabti, "ManytoMany Communication with Bounded Traffic," Proc. Frontiers Massively Parallel Computation, pp. 2027, 1995.
[21] S. Ranka, Y. Won, and S. Sahni, "Programming a Hypercube Multicomputer," IEEE Software, pp. 6977, Sept. 1988.
[22] R. Sarnath and X. He, "Efficient Parallel Algorithms for Selection and Searching on Sorted Matrices," Proc. Sixth Int'l Parallel Processing Symp., pp. 108111, 1992.
[23] A. Schonhage, M.S. Paterson, and N. Pippenger, "Finding the Median," J. Computer and System Sciences, vol. 13, pp. 184199, 1976.
[24] R.V. Shankar and S. Ranka, "Random Data Accesses on a CoarseGrained Parallel Machine II: OnetoMany and ManytoOne Mappings," CIS technical report, Syracuse Univ., 1994.
[25] J. Woo and S. Sahni, "Load Balancing on a Hypercube," Proc. Fifth Int'l Parallel Processing Symp., pp. 525530, 1991.