Parallel Algorithms for Generation of Long Sorted Runs on IBM
碩士 === 國立臺灣科技大學 === 工程技術研究所 === 83 === Generation of long sorted runs is the first phase for sorting a large file. Fast generation of long sorted runs can help us significantly decrease the total execution time required for sorting a large...
Main Authors: | Chen, Hung-Kuang, 陳宏光 |
---|---|
Other Authors: | Lin, Yen-Chun |
Format: | Others |
Language: | zh-TW |
Published: |
1995
|
Online Access: | http://ndltd.ncl.edu.tw/handle/95780901014825159435 |
Similar Items
-
Parallel algorithms for generation of long sorted runs on IBM SP2
by: Chen, Hong Guang, et al.
Published: (1995) -
Parallel sorting algorithms
by: Zeng, Xian-Xiong, et al.
Published: (1984) -
Parallel Computing for Sorting Algorithms
by: Baghdad Science Journal
Published: (2014-06-01) -
Implementing parallel sorting algorithms
by: Elabed, Jamal
Published: (2011) -
Scalability Validation of Parallel Sorting Algorithms
by: Berens, Yannick
Published: (2017)