Abstract
A parallel algorithm is presented for generation of long sorted runs as the first phase of sorting a large file. It can generate runs of length about 2mp + 2 on a unidirectional linear array of p processors each with a heap of size m. Internal computations can be completely overlapped with I/O, and almost only disk read time is required. Experiments with the algorithm and its variations have been conducted. The results show that all the versions can generate longer runs than a previous algorithm run on a bidirectional linear array.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
