A Weighted Buddy Method for Dynamic Storage Allocation.
Saved in:
| Title: | A Weighted Buddy Method for Dynamic Storage Allocation. |
|---|---|
| Authors: | Shen, Kenneth K.1, Peterson, James L.1, Weissman, C. |
| Source: | Communications of the ACM. Oct74, Vol. 17 Issue 10, p558-562. 5p. 4 Diagrams. |
| Subjects: | Dynamic storage allocation (Computer science), Computer software, Algorithms, Computer programming, Electronic data processing |
| Abstract: | An extension of the buddy method, called the weighted buddy method, for dynamic storage allocation is presented The weighted buddy method allows block sizes of 2k and 3 ,2k, whereas the original buddy method allowed only block sizes of 2k. This extension is achieved at an additional cost of only two bits per block. Simulation results are presented which compare this method with the buddy method. These results indicate that, for a uniform request distribution, the buddy system has less total memory fragmentation than the weighted buddy algorithm. However, the total fragmentation is smaller for the weighted buddy method when the requests are for exponentially distributed block sizes. [ABSTRACT FROM AUTHOR] |
| Copyright of Communications of the ACM is the property of Association for Computing Machinery 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: 5225237 AccessLevel: 6 PubType: Periodical PubTypeId: serialPeriodical PreciseRelevancyScore: 0 |
| IllustrationInfo | |
| Items | – Name: Title Label: Title Group: Ti Data: A Weighted Buddy Method for Dynamic Storage Allocation. – Name: Author Label: Authors Group: Au Data: <searchLink fieldCode="AR" term="%22Shen%2C+Kenneth+K%2E%22">Shen, Kenneth K.</searchLink><relatesTo>1</relatesTo><br /><searchLink fieldCode="AR" term="%22Peterson%2C+James+L%2E%22">Peterson, James L.</searchLink><relatesTo>1</relatesTo><br /><searchLink fieldCode="AR" term="%22Weissman%2C+C%2E%22">Weissman, C.</searchLink> – Name: TitleSource Label: Source Group: Src Data: <searchLink fieldCode="JN" term="%22Communications+of+the+ACM%22">Communications of the ACM</searchLink>. Oct74, Vol. 17 Issue 10, p558-562. 5p. 4 Diagrams. – 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="%22Computer+software%22">Computer software</searchLink><br /><searchLink fieldCode="DE" term="%22Algorithms%22">Algorithms</searchLink><br /><searchLink fieldCode="DE" term="%22Computer+programming%22">Computer programming</searchLink><br /><searchLink fieldCode="DE" term="%22Electronic+data+processing%22">Electronic data processing</searchLink> – Name: Abstract Label: Abstract Group: Ab Data: An extension of the buddy method, called the weighted buddy method, for dynamic storage allocation is presented The weighted buddy method allows block sizes of 2k and 3 ,2k, whereas the original buddy method allowed only block sizes of 2k. This extension is achieved at an additional cost of only two bits per block. Simulation results are presented which compare this method with the buddy method. These results indicate that, for a uniform request distribution, the buddy system has less total memory fragmentation than the weighted buddy algorithm. However, the total fragmentation is smaller for the weighted buddy method when the requests are for exponentially distributed block sizes. [ABSTRACT FROM AUTHOR] – Name: AbstractSuppliedCopyright Label: Group: Ab Data: <i>Copyright of Communications of the ACM is the property of Association for Computing Machinery 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=5225237 |
| RecordInfo | BibRecord: BibEntity: Identifiers: – Type: doi Value: 10.1145/355620.361164 Languages: – Code: eng Text: English PhysicalDescription: Pagination: PageCount: 5 StartPage: 558 Subjects: – SubjectFull: Dynamic storage allocation (Computer science) Type: general – SubjectFull: Computer software Type: general – SubjectFull: Algorithms Type: general – SubjectFull: Computer programming Type: general – SubjectFull: Electronic data processing Type: general Titles: – TitleFull: A Weighted Buddy Method for Dynamic Storage Allocation. Type: main BibRelationships: HasContributorRelationships: – PersonEntity: Name: NameFull: Shen, Kenneth K. – PersonEntity: Name: NameFull: Peterson, James L. – PersonEntity: Name: NameFull: Weissman, C. IsPartOfRelationships: – BibEntity: Dates: – D: 01 M: 10 Text: Oct74 Type: published Y: 1974 Identifiers: – Type: issn-print Value: 00010782 Numbering: – Type: volume Value: 17 – Type: issue Value: 10 Titles: – TitleFull: Communications of the ACM Type: main |
| ResultId | 1 |
