Isabelle Puaut. A distributed garbage collector for active objects. In OOPSLA  Home/Search   Document Details and Download   Summary   Related Articles   Check

....described by Kamada et al. 19] In this work, all active objects are considered live. An interesting feature of their algorithm is the use of a centralized agent which handles many problems related to synchronization and detection of termination of various phases of the garbage collection. Puaut [28, 29] presents an algorithm comprising of independent local collectors loosely coupled to a global collector. The global collector is a logically centralized service that maintains a graph which is a merge of subgraphs sent by the local garbage collectors. Dickman [12] presents an interesting ....

I. Puaut. A distributed garbage collector for active objects. In PARLE'94 Parallel Architectures and Languages Europe, Lecture Notes in Computer Science. Springer-Verlag, 1994. Also INRIA UCIS-DIFUSION RR 2134.

....been described by Kamada [18] In this work, all active objects are considered live. An interesting feature of their algorithm is the use of a centralized agent which handles many problems related to synchronization and detection of termination of various phases of the garbage collection. Puaut [29, 30] presents an algorithm comprising of independent local collectors loosely coupled to a global collector. The global collector is a logically centralized service that maintains a graph which is a merge of subgraphs sent by the local garbage collectors. The local collectors send a vector timestamp ....

Isabelle Puaut. A distributed garbage collector for active objects. In PARLE'94 Parallel Architectures and Languages Europe, Lecture Notes in Computer Science. Springer-Verlag, 1994. Also INRIA UCIS-DIFUSION RR 2134.

....needed between collectors. Besides that, simplifying hypotheses are introduced, for example assuming that there is no delay in transferring messages from one collector to another cannot be veried in practice. Recent papers evoke the use of local garbage collectors with a logical global collector [WK91, Pua94] performing garbage collection in distributed systems of active objects. The local ones need not be synchronised with each other but still here we need a central garbage collector. To our knowledge major existing parallel garbage algorithms for graphs fail to t into the implemented model of ....

....nodes or testing reachability of nodes is not suitable when the graph is distributed over a set of processors. The main purpose of this paper is to have a method that represents an eOEcient garbage collector for the implemented model. Any solution introducing a supervisor or a global snapshot[WK91, Pua94] of the system state is inadequate. We recall that the implemented model introduces additional data structures called photos to solve the lack of global state. Each node stores a photo (see section 2) which is a part of a graph below a node. Thus, a node N is referred to by its antecedents ....

I. Puaut. A distributed garbage collector for active objects. In Proc. of PARLE'94, volume 817 of Lecture Notes in Computer Science, pages 539 552. Springer-Verlag, July 1994.

....a client server model. Distributed references are tracked by the server, which can use them to determine where garbage is. For scaling to larger networks, the article proposes dividing the network into areas, each with its own server and a global server to sit above for inter area references. Puaut[45, 46] provides another client server model for distributed collection of active objects. This extends Kafura s [29] algorithm for collecting agents by allowing lost messages and removing synchronization constraints. The various nodes of a system send timestamped information to a global collector ....

Isabelle Puaut. A Distributed Garbage Collector for Active Objects. In OOPSLA Proceedings, pages 113--128. ACM, 1994.

....As we show in Section 7, the number of marking messages is considerable, and thus reduction of the GC messages in essential for achieving good performance. Both employ (local) write barrier for concurrency with mutators, and mutators are allowed to work in black (marked and traversed) area only. [22, 16] presents an GC algorithm of actors under the definition proposed in [12] 22] emphasizes the treatment of pending messages in network and employs bulldozing messages to confirm message arrival. However, the algorithm also requires an acknowledgement message for every marking message, doubling ....

....arrival. However, the algorithm also requires an acknowledgement message for every marking message, doubling the traffic of global GC messages. It also allows mutators to work concurrently with marking; however, the run time overhead of their algorithm in collecting the actors seems very high. [16] collects the global information of object reference into one master node, upon which traversal is done based on [12] The algorithm exhibits favorable behavior such as fault tolerance and message loss in distributed systems, but the centralization of collection information would be difficult to ....

I. Puaut. A distributed garbage collector for active objects. In Proc. of OOPSLA, 1994. (to appear).

....and for making objects interact with each other through location independent method calls. Gothic provides an algorithm implementing placement of method executions that adapts to processors loads and to objects characteristics [Belhamissi 94] In addition, a distributed garbage collector [Puaut 94] frees the resources (memory and processor) consumed by unneeded objects. The rest of this section gives additional information on the object model of Gothic and its algorithm for placing method executions. Objects and execution structures A Gothic object includes internal data and a set of ....

Puaut, I., A distributed garbage collector for active objects, Proc. Object-Oriented Programming Systems, Languages and Applications, (OOPSLA'94) , Portland Oregon, Oct. 1994.

.... the design and implementation of two distributed object based programming systems: Gothic [6] and Arche [8] Although this work led to promising results from the standpoint of specific object management mechanisms (e.g. fault tolerance mechanism for Gothic [7] and garbage collection for Arche [38]) the proposed distributed object based systems were not entirely satisfactory for several reasons. Among them, let us mention the systems poor performance and lack of portability. We thus decided to adopt a generic approach in order to solve these shortcomings but also to be able to implement ....

....remote calls, and to implement algorithms for orphan detection, orphan destruction, and detection of abnormal terminations. Although not yet examined, another Isatis customization that could be considered is the introduction of the garbage collector dedicated to the Arche language and presented in [38]. The proposed garbage collector is comprised of a collection of local garbage collectors, loosely coupled to a global garbage collector. Each local collector identifies and reclaims the objects that can be detected to be garbage on a local basis, while it communicates with the global collector to ....

I. Puaut. A distributed garbage collector for active objects. In Proceedings of the Ninth ACM Conference on Object-Oriented Programming Systems, Languages and Applications, 1994.

....containing references is sent from one site to another, In Table and Out Table are updated accordingly. An object name remains stored in In Table or Out Table until the garbage collector finds it to be no longer needed, as detailed later. 1 Earlier results of this work can be found in [8, 9]. Our strategy for garbage collection is to have sites responsible for doing local garbage collection and managing the resources for the objects they own. A local garbage collector is associated with each site and detects garbage by using only local information in an expedient manner (garbage ....

I. Puaut. A distributed garbage collector for active objects. In Proc. of PARLE Conference (Parallel Architectures and Languages Europe), Athens, Greece, July 1994.

No context found.

Isabelle Puaut. A distributed garbage collector for active objects. In OOPSLA

No context found.

Isabelle Puaut. A distributed garbage collector for active objects. In PARLE

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC