Parallel dynamic storage allocation algorithms
A dynamic storage allocator manages space for objects whose lifetimes are not known by the system at the time for their creation. This paper examines parallel dynamic storage allocation algorithms. Three new algorithms, multiple free list fit I, modified quick fit, and multiple free list fit II, are...
Uloženo v:
| Vydáno v: | Parallel and Distributed Processing, 5th IEEE Symposium On s. 82 - 91 |
|---|---|
| Hlavní autor: | |
| Médium: | Konferenční příspěvek Journal Article |
| Jazyk: | angličtina |
| Vydáno: |
IEEE Comput. Soc. Press
1993
|
| Témata: | |
| ISBN: | 9780818642227, 081864222X |
| On-line přístup: | Získat plný text |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
| Abstract | A dynamic storage allocator manages space for objects whose lifetimes are not known by the system at the time for their creation. This paper examines parallel dynamic storage allocation algorithms. Three new algorithms, multiple free list fit I, modified quick fit, and multiple free list fit II, are presented which outperform all previous algorithms we tested. The performances of the three algorithms differ when the percentage of requests for large blocks is high. Multiple free list fit I is the fastest algorithm when large blocks of many different sizes are requested. Multiple free list fit II is the fastest algorithm when large blocks of only a few different sizes are requested.< > |
|---|---|
| AbstractList | A dynamic storage allocator manages space for objects whose lifetimes are not known by the system at the time for their creation. This paper examines parallel dynamic storage allocation algorithms. Three new algorithms, multiple free list fit I, modified quick fit, and multiple free list fit II, are presented which outperform all previous algorithms we tested. The performances of the three algorithms differ when the percentage of requests for large blocks is high. Multiple free list fit I is the fastest algorithm when large blocks of many different sizes are requested. Multiple free list fit II is the fastest algorithm when large blocks of only a few different sizes are requested.< > A dynamic storage allocator manages space for objects whose lifetimes are not known by the system at the time of their creation. This paper examines parallel dynamic storage allocation algorithms. Three new algorithms, multiple free list fit I, modified quick fit, and multiple free list fit II, are presented which outperform all previous algorithms we tested. The performances of the three algorithms differ when the percentage of requests for large blocks is high. Multiple free list fit I is the fastest algorithm when large blocks of many different sizes are requested. Multiple free list fit II is the fastest algorithm when large blocks of only a few different sizes are requested. |
| Author | Iyengar, A. |
| Author_xml | – sequence: 1 givenname: A. surname: Iyengar fullname: Iyengar, A. organization: Hewlett-Packard Co., Chelmsford, MA, USA |
| BookMark | eNotT01LxDAUDKigrr2Lp568tfYlTdIcZf2EBQvquSTpyxpJm7XpHvbfW1nnMsMwMzCX5HSMIxJyDVUJUKm79_ahLUEpVjLFeS1PSKZkUzXQiJpSKs9JltJ3tYDzRlB5QcpWTzoEDHl_GPXgbZ7mOOkt5osbrZ59HBe5jZOfv4Z0Rc6cDgmzf16Rz6fHj_VLsXl7fl3fbwoP0MyFMIiUOWpR6t6ANsiswdpJRABHXd9TVTFmNEqjHC6uE2IpgbKNYlywFbk97u6m-LPHNHeDTxZD0CPGfeqoAAlc_gVvjkG_rHS7yQ96OnTH9-wXQG5SxA |
| ContentType | Conference Proceeding Journal Article |
| DBID | 6IE 6IL CBEJK RIE RIL 7SC 8FD JQ2 L7M L~C L~D |
| DOI | 10.1109/SPDP.1993.395547 |
| DatabaseName | IEEE Electronic Library (IEL) Conference Proceedings IEEE Proceedings Order Plan All Online (POP All Online) 1998-present by volume IEEE Xplore All Conference Proceedings IEEE Electronic Library (IEL) IEEE Proceedings Order Plans (POP All) 1998-Present Computer and Information Systems Abstracts Technology Research Database ProQuest Computer Science Collection Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional |
| DatabaseTitle | Computer and Information Systems Abstracts Technology Research Database Computer and Information Systems Abstracts – Academic Advanced Technologies Database with Aerospace ProQuest Computer Science Collection Computer and Information Systems Abstracts Professional |
| DatabaseTitleList | Computer and Information Systems Abstracts |
| Database_xml | – sequence: 1 dbid: RIE name: IEEE Electronic Library (IEL) url: https://ieeexplore.ieee.org/ sourceTypes: Publisher |
| DeliveryMethod | fulltext_linktorsrc |
| EndPage | 91 |
| ExternalDocumentID | 395547 |
| GroupedDBID | 6IE 6IK 6IL AAJGR AAWTH ACGHX ALMA_UNASSIGNED_HOLDINGS BEFXN BFFAM BGNUA BKEBE BPEOZ CBEJK IERZE OCL RIB RIC RIE RIL 7SC 8FD JQ2 L7M L~C L~D |
| ID | FETCH-LOGICAL-i118t-6bee23f2ce7adb1abe3cbe4f7ee11f2fdd29033bae7b9feee1f666be19c893563 |
| IEDL.DBID | RIE |
| ISBN | 9780818642227 081864222X |
| IngestDate | Fri Jul 11 12:03:54 EDT 2025 Tue Aug 26 22:16:03 EDT 2025 |
| IsPeerReviewed | false |
| IsScholarly | false |
| Language | English |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-i118t-6bee23f2ce7adb1abe3cbe4f7ee11f2fdd29033bae7b9feee1f666be19c893563 |
| Notes | ObjectType-Article-2 SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 23 |
| PQID | 26171576 |
| PQPubID | 23500 |
| PageCount | 10 |
| ParticipantIDs | proquest_miscellaneous_26171576 ieee_primary_395547 |
| PublicationCentury | 1900 |
| PublicationDate | 19930000 19930101 |
| PublicationDateYYYYMMDD | 1993-01-01 |
| PublicationDate_xml | – year: 1993 text: 19930000 |
| PublicationDecade | 1990 |
| PublicationTitle | Parallel and Distributed Processing, 5th IEEE Symposium On |
| PublicationTitleAbbrev | SPDP |
| PublicationYear | 1993 |
| Publisher | IEEE Comput. Soc. Press |
| Publisher_xml | – name: IEEE Comput. Soc. Press |
| SSID | ssj0000558627 |
| Score | 1.2468346 |
| Snippet | A dynamic storage allocator manages space for objects whose lifetimes are not known by the system at the time for their creation. This paper examines parallel... A dynamic storage allocator manages space for objects whose lifetimes are not known by the system at the time of their creation. This paper examines parallel... |
| SourceID | proquest ieee |
| SourceType | Aggregation Database Publisher |
| StartPage | 82 |
| SubjectTerms | Aging Computer languages Concurrency control Heuristic algorithms Memory management Parallel machines Performance evaluation Programming profession System performance Testing |
| Title | Parallel dynamic storage allocation algorithms |
| URI | https://ieeexplore.ieee.org/document/395547 https://www.proquest.com/docview/26171576 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV07T8MwELYoYmDiVUR5ZmBNG9tJLp6BigFVkXioW-THGSpBgtKU34-dNGWAhUzOkMjOw3f3fXffEXJtjfY8oQqBxSaMNVWhAsXCVID7szRNTJs8_vIAs1k2n4t8rbPd1sIgYpt8hmM_bLl8U-mVh8omXDjjBwMyAEi7Uq0NnBIlifPNoVV4pFnqgY1eX6c_h56ljMTkMb_NfaEeH3f3XPdW-bUht1Zmuvev-e2T4U-1XpBv7NAB2cLyiIxzWfs2Ke-B6XrOBz4N0m0egWfaO5zODV-retG8fSyH5Hl693RzH657I4QLFxI0YaoQGbdMI0ijqFTItcLYAiKlllljmIg4VxJBCetmSq0LVBRSoZ2HkqT8mGyXVYknJJDKeXE2BSqzLMaES3AHMsUAdGIjMSKHfqnFZyd_UXSrHJGr_lEV7ov0NIMssVotC6_xTl0Yc_rndWdkt8sZ9CjGOdlu6hVekB391SyW9WX7Ur8Bsemgcw |
| linkProvider | IEEE |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3JTsMwELWgIMGJrYiyNQeuaWM7ieMzi4ooVSQK6i3yMoZKkKA05fuxk6Yc4EJOziGRncUz897MG4SujFaOJ5Q-I6H2Q4WlL5kkfsyZ_bMUjnSdPP4yZpNJMpvxdKWzXdfCAECdfAYDN6y5fF2opYPKhpRb48c20VYUhiRoirXWgEoQRdY7Z7XGI05iB220CjvtOWt5yoAPn9Kb1JXq0UFz11V3lV9bcm1n7vb-NcN91P2p1_PStSU6QBuQH6FBKkrXKOXd003Xec8lQtrtw3Nce4PU2eFrUc6rt49FFz3f3U6vR_6qO4I_t0FB5ccSgFBDFDChJRYSqJIQGgaAsSFGa8IDSqUAJrmxM8XGhioSMFfWR4lieow6eZHDCfKEtH6ciRkWSRJCRAWzBxBJGFORCXgPHbqlZp-NAEbWrLKH-u2jyuw36YgGkUOxXGRO5R3bQOb0z-v6aGc0fRxn4_vJwxnabTIIHaZxjjpVuYQLtK2-qvmivKxf8Dc7A6O6 |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=proceeding&rft.title=Parallel+and+Distributed+Processing%2C+5th+IEEE+Symposium+On&rft.atitle=Parallel+dynamic+storage+allocation+algorithms&rft.au=Iyengar%2C+A.&rft.date=1993-01-01&rft.pub=IEEE+Comput.+Soc.+Press&rft.isbn=9780818642227&rft.spage=82&rft.epage=91&rft_id=info:doi/10.1109%2FSPDP.1993.395547&rft.externalDocID=395547 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9780818642227/lc.gif&client=summon&freeimage=true |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9780818642227/mc.gif&client=summon&freeimage=true |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9780818642227/sc.gif&client=summon&freeimage=true |