loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
10th International Parallel Processing Symposium (IPPS '96)
Practical algorithms for selection on coarse-grained parallel computers
Honolulu, HI
April 15-April 19
ISBN: 0-8186-7255-2
ASCII Text
x 
 
I. Al-Furaih, S. Aluru, S. Goil, S. Ranka, "Practical algorithms for selection on coarse-grained parallel computers," Parallel Processing Symposium, International, pp. 309, 10th International Parallel Processing Symposium (IPPS '96), 1996.
 
 
BibTex
x
 
@article{ 10.1109/IPPS.1996.508074,
author = {I. Al-Furaih and S. Aluru and S. Goil and S. Ranka},
title = {Practical algorithms for selection on coarse-grained parallel computers},
journal ={Parallel Processing Symposium, International},
volume = {0},
year = {1996},
issn = {1063-7133},
pages = {309},
doi = {http://doi.ieeecomputersociety.org/10.1109/IPPS.1996.508074},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Parallel Processing Symposium, International
TI - Practical algorithms for selection on coarse-grained parallel computers
SN - 1063-7133
SP
EP
A1 - I. Al-Furaih,
A1 - S. Aluru,
A1 - S. Goil,
A1 - S. Ranka,
PY - 1996
KW - randomised algorithms; deterministic algorithms; distributed memory systems; coarse-grained parallel computers; distributed memory parallel computers; randomized algorithms; deterministic algorithms; CM-5
VL - 0
JA - Parallel Processing Symposium, International
ER -
 
I. Al-Furaih, Sch. of Comput. & Inf. Sci., Syracuse Univ., NY, USA
S. Aluru, Sch. of Comput. & Inf. Sci., Syracuse Univ., NY, USA
S. Goil, Sch. of Comput. & Inf. Sci., Syracuse Univ., NY, USA
S. Ranka, Sch. of Comput. & Inf. Sci., Syracuse Univ., NY, USA
In this paper, we consider the problem of selection on coarse-grained distributed memory parallel computers. We discuss several deterministic and randomized algorithms for parallel selection. Experimental results on the CM-5 demonstrate that randomized algorithms are superior to their deterministic counterparts.
Index Terms:
randomised algorithms; deterministic algorithms; distributed memory systems; coarse-grained parallel computers; distributed memory parallel computers; randomized algorithms; deterministic algorithms; CM-5
Citation:
I. Al-Furaih, S. Aluru, S. Goil, S. Ranka, "Practical algorithms for selection on coarse-grained parallel computers," ipps, pp.309, 10th International Parallel Processing Symposium (IPPS '96), 1996
Usage of this product signifies your acceptance of the Terms of Use.