A Markov Process for Sequential Allocation

Calina Stefanescu

Abstract: We describe a Markov process which models the sequential allocation for two adjacent tables coexisting in memory by growing towards each other. The tables are expected to fill at the same rate, random deletions and insertions are allowed.