Abstract

In this paper we consider parallel algorithms for computing an optimal link among weighted regions in the 2-dimensional (2-D) space. The weighted regions optimal link problem arises in several areas, such as geographic information systems (GIS), radiation therapy, geological exploration, environmental engineering and military applications. We present a CREW PRAM parallel algorithm and a coarse-grain parallel computer algorithm. Given a weighted subdivision with a total of n vertices, the work of the parallel algorithms we propose is only a O(log n) factor more than that of their (optimal) sequential counterparts.

Full Text
Published version (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