Matches in SemOpenAlex for { <https://semopenalex.org/work/W2000320900> ?p ?o ?g. }
Showing items 1 to 77 of
77
with 100 items per page.
- W2000320900 endingPage "330" @default.
- W2000320900 startingPage "311" @default.
- W2000320900 abstract "We analyze a dynamic queue-storage problem where the arrival and departure processes are those of the single-server Poisson (M/M/1) queue. The queue is stored in a linear array of cells numbered 1, 2, 3,…, with at most one item (customer) per cell. The storage policy is first-fit, i.e., an item is placed at the time of its arrival into the lowest numbered unoccupied cell, where it remains until it is served and departs. Let S(t) be the set of occupied cells at time t, and define the wasted space as W(t) = maxS(t) − |S(t)|, i.e. W(t) is the number of interior unoccupied cells. We analyze wasted space under the first-in-first-out (FIFO) and processor-sharing (PS) service disciplines. The results are expressed in terms of the ‘traffic intensity’ measure n = limt→∞E|S(t)|, i.e. the expected number in the system in statistical equilibrium. An asymptotic analysis of the steady state provides the following two tight bounds EWnFIFO=Θ(n), EWnPS=Θ(nlogn. These results are to be compared with the corresponding result, Θ(nlog logn), already known for the infinite server queue. In proving the new bounds, we also obtain estimates of the tails of the distributions of wasted space. Dynamic storage allocation in computers is an important application of the above results. The bounds show that, on average, wasted space is asymptotically a negligible fraction of the total space spanned by the queue. This in turn means that in heavy traffic time-consuming compaction (garbage collection) schemes can have very little effect on storage efficiency." @default.
- W2000320900 created "2016-06-24" @default.
- W2000320900 creator A5035070999 @default.
- W2000320900 creator A5039754060 @default.
- W2000320900 creator A5046041321 @default.
- W2000320900 date "1990-12-01" @default.
- W2000320900 modified "2023-09-27" @default.
- W2000320900 title "First-fit allocation of queues: tight probabilistic bounds on wasted space" @default.
- W2000320900 cites W1968314633 @default.
- W2000320900 cites W1979412081 @default.
- W2000320900 cites W1996632379 @default.
- W2000320900 cites W2064975723 @default.
- W2000320900 cites W2103012681 @default.
- W2000320900 cites W2113750873 @default.
- W2000320900 cites W2145641727 @default.
- W2000320900 cites W2751862591 @default.
- W2000320900 cites W3107411780 @default.
- W2000320900 cites W569304865 @default.
- W2000320900 doi "https://doi.org/10.1016/0304-4149(90)90098-d" @default.
- W2000320900 hasPublicationYear "1990" @default.
- W2000320900 type Work @default.
- W2000320900 sameAs 2000320900 @default.
- W2000320900 citedByCount "8" @default.
- W2000320900 countsByYear W20003209002012 @default.
- W2000320900 crossrefType "journal-article" @default.
- W2000320900 hasAuthorship W2000320900A5035070999 @default.
- W2000320900 hasAuthorship W2000320900A5039754060 @default.
- W2000320900 hasAuthorship W2000320900A5046041321 @default.
- W2000320900 hasConcept C100906024 @default.
- W2000320900 hasConcept C105795698 @default.
- W2000320900 hasConcept C111919701 @default.
- W2000320900 hasConcept C114614502 @default.
- W2000320900 hasConcept C118615104 @default.
- W2000320900 hasConcept C160403385 @default.
- W2000320900 hasConcept C199360897 @default.
- W2000320900 hasConcept C2777145635 @default.
- W2000320900 hasConcept C2778572836 @default.
- W2000320900 hasConcept C2780009758 @default.
- W2000320900 hasConcept C33923547 @default.
- W2000320900 hasConcept C41008148 @default.
- W2000320900 hasConcept C77088390 @default.
- W2000320900 hasConcept C9390403 @default.
- W2000320900 hasConceptScore W2000320900C100906024 @default.
- W2000320900 hasConceptScore W2000320900C105795698 @default.
- W2000320900 hasConceptScore W2000320900C111919701 @default.
- W2000320900 hasConceptScore W2000320900C114614502 @default.
- W2000320900 hasConceptScore W2000320900C118615104 @default.
- W2000320900 hasConceptScore W2000320900C160403385 @default.
- W2000320900 hasConceptScore W2000320900C199360897 @default.
- W2000320900 hasConceptScore W2000320900C2777145635 @default.
- W2000320900 hasConceptScore W2000320900C2778572836 @default.
- W2000320900 hasConceptScore W2000320900C2780009758 @default.
- W2000320900 hasConceptScore W2000320900C33923547 @default.
- W2000320900 hasConceptScore W2000320900C41008148 @default.
- W2000320900 hasConceptScore W2000320900C77088390 @default.
- W2000320900 hasConceptScore W2000320900C9390403 @default.
- W2000320900 hasIssue "2" @default.
- W2000320900 hasLocation W20003209001 @default.
- W2000320900 hasOpenAccess W2000320900 @default.
- W2000320900 hasPrimaryLocation W20003209001 @default.
- W2000320900 hasRelatedWork W1958509945 @default.
- W2000320900 hasRelatedWork W2025785911 @default.
- W2000320900 hasRelatedWork W2030856915 @default.
- W2000320900 hasRelatedWork W2067769121 @default.
- W2000320900 hasRelatedWork W2134153796 @default.
- W2000320900 hasRelatedWork W2147021610 @default.
- W2000320900 hasRelatedWork W3035065803 @default.
- W2000320900 hasRelatedWork W327553754 @default.
- W2000320900 hasRelatedWork W4237384293 @default.
- W2000320900 hasRelatedWork W2227966099 @default.
- W2000320900 hasVolume "36" @default.
- W2000320900 isParatext "false" @default.
- W2000320900 isRetracted "false" @default.
- W2000320900 magId "2000320900" @default.
- W2000320900 workType "article" @default.