Abstract
This paper presents a new algorithm based on Quicksort for sorting in place a distributed file in a message switching network. It discusses in detail the algorithmic aspects of the method and compares it to other possible approaches. The sort is analyzed and is shown to require, on the average, O( M·log( M)) messages and a total data traffic of O( N·log( M)) records for a file of size N fragmented over M stations. Arguments for the performance one may expect in practice, where N is much larger than M, are given. They are supported by results from a sequential simulation.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: 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.