Models of higher-order, type-safe, distributed computation over autonomous persistent object stores

Mira da Silva, Miguel Leitão Bignolas (1996) Models of higher-order, type-safe, distributed computation over autonomous persistent object stores. PhD thesis, University of Glasgow.

Full text available as:
[img]
Preview
PDF
Download (12MB) | Preview
Printed Thesis Information: https://eleanor.lib.gla.ac.uk/record=b1666527

Abstract

A remote procedure call (RPC) mechanism permits the calling of procedures in another
address space. RPC is a simple but highly effective mechanism for interprocess communication
and enjoys nowadays a great popularity as a tool for building distributed applications.
This popularity is partly a result of their overall simplicity but also partly a consequence
of more than 20 years of research in transpaxent distribution that have failed to deliver
systems that meet the expectations of real-world application programmers.
During the same 20 years, persistent systems have proved their suitability for building
complex database applications by seamlessly integrating features traditionally found in
database management systems into the programming language itself. Some research. effort
has been invested on distributed persistent systems, but the outcomes commonly suffer
from the same problems found with transparent distribution.
In this thesis I claim that a higher-order persistent RPC is useful for building distributed
persistent applications. The proposed mechanism is: realistic in the sense that it uses
current technology and tolerates partial failures; understandable by application programmers;
and general to support the development of many classes of distributed persistent
applications.
In order to demonstrate the validity of these claims, I propose and have implemented three
models for distributed higher-order computation over autonomous persistent stores. Each
model has successively exposed new problems which have then been overcome by the next
model. Together, the three models provide a general yet simple higher-order persistent
RPC that is able to operate in realistic environments with partial failures.
The real strength of this thesis is the demonstration of realism and simplicity. A higherorder
persistent RPC was not only implemented but also used by programmers without
experience of programming distributed applications. Furthermore, a distributed persistent
application has been built using these models which would not have been feasible with a
traditional (non-persistent) programming language.

Item Type: Thesis (PhD)
Qualification Level: Doctoral
Subjects: Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Colleges/Schools: College of Science and Engineering
Supervisor's Name: Atkinson, Malcolm
Date of Award: 1996
Depositing User: Mr Toby Hanning
Unique ID: glathesis:1996-2689
Copyright: Copyright of this thesis is held by the author.
Date Deposited: 08 Jun 2011
Last Modified: 04 Feb 2014 10:48
URI: http://theses.gla.ac.uk/id/eprint/2689

Actions (login required)

View Item View Item