2013 IEEE 54th Annual Symposium on Foundations of Computer Science (1991)

San Juan, Puerto Rico

Oct. 1, 1991 to Oct. 4, 1991

ISBN: 0-8186-2445-0

pp: 711-722

M.T. Goodrich , Dept. of Comput. Sci., Johns Hopkins Univ., Baltimore, MD, USA

ABSTRACT

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.

INDEX TERMS

parallel computational geometry, approximation algorithms, parallel algorithms, processor allocation, randomized CRCW PRAM

CITATION

M.T. Goodrich,
"Using approximation algorithms to design parallel algorithms that may ignore processor allocation",

*2013 IEEE 54th Annual Symposium on Foundations of Computer Science*, vol. 00, no. , pp. 711-722, 1991, doi:10.1109/SFCS.1991.185439