Paper Info
Title
Data Futures in DISCWorld
Abstract
Data futures in a metacomputing system refer to data products that have not yet been created but which can be uniquely named and manipulated. We employ data flow mechanisms expressed as high level task graphs in our DISCWorld metacomputing system. Nodes in these task graphs can themselves be expanded into further task graphs or can be represented as futures in the processing schedule. We find this this a generally useful approach to the dynamic and optimal execution of task graphs. In this paper we describe our DISCWorld Remote Access Mechanism for Futures (DRAMFs) and its implementation using Java technology. DRAMFs embody these ideas and allow data products to be lazily de-referenced and to be manipulated as first class objects in the object space of the metacomputing system. Our system aids in the provision against partial failure or network disruptions in a distributed system such as DISCWorld.
Year
DOI
Venue
2000
10.1007/3-540-45492-6_5
HPCN Europe
Keywords
Field
DocType
discworld remote access mechanism,metacomputing system,data future,discworld metacomputing system,data product,task graph,high level task graph,java technology,system aid,data flow mechanism,data futures,data flow,process scheduling,distributed system
Graph,Object-oriented programming,Futures contract,Computer science,First class,Systems architecture,Metacomputing,Java,Distributed computing,Data flow diagram
Conference
Volume
ISSN
ISBN
1823
0302-9743
3-540-67553-1
Citations 
PageRank 
References 
0
0.34
11
Authors
2
Name
Order
Citations
PageRank
H. A. James18931.57
K. A. Hawick229366.26