skip to main content
10.1145/2833312.2833325acmotherconferencesArticle/Chapter ViewAbstractPublication PagesicdcnConference Proceedingsconference-collections
research-article

Shared-object system equilibria: delay and throughput analysis

Published: 04 January 2016 Publication History

Abstract

We consider shared-object systems that require their threads to fulfill the system jobs by first acquiring sequentially the objects needed for the jobs and then holding on to them until the job completion. Such systems are in the core of a variety of shared-resource allocation and synchronization systems. This work opens a new perspective to study the expected job delay and throughput analytically, given the possible set of jobs that may join the system dynamically. We identify the system dependencies that cause contention among the threads as they try to acquire the job objects. We use these observations to define the shared-object system equilibria. We note that the system is in equilibrium whenever the rate in which jobs arrive at the system matches the job completion rate. These equilibria consider not only the job delay but also the job throughput, as well as the time in which each thread blocks other threads in order to complete its job. We then further study in detail the thread work cycles and, by using a graph representation of the problem, we are able to propose procedures for estimating equilibria, i.e., discovering the job delay and throughput, as well as the blocking time. To the best of our knowledge, this is a new perspective, that can provide better analytical tools for the problem, in order to estimate performance measures similar to ones that can be acquired through experimentation on working systems and simulations.

References

[1]
I. Adan and J. Resing. Queueing theory. Eindhoven University of Technology Eindhoven, 2002.
[2]
T. Altiok. On the phase-type approximations of general distributions. IIE Transactions 17(2):110--116, 1985.
[3]
F. Baskett, K. M. Chandy, R. R. Muntz, and F. G. Palacios. Open, closed, and mixed networks of queues with different classes of customers. Journal of the ACM (JACM), 22(2):248--260, 1975.
[4]
B. Baynat and Y. Dallery. A product-form approximation method for general closed queueing networks with several classes of customers. Perform. Eval., 24(3):165--188, 1996.
[5]
G. Bolch, S. Greiner, H. de Meer, and K. S. Trivedi. Queueing networks and Markov chains. John Wiley & Sons, 2006.
[6]
J. Cho and H. Garcia-Molina. Synchronizing a database to improve freshness. ACM SIGMOD: 29(2), pp. 117--128, 2000.
[7]
R. M. Feldman and C. Valdez-Flores. Applied probability and stochastic processes. Springer, 2010.
[8]
W. J. Gordon and G. F. Newell. Closed queuing systems with exponential servers. Operations research, 15(2):254--265, 1967.
[9]
P. H. Ha and P. Tsigas. Reactive multi-word synchronization for multiprocessors. Journal of Instruction-Level Parallelism, 6: 1--25, 2004.
[10]
N. A. Lynch. Upper bounds for static resource allocation in a distributed system. J. Comput. Syst. Sci., 23(2):254--278, 1981.
[11]
M. Papatriantafilou and P. Tsigas. On distributed resource handling: Dining, drinking and mobile philosophers. OPODIS 1997, pp. 293--308.
[12]
S. Ramesh and H. G. Perros. A multi-layer client-server queueing network model with non-hierarchical synchronous and asynchronous messages. Perform. Eval., 45(4):223--256, 2001.
[13]
I. Salem, E. M. Schiller, M. Papatriantafilou, and P. Tsigas. Shared-object System Equilibria: Delay and Throughput Analysis. arXiv:1508.01660, 2015.

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Other conferences
ICDCN '16: Proceedings of the 17th International Conference on Distributed Computing and Networking
January 2016
370 pages
ISBN:9781450340328
DOI:10.1145/2833312
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 04 January 2016

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. delay and throughput analysis
  2. resource sharing

Qualifiers

  • Research-article

Conference

ICDCN '16

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • 0
    Total Citations
  • 41
    Total Downloads
  • Downloads (Last 12 months)0
  • Downloads (Last 6 weeks)0
Reflects downloads up to 17 Feb 2025

Other Metrics

Citations

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media