Abstract
An asynchronous scheduling strategy for use in conjunction with any sequential merging algorithm to implement an asynchronous parallel merging algorithm on an MIMD multiprocessor is presented. In particular, an asynchronous parallel implementation of the 2-way merge algorithm is described and used as a component in three versions of a parallel sorting algorithm. Their performance is compared when executed on the Sequent Balance 8000 multiprocessor.
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.
