Proceedings 32nd Annual Symposium of Foundations of Computer Science (1991)
San Juan, Puerto Rico
Oct. 1, 1991 to Oct. 4, 1991
M.T. Goodrich , Dept. of Comput. Sci., Johns Hopkins Univ., Baltimore, MD, USA
A framework is presented for designing parallel algorithms that may ignore processor allocation. A number of fast approximation algorithms are developed, and it is shown how to use these algorithms to simulate any algorithm that fits this framework in a work-preserving fashion on a randomized CRCW PRAM. Several applications of the approach to parallel computational geometry are given.
parallel computational geometry, approximation algorithms, parallel algorithms, processor allocation, randomized CRCW PRAM
M. Goodrich, "Using approximation algorithms to design parallel algorithms that may ignore processor allocation,"  Proceedings 32nd Annual Symposium of Foundations of Computer Science(FOCS), San Juan, Puerto Rico, 1991, pp. 711-722.