Task Parallel Implementation of the Bowyer-Watson Algorithm

  • Authors:
  • Nikos Chrisochoides;Florian Sukup

  • Affiliations:
  • -;-

  • Venue:
  • Task Parallel Implementation of the Bowyer-Watson Algorithm
  • Year:
  • 1996

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper we present a parallel implementation of the Bowyer-Watson (BW) algorithm using the task-parallel programming model. The BW algorithm constitutes an ideal mesh refinement strategy for implementing a large class of unstructured mesh generation techniques on both sequential and parallel computers, by preventing the need for global mesh refinement. Its implementation on distributed memory multicomputers using the traditional data-parallel model has been proven very inefficient due to excessive synchronization needed among processors.