Scalability of dynamic storage allocation algorithms
Dynamic storage allocation has a significant impact on computer performance. A dynamic storage allocator manages space for objects whose lifetimes are not known by the system at the time of their creation. A good dynamic storage allocator should utilize storage efficiently and satisfy requests in as...
Uloženo v:
| Vydáno v: | Proceedings of 6th Symposium on the Frontiers of Massively Parallel Computation (Frontiers '96) s. 223 - 232 |
|---|---|
| Hlavní autor: | |
| Médium: | Konferenční příspěvek |
| Jazyk: | angličtina |
| Vydáno: |
IEEE
1996
|
| Témata: | |
| ISBN: | 0818675519, 9780818675515 |
| ISSN: | 1088-4955 |
| 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 | Dynamic storage allocation has a significant impact on computer performance. A dynamic storage allocator manages space for objects whose lifetimes are not known by the system at the time of their creation. A good dynamic storage allocator should utilize storage efficiently and satisfy requests in as few instructions as possible. A dynamic storage allocator on a multiprocessor should have the ability to satisfy multiple requests concurrently. This paper examines parallel dynamic storage allocation algorithms and how performance scales with increasing numbers of processors. The highest throughputs and lowest instruction counts are achieved with multiple free list fit I. The best memory utilization is achieved using a best fit system. |
|---|---|
| AbstractList | Dynamic storage allocation has a significant impact on computer performance. A dynamic storage allocator manages space for objects whose lifetimes are not known by the system at the time of their creation. A good dynamic storage allocator should utilize storage efficiently and satisfy requests in as few instructions as possible. A dynamic storage allocator on a multiprocessor should have the ability to satisfy multiple requests concurrently. This paper examines parallel dynamic storage allocation algorithms and how performance scales with increasing numbers of processors. The highest throughputs and lowest instruction counts are achieved with multiple free list fit I. The best memory utilization is achieved using a best fit system. |
| Author | Iyengar, A. |
| Author_xml | – sequence: 1 givenname: A. surname: Iyengar fullname: Iyengar, A. organization: Res. Div., IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, USA |
| BookMark | eNotj81Kw0AYRQesYFu7F1d5gcT5MvPNz1KCtUJFQV2X-a0jSUaSbPL2Burd3LO6nLshqz73gZA7oBUA1Q_71_emAq1Fhaio0ldkQxUoIRFBr8gaqFIl14g3ZDeOP3QJ54wJXBP-4UxrbGrTNBc5Fn7uTZdcMU55MOdQmLbNzkwp9wue85Cm7268JdfRtGPY_feWfO2fPptDeXx7fmkej2UCyqdSMgtWuKAit1JrZRB8zSTSmnm7GEQXrEIVIWpvvAUqUAonQfraMq4p25L7y24KIZx-h9SZYT5dPrI_iB5Gyg |
| ContentType | Conference Proceeding |
| DBID | 6IE 6IL CBEJK RIE RIL |
| DOI | 10.1109/FMPC.1996.558089 |
| 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 |
| DatabaseTitleList | |
| Database_xml | – sequence: 1 dbid: RIE name: IEEE Electronic Library (IEL) url: https://ieeexplore.ieee.org/ sourceTypes: Publisher |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Computer Science |
| EndPage | 232 |
| ExternalDocumentID | 558089 |
| GroupedDBID | 29P 6IE 6IL AAJGR AAWTH ADZIZ ALMA_UNASSIGNED_HOLDINGS BEFXN BFFAM BGNUA BKEBE BPEOZ CBEJK CHZPO IPLJI OCL RIE RIL RNS |
| ID | FETCH-LOGICAL-i104t-73b1b6ce8f4b7998a51d2375023db044fceb858f1f9dadb106576c717d2b34903 |
| IEDL.DBID | RIE |
| ISBN | 0818675519 9780818675515 |
| ISICitedReferencesCount | 2 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=558089&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 1088-4955 |
| IngestDate | Tue Aug 26 17:33:03 EDT 2025 |
| IsPeerReviewed | false |
| IsScholarly | true |
| Language | English |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-i104t-73b1b6ce8f4b7998a51d2375023db044fceb858f1f9dadb106576c717d2b34903 |
| PageCount | 10 |
| ParticipantIDs | ieee_primary_558089 |
| PublicationCentury | 1900 |
| PublicationDate | 19960000 |
| PublicationDateYYYYMMDD | 1996-01-01 |
| PublicationDate_xml | – year: 1996 text: 19960000 |
| PublicationDecade | 1990 |
| PublicationTitle | Proceedings of 6th Symposium on the Frontiers of Massively Parallel Computation (Frontiers '96) |
| PublicationTitleAbbrev | FMPC |
| PublicationYear | 1996 |
| Publisher | IEEE |
| Publisher_xml | – name: IEEE |
| SSID | ssj0000443365 ssj0040508 |
| Score | 1.3733902 |
| Snippet | Dynamic storage allocation has a significant impact on computer performance. A dynamic storage allocator manages space for objects whose lifetimes are not... |
| SourceID | ieee |
| SourceType | Publisher |
| StartPage | 223 |
| SubjectTerms | Aging Computer languages Computer performance Concurrent computing Heuristic algorithms Parallel machines Programming profession Scalability System performance Throughput |
| Title | Scalability of dynamic storage allocation algorithms |
| URI | https://ieeexplore.ieee.org/document/558089 |
| WOSCitedRecordID | wos558089&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV07T8MwED7RioGpUIp4ywNr2qSOX3NFxUIVCZC6VXFsQwca1KZI_HvOdlqExMISOV6S-JL4vnt8H8BdboUuhdJJpUSQMDNJaVmJh4wazSyXzgWxCTGbyflcFS3PduiFsdaG4jM79MOQyzd1tfWhshFjMpWqAx0heGzV2odT0jynlO89X3RD0tgFhy8CYgAWqB89eRt6CKol3tmds136MlWj6WMx8R18fBgv9kt0Jew5096_7vYYBj-9e6TY70oncGBXfejtxBtI-y2fQv6E1okk3V-kdsREaXriqyXxH0N8Qj6G83D4Wq-Xzdv7ZgAv0_vnyUPSSigkS8RZTSKozjSvrHS5FoisSpaZMUUvYYyWwDVzldWSSZc5ZUqjER8i_qgQ4pmxprlK6Rl0V_XKngORzmZayOiDScO0ykuTcc58bs4KdQF9vwaLj8iSsYiPf_nn7BUcxepnH8q4hm6z3tobOKw-m-VmfRss-w14Mpz9 |
| linkProvider | IEEE |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3NT8IwFH9RNNETihi_3cHrYB_t2p6JRCMQEjHhRta1VQ4yA8PE_97XdmBMvHhZul629W3r-72P3w_gjmgmcyZkWAjmJMxUmGua4yFOlaQ648Y4sQk2GvHpVIxrnm3XC6O1dsVnumOHLpevymJtQ2VdSnnExS7sUUKSyDdrbQMqESFpmm19X3REIt8Hh68CogDqyB8tfRv6CKKm3tmc000CMxLd_nDcsz18Wcdf7pfsitt1-s1_3e8RtH-694Lxdl86hh29aEFzI98Q1F_zCZBntI-n6f4KShMoL04f2HpJ_MsENiXvA3o4fC2X8-rtfdWGl_79pPcQ1iIK4RyRVhWyVMYyKzQ3RDLEVjmNVZKin5CgLXDNTKElp9zERqhcSUSIiEAKBHkqkSkRUXoKjUW50GcQcKNjybj3wriiUpBcxVlGbXZOM3EOLbsGsw_PkzHzj3_x5-wtHDxMhoPZ4HH0dAmHvhbaBjauoFEt1_oa9ovPar5a3jgrfwPbpKBE |
| 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=Proceedings+of+6th+Symposium+on+the+Frontiers+of+Massively+Parallel+Computation+%28Frontiers+%2796%29&rft.atitle=Scalability+of+dynamic+storage+allocation+algorithms&rft.au=Iyengar%2C+A.&rft.date=1996-01-01&rft.pub=IEEE&rft.isbn=9780818675515&rft.issn=1088-4955&rft.spage=223&rft.epage=232&rft_id=info:doi/10.1109%2FFMPC.1996.558089&rft.externalDocID=558089 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1088-4955&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1088-4955&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1088-4955&client=summon |