Parallel sorting on heterogeneous platforms

Proceedings - International Symposium on High Performance Computing Systems and Applications

Volumn 2002-January, Issue , 2002, Pages 116-117

  Mateescu, Gabriel ^a  

^a NATIONAL RESEARCH COUNCIL CANADA   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

HETEROGENEOUS NETWORKS; NETWORK MANAGEMENT; SORTING;

CRITICAL PATHS; HETEROGENEOUS PLATFORMS; NETWORKS OF WORKSTATIONS; PARALLEL SORTING; SUB-PROBLEMS;

PARALLEL PROCESSING SYSTEMS;

EID: 84901597545     PISSN: 15505243     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/HPCSA.2002.1019143     Document Type: Conference Paper

References (9)

1. A. V. Aho, J. E. Hopcroft, and J. D. Ullman. Data Structures and Algorithms. Addison-Wesley, Reading, MA, USA, 1983.
2. S. G. Akl. Parallel Sorting Algorithms. Academic Press, 1985.
3. R. Cole. Parallel merge sort. SIAM Journal on Computing, 17(4):770-785, Aug. 1988.
4. R. Henderson. Job scheduling under the Portable Batch System. In F. D.G. and R. L., editors, Job Scheduling Startegies for Paralell Processing, volume 949 of Lecture Notes in Computer Science, pages 279-294. Springer-Verlag, 1995.
5. J. Jones. NAS requirements checklist for job queueing/ scheduling software. Technical Report NAS-96-003, NASA, April 1996.
6. F. T. Leighton. Introduction to Parallel Algorithms and Architectures. Morgan Kaufman, San Mateo, 1992.
7. J. Peek, T. O'Reilly, and M. Loukides. Unix Power Tools. O'Reilly, Sebastopol CA, 1997.
8. SPEC. Standard Performance Evaluation Corporation. http://www.spec.org, 2000.
9. S. Zhou. LSF: Load sharing in large-scale heterogeneous distributed systems. In Proc. Workshop on Cluster Computing, 1992.