{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T19:30:56Z","timestamp":1787340656407,"version":"build-2736575974"},"reference-count":7,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM J. Comput."],"published-print":{"date-parts":[[1985,5]]},"abstract":"<jats:p>We study a model of dynamic storage allocation in which requests for single units of memory arrive in a Poisson stream at rate $\\lambda $ and are accommodated by the first available location found in a linear scan of memory. Immediately after this first-fit assignment, an occupied location commences an exponential delay with rate parameter $\\mu $, after which the location again becomes available. The set of occupied locations (identified by their numbers) at time t forms a random subset $S_t $ of $\\{ 1,2, \\cdots \\}$. The extent of the fragmentation in $S_t $, i.e. the alternating holes and occupied regions of memory, is measured by $\\max (S_t ) - |S_t |$. In equilibrium, the number of occupied locations, $|S|$, is known to be Poisson distributed with mean $\\rho = \\lambda\/ \\mu$. We obtain an explicit formula for the stationary distribution of max $(S)$, the last occupied location, and by independent arguments we show that $(E\\max (S) - E|S|) \/E|S| \\to 0$ as the traffic intensity $\\rho \\to \\infty $. Moreover, we verify numerically that for any $\\rho $ the expected number of wasted locations in equilibrium is never more than $\\frac{1}{3}$ the expected number of occupied locations.<\/jats:p>\n                  <jats:p>Our model applies to studies of fragmentation in paged computer systems, and to containerization problems in industrial storage applications. Finally, our model can be regarded as a simple concrete model of interacting particles [Adv. Math., 5 (1970), pp. 246\u2013290].<\/jats:p>","DOI":"10.1137\/0214032","type":"journal-article","created":{"date-parts":[[2005,2,24]],"date-time":"2005-02-24T06:25:35Z","timestamp":1109226335000},"page":"416-425","source":"Crossref","is-referenced-by-count":42,"title":["A Stochastic Model of Fragmentation in Dynamic Storage Allocation"],"prefix":"10.1137","volume":"14","author":[{"given":"E. G.","family":"Coffman, Jr.","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"T. T.","family":"Kadota","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"L. A.","family":"Shepp","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"351","published-online":{"date-parts":[[2006,7,13]]},"reference":[{"key":"R1","doi-asserted-by":"publisher","DOI":"10.1137\/1025074"},{"key":"R2","unstructured":"E. G. Coffman, Jr., T. T. Kadota, L. A. Shepp,  On the asymptotic optimality of first-fit storage allocation, IEEE Trans. Software Engineering, to appear"},{"key":"R3","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1968.227425"},{"key":"R4","volume-title":"An Introduction to Probability Theory and Its Applications. Vol. I","author":"Feller William","year":"1950"},{"key":"R5","unstructured":"T. T. Kadota, L. A. Shepp, J. Ziv,  Asymptotic efficiency of dynamic storage systems, to appear"},{"key":"R6","volume-title":"Fundamental Algorithms, Vol. 1","author":"Knuth D. E.","year":"1973"},{"key":"R7","doi-asserted-by":"publisher","DOI":"10.1016\/0001-8708(70)90034-4"}],"container-title":["SIAM Journal on Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/0214032","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T18:42:56Z","timestamp":1787337776000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/0214032"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985,5]]},"references-count":7,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1985,5]]}},"alternative-id":["10.1137\/0214032"],"URL":"https:\/\/doi.org\/10.1137\/0214032","relation":{},"ISSN":["0097-5397","1095-7111"],"issn-type":[{"value":"0097-5397","type":"print"},{"value":"1095-7111","type":"electronic"}],"subject":[],"published":{"date-parts":[[1985,5]]}}}