Tentative steps toward a development method for interfering programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
Concurrency control in a dynamic search structure
ACM Transactions on Database Systems (TODS)
Performance analysis of on-the-fly garbage collection
Communications of the ACM
On-the-fly garbage collection: an exercise in cooperation
Communications of the ACM
Verifying properties of parallel programs: an axiomatic approach
Communications of the ACM
Theory, Volume 1, Queueing Systems
Theory, Volume 1, Queueing Systems
SAC '92 Proceedings of the 1992 ACM/SIGAPP Symposium on Applied computing: technological challenges of the 1990's
SAC '95 Proceedings of the 1995 ACM symposium on Applied computing
Performance and Stability Analysis of Multilevel Data Structures with Deferred Reorganization
IEEE Transactions on Software Engineering
Modeling and Analysis of Concurrent Maintenance Policies for Data Structures Using Pointers
IEEE Transactions on Software Engineering
Early-Reply Components: Concurrent Execution with Sequential Reasoning
ICSR-7 Proceedings of the 7th International Conference on Software Reuse: Methods, Techniques, and Tools
Online reorganization of databases
ACM Computing Surveys (CSUR)
Hi-index | 0.01 |
A stepwise method of deriving the high-performance implementation of a set of operations is proposed. This method is based on the ability to organize the data into a multilevel data structure to provide an efficient implementation of all the operations. Typically, for such data organization the performance may deteriorate over a period of time and that can be corrected by reorganizing the data. This data reorganization is done by the introduction of maintenance processes. For a particular example, the multilevel data organization and the different models of maintenance processes possible are considered. The various models of maintenance process provide varying amounts of concurrency by varying the degree of atomicity in different operations. Performance behavior for the different models is derived and a correctness proof for the developed implementation is outlined