The Persistent Abstract Machine

Connor, Richard; Brown, A. L.; Carrick, R.; Dearle, Alan; Morrison, Ronald

doi:10.1007/978-1-4471-3173-1_24

Cited by 9 publications

(5 citation statements)

References 6 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…16 Page request messages are typically transmitted to the node whose identity is embedded in the page address. Prior to transmitting a request for provision of a page, however, the kernel checks a local table which maps moved volumes to their new mounting node.…”

Section: Naming and Coherencymentioning

confidence: 99%

Distributed persistent stores

Henskens

Rosenberg

1993

Microprocessors and Microsystems

View full text Add to dashboard Cite

show abstract

Section: Naming and Coherencymentioning

confidence: 99%

Distributed persistent stores

Henskens

Rosenberg

1993

Microprocessors and Microsystems

View full text Add to dashboard Cite

show abstract

“…Mneme is the POS used for this study. There have also been a number of designs related to virtual memory such as [2,3,36,37,38]. Object servers include ObServer [39] and Gemstone [40].…”

Section: Related Workmentioning

confidence: 99%

Working with persistent objects: to swizzle or not to swizzle

Moss

1992

IIEEE Trans. Software Eng.

View full text Add to dashboard Cite

Pointer swizzling 3 is the conversion of database objects between an external form (object identifiers) and an internal form (direct memory pointers). Swizzling is used in some object-oriented databases, persistent object stores, and persistent and database programming language implementations to speed manipulation of memory resident data. Here we describe a simplifying model of application behavior, revealing those aspects where swizzling is most relevant in both benefits and costs. The model has a number of parameters, which we have measured for a particular instance of the Mneme persistent object store, varying the swizzling technique used. The results confirm most of the intuitive, qualitative tradeoffs, with the quantitative data showing that some performance differences between schemes are smaller than might be expected. However, there are some interesting effects that run counter to naive intuition, most of which we explain using deeper analysis of the algorithms and data structures.

show abstract

“…In particular, process models evolve frequently, and therefore must accommodate dynamic change within the application domain. Thus, the architectural problems encountered in implementing process modelling systems are similar to, if not the same as, those investigated by the persistent programming community over many years now [8][9][10][11][12][13][14][15][16][17][18][19][20][21][22].…”

Section: Introductionmentioning

confidence: 98%

A compliant persistent architecture

Morrison

Balasubramaniam

Greenwood

et al. 2000

Softw: Pract. Exper.

View full text Add to dashboard Cite

The changing needs of modern application systems demand new and radical software architectures to support them. The attraction of persistent systems is that they define precisely the extent to which they are open, thereby allowing the dynamically changing resource requirements of applications to be tracked accurately within the persistent environment. Thus, an ever-growing body of work is being established to study the nature of running applications, and to use the information gleaned, to improve the runtime execution of these applications. Here we propose a new architectural approach to constructing persistent systems that accommodates, and thus is compliant to, the needs of particular applications. By separating policy from mechanism in all components, the architecture may be tailored to the policy needs of the application. ‡ ‡ We first propose a generic architecture for compliance, and then show how it may be instantiated. Finally, we describe an example of how the architecture operates in a manner that is compliant to a target application. We postulate, since we have not yet measured, that the benefits of compliant architectures will be a reduction in complexity, with corresponding gains in flexibility, portability, understandability in terms of failure semantics, and performance. ‡ ‡ Policy may be regarded as strategy for achieving a goal, such as a cache eviction algorithm, whereas mechanism is the method by which the objective is achieved, such as the physical movement of the cache lines. As we see later, policy and mechanism are composable to form new mechanism. ; 30:363-386 * This is the situation found in real-time applications. The term operating software has been used to characterise such real-time systems to emphasise the intimate connection between the real-time application and the real-time operating system [26].let init ← any (0) let initObject ← vector @1 of [init, init, init] ! A vector (array) of dummy objects.let clusterRoots ← vector @1 of [init, init, init, init, init] ! The empty vector of cluster roots.let clusterObjects ← vector @1 of [initObject, initObject, initObject, initObject] ! The empty vector of vectors of associated objects. ! The root index is used to identify the vector of associated objects within this.

show abstract

The Persistent Abstract Machine

Cited by 9 publications

References 6 publications

Distributed persistent stores

Distributed persistent stores

Working with persistent objects: to swizzle or not to swizzle

A compliant persistent architecture

Contact Info

Product

Resources

About