The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
Performance analysis of concurrent maintenance policies for servers in a distributed environment
ACM '86 Proceedings of 1986 ACM Fall joint computer conference
On-the-fly garbage collection: an exercise in cooperation
Communications of the ACM
On self-organizing sequential search heuristics
Communications of the ACM
Optimal reorganization of distributed space disk files
Communications of the ACM
SAC '92 Proceedings of the 1992 ACM/SIGAPP Symposium on Applied computing: technological challenges of the 1990's
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
Online reorganization of databases
ACM Computing Surveys (CSUR)
| Hi-index | 0.00 |
Three strategies for designing servers and maintaining their data structures are discussed: incremental maintenance, periodic maintenance, and concurrent maintenance. The authors study periodic and concurrent maintenance strategies analytically in order to gain more insight into the behavior of servers using these strategies and determine when and how the maintenance should be performed. For periodic maintenance, it is shown that there is a value of the period which minimizes the average response time, and a formula to compute this value analytically is derived. For concurrent maintenance, a formula for its average response time and the condition under which concurrent maintenance would be preferable to periodic maintenance is derived. The authors have conducted a series of experiments to compare the performance of different maintenance strategies. For the system considered in the experiment, periodic maintenance yields the best average response time, whereas concurrent maintenance gives the least standard deviation and the smallest maximum response time.