We consider a version in continuous time of the parking problem of Knuth. Files arrive following a Poisson point process and are stored on a hardware identified with the real line, in the closest free portions at the right of the arrival location. We specify the distribution of the space of unoccupied locations at a fixed time and give asymptotic regimes when the hardware is becoming full
In this paper, we deal with the optimal I/O point location in an automated parking system. In this s...
We analyse a storage process with dynamical arrivals and departures. Under probabilistic assumptions...
Background. A generalization of the A. Rényi’s stochastic parking model is considered. In our model,...
25 pagesWe consider a generalized version in continuous time of the parking problem of Knuth. Files ...
We consider a generalized version in continuous time of the parking problem of Knuth. Files arrive f...
In this thesis, a storage model with infinite capacity, additive stochastic input and unit release p...
First, I study a process for data storage in continuous time where the hardware is identified with t...
We consider a storage allocation model with a finite number of storage spaces. There are m primary s...
AbstractThe design and analysis of algorithms for on-line dynamic storage allocation has been a fund...
We analyze a dynamic queue-storage problem where the arrival and departure processes are those of th...
We study a model of dynamic storage allocation in which requests for single units of memory arrive i...
AbstractRecent works by Newell [13] and Coffman. [2] have studied a queuing or storage model which i...
Recent works by Newell [13] and Coffman. [2] have studied a queuing or storage model which is most e...
AbstractWe consider a storage process with finite or infinite capacity having a compound Poisson pro...
In this paper we introduce a storage process with singular continuous input. The input process is de...
In this paper, we deal with the optimal I/O point location in an automated parking system. In this s...
We analyse a storage process with dynamical arrivals and departures. Under probabilistic assumptions...
Background. A generalization of the A. Rényi’s stochastic parking model is considered. In our model,...
25 pagesWe consider a generalized version in continuous time of the parking problem of Knuth. Files ...
We consider a generalized version in continuous time of the parking problem of Knuth. Files arrive f...
In this thesis, a storage model with infinite capacity, additive stochastic input and unit release p...
First, I study a process for data storage in continuous time where the hardware is identified with t...
We consider a storage allocation model with a finite number of storage spaces. There are m primary s...
AbstractThe design and analysis of algorithms for on-line dynamic storage allocation has been a fund...
We analyze a dynamic queue-storage problem where the arrival and departure processes are those of th...
We study a model of dynamic storage allocation in which requests for single units of memory arrive i...
AbstractRecent works by Newell [13] and Coffman. [2] have studied a queuing or storage model which i...
Recent works by Newell [13] and Coffman. [2] have studied a queuing or storage model which is most e...
AbstractWe consider a storage process with finite or infinite capacity having a compound Poisson pro...
In this paper we introduce a storage process with singular continuous input. The input process is de...
In this paper, we deal with the optimal I/O point location in an automated parking system. In this s...
We analyse a storage process with dynamical arrivals and departures. Under probabilistic assumptions...
Background. A generalization of the A. Rényi’s stochastic parking model is considered. In our model,...