Parallel optimal weighted links

Ovidiu Daescu, Yam K. Cheung, James D Palmer

Research output: Contribution to journalArticle

1 Citation (Scopus)

Abstract

In this paper we consider parallel algorithms for computing an optimal link among weighted regions in the plane. The problem arises in several areas, including radiation therapy, geological exploration and environmental engineering. We present a CREW PRAM parallel algorithm and a coarse-grain parallel computer algorithm for this problem. For a weighted subdivision with n vertices, the work of the parallel algorithms we propose is only an O(log n) factor more than that of their optimal sequential counterparts. We further adapt an algorithm for minimizing sum of linear fractionals, that has inherent parallelism, to solve in parallel the global optimization problems associated with our solution for the weighted region optimal link problem.

Fingerprint

Parallel algorithms
Parallel Algorithms
Radiation Therapy
Environmental engineering
Radiotherapy
Global optimization
Parallel Computers
Subdivision
Global Optimization
Parallelism
Optimization Problem
Engineering
Computing

ASJC Scopus subject areas

  • Computer Science(all)
  • Theoretical Computer Science

Cite this

Parallel optimal weighted links. / Daescu, Ovidiu; Cheung, Yam K.; Palmer, James D.

In: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Vol. 5300 LNCS, 2009, p. 66-81.

Research output: Contribution to journalArticle

@article{b6c0baa791c946a78409650bd1353f1f,
title = "Parallel optimal weighted links",
abstract = "In this paper we consider parallel algorithms for computing an optimal link among weighted regions in the plane. The problem arises in several areas, including radiation therapy, geological exploration and environmental engineering. We present a CREW PRAM parallel algorithm and a coarse-grain parallel computer algorithm for this problem. For a weighted subdivision with n vertices, the work of the parallel algorithms we propose is only an O(log n) factor more than that of their optimal sequential counterparts. We further adapt an algorithm for minimizing sum of linear fractionals, that has inherent parallelism, to solve in parallel the global optimization problems associated with our solution for the weighted region optimal link problem.",
author = "Ovidiu Daescu and Cheung, {Yam K.} and Palmer, {James D}",
year = "2009",
doi = "10.1007/978-3-642-00212-0_4",
language = "English (US)",
volume = "5300 LNCS",
pages = "66--81",
journal = "Lecture Notes in Computer Science",
issn = "0302-9743",
publisher = "Springer Verlag",

}

TY - JOUR

T1 - Parallel optimal weighted links

AU - Daescu, Ovidiu

AU - Cheung, Yam K.

AU - Palmer, James D

PY - 2009

Y1 - 2009

N2 - In this paper we consider parallel algorithms for computing an optimal link among weighted regions in the plane. The problem arises in several areas, including radiation therapy, geological exploration and environmental engineering. We present a CREW PRAM parallel algorithm and a coarse-grain parallel computer algorithm for this problem. For a weighted subdivision with n vertices, the work of the parallel algorithms we propose is only an O(log n) factor more than that of their optimal sequential counterparts. We further adapt an algorithm for minimizing sum of linear fractionals, that has inherent parallelism, to solve in parallel the global optimization problems associated with our solution for the weighted region optimal link problem.

AB - In this paper we consider parallel algorithms for computing an optimal link among weighted regions in the plane. The problem arises in several areas, including radiation therapy, geological exploration and environmental engineering. We present a CREW PRAM parallel algorithm and a coarse-grain parallel computer algorithm for this problem. For a weighted subdivision with n vertices, the work of the parallel algorithms we propose is only an O(log n) factor more than that of their optimal sequential counterparts. We further adapt an algorithm for minimizing sum of linear fractionals, that has inherent parallelism, to solve in parallel the global optimization problems associated with our solution for the weighted region optimal link problem.

UR - http://www.scopus.com/inward/record.url?scp=67650434470&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=67650434470&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-00212-0_4

DO - 10.1007/978-3-642-00212-0_4

M3 - Article

VL - 5300 LNCS

SP - 66

EP - 81

JO - Lecture Notes in Computer Science

JF - Lecture Notes in Computer Science

SN - 0302-9743

ER -