Persistent object management system

Cockshott, Paul; Atkinson, Malcolm; Chisholm, Kenneth; Bailey, Peter J.; Morrison, Ronald

doi:10.1002/spe.4380140106

Cited by 74 publications

(13 citation statements)

References 5 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The concurrent operating system is an extension of the Persistent Information Space Architecture (PISA), developed by a joint project between University of St. Andrews, University of Edinburgh, and ICL in the United Kingdom [7]. The PISA system is based on the principle of uniformity of persistence of data objects, where the persistence of an object is the length of time that the object exists and is useable.…”

Section: The Concurrent Operating Systemmentioning

confidence: 99%

The Leopard workstation project

Ashenden

Barter

Marlin

1987

SIGARCH Comput. Archit. News

View full text Add to dashboard Cite

I n t r o d u c t i o n .An emerging trend in the use of computer systems is the general migration to workstations. It is clear from examination of current and projected uses of workstations that many applications require more processing power than can be readily achieved with one processor. Such applications include computer-aided engineering and design, graphics generation, and software systems development. The use of multiprocessor architectures is a cost-effective way to solve this problem.The Leopard Workstation Project at the University of Adelaide is investigating a multiprocessor architecture for high performance workstation computers. This architecture makes use of newly available processor components and interconnection technology, and combines them in a way which yields high performance, whilst keeping overhead cost low. The Project is also working on software systems which will take advantage of the architecture, including a concurrent operating system using the Persistent Information Space Architecture (PISA) model, and a concurrent programming environment called Multiview.This paper describes the architecture of the Leopard Workstation, and gives a brief outline of previous developmental work. The work in progress on prototype implementations is then outlined, and an overview is given of of the software projects which take advantage of this architecture. 40

show abstract

Section: The Concurrent Operating Systemmentioning

confidence: 99%

The Leopard workstation project

Ashenden

Barter

Marlin

1987

SIGARCH Comput. Archit. News

View full text Add to dashboard Cite

show abstract

“…Reorganizing the neap requires a collector that can move objects, e.g., a copying collector. Copying collectors can increase locality of reference and reduce paging by moving objects that are referenced together to the same page [13,35,53] [56] have shown how the virtual memory hardware on stock hardware can be used to facilitate incremental copying garbage collection with lower overhead.…”

Section: Atomic Incremental Garbage Collectionmentioning

confidence: 99%

“…PS-algol [3,13,37] is a language for persistent programming. There are many similarities between the system model of PS-algol and a stable heap: both define persistence according to reachability from a persistent root, and both use transactions to control concurrency and provide fault-tolerance.…”

Section: Ps-algolmentioning

confidence: 99%

Atomic incremental garbage collection and recovery for a large stable heap

Kolodner

Weihl

1993

Proceedings of the 1993 ACM SIGMOD International Conference on Management of Data

View full text Add to dashboard Cite

A stable heap is storage that is managed automatically using garbage collection, manipulated using atomic transactions, and accessed using a uniform storage model. These features enhance reliability and simplify programming by preventing errors due to explicit deallocation, by masking failures and concurrency using transactions, and by eliminating the distinction between accessing temporary storage and permanent storage. Stable heap management is useful for programming languages for reliable distributed computing, programming languages with persistent storage, and object-oriented database systems.Many applications that could benefit from a stable heap (e.g., computer-aided design, computer-aided software engineering, and office information systems) require large amounts of storage, timely responses for transactions, and high availability. We present garbage collection and recovery algorithms for a stable heap implementation that meet these goals and are appropriate for stock hardware. The collector is incremental: it does not attempt to collect the whole heap at once. The collector is also atomic: it is coordinated with the recovery system to prevent problems when it moves and modifies objects. The time for recovery is independent of heap size, and can be shortened using checkpoints.An object in a stable heap is stable and survives crashes if it is reachable from a root that is designated stable; other objects are volatile (e.g., objects local to procedure invocations) and do not need to survive crashes. By tracking objects as they become stable and dividing the heap into a stable area and a volatile area, our algorithms incur the costs of crash recovery and atomic garbage collection only for stable objects. Our tracking algorithm is concurrent; multiple transactions can invoke the tracking algorithm at the same time.We present a formal specification for a stable heap and a formal description of the atomic incremental garbage collector and recovery system used to implement it. We demonstrate the correctness of the algorithms by exhibiting the abstraction function and the invariants they maintain. We also describe a prototype that we implemented to show the feasibility of our algorithms.

show abstract

“…This is sufficient to provide access to any object in the persistent store. Automatic transfer of data from the long term persistent store is performed by the persistent object management system [4] when the data is accessed. The access of the data in the persistent store is performed in exactly the same manner as in the main store, the object manager knowing the difference so as to leave the transfer transparent to the user.…”

Section: The Persistent Store Interfacementioning

confidence: 99%

“…In this way PS-algol provides a secure transaction mechanism on its persistent store. Further reading on the PS-algol system can be found in [1] and [4].…”

Section: The Persistent Store Interfacementioning

confidence: 99%

An Integrated Graphics Programming Environment

Morrison

Floranis

Dearle

et al. 1986

Computer Graphics Forum

Self Cite

View full text Add to dashboard Cite

The facilities of the PS-algol programming language are described in this paper to show how they may be used to provide an integrated graphics programming environment. The persistent store mechanism and the secure transaction facilities of the language provide the basic environment in which an integrated system may be implemented. This is augmented by data types and operations to support line drawings and raster graphics. The combination of these mechanisms may be used to provide the integrated graphics programming environment.

show abstract

Persistent object management system

Abstract: This is a description of the integrated Persistent Object Management System (POMS) for the language PS‐algol. The objective of POMS is to provide an implementation of the PS‐algol persistent heap1 entirely by means of procedures written in PS‐algol.

Cited by 74 publications

References 5 publications

The Leopard workstation project

The Leopard workstation project

Atomic incremental garbage collection and recovery for a large stable heap

An Integrated Graphics Programming Environment

Contact Info

Product

Resources

About