论文信息 - Unifying Themes for Network Selection

Unifying Themes for Network Selection

In this paper we present efficient deterministic and randomized algorithms for selection on any interconnection network when the number of input keys (n) is ≥ the number of processors (p).

Sanguthevar Rajasekaran | Shibu Yooseph | Wang Chen

[1] F. Leighton,et al. Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes , 1991 .

[2] Ernst W. Mayr,et al. Efficient computation on sparse interconnection networks , 1989 .

[3] Ronald L. Rivest,et al. Expected time bounds for selection , 1975, Commun. ACM.

[4] Sanguthevar Rajasekaran,et al. Derivation of Randomized Sorting and Selection Algorithms , 1993 .

[5] Sanguthevar Rajasekaran. Randomized Parallel Selection , 1990, FSTTCS.

[6] Lata Narayanan,et al. Multi-packet selection on mesh-connected processor arrays , 1992, Proceedings Sixth International Parallel Processing Symposium.

[7] Lata Narayanan,et al. Optimal algorithms for selection on a mesh-connected processor array , 1992, [1992] Proceedings of the Fourth IEEE Symposium on Parallel and Distributed Processing.

[8] Manuel Blum,et al. Time Bounds for Selection , 1973, J. Comput. Syst. Sci..

[9] Adi Shamir,et al. An optimal sorting algorithm for mesh connected computers , 1986, STOC '86.

[10] Sanguthevar Rajasekaran,et al. Mesh Connected Computers with Fixed and Reconfigurable Buses: Packet Routing, Sorting, and Selection , 1993, ESA.

[11] Rüdiger Reischuk. Probabilistic Parallel Algorithms for Sorting and Selection , 1985, SIAM J. Comput..