An analysis of parallel-read sequential-write systems
References (8)
Operating System Principles
(1973)- et al.
Concurrent Control with Readers and Writers
Comm. of the ACM
(October 1971) Cooperating Sequential Processes
Monitors: An Operating System Structuring Concept
Comm. of the ACM
(October 1974)
Cited by (16)
Theoretical and experimental evaluation of communication-induced checkpointing protocols in F<inf>E</inf> and F<inf>Lazy-E</inf> families
2011, Performance EvaluationCitation Excerpt :Chesnais et al. propose a model for concurrent access to a distributed data base systems [6] and present an approximate solution for concurrent access and evaluate the accuracy of the approximate solution through simulation. Coffman et al. [7] obtain effective read times in terms of their Laplace Transforms assuming Poisson stream of write access when a non-sharable resource is accessed by readers and writers where we assume that readers execute in parallel whereas writers execute in a mutually exclusive manner. Coffman et al. analyze and determine the gain in read throughput in replicated database systems in the presence of consistency preserving algorithms that update all copies in a consistent way [8].
Adaptive prefetching algorithm in disk controllers
2008, Performance EvaluationCitation Excerpt :Subsequently, we extend this adaptive control prefetching algorithm to multiprogramming models using a “parallel processing” approximation. To ensure the efficient use of the resources, Multiprogramming is employed in computer systems to allow a number of users’ simultaneous accesses to the shared facilities [6,8]. Thus, we extend the prefetching algorithm to multiprogrammed memory models.
Adaptive control of pre-fetching
2001, Performance EvaluationA multithreshold scheduling policy for readers and writers
1998, Information SciencesComparison of stability and queueing times for reader-writer queues
1997, Performance EvaluationAnalysis of a replicated data base
1985, Performance Evaluation