JavaSpaces Principles, Patterns, and Practice
JavaSpaces Principles, Patterns, and Practice
Coordinating processes with secure spaces
Science of Computer Programming - Special issue on coordination languages and architectures
A Coordination Model Agents Based on Secure Spaces
COORDINATION '99 Proceedings of the Third International Conference on Coordination Languages and Models
IBM Systems Journal
Language support for fast and reliable message-based communication in singularity OS
Proceedings of the 1st ACM SIGOPS/EuroSys European Conference on Computer Systems 2006
Coordination with multicapabilities
Science of Computer Programming
XMem: type-safe, transparent, shared memory for cross-runtime communication and coordination
Proceedings of the 2008 ACM SIGPLAN conference on Programming language design and implementation
Information Processing Letters
Accurate garbage collection in uncooperative environments revisited
Concurrency and Computation: Practice & Experience
An efficient multi-processor architecture for parallel cyclic reference counting
VECPAR'02 Proceedings of the 5th international conference on High performance computing for computational science
Coordination with multicapabilities
COORDINATION'05 Proceedings of the 7th international conference on Coordination Models and Languages
New algorithms and applications of cyclic reference counting
ICGT'06 Proceedings of the Third international conference on Graph Transformations
Hi-index | 0.00 |
As open systems persist, garbage collection GC can be a vital aspect in managing system resources. Although garbage collection has been proposed for the standard Linda, it was a rather course-grained mechanism. This finer-grained method is offered in Lindacap, a capability-based coordination system for open distributed systems. Multicapabilities in Lindacap enable tuples to be uniquely referenced, thus providing sufficient information on the usability of tuples data within the tuple-space. This paper describes the garbage collection mechanism deployed in Lindacap, which involves selectively garbage collecting tuples within tuple-spaces. The authors present the approach using reference counting, followed by the tracing mark-and-sweep algorithm to garbage collect cyclic structures. A time-to-idle TTI technique is also proposed, which allows for garbage collection of multicapability regions that are being referred to by agents but are not used in a specified length of time. The performance results indicate that the incorporation of garbage collection techniques adds little overhead to the overall performance of the system. The difference between the average overhead caused by the mark-and-sweep and reference counting is small, and can be considered insignificant if the benefits brought by the mark-and-sweep is taken into account.