Architecture of a High Performance Persistent Object Store

Source: CiteSeer


Introduction Applications for multicomputers (massively parallel, MIMD, distributed memory computers) are apparently under challenge from the continuing increase in speed of single processors, and their combination over LANs as NoWs (Networks of Workstations) and over shared memory as SMP (symmetric multiprocessor) systems. However, there are many classes of applications which are well suited to the multicomputer's larger number of processors than the SMP architecture, and its coordinated parallelism and high-speed interconnectivity. This is becoming more apparent as effective, scalable parallel filesystems[5, 15] become available for the multicomputer to address its previous problems of inadequate I/O performance. However there remains a class of problems whose irregular structure makes them hard to program for current multicomputer systems, although they display the potential to benefit from the architecture. For the programmer and automatic compiler alike these applications

Download full-text


Available from: Christopher W. Johnson, Nov 23, 2014
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: A multicomputer persistent object store(MPOS) is a software layer that is intended to help in programming irregular, data-intensive applications on multicomputers such as the Fujitsu AP series. We have built a prototype MPOS with an architecture of specialised object-server processors and client-application processors, over the HiDIOS multiple disk file system. Application processes see a common object address space, using optimistic transactions for concurrency control. Objects transparently persist on disk, via page buffers in the object-servers. We report experience and scalability performance of two benchmark applications studies, one in scientific computation (an N-body tree code) and the other a parallel version of the OO7 object-oriented database benchmark. 1 Introduction 1.1 A multicomputer persistent object store - HeROD The HeROD multicomputer persistent object store allows multiple application processes running in a multicomputer to see a common, persistent store made of o...
    Full-text · Article · Dec 1996
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: Using a persistent multicomputer object store should greatly simplify the writing of distributed memory parallel programs operating on irregular, object-structured data, by removing from the programmer the burden of managing data referencing, distribution and coherency. In this report we explore the development of such a program using the HeROD persistent multicomputer object store, in a computational science application. The computational code is part of the tree-code algorithm for the N-body problem. A number of solutions to the difficulties of combining flat transactions and cooperating parallel processes are explored, in both the application programming domain and the persistent store design. Actual performance measures of the implementation on a 128-processor multicomputer are reported, with scalability comparisons for a range of processor configurations (exploring sensitivity to the client-server balance) and program implementation strategies, particularly by varying transaction ...
    Preview · Article · Mar 1997
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: The subject of this thesis is scalability and persistence. A convergence of computing and communications technologies has lead to the `information explosion'. Demand for information has grown at an unprecedented pace, placing pressure on the scalability of information servers. At the same time there has been a revolution in switching technology which has seen the once exotic tightly coupled distributed memory computer become widely available through commodity components. These two developments in computing and communications technologies come together, the former bringing with it the challenge of constructing systems capable of scaling to address the spiraling demand for information, and the latter offering a scalable hardware architecture upon which such systems can be based. The most elegant approach to persistent data management lies in the use of orthogonal persistence. Orthogonally persistent programming languages bring together the disparate concerns of programming languages and ...
    Preview · Article · Nov 1997