Principles of transaction-oriented database recovery
ACM Computing Surveys (CSUR)
Implementation of resilient, atomic data types
ACM Transactions on Programming Languages and Systems (TOPLAS) - Lecture notes in computer science Vol. 174
GALILEO: a strongly-typed, interactive conceptual language
ACM Transactions on Database Systems (TODS)
Concurrency control and recovery in database systems
Concurrency control and recovery in database systems
A theoretical foundation of multi-level concurrency control
PODS '86 Proceedings of the fifth ACM SIGACT-SIGMOD symposium on Principles of database systems
Development of an object-oriented DBMS
OOPLSA '86 Conference proceedings on Object-oriented programming systems, languages and applications
SOSP '87 Proceedings of the eleventh ACM Symposium on Operating systems principles
Distributed programming in Argus
Communications of the ACM
Improving locality of reference in a garbage-collecting memory management system
Communications of the ACM
Atomic garbage collection: managing a stable heap
SIGMOD '89 Proceedings of the 1989 ACM SIGMOD international conference on Management of data
Cactis: a self-adaptive, concurrent implementation of an object-oriented database management system
ACM Transactions on Database Systems (TODS)
Principles and realization strategies of multilevel transaction management
ACM Transactions on Database Systems (TODS)
Mostly parallel garbage collection
PLDI '91 Proceedings of the ACM SIGPLAN 1991 conference on Programming language design and implementation
Effective “static-graph” reorganization to improve locality in garbage-collected systems
PLDI '91 Proceedings of the ACM SIGPLAN 1991 conference on Programming language design and implementation
ACM Transactions on Database Systems (TODS)
Persistent memory: a storage architecture for object-oriented database systems
OODS '86 Proceedings on the 1986 international workshop on Object-oriented database systems
Reliable object storage to support atomic actions
Proceedings of the tenth ACM symposium on Operating systems principles
A real-time garbage collector based on the lifetimes of objects
Communications of the ACM
List processing in real time on a serial computer
Communications of the ACM
Transaction Processing: Concepts and Techniques
Transaction Processing: Concepts and Techniques
Incremental Collection of Mature Objects
IWMM '92 Proceedings of the International Workshop on Memory Management
Object and File Management in the EXODUS Extensible Database System
VLDB '86 Proceedings of the 12th International Conference on Very Large Data Bases
Distributed Systems - Architecture and Implementation, An Advanced Course
Garbage collection in a large LISP system
LFP '84 Proceedings of the 1984 ACM Symposium on LISP and functional programming
Generation Scavenging: A non-disruptive high performance storage reclamation algorithm
SDE 1 Proceedings of the first ACM SIGSOFT/SIGPLAN software engineering symposium on Practical software development environments
RECOVERY USING VIRTUAL MEMORY
A bibliography on garbage collection and related topics
ACM SIGPLAN Notices
Partition selection policies in object database garbage collection
SIGMOD '94 Proceedings of the 1994 ACM SIGMOD international conference on Management of data
Semi-automatic, self-adaptive control of garbage collection rates in object databases
SIGMOD '96 Proceedings of the 1996 ACM SIGMOD international conference on Management of data
Partitioned garbage collection of a large object store
SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
Garbage collection for a client-server persistent object store
ACM Transactions on Computer Systems (TOCS)
On-line reorganization in object databases
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
A Highly Effective Partition Selection Policy for Object Database Garbage Collection
IEEE Transactions on Knowledge and Data Engineering
Predictions and Challenges for Database Systems in the Year 2000
VLDB '93 Proceedings of the 19th International Conference on Very Large Data Bases
Efficient Incremental Garbage Collection for Client-Server Object Database Systems
VLDB '95 Proceedings of the 21th International Conference on Very Large Data Bases
TMOS: A Transactional Garbage Collector
POS-9 Revised Papers from the 9th International Workshop on Persistent Object Systems
Partitioned garbage collection of a large stable heap
IWOOOS '96 Proceedings of the 5th International Workshop on Object Orientation in Operating Systems (IWOOOS '96)
Stasis: flexible transactional storage
OSDI '06 Proceedings of the 7th symposium on Operating systems design and implementation
Online reorganization of databases
ACM Computing Surveys (CSUR)
NV-Heaps: making persistent objects fast and safe with next-generation, non-volatile memories
Proceedings of the sixteenth international conference on Architectural support for programming languages and operating systems
| Hi-index | 0.00 |
A stable heap is storage that is managed automatically using garbage collection, manipulated using atomic transactions, and accessed using a uniform storage model. These features enhance reliability and simplify programming by preventing errors due to explicit deallocation, by masking failures and concurrency using transactions, and by eliminating the distinction between accessing temporary storage and permanent storage. Stable heap management is useful for programming languages for reliable distributed computing, programming languages with persistent storage, and object-oriented database systems.Many applications that could benefit from a stable heap (e.g., computer-aided design, computer-aided software engineering, and office information systems) require large amounts of storage, timely responses for transactions, and high availability. We present garbage collection and recovery algorithms for a stable heap implementation that meet these goals and are appropriate for stock hardware. The collector is incremental: it does not attempt to collect the whole heap at once. The collector is also atomic: it is coordinated with the recovery system to prevent problems when it moves and modifies objects. The time for recovery is independent of heap size, even if a failure occurs during garbage collection.