IDEAS home Printed from https://ideas.repec.org/a/bla/stanee/v54y2000i2p190-201.html
   My bibliography  Save this article

The M/G/∞ Queueing Model for Optimistic Concurrency Control

Author

Listed:
  • S. A. E. Sassen
  • J. Van Der Wal

Abstract

The M/G/∞ queue with Optimistic Concurrency Control (OCC) is a model for a special form of parallel transaction processing in a real‐time database. Transactions arrive according to a Poisson process and require some generally distributed execution time. One of the differences with ordinary multi‐ and infinite‐server queueing models is that under OCC the successful completion of one transaction may immediately cause the failure of one or more of the other transactions. This happens if the completing transaction has overwritten a data‐item that is in use by another transaction in progress. As soon as this failure is detected the failed transaction is restarted. So the total service time of a transaction consists of its final successful run and the time spent on unsuccessful runs. In this study we develop an approximation for the distribution of the total service time, and test the approximation against simulation. Although in practice the number of servers is never unlimited, this study provides valuable insight in the asymptotics with respect to the number of servers. The approximation clearly demonstrates the very limited performance gain from an increase of the number of servers.

Suggested Citation

  • S. A. E. Sassen & J. Van Der Wal, 2000. "The M/G/∞ Queueing Model for Optimistic Concurrency Control," Statistica Neerlandica, Netherlands Society for Statistics and Operations Research, vol. 54(2), pages 190-201, July.
    • Handle: RePEc:bla:stanee:v:54:y:2000:i:2:p:190-201
    DOI: 10.1111/1467-9574.00136
    as

    Download full text from publisher

    File URL: https://doi.org/10.1111/1467-9574.00136
    Download Restriction: no
    File URL: https://libkey.io/10.1111/1467-9574.00136?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:bla:stanee:v:54:y:2000:i:2:p:190-201. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Wiley Content Delivery (email available below). General contact details of provider: http://www.blackwellpublishing.com/journal.asp?ref=0039-0402 .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.