Distributed recursive sets: programmability and effectiveness for data intensive applications

Bogdan Diaconescu Diaconescu,Conradi Conradi

doi:10.1109/clustr.2003.1253354

Distributed recursive sets: programmability and effectiveness for data intensive applications

Bogdan Diaconescu Diaconescu, Conradi Conradi

https://doi.org/10.1109/clustr.2003.1253354

Copy DOI

Publication Date: Jan 1, 2003

Citations: 8

Affiliation: University of California, Irvine, Norwegian University of Science and Technology

#Multiple Address Spaces #Recursive Data + Show 8 more

Abstract
Full-Text PDF
Similar Papers

Abstract

This paper presents a concurrent object model based on distributed recursive sets for data intensive applications that use complex, recursive data layouts. The set abstraction is used to represent irregular (recursive) data layouts. The distributed set abstraction is used to transparently distribute large data across multiple address spaces. We effectively map data to processors by using information about data accesses to preserve locality. This results in a consistency scheme with small communication requirements. The programming model is easy to use since the system automatically does the data distribution, mapping and consistency.

Full Text