UC BERKELEY
EECS technical reports
TECHNICAL REPORTS


CSD-95-879.pdf
Oskicat catalog record
Conditions of Use

Archive Home Page

Multipol: A Distributed Data Structure Library

Authors:
Chakrabarti, Soumen
Deprit, Etienne
Im, Eun-Jin
Jones, Jeff
Krishnamurthy, Arvind
Wen, Chi-Po
Yelick, Katherine
Technical Report Identifier: CSD-95-879
July 1995
CSD-95-879.pdf

Abstract: Applications with dynamic data structures, unpredictable computational costs, and irregular data access patterns require substantial effort to parallelize. Much of their programming complexity comes from the implementation of distributed data structures. We describe a library of such data structures, Multipol, which includes parallel versions of classic data structures such as trees, sets, lists, graphs, and queues. The library is built on a portable runtime layer that provides basic communication, synchronization, and caching. The data structures address the classic trade-off between locality and load balance through a combination of replication, partitioning, and dynamic caching. To tolerate remote communication latencies, some of the operations are split into a separate initiation and completion phase, allowing for computation and communication overlap at the library interface level. This leads to a form of relaxed consistency semantics for the data types. In this paper we give an overview of Multipol, discuss the performance trade-offs and interface issues, and describe some of the applications that motivated its development.