Distribution Sweeping on Clustered Machines with Hierarchical Memories

This paper investigates the design of parallel algorithmic strategies that address the efficient use of both, memory hierarchies within each processor and a multilevel clustered structure of the interconnection between processors. In the past, these phenomena have usually been addressed separately. This paper is a first step towards parallel algorithmic strategies which address both at the same time. As a case study, we investigate the distribution sweeping method which has been very effective for the design of external memory algorithms for computational geometry problems. We present a novel method for parallel distribution sweeping on a clustered parallel machine with hierarchical local memories, showing that it yields optimal computation, communication and memory access times for a number of geometry problems.

• Type: Conference
• Year: 2002
• Where: IPPS
• Authors: Frank K. H. A. Dehne, Stefano Mardegan, Andrea Pietracaprina, Giuseppe Prencipe
• Keywords: Distributed And Parallel Computing, Geometry Problems, IPPS 2002, Multilevel Clustered Structure, Parallel Algorithmic Strategies