Survey: Computational Models for Asymmetric Read and Write Costs
With the arrival of new emerging technologies for non-volatile main memory, the cost of reading from memory will be significantly cheaper than the cost of writing to memory. This raises new challenges to algorithm design since many of the classic algorithms use approximately the same number of reads...
Uložené v:
| Vydané v: | 2018 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW) s. 733 - 743 |
|---|---|
| Hlavný autor: | |
| Médium: | Konferenčný príspevok.. |
| Jazyk: | English |
| Vydavateľské údaje: |
IEEE
01.05.2018
|
| Predmet: | |
| On-line prístup: | Získať plný text |
| Tagy: |
Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
|
| Abstract | With the arrival of new emerging technologies for non-volatile main memory, the cost of reading from memory will be significantly cheaper than the cost of writing to memory. This raises new challenges to algorithm design since many of the classic algorithms use approximately the same number of reads and writes. In this survey, we review the existing computational models that measure the cost of operations and memory accesses to the NVMs, and scheduler of parallel algorithms on the new hardware. The new models meanwhile allow theoretical analysis and showing lower bounds on the hardness of the classic problems. We also list some existing results on lower and upper bounds on the most common problems like sorting, searching, graph traversal, based on these models. |
|---|---|
| AbstractList | With the arrival of new emerging technologies for non-volatile main memory, the cost of reading from memory will be significantly cheaper than the cost of writing to memory. This raises new challenges to algorithm design since many of the classic algorithms use approximately the same number of reads and writes. In this survey, we review the existing computational models that measure the cost of operations and memory accesses to the NVMs, and scheduler of parallel algorithms on the new hardware. The new models meanwhile allow theoretical analysis and showing lower bounds on the hardness of the classic problems. We also list some existing results on lower and upper bounds on the most common problems like sorting, searching, graph traversal, based on these models. |
| Author | Gu, Yan |
| Author_xml | – sequence: 1 givenname: Yan surname: Gu fullname: Gu, Yan |
| BookMark | eNotj8tKw0AYhUdQUGseQNzMCyTONZlxZYlVCxWLVbosfzJ_YCSXkpkKeXsDejZn9R2-c03O-6FHQm45yzhn9n69fdru9plg3GSMccHOSGILw7U0uZ5jL0kSwjdjTORG5ZpfkcfdafzB6YGWQ3c8RYh-6KGlb4PDNtBmGOkyTF2HcfQ1_UBwFHpH96OPOCMhhhty0UAbMPnvBfl6Xn2Wr-nm_WVdLjep54WOqaycBqMcr50VGitbI4CspYPZhakGdJM7J8BCI3OolNP1_EhJrIxoEFAuyN3frkfEw3H0HYzTwSihlSnkL8z4S5A |
| CODEN | IEEPAD |
| ContentType | Conference Proceeding |
| DBID | 6IE 6IL CBEJK RIE RIL |
| DOI | 10.1109/IPDPSW.2018.00120 |
| 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/IET 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 |
| EISBN | 9781538655559 1538655551 |
| EndPage | 743 |
| ExternalDocumentID | 8425487 |
| Genre | orig-research |
| GroupedDBID | 6IE 6IF 6IL 6IN AAJGR AAWTH ABLEC ALMA_UNASSIGNED_HOLDINGS BEFXN BFFAM BGNUA BKEBE BPEOZ CBEJK IEGSK OCL RIB RIC RIE RIL |
| ID | FETCH-LOGICAL-i175t-3bd5a84d1cd925eb9ceaa3c3da02604fa5f6dd2a9af36ab4d5c10943eb82feae3 |
| IEDL.DBID | RIE |
| ISICitedReferencesCount | 1 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000541051600085&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| IngestDate | Wed Aug 27 02:47:55 EDT 2025 |
| IsPeerReviewed | false |
| IsScholarly | false |
| Language | English |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-i175t-3bd5a84d1cd925eb9ceaa3c3da02604fa5f6dd2a9af36ab4d5c10943eb82feae3 |
| PageCount | 11 |
| ParticipantIDs | ieee_primary_8425487 |
| PublicationCentury | 2000 |
| PublicationDate | 2018-May |
| PublicationDateYYYYMMDD | 2018-05-01 |
| PublicationDate_xml | – month: 05 year: 2018 text: 2018-May |
| PublicationDecade | 2010 |
| PublicationTitle | 2018 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW) |
| PublicationTitleAbbrev | IPDPSW |
| PublicationYear | 2018 |
| Publisher | IEEE |
| Publisher_xml | – name: IEEE |
| SSID | ssj0002684651 |
| Score | 1.668653 |
| Snippet | With the arrival of new emerging technologies for non-volatile main memory, the cost of reading from memory will be significantly cheaper than the cost of... |
| SourceID | ieee |
| SourceType | Publisher |
| StartPage | 733 |
| SubjectTerms | Analytical models asymmetric memory Complexity theory computational model Computational modeling I/O efficient algorithms Memory management nested parallel computation non volatile memory Phase change random access memory Task analysis write efficient algorithms |
| Title | Survey: Computational Models for Asymmetric Read and Write Costs |
| URI | https://ieeexplore.ieee.org/document/8425487 |
| WOSCitedRecordID | wos000541051600085&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/eLvHCXMwlV07T8MwED61FQMToBbxlgdGQuskTmMmEFDBUkUqiG7Vxb5IlWiKmrRS_z2-JCoMLGyWLcu683Cv7-4DuGbFZybVHilO3ShtvRjtwCPtx0ZKQ9avySaG43E8neqkBTe7XhgiqsBndMvLqpZvl2bNqbI-l4ycg92G9nAY1b1au3wKTy2JlGwKl3Kg-6_JUzL5YPQWwyUlM3r_IlCp7Mfo4H8vH0LvpxFPJDsTcwQtyrtwP1mvNrS9EzUjQ5PNE8xq9lkI54SKh2K7WDBVlhEMkheYW-HC8JLclaIsevA-en57fPEaIgRv7qx76QWpVRiHVhqrfUWpNoQYmMAiTwQLM1RZZK2PGrMgwjS0ykhGDFIa-xkhBcfQyZc5nYDItPNXCFOTOT8iRBVHgY9soFwkiO7sFLos_eyrnnUxawQ_-3v7HPZZvTUA8AI65WpNl7BnNuW8WF1VH_QN5SaTBg |
| linkProvider | IEEE |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3NS8MwFH_MKehJZRO_zcGjdUvb1MaToo4N5yhs4m4jTV5h4DpZu8H-e_PaMj148RYSQngvh_f1e-8HcE2KT3QsHRSUuhHSOKEybQelG2rONRq3JJu4GwzC8VhGNbjZ9MIgYgE-w1taFrV8M9dLSpW1qGRkHewt2CbmrKpba5NRobklgeBV6ZK3ZasXPUfDD8JvEWCSE6f3LwqVwoJ09v_39gE0f1rxWLQxModQw7QBD8PlYoXre1ZyMlT5PEa8Zp8Zs24oe8zWsxmRZWlGMHmmUsNsIJ6jvZLlWRPeOy-jp65TUSE4U2vfc8eLjVChb7g20hUYS41KedozimaC-YkSSWCMq6RKvEDFvhGaE2YQ49BNUKF3BPV0nuIxsERajwVVrBPrSfhKhIHnKjJRNhZU9uwEGiT95KucdjGpBD_9e_sKdrujt_6k3xu8nsEeqbqEA55DPV8s8QJ29CqfZovL4rO-Ab7elk8 |
| 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=2018+IEEE+International+Parallel+and+Distributed+Processing+Symposium+Workshops+%28IPDPSW%29&rft.atitle=Survey%3A+Computational+Models+for+Asymmetric+Read+and+Write+Costs&rft.au=Gu%2C+Yan&rft.date=2018-05-01&rft.pub=IEEE&rft.spage=733&rft.epage=743&rft_id=info:doi/10.1109%2FIPDPSW.2018.00120&rft.externalDocID=8425487 |