IDEAS home Printed from https://ideas.repec.org/a/inm/ormnsc/v26y1980i8p796-809.html
   My bibliography  Save this article

Optimal Sizing of Records Used to Store Messages of Various Lengths

Author

Listed:
  • Ranel E. Erickson

    (Bell Laboratories)

  • Hanan Luss

    (Bell Laboratories)

Abstract

In many computer applications messages of various lengths need to be stored in some storage device. In this paper we examine the problem in which a fixed number of record lengths can be used to store messages. Whenever a message arrives, it is stored in the smallest possible record which is at least as large as the message. If a message cannot be stored in any single record, it is divided into segments and stored in several records of the same length. Each record is accompanied by a header which contains overhead information. Furthermore, in some applications records of the same length are stored in larger units, called blocks. If so, some space may be wasted at the end of a block. The objective is to find the optimal record lengths so that the expected total space used to store a message is minimized A dynamic programming algorithm that finds the optimal record lengths is developed for a general message length distribution. Numerical examples are discussed.

Suggested Citation

  • Ranel E. Erickson & Hanan Luss, 1980. "Optimal Sizing of Records Used to Store Messages of Various Lengths," Management Science, INFORMS, vol. 26(8), pages 796-809, August.
    • Handle: RePEc:inm:ormnsc:v:26:y:1980:i:8:p:796-809
    DOI: 10.1287/mnsc.26.8.796
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/mnsc.26.8.796
    Download Restriction: no
    File URL: https://libkey.io/10.1287/mnsc.26.8.796?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
    ---><---

    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:inm:ormnsc:v:26:y:1980:i:8:p:796-809. 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: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    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.