English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

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 $. Moreove...

A Stochastic Model of Fragmentation in Dynamic Storage Allocation