Upper and lower time bounds for parallel random access machines without simultaneous writes
SIAM Journal on Computing
Tight comparison bounds on the complexity of parallel sorting
SIAM Journal on Computing
The average complexity of deterministic and randomized parallel comparison-sorting algorithms
SIAM Journal on Computing
SIAM Journal on Computing
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Time complexity of Boolean functions on CREW PRAMs
SIAM Journal on Computing
Ultra-fast expected time parallel algorithms
SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
An introduction to parallel algorithms
An introduction to parallel algorithms
Load balancing requires &OHgr;(log*n) expected time
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
Exact lower time bounds for computing Boolean functions on CREW PRAMs
Journal of Computer and System Sciences
Lower bounds for randomized exclusive write PRAMs
Proceedings of the seventh annual ACM symposium on Parallel algorithms and architectures
Optimal parallel approximation for prefix sums and integer sorting
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Optimal deterministic approximate parallel prefix sums and their applications
ISTCS '95 Proceedings of the 3rd Israel Symposium on the Theory of Computing Systems (ISTCS'95)
Halvers and expanders (switching)
SFCS '92 Proceedings of the 33rd Annual Symposium on Foundations of Computer Science
| Hi-index | 0.00 |
PADDED-SORTING is a task of placing input items in an array in a nondecreasing order, but with free space between consecutive elements allowed. For many applications, padded-sorting is as useful as sorting. Approximate compaction and compression are closely related problems. It is known that time complexity of padded-sorting on randomized CRCW PRAMs is considerably lower than time complexity of sorting. We analyze time complexity of these problems on CREW and EREW PRAMs (deterministic and randomized) and get tight lower und upper bounds depending on the size of free space. We extend our lower bounds to approximate compaction and compression.Some of the algorithms presented are very rare examples of randomized EREW PRAMs that are much faster than their deterministic counterparts.