William L. Hightower
- AH88.A. Aggarwal and M.-D. A. Huang, Network Complexity of Sorting and Graph Problems and Simulating CRCW PRAMs by Interconnection Networks; Lecture Notes in Computer Science VLSI Algorithms and Architectures (AWOC 88) (ed. by John Reif), vol. 319, pp. 339-350, Springer-Verlag, 1988. Google Scholar
Digital Library
- AKS83.M.Ajtai, J. Komlos, and E. Szemeredil, Sorting in c log n Parallel Steps, Combinatorica, 3:1-19, 1983. Google ScholarDigital Library
- AV79.D. Angluin and L.G. Valiant, Fast Probabilistic Algorithms for Hamiltonian Circuits and Matchings, Journal of Computer and System Sciences, 18(2):155-193, April 1979.Google ScholarCross Ref
- AKl85.S.G. Akl;, Parallel Sorting Algorithms, Academic Press, Toronto, 1985. Google ScholarDigital Library
- BAT68.K. Batcher; Sorting Networks and Their Applications, Proceedings of the AFIPS Spring Joint Computing Conference, vol. 32, pp.307- 314, 1968.Google Scholar
- BS78.G. Baudet and D. Stevenson, Optimal Sorting Algorithms for Parallel Computers, IEEE Transactions on Computers, C-27:84-87, 1978.Google ScholarDigital Library
- BLE90.G.E. Blelloch, Vector Models for Data-Parallel Computing, The MIT Press, 1990. Google ScholarDigital Library
- BLM+91.G.E. Blelloch, C.E. Leiserson, B.M. Maggs, C.G. Plaxton, S.J. Smith, and M. Zagha; A Comparison of Sorting Algorithms for the Connection Machine CM-2; 3rd Annual ACM Symposium on Parallel Algorithms and Architectures, July 21-24, 1991, Hilton Head, SC, pp.3-16. Google ScholarDigital Library
- CHL89.B. Chlebus, Sorting Within Distance Bound on a Mesh-Connected Arrays, International Symposium on Optimal Algotihms, vol. 401 of Lecture Notes in Computer Science, pp. 232-238, Springer-Verlag, NY, 1989. Google ScholarDigital Library
- COLE88.R. Cole, Parallel Merge Sort, SlAM Journal on Computing, pp. 770-785, 1988. Google ScholarDigital Library
- CV86.R. Cole and U. Vishkin, Deterministic Coin Tossing and Accelerating Cascades: Micro and Macro Techniques for Designing Parallel Algorithms, Proceedings of the 18th Annual ACM Symposium on Theory of Computing, pp. 206-219, 1986. Google ScholarDigital Library
- CLR90.T.H. Cormen, C.E. Leiserson, and R.L. Rivest, Introduction to Algorithms, The MIT Press and McGraw Hill, 1990. Google ScholarDigital Library
- CP90.R.E. Cypher and C.G. Plaxton, Deterministic Sorting in Nearly Logarithmic Time on the Hypercube and Related Computers, Proceedings of the 22nd Annual ACM Symposium on Theory of Computing, pp. 193-203, May 1990. Google ScholarDigital Library
- DNS91.D.J. DeWitt, J.F. Naughton, D.F. Schneider, Parallel Sorting on a Shared-Nothing Architecture using Probabilistic Splitting, Computer Sciences TR#1043, University of Wisconsin - Madison, 1991.Google Scholar
- FKO86.E. Felten, S. Karlin, and S. Otto, Sorting on a Hypercube, Hm 244, Caltech/JPL, 1986.Google Scholar
- FM70.W.D. Frazer and A.C. McKellar, Samplesort: A Sampling Approach to Minimal Storage Tree Sorting, Journal of the ACM, 17(3):496- 507, 1970. Google ScholarDigital Library
- HOE56.W. Hoeffding, On the Distribution of the Number of Successes in Independent Trials, Annals of Mathematical Statistics, 27:713-721, 1956.Google ScholarCross Ref
- HC83.J.S. Huang and Y.C. Chow, Parallel Sorting and Data Partitioning by Sampling, Proceedings of the IEEE Computer Society's Seventh International Computer Software and Applications Conference, pp. 627-631, November 1983.Google Scholar
- KKNT91.C. Kaklamanis, D. Krizanc, L. Narayanan, and T. Tsantilas, Randomized Sorting and Selection on Mesh-Connected Processor Arrays, 3rd Annual ACM Symposium on Parallel Algorithms and Architectures, July 21-24, 1991, Hilton Head, SC, pp. 17-28. Google ScholarDigital Library
- KUN88a.M. Kunde, Routing and Sorting on Mesh- Connected Arrays, Aegan Workshop on Computing" VLSI Algorithms and Architectures, vol. 319 of Lecture Notes in Computer Science, pp. 423-433, Springer- Verlag, NY, 1988. Google ScholarDigital Library
- KUN88b.M. Kunde, 1-selection and Related Problems on Grids of Processors, Aegan Workshop on Computing: VLSI Algorithms and Architectures, vol. 319 of Lecture Notes in Computer Science, pp. 423-433, Springer- Verlag, NY, 1988.Google ScholarCross Ref
- LEI865.F.T. Leighton, Tight Bounds on the Complexity of Parallel Sorting, IEEE Transactions on Computers, C-34(4):344-354, April 1985. Google ScholarDigital Library
- LP90.T. Leighton and G. Plaxton, A (Fairly) Simple Circuit That (Usually) Sorts, Proceedings of the 31st Annual Symposium on Foundations of Computer Science, pp. 264-274, October 1990.Google ScholarDigital Library
- NS82.D. Nassimi and S. Sahni, Parallel Permutation and Sorting Algorithms and a New Generalized Connection Network, Journal of the A CM, 29(3):642-667, July 1982. Google ScholarDigital Library
- PAT90.M.S. Paterson, Improved Sorting Networks with O(log n) Depth, Algorithmica, 5::75-92, 1990.Google ScholarDigital Library
- PLAX89.C.G. Plaxton, Efficient Computation on Sparse Interconnection Networks, Technical Report STAN-CS-89-1283, Stanford University, Department of Computer Science, September 1989.Google Scholar
- PRIN90.J.F. Prins, Efficient Bitonic Sorting of Large Arrays on the MasPar MP-1, 3rd Symposium on Frontiers of Massively Parallel Processing, 1990; expanded version Technical Report 91- 041, Univ. of North Carolina, 1991.Google Scholar
- QUI89.M.J. Quinn, Analysis and Benchmarking of Two Parallel Sorting Algorithms: Hypersort and Quickmerge, BIT, 29(2):239-250, 1989. Google ScholarDigital Library
- RR89.S. Rajasekaran and J.H. Reif, Optimal and Sublogarithmic Time Randomized Parallel Sorting Algorithms, SlAM Journal on Computing, 18(3):594-607, June 1989. Google ScholarDigital Library
- RV83,87.J.H. Reif and L.G. Valiant, A Logarithmic Time Sort for Linear Size Networks, 15th Annual ACM Symposium on Theory of Computing, Boston, MA, pp. 10-16, 1983; also in Journal of the ACM, 34(1):60-76, January 1987. Google ScholarDigital Library
- REI85.R. Reischuk, Probabilistic Parallel Algorithms for Sorting and Selection, SlAM Journal of Computing, 14(2):396-411, May 1985.Google ScholarDigital Library
- SS86.C. Schnorr and A. Shamir, An Optimal Sorting Algorithm for Mesh Connected Computers, Symposium on the Theory of Computation, pp. 255-263, 1986. Google ScholarDigital Library
- SG88.S.R. Seidel and W.L. George, Binsorting on Hypercubes with d-port Communication, Proceedings of the Third Conference on Hypercube Concurrent Computers, pp. 1455- 1461, January 1988. Google ScholarDigital Library
- TK77.C.D. Thompson and H.T. Kung, Sorting on a Mesh-connected Parallel Computer, Communications of the ACM 20(4):263-271, 1977. Google ScholarDigital Library
- U83.J. Ullman, Computational Aspects of VLSI, Computer Science Press, 1983 Google ScholarDigital Library
- VD88.P. Varman and K. Doshi, Sorting with Linear Speedup on a Pipelined Hypercube, Technical Report TR-9902, Rice University, Department of Electrical and Computer Engineering, February 1988.Google Scholar
- WAG89.B.A. Wagar, Hyperquicksort: A Fast Sorting Algorithm for Hypercubes, Hypercube Multiprocessors 1987 (Proceedings of the Second Conference on Hypercube Multiprocessors) (ed. M.T. Heath), pp. 292- 299, Philadelphia, PA, 1987. SIAM.Google Scholar
- WAG90.B.A. Wagar, Practical Sorting Algorithms for Hypercube Computers, Ph.D. Thesis, Department of Electrical Engineering and Computer Science, University of Michigan, Ann Arbor, MI, July 1990. Google ScholarDigital Library
- WS88.Y. Won and S. Sahni, A Balanced Bin Sort for Hypercube Multicomputers. Journal of Supercomputing, 2:435-448, 1988.Google ScholarCross Ref
Index Terms
- Implementations of randomized sorting on large parallel machines
Recommendations
Parallel database sorting
Sorting in database processing is frequently required through the use of Order By and Distinct clauses in SQL. Sorting is also widely known in computer science community at large. Sorting in general covers internal and external sorting. Past published ...
Communication-Efficient Parallel Sorting
We study the problem of sorting n numbers on a p-processor bulk-synchronous parallel (BSP) computer, which is a parallel multicomputer that allows for general processor-to-processor communication rounds provided each processor sends and receives at most ...
Sorting in Parallel Database Systems
HPC '00: Proceedings of the The Fourth International Conference on High-Performance Computing in the Asia-Pacific Region-Volume 2 - Volume 2Sorting in database processing is frequently required using Order By and Distinct clauses in SQL. Sorting is also widely known in computer science community at large. Sorting in general covers internal and external sorting. Past-published work has ...
Comments