HPCN-Europe 2000: High Performance Computing and Networking pp 41-50 | Cite as
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.
Keywords
data futures task graphs Java metacomputingPreview
Unable to display preview. Download preview PDF.
References
- 1.Denis Caromel. Toward a Method of Object-Oriented Concurrent Programming. In Communications of the ACM, 36(9):90–102, September 1993.CrossRefGoogle Scholar
- 2.P. D. Coddington, K. A. Hawick and H. A. James. Web-Based Access to Distributed High-Performance Geographic Information Systems for Decision Support, Proc. of Hawai’i International Conference on System Sciences (HICSS-32), Maui, January 1999.Google Scholar
- 3.K. A. Hawick and P. D. Coddington. Interfacing to Distributed Active Data Archives, International Journal on Future Generation Computer Systems, Special Issue on Interfacing to Scientific Data Archives, 16(1999) 73–89. Editor, Roy Williams.Google Scholar
- 4.K. A. Hawick and H. A. James. Distributed High-Performance Computation for Remote Sensing, Proc. of Supercomputing’ 97, San Jose, November 1997Google Scholar
- 5.K. A. Hawick, H. A. James and J. A. Mathew. Remote Data Access in Distributed Object-Oriented Middleware, To appear in Parallel and Distributed Computing Practices, 1999.Google Scholar
- 6.K. A. Hawick, H. A. James, A. J. Silis, D. A. Grove, K. E. Kerry, J. A. Mathew, P. D. Coddington, C. J. Patten, J. F. Hercus and F. A. Vaughan. DISCWorld: An Environment for Service-Based Metacomputing. Invited article Future Generation Computing Systems (FGCS), (15)623–635, 1999.CrossRefGoogle Scholar
- 7.K. A. Hawick, H. A. James, C. J. Patten and F. A. Vaughan. DISCWorld: A Distributed High Performance Computing Environment, Proc. of HPCN Europe’ 98, Amsterdam, April 1998.Google Scholar
- 8.Heath A. James. Scheduling in Metacomputing Systems, PhD Thesis, The University of Adelaide, July 1999.Google Scholar
- 9.H. A. James and K. A. Hawick. Resource Descriptions for Job Scheduling in DISCWorld, Proc 5th IDEA Workshop, Fremantle, Feb 1998.Google Scholar
- 10.B. Liskov and L. Shrira. Promises: Linguistic Support for Efficient Asynchronous Procedure Calls in Distributed Systems. In Proc. SIGPLAN’88 Conf. Programming Language Design and Implementation, pp260–267, June 1988.Google Scholar
- 11.J. A. Mathew, A. J. Silis and K. A. Hawick. Inter Server Transport of Java Byte Code in a Metacomputing Environment, Proc. TOOLS Pacific (Tools 28)-Technology of Object-Oriented Languages and Systems, Melbourne, 1998.Google Scholar
- 12.Object Management Group. CORBA/IIOP 2.2 Specification, July 1998, Available from http://www.omg.org/corba/cichpter.html.
- 13.Andrew Silis and K. A. Hawick. The DISCWorld Peer-To-Peer Architecture. In Proc. Fifth IDEA Workshop, February 1998.Google Scholar
- 14.Edward F. Walker, Richard Floyd and Paul Neves. Asynchronous Remote Operation Execution in Distributed Systems. In Proc. Tenth Int. Conf. Distributed Computing Systems, pages 253–259, May 1990.Google Scholar