Storage allocation under processor sharing I: exact solutions and asymptotics.
Saved in:
| Title: | Storage allocation under processor sharing I: exact solutions and asymptotics. |
|---|---|
| Authors: | Sohn, Eunju1 esohn3@math.uic.edu, Knessl, Charles1 knessl@uic.edu |
| Source: | Queueing Systems. May2010, Vol. 65 Issue 1, p1-18. 18p. 1 Diagram, 2 Charts. |
| Subjects: | Dynamic storage allocation (Computer science), Client/server computing, Asymptotic expansions, Distribution (Probability theory), Poisson processes |
| Abstract: | We consider a processor-sharing storage allocation model, which has m primary holding spaces and infinitely many secondary ones, and a single processor servicing the stored items (customers). An arriving customer takes a primary space, if one is available. We define the traffic intensity ρ to be λ/ μ where λ is the customers’ arrival rate and μ is the service rate of the processor. We study the joint probability distribution of the numbers of occupied primary and secondary spaces. For 0< ρ<1, we obtain the exact solutions for m=1 and m=2. For arbitrary m we study the problem in the asymptotic limit ρ↑1 with m fixed. We also give the tail of the distribution for a fixed ρ<1 and any m. [ABSTRACT FROM AUTHOR] |
| Copyright of Queueing Systems is the property of Springer Nature and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) | |
| Database: | Engineering Source |
| FullText | Links: – Type: pdflink Text: Availability: 0 |
|---|---|
| Header | DbId: egs DbLabel: Engineering Source An: 49133264 AccessLevel: 6 PubType: Academic Journal PubTypeId: academicJournal PreciseRelevancyScore: 0 |
| IllustrationInfo | |
| Items | – Name: Title Label: Title Group: Ti Data: Storage allocation under processor sharing I: exact solutions and asymptotics. – Name: Author Label: Authors Group: Au Data: <searchLink fieldCode="AR" term="%22Sohn%2C+Eunju%22">Sohn, Eunju</searchLink><relatesTo>1</relatesTo><i> esohn3@math.uic.edu</i><br /><searchLink fieldCode="AR" term="%22Knessl%2C+Charles%22">Knessl, Charles</searchLink><relatesTo>1</relatesTo><i> knessl@uic.edu</i> – Name: TitleSource Label: Source Group: Src Data: <searchLink fieldCode="JN" term="%22Queueing+Systems%22">Queueing Systems</searchLink>. May2010, Vol. 65 Issue 1, p1-18. 18p. 1 Diagram, 2 Charts. – Name: Subject Label: Subjects Group: Su Data: <searchLink fieldCode="DE" term="%22Dynamic+storage+allocation+%28Computer+science%29%22">Dynamic storage allocation (Computer science)</searchLink><br /><searchLink fieldCode="DE" term="%22Client%2Fserver+computing%22">Client/server computing</searchLink><br /><searchLink fieldCode="DE" term="%22Asymptotic+expansions%22">Asymptotic expansions</searchLink><br /><searchLink fieldCode="DE" term="%22Distribution+%28Probability+theory%29%22">Distribution (Probability theory)</searchLink><br /><searchLink fieldCode="DE" term="%22Poisson+processes%22">Poisson processes</searchLink> – Name: Abstract Label: Abstract Group: Ab Data: We consider a processor-sharing storage allocation model, which has m primary holding spaces and infinitely many secondary ones, and a single processor servicing the stored items (customers). An arriving customer takes a primary space, if one is available. We define the traffic intensity ρ to be λ/ μ where λ is the customers’ arrival rate and μ is the service rate of the processor. We study the joint probability distribution of the numbers of occupied primary and secondary spaces. For 0< ρ<1, we obtain the exact solutions for m=1 and m=2. For arbitrary m we study the problem in the asymptotic limit ρ↑1 with m fixed. We also give the tail of the distribution for a fixed ρ<1 and any m. [ABSTRACT FROM AUTHOR] – Name: AbstractSuppliedCopyright Label: Group: Ab Data: <i>Copyright of Queueing Systems is the property of Springer Nature and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract.</i> (Copyright applies to all Abstracts.) |
| PLink | https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=egs&AN=49133264 |
| RecordInfo | BibRecord: BibEntity: Identifiers: – Type: doi Value: 10.1007/s11134-010-9164-3 Languages: – Code: eng Text: English PhysicalDescription: Pagination: PageCount: 18 StartPage: 1 Subjects: – SubjectFull: Dynamic storage allocation (Computer science) Type: general – SubjectFull: Client/server computing Type: general – SubjectFull: Asymptotic expansions Type: general – SubjectFull: Distribution (Probability theory) Type: general – SubjectFull: Poisson processes Type: general Titles: – TitleFull: Storage allocation under processor sharing I: exact solutions and asymptotics. Type: main BibRelationships: HasContributorRelationships: – PersonEntity: Name: NameFull: Sohn, Eunju – PersonEntity: Name: NameFull: Knessl, Charles IsPartOfRelationships: – BibEntity: Dates: – D: 01 M: 05 Text: May2010 Type: published Y: 2010 Identifiers: – Type: issn-print Value: 02570130 Numbering: – Type: volume Value: 65 – Type: issue Value: 1 Titles: – TitleFull: Queueing Systems Type: main |
| ResultId | 1 |
