ACM Home Page
Please provide us with feedback. Feedback
The performance of a precedence-based queuing discipline
Full text PdfPdf (748 KB)
Source Journal of the ACM (JACM) archive
Volume 33 ,  Issue 3  (July 1986) table of contents
Pages: 593 - 602  
Year of Publication: 1986
ISSN:0004-5411
Authors
John N. Tsitsiklis  Stanford Univ., Stanford, CA
Christos H. Papadimitriou  Stanford Univ., Stanford, CA
Pierre Humblet  Massachusetts Institute of Technology, Cambridge
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 1,   Downloads (12 Months): 23,   Citation Count: 4
Additional Information:

abstract   references   cited by   index terms   review   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/5925.5936
What is a DOI?

ABSTRACT

A queuing system with infinitely many servers, and with the following queuing discipline is considered: For any two jobs i and j in the system, such that i arrived later than j, there is a fixed probability p that i will have to wait for j's execution to terminate before i starts executing. This queuing system is a very simple model for database concurrency control via “static” locking, as well as of parallel execution of programs consisting of several interdependent processes. The problem of determining the maximum arrival rate (as a function of p) that can be sustained before this system becomes unstable is studied. It is shown that this rate is inversely proportional to p, and close upper and lower bounds on the constant for the case of deterministic departures are found. The result suggests that the degree of multiprogramming of multiuser databases, or the level of parallelism of concurrent programs, is inversely proportional to the probability of conflict, and that the constant is small and known within a factor of 2. The technique used involves the computation of certain asymptotic parameters of a random infinite directed acyclic graph (dag) that seem of interest by themselves.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
ALDOUS, D., AND PITMAN, J. The asymptotic speed and shape of a particle system. In Probability, Statistics and Analysis, J. F. C. Kingman and G. E. H. Reuter, Eds. Cambridge University Press, Cambridge, England, 1983.
1a
 
2
3
 
4



REVIEW

"Kuchibhatla Sundar Das : Reviewer"

This is a very theoretical paper addressing throughput issues in relation to precedent-based queueing disciplines. The authors rightly point out that the results of this paper are applicable to database concurrency and parallel execution of prog  more...

Collaborative Colleagues:
John N. Tsitsiklis: colleagues
Christos H. Papadimitriou: colleagues
Pierre Humblet: colleagues