A Shared Object Hierarchy
نویسنده
چکیده
This paper describes the design and proposed implementation of a shared object hierarchy. The object hierarchy is stored in a relational database and objects referenced by an application program are cached in the program’s address space. The paper describes the database representation for the object hierarchy and the use of POSTGRES, a next-generation relational database management system, to implement object referencing efficiently. The shared object hierarchy system will be used to implement OBJFADS, an object-oriented programming environment for interactive multimedia database applications, that will be the programming interface to POSTGRES.
منابع مشابه
Object-Based Classification of UltraCamD Imagery for Identification of Tree Species in the Mixed Planted Forest
This study is a contribution to assess the high resolution digital aerial imagery for semi-automatic analysis of tree species identification. To maximize the benefit of such data, the object-based classification was conducted in a mixed forest plantation. Two subsets of an UltraCam D image were geometrically corrected using aero-triangulation method. Some appropriate transformations were perfor...
متن کاملThe Consensus Hierarchy is not
The consensus hierarchy characterizes the strength of a shared object by its ability to solve the consensus problem in a wait-free manner. A robust hierarchy has the additional property that objects at lower levels cannot be combined in any way to construct objects at higher levels of the hierarchy. Several variations of the consensus hierarchy have appeared in the literature, and it has been s...
متن کاملToward Large Scale Shared Memory Multiprocessing
We are currently investigating two di erent approaches to scalable shared memory Munin a distributed shared memory DSM system implemented entirely in software and Willow a true shared memory multiprocessor with extensive hardware support for scalability Munin allows parallel programs written for shared memory multiprocessors to be executed e ciently on dis tributed memory multiprocessors Unlike...
متن کاملOn the Computational Power of Shared Objects
We propose a new classification for evaluating the strength of shared objects. The classification is based on finding, for each object of type o, the strongest progress condition for which it is possible to solve consensus for any number of processes, using any number of objects of type o and atomic registers. We use the strongest progress condition to associate with each object a number call t...
متن کاملService Availability in Concurrent Systems - Part I: A Theory of Hierarchical Services of Interacting Processes
A novel formal model is introduced that is tailored to the treatment of the service availability problem in concurrent systems. This model, called hierarchical services of interacting processes (HSIP), incorporates the hierarchy of services, processes, shared variables, and dense time to reason about services quantitatively. The underlying concept is that a service, via its hierarchy, relates t...
متن کامل