Elsevier

Performance Evaluation

Volume 1, Issue 1, January 1981, Pages 62-69
Performance Evaluation

An analysis of parallel-read sequential-write systems

https://doi.org/10.1016/0166-5316(81)90044-4Get rights and content

Abstract

We consider a classical problem in the parallel access of processes to a common non-shareable resource. Our purpose is to evaluate the effective read throughput of a set of independent processes in the presence of write operations carried out by the same processes. Read operations are assumed to be executable in parallel, while writes have to be strictly sequential. Explicit expressions are obtained for the distributions of effective read times in terms of their Laplace transforms, under general assumptions concerning the access times and assuring a Poisson stream of write accesses.

References (8)

  • P. Brinch-Hansen

    Operating System Principles

    (1973)
  • P.J. Courtois et al.

    Concurrent Control with Readers and Writers

    Comm. of the ACM

    (October 1971)
  • E. Dijkstra

    Cooperating Sequential Processes

  • C.A.R. Hoare

    Monitors: An Operating System Structuring Concept

    Comm. of the ACM

    (October 1974)
There are more references available in the full text version of this article.

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 Evaluation
    Citation 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 Evaluation
    Citation 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 Evaluation
  • Analysis of a replicated data base

    1985, Performance Evaluation
View all citing articles on Scopus
View full text