Show simple item record

Files in this item

Thumbnail

Item metadata

dc.contributor.authorDearle, Alan
dc.contributor.authorKirby, Graham
dc.contributor.authorNorcross, Stuart
dc.contributor.authorMcCarthy, Andrew
dc.date.accessioned2011-01-07T16:56:07Z
dc.date.available2011-01-07T16:56:07Z
dc.date.issued2006
dc.identifier.citationDearle , A , Kirby , G , Norcross , S & McCarthy , A 2006 , A peer-to-peer middleware framework for resilient persistent programming . University of St Andrews .en
dc.identifier.otherPURE: 5009019
dc.identifier.otherPURE UUID: 3eb0cd09-2cf6-4562-95b4-327980a71759
dc.identifier.otherArXiv: http://arxiv.org/abs/1006.3724v1
dc.identifier.otherORCID: /0000-0002-4422-0190/work/28429106
dc.identifier.urihttps://hdl.handle.net/10023/1671
dc.descriptionSubmitted to EuroSys 2006 This work is funded partially by Nuffield grant URB/01597/Gen
dc.description.abstractThe persistent programming systems of the 1980s offered a programming model that integrated computation and long-term storage. In these systems, reliable applications could be engineered without requiring the programmer to write translation code to manage the transfer of data to and from non-volatile storage. More importantly, it simplified the programmer's conceptual model of an application, and avoided the many coherency problems that result from multiple cached copies of the same information. Although technically innovative, persistent languages were not widely adopted, perhaps due in part to their closed-world model. Each persistent store was located on a single host, and there were no flexible mechanisms for communication or transfer of data between separate stores. Here we re-open the work on persistence and combine it with modern peer-to-peer techniques in order to provide support for orthogonal persistence in resilient and potentially long-running distributed applications. Our vision is of an infrastructure within which an application can be developed and distributed with minimal modification, whereupon the application becomes resilient to certain failure modes. If a node, or the connection to it, fails during execution of the application, the objects are re-instantiated from distributed replicas, without their reference holders being aware of the failure. Furthermore, we believe that this can be achieved within a spectrum of application programmer intervention, ranging from minimal to totally prescriptive, as desired. The same mechanisms encompass an orthogonally persistent programming model. We outline our approach to implementing this vision, and describe current progress.
dc.format.extent14
dc.language.isoeng
dc.publisherUniversity of St Andrews
dc.subjectcs.DCen
dc.subjectDistributed, parallel, and cluster computingen
dc.subjectQA75 Electronic computers. Computer scienceen
dc.subject.lccQA75en
dc.titleA peer-to-peer middleware framework for resilient persistent programmingen
dc.typeReporten
dc.description.versionPreprinten
dc.contributor.institutionUniversity of St Andrews. School of Computer Scienceen
dc.identifier.urlhttp://arxiv.org/abs/1006.3724en


This item appears in the following Collection(s)

Show simple item record