Michel Riveill · Distributed Systems Engineering · 1995
This paper presents the integration of a concurrency control mechanism in class-based languages. Synchronization constraints are expressed as separate control clauses and are factorized for a class of objects. Interference of this mechanism with inheritance and transactions is examined and solutions are proposed. This paper addresses language and system issues: canonical examples of synchronized objects are provided and an implementation of the mechanism is outlined.
Cited by 1
M. Kiser, A. Zogg · 1989
Object oriented programming and parallel programming are two important and evolving areas in computer science. Much research has been carried out in each of the two programming disciplines, but little effort has been put on combining the two areas. The authors discuss a major problem of parallel programming: synchronization of concurrent processes using a shared object. Discussing the example of the bounded buffer, they demonstrate how to build a high structured shared object based on primitive constructs in an object oriented manner. They use the object oriented programming environment Smalltalk-80 which supports basic process management and synchronization tools (semaphores). The ideas presented were realized in a prototype of a distributed directory service according to the CCIT X.500 standard. >
Cited by 1
Chris Salzmann · 1999
Modern component architectures extend the range of reuse from the data-model level towards the level of functionality. In modern distributed object architectures different clients share a set of so called business objects for representing encapsulated functionality or certain entities. One of the advantages of this approach is, that several applications can share one instance of such a business object. The advantages of sharing resources are well known: higher reliability, compact code and lower costs, just to mention a few. However, in large distributed systems, that share objects instances the effort for managing and configuring those systems increase rapidly. In this position paper we give the benefits of that approach and we sketch out what facilities a systems has to provide to maintain and manage those shared objects. Keywords: Software Engineering, Administration of Distributed Objects, Configuration Management, Distributed Systems, Business Objects and Software Architecture W...
Cited by 0
Dudka, Kamil · Brno University of Technology Digital Library (Brno University of Technology)
Tato bakalářská práce se zabývá problematikou meziprocesové komunikace v moderních operačních systémech. Důraz je kladen na využití sdílené paměti pro meziprocesovou komunikaci v objektově orientovaném jazyku C++. Součástí práce je popis návrhu a implementace knihovny, která umožňuje sdílenou paměť jednoduše a efektivně používat. Knihovna umožňuje sdílet přímo objekty jazyka C++ mezi procesy. Kromě toho vytváří knihovna platformově nezávislé rozhraní pro práci se sdílenou pamětí v operačních systémech Linux a Microsoft Windows. V závěru práce je zhodnocena efektivita využití sdílené paměti jako způsobu meziprocesové komunikace.
Cited by 0
Matthieu Perrin · Elsevier eBooks · 2017
Cited by 1
Oleg Grabar · 2024
Cited by 23
Andrew Tanenbaum Henri, Henri E. Bal, M. Frans Kaashoek · 1993
Cited by 0
Chevalier Hagimont Krakowiak, P. -y. Chevalier, D. Hagimont et al. · 2007
This position paper supports the view that a model based on shared objects is an attractive alternative to message passing for structuring distributed applications and that a distributed operating system should provide support for shared persistent objects. The paper reviews several recently proposed solutions, including our own, and outlines some current problems.
Cited by 0
P.-Y. Chevalier, D. Hagimont, S. Krakowiak et al. · 1992
This position paper supports the view that a model based on shared objects is an attractive alternative to message passing for structuring distributed applications and that a distributed operating system should provide support for shared persistent objects. The paper reviews several recently proposed solutions, including our own, and outlines some current problems.
Cited by 0
Andrew S. Tanenbaum, M. Frans Kaashoek, Henri E. Bal et al. · 1992
Parallel computers come in two varieties: those with shared memory and those without. The former are hard to build; the latter are hard to program. In this paper we propose a hybrid form that combines the best properties of each. The basic idea is to allow programmers to define objects upon-which userdefined operations are performed, in effect, abstract data types. Each object is replicated on each machine that needs it. Reads are done locally, with no network traffic. Writes are done by a reliable broadcast algorithm. A language for parallel programming, Orca, based on distributed shared objects has been designed, implemented, and used for some applications. Its implementation uses the reliable broadcast mechanism. For applications with a high read/write ratio to the shared objects, we show that our approach can frequently achieve close to linear speedup with up to 16 processors. BLURB FOR CENTER COLUMN Parallel computers come in two varieties: those with shared memory and those without. The former are hard to build; the latter are hard to program. In this paper we propose a hybrid form that combines the best properties of each.
Cited by 0
Yehuda Afek, David S. Greenberg, Michael Merritt et al. · Journal of the ACM · 1995
This paper investigates the effects of the failure of shared objects on distributed systems. First the notion of a faulty shared object is introduced. Then upper and lower bounds on the space complexity of implementing reliable shared objects are provided, Shared object failures are modeled as instantaneous and arbitraty changes to the state of the object. Several constructions of nonfaulty wait-free shared objects from a set of shared objects, some of which may suffer any number of faults, are presented. Three of these constructions are:
Cited by 42Open access
Prasad Jayanti, Tushar Chandra, Sam Toueg · 1992
Cited by 1
Prasad Jayanti, Tushar Chandra, Sam Toueg · 1992
Wait-free implementations of shared objects tolerate the failure of processes, but not the failure of base objects from which they are implemented. We consider the problem of implementing shared objects that tolerate the failure of both processes and base objects.We identify two classes of object failures: responsive and nonresponsive. With responsive failures, a faulty object responds to every operation, but its responses may be incorrect. With nonresponsive failures, a faulty object may also “hang” without responding. In each class, we define crash, omission, and arbitrary modes of failure.We show that all responsive failure modes can be tolerated. More precisely, for all responsive failure modes ℱ, object types T, and t ≥ 0, we show how to implement a shared object of type T which is t-tolerant for ℱ. Such an object remains correct and wait-free even if up to t base objects fail according to ℱ. In contrast to responsive failures, we show that even the most benign non-responsive failure mode cannot be tolerated. We also show that randomization can be used to circumvent this impossibility result.Graceful degradation is a desirable property of fault-tolerant implementations: the implemented object never fails more severely than the base objects it is derived from, even if all the base objects fail. For several failure modes, we show wheter this property can be achieved, and, if so, how.
Cited by 0
James M. Stringham · 1990
Cited by 0Open access
Michael Merritt, Gadi Taubenfeld · 2007
) Michael Merritt ? Gadi Taubenfeld ?? Abstract. Fairness in concurrent systems can be viewed as an abstraction that bridges low-level timing guarantees and make them available to programmers with a minimal loss of power and a maximal ease of use. We investigate the implementation and power of a range of fairness models that are appropriate to the synchronous, semi-synchronous and asynchronous contexts of various concurrent systems. 1 Introduction 1.1 Motivation Fairness is a powerful abstraction that has led to fruitful results in the theory of concurrent, distributed and nondeterministic programs. Various notions of fairness can be explained very briefly, but small differences have important consequences on the computability and complexity of concurrent systems. We investigate the implementation and power of a range of fairness models that are appropriate to the synchronous, semi-synchronous and asynchronous contexts of various concurrent systems. While some previous wo...
Cited by 0
M. Ahamad, F.J. Torres-Rojas, R. Kordale et al. · Workshop on Mobile Computing Systems and Applications · 2002
In systems that support disconnected operations, shared objects must be cached at client sites to ensure that the objects are accessible while the client is disconnected. It is desirable that objects cached at a client site are mutually consistent with respect to the level of consistency provided by the system. We present a new technique for detecting mutual consistency of objects and show how it can be used to support causal consistency, which is appropriate in systems that support disconnected operations.
Cited by 2
Tushar Deepak Chandra, Sam Toueg, Prasad Jayanti et al. · 1998
Cited by 0
Trinity College, Alan Judge, Alan Judge · 1996
ion and Subtype Polymorphism. Technical Report CSD-TR-93-059, Department of Computer Sciences, Purdue University, West Lafayette, IN 47907, USA, December 1994. [20] John K. Bennett, John B. Carter, and Willy Zwaenepoel. Adaptive Software Cache Management for Distributed Shared Memory Architectures. In Proceedings of the 17th Annual International Symposium on Computer Architecture [101], pages 125-- 134. Also published in ACM SIGARCH News, 18(2), June 1990. [21] John K. Bennett, John B. Carter, and Willy Zwaenepoel. Munin: Distributed Shared Memory Based on Type-Specific Memory Coherence. SIGPLAN Notices, 25(3):168--176, March 1990. Proceedings of the 2 nd ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming. [22] Jos'e M. Bernab'eu-Aub'an, Phillip W. Hutto, M. Yousef A. Khalidi, Mustaque Ahamad, Willian F. Appelbe, Partha Dasgupta, Richard J. LeBlanc, and Umakishore Ramachandran. Clouds---A Distributed, Object-Based Operating System Architecture and Kernel Implem...
Cited by 0
Mustaque Ahamad, F.J. Torces-Rojas, Rammohan Kordale et al. · 1994
In systems that support disconnected operations, shared objects must be cached at client sites to ensure that the objects are accessible while the client is disconnected. It is desirable that objects cached at a client site are mutually consistent with respect to the level of consistency provided by the system. We present a new technique for detecting mutual consistency of objects and show how it can be used to support causal consistency, which is appropriate in systems that support disconnected operations.
Cited by 13
Philip Homburgmaarten, Steen Andrew, S. Tanenbaum · 2008
Abstract Developing wide area applications such as those for sharing data across the Internet is unnec-essarily difficult. The main problem is the widespread use of a communication paradigm that is too low level. We will show how wide area application development can be made easier when usingdistributed shared objects instead of a communication-oriented model. An object in our model is physically distributed, with multiple copies of its state on different machines. All implementationaspects such as replication, distribution, and migration of state, are hidden from users through an object's interface. In this paper, we concentrate on the application of distributed shared objects,by providing an outline of a middleware solution that permits integration of the Internet services for e-mail, News, file transfer, and Web documents.
Cited by 0