Please use this identifier to cite or link to this item:
Scopus Web of ScienceĀ® Altmetric
Full metadata record
DC FieldValueLanguage
dc.contributor.authorJames, Heath Alexanderen
dc.contributor.authorHawick, K. A.en
dc.identifier.citationProceedings of High Performance Computing and Networking - 8th International Conference, HPCN Europe 2000 Amsterdam, The Netherlands, May 8-10 2000 / G. Goos, J. Hartmanis and J. van Leeuwen (eds.): pp.41-50en
dc.description.abstractData 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.en
dc.description.statementofresponsibilityH.A. James and K.A. Hawicken
dc.relation.ispartofseriesLecture notes in Computer Science ; 1823/2010en
dc.rightsCopyright Springer-Verlag Berlin Heidelberg 2000en
dc.subjectdata futures; task graphs; Java; metacomputingen
dc.titleData futures in DISCWorlden
dc.typeConference paperen
dc.contributor.schoolSchool of Computer Scienceen
dc.contributor.conferenceInternational Conference on High Performance Computing and Networking (8th : 2000 : Amsterdam, The Netherlands)en
dc.contributor.conferenceHPCN Europe 2000en
Appears in Collections:Computer Science publications

Files in This Item:
There are no files associated with this item.

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.