Abstract
A parallel version of the double distributive partitioning sorting algorithm is described, and two versions of this algorithm are compared on a MIMD shared memory multiprocessor. A “reclaimer” version, in which child processes completely build their page tables before starting useful work, exhibitsO(n/p) expected-case time complexity for a wide class of distributions.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
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 call
