Storage allocation under processor sharing II: Further asymptotic results (Q3081338): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Charles Knessl / rank
Normal rank
 
Property / author
 
Property / author: Charles Knessl / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 0907.3683 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Storage allocation under processor sharing. I: Exact solutions and asymptotics / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple direct solution to a storage allocation model / rank
 
Normal rank
Property / cites work
 
Property / cites work: A perpetuity and the <i>M</i>/<i>M</i>/∞ ranked server system / rank
 
Normal rank
Property / cites work
 
Property / cites work: A provably efficient algorithm for dynamic storage allocation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some asymptotic results for the \(M/M/\infty\) queue with ranked servers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometrical Optics and Models of Computer Memory Fragmentation / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Stochastic Model of Fragmentation in Dynamic Storage Allocation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotic expansions for a stochastic model of queue storage / rank
 
Normal rank
Property / cites work
 
Property / cites work: First-fit allocation of queues: Tight probabilistic bounds on wasted space / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Introduction to Combinatorial Models of Dynamic Storage Allocation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some interesting processes arising as heavy traffic limits in an M/M/\(\infty\) storage process / rank
 
Normal rank
Property / cites work
 
Property / cites work: The distribution of wasted spaces in the M/M/∞ queue with ranked servers / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Revision as of 20:45, 3 July 2024

scientific article
Language Label Description Also known as
English
Storage allocation under processor sharing II: Further asymptotic results
scientific article

    Statements

    Storage allocation under processor sharing II: Further asymptotic results (English)
    0 references
    0 references
    0 references
    7 March 2011
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references