A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Distributed recursive sets: programmability and effectiveness for data intensive applications
2003
Proceedings IEEE International Conference on Cluster Computing CLUSTR-03
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 using information about data accesses to preserve locality. This results in a consistency scheme with small
doi:10.1109/clustr.2003.1253354
dblp:conf/cluster/DiaconescuC03
fatcat:4xwerd4czbegzh3276bya2gesa