IDEAS home Printed from https://ideas.repec.org/a/eee/matcom/v44y1997i1p81-98.html
   My bibliography  Save this article

An optimal termination testing procedure for discrete event simulations

Author

Listed:
  • Feldman, Phillip
  • Muni, Adviti
  • Swindle, Glen

Abstract

In this paper we consider discrete-event simulations which yield results until a termination condition is satisfied. The simulation can proceed beyond this time, but no useful information is generated. The time at which the termination condition will be satisfied is not known initially, and is taken to be randomly distributed with some prescribed density. It is necessary, therefore, to periodically check the termination condition, and this consumes CPU time. The question that we address is how to distribute checking time to minimize expected CPU expenditure. We do this by taking a limit in which the cost of checking is small, and then minimizing the limiting expected CPU expenditure. In general, uniformly distributed checking times are not optimal. The layouts of checking times which are generated by our minimization procedure can significantly outperform constant checking intervals.

Suggested Citation

  • Feldman, Phillip & Muni, Adviti & Swindle, Glen, 1997. "An optimal termination testing procedure for discrete event simulations," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 44(1), pages 81-98.
    • Handle: RePEc:eee:matcom:v:44:y:1997:i:1:p:81-98
    DOI: 10.1016/S0378-4754(97)00051-7
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0378475497000517
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/S0378-4754(97)00051-7?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
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    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:eee:matcom:v:44:y:1997:i:1:p:81-98. 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: Catherine Liu (email available below). General contact details of provider: http://www.journals.elsevier.com/mathematics-and-computers-in-simulation/ .

    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.