Abstract
The problem of merging two large ordered sets A and B is considered. A detailed description of the development of an efficient parallel algorithm is given, starting with a version of the algorithm that demonstrates the idea of partitioning the merge problem into independent subproblems and ending with an optimal parallel algorithm for the EREW P- RAM model of computation.
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
