Optimal Sizing of Records Used to Store Messages of Various Lengths

Ranel E. Erickson and Hanan Luss
Additional contact information
Ranel E. Erickson: Bell Laboratories
Hanan Luss: Bell Laboratories

Management Science, 1980, vol. 26, issue 8, 796-809

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.

Keywords: computers; dynamic programming applications; record sizing (search for similar items in EconPapers)
Date: 1980
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.26.8.796 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:ormnsc:v:26:y:1980:i:8:p:796-809

Access Statistics for this article

More articles in Management Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().