Research@StAndrews
 
The University of St Andrews

Research@StAndrews:FullText >
University of St Andrews Research >
University of St Andrews Research >
University of St Andrews Research >

Please use this identifier to cite or link to this item: http://hdl.handle.net/10023/1671
This item has been viewed 2 times in the last year. View Statistics

Files in This Item:

File Description SizeFormat
1006.3724v1559.72 kBAdobe PDFView/Open
Title: A peer-to-peer middleware framework for resilient persistent programming
Authors: Dearle, Alan
Kirby, Graham
Norcross, Stuart
McCarthy, Andrew
Keywords: cs.DC
Distributed, parallel, and cluster computing
QA75 Electronic computers. Computer science
Issue Date: 2006
Citation: Dearle , A , Kirby , G , Norcross , S & McCarthy , A 2006 , A peer-to-peer middleware framework for resilient persistent programming . University of St Andrews .
Abstract: The 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.
Version: Preprint
Description: Submitted to EuroSys 2006 This work is funded partially by Nuffield grant URB/01597/G
URI: http://hdl.handle.net/10023/1671
http://arxiv.org/abs/1006.3724
Type: Report
Publisher: University of St Andrews
Appears in Collections:University of St Andrews Research
Computer Science Research



This item is protected by original copyright

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

 

DSpace Software Copyright © 2002-2012  Duraspace - Feedback
For help contact: Digital-Repository@st-andrews.ac.uk | Copyright for this page belongs to St Andrews University Library | Terms and Conditions (Cookies)