loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Fifth IEEE International Conference on Cluster Computing (CLUSTER'03)
Distributed Recursive Sets: Programmability and Effectiveness for Data Intensive Applications
Hong Kong
December 01-December 04
ISBN: 0-7695-2066-9
ASCII Text
x 
 
Roxana E. Diaconescu, Reidar Conradi, "Distributed Recursive Sets: Programmability and Effectiveness for Data Intensive Applications," Cluster Computing, IEEE International Conference on, pp. 483, Fifth IEEE International Conference on Cluster Computing (CLUSTER'03), 2003.
 
 
BibTex
x
 
@article{ 10.1109/CLUSTR.2003.1253354,
author = {Roxana E. Diaconescu and Reidar Conradi},
title = {Distributed Recursive Sets: Programmability and Effectiveness for Data Intensive Applications},
journal ={Cluster Computing, IEEE International Conference on},
volume = {0},
year = {2003},
isbn = {0-7695-2066-9},
pages = {483},
doi = {http://doi.ieeecomputersociety.org/10.1109/CLUSTR.2003.1253354},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Cluster Computing, IEEE International Conference on
TI - Distributed Recursive Sets: Programmability and Effectiveness for Data Intensive Applications
SN - 0-7695-2066-9
SP
EP
A1 - Roxana E. Diaconescu,
A1 - Reidar Conradi,
PY - 2003
KW - null
VL - 0
JA - Cluster Computing, IEEE International Conference on
ER -
 
Roxana E. Diaconescu, University of California at Irvine
Reidar Conradi, Norwegian University of Science and Technology

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 communication requirements. The programming model is easy to use since the system automatically does the data distribution, mapping and consistency.

Citation:
Roxana E. Diaconescu, Reidar Conradi, "Distributed Recursive Sets: Programmability and Effectiveness for Data Intensive Applications," cluster, pp.483, Fifth IEEE International Conference on Cluster Computing (CLUSTER'03), 2003
Usage of this product signifies your acceptance of the Terms of Use.