Range Translations for Fast Virtual Memory
Modern workloads suffer high execution-time overhead due to page-based virtual memory. The authors introduce range translations that map arbitrary-sized virtual memory ranges to contiguous physical memory pages while retaining the flexibility of paging. A range translation reduces address translatio...
Gespeichert in:
| Veröffentlicht in: | IEEE MICRO 2016-05, Vol.36 (3), p.118-126 |
|---|---|
| Hauptverfasser: | , , , , , , , , |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext bestellen |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 126 |
|---|---|
| container_issue | 3 |
| container_start_page | 118 |
| container_title | IEEE MICRO |
| container_volume | 36 |
| creator | Gandhi, Jayneel Karakostas, Vasileios Ayar, Furkan Cristal, Adrian Hill, Mark D. McKinley, Kathryn S. Nemirovsky, Mario Swift, Michael M. Unsal, Osman S. |
| description | Modern workloads suffer high execution-time overhead due to page-based virtual memory. The authors introduce range translations that map arbitrary-sized virtual memory ranges to contiguous physical memory pages while retaining the flexibility of paging. A range translation reduces address translation to a range lookup that delivers near zero virtual memory overhead. |
| doi_str_mv | 10.1109/MM.2016.10 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_RIE</sourceid><recordid>TN_cdi_proquest_journals_1798215796</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>7436661</ieee_id><sourcerecordid>4095065341</sourcerecordid><originalsourceid>FETCH-LOGICAL-c312t-d8affd25ced9bc9ffbef1f42bad86cd3744d0a3bc4a76c55c2df0c0bd343a003</originalsourceid><addsrcrecordid>eNpd0M9LwzAUB_AgCs7pxauXghcZtL6XpE1zlOFUWBFkeA1pfkhH186kPey_t2PiwdOXL3x4PL6E3CJkiCAfqyqjgEWGcEZmKJlIOXJ2TmZABU1RMHpJrmLcAkBOoZyRxYfuvlyyCbqLrR6avouJ70Oy0nFIPpswjLpNKrfrw-GaXHjdRnfzm3OyWT1vlq_p-v3lbfm0Tg1DOqS21N5bmhtnZW2k97Xz6DmttS0LY5ng3IJmteFaFCbPDbUeDNSWcaYB2Jw8nM7uQ_89ujioXRONa1vduX6MCkuacynL_Ejv_9FtP4Zuek6hkCXFXMhiUouTMqGPMTiv9qHZ6XBQCOq4mqoqdVxt6hO-O-HGOfcHBWdFUSD7AURdZy4</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>1798215796</pqid></control><display><type>article</type><title>Range Translations for Fast Virtual Memory</title><source>IEEE Electronic Library (IEL)</source><creator>Gandhi, Jayneel ; Karakostas, Vasileios ; Ayar, Furkan ; Cristal, Adrian ; Hill, Mark D. ; McKinley, Kathryn S. ; Nemirovsky, Mario ; Swift, Michael M. ; Unsal, Osman S.</creator><creatorcontrib>Gandhi, Jayneel ; Karakostas, Vasileios ; Ayar, Furkan ; Cristal, Adrian ; Hill, Mark D. ; McKinley, Kathryn S. ; Nemirovsky, Mario ; Swift, Michael M. ; Unsal, Osman S.</creatorcontrib><description>Modern workloads suffer high execution-time overhead due to page-based virtual memory. The authors introduce range translations that map arbitrary-sized virtual memory ranges to contiguous physical memory pages while retaining the flexibility of paging. A range translation reduces address translation to a range lookup that delivers near zero virtual memory overhead.</description><identifier>ISSN: 0272-1732</identifier><identifier>EISSN: 1937-4143</identifier><identifier>DOI: 10.1109/MM.2016.10</identifier><identifier>CODEN: IEMIDZ</identifier><language>eng</language><publisher>Los Alamitos: IEEE</publisher><subject>Computer memory ; Flexibility ; Memory management ; Operating systems ; Paging ; translation look-aside buffer ; Translations ; Virtual memory ; Virtual memory systems ; Virtual reality ; Workload ; Workloads</subject><ispartof>IEEE MICRO, 2016-05, Vol.36 (3), p.118-126</ispartof><rights>Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) May-Jun 2016</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c312t-d8affd25ced9bc9ffbef1f42bad86cd3744d0a3bc4a76c55c2df0c0bd343a003</citedby><cites>FETCH-LOGICAL-c312t-d8affd25ced9bc9ffbef1f42bad86cd3744d0a3bc4a76c55c2df0c0bd343a003</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/7436661$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>315,781,785,797,27929,27930,54763</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/7436661$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Gandhi, Jayneel</creatorcontrib><creatorcontrib>Karakostas, Vasileios</creatorcontrib><creatorcontrib>Ayar, Furkan</creatorcontrib><creatorcontrib>Cristal, Adrian</creatorcontrib><creatorcontrib>Hill, Mark D.</creatorcontrib><creatorcontrib>McKinley, Kathryn S.</creatorcontrib><creatorcontrib>Nemirovsky, Mario</creatorcontrib><creatorcontrib>Swift, Michael M.</creatorcontrib><creatorcontrib>Unsal, Osman S.</creatorcontrib><title>Range Translations for Fast Virtual Memory</title><title>IEEE MICRO</title><addtitle>MM</addtitle><description>Modern workloads suffer high execution-time overhead due to page-based virtual memory. The authors introduce range translations that map arbitrary-sized virtual memory ranges to contiguous physical memory pages while retaining the flexibility of paging. A range translation reduces address translation to a range lookup that delivers near zero virtual memory overhead.</description><subject>Computer memory</subject><subject>Flexibility</subject><subject>Memory management</subject><subject>Operating systems</subject><subject>Paging</subject><subject>translation look-aside buffer</subject><subject>Translations</subject><subject>Virtual memory</subject><subject>Virtual memory systems</subject><subject>Virtual reality</subject><subject>Workload</subject><subject>Workloads</subject><issn>0272-1732</issn><issn>1937-4143</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2016</creationdate><recordtype>article</recordtype><sourceid>RIE</sourceid><recordid>eNpd0M9LwzAUB_AgCs7pxauXghcZtL6XpE1zlOFUWBFkeA1pfkhH186kPey_t2PiwdOXL3x4PL6E3CJkiCAfqyqjgEWGcEZmKJlIOXJ2TmZABU1RMHpJrmLcAkBOoZyRxYfuvlyyCbqLrR6avouJ70Oy0nFIPpswjLpNKrfrw-GaXHjdRnfzm3OyWT1vlq_p-v3lbfm0Tg1DOqS21N5bmhtnZW2k97Xz6DmttS0LY5ng3IJmteFaFCbPDbUeDNSWcaYB2Jw8nM7uQ_89ujioXRONa1vduX6MCkuacynL_Ejv_9FtP4Zuek6hkCXFXMhiUouTMqGPMTiv9qHZ6XBQCOq4mqoqdVxt6hO-O-HGOfcHBWdFUSD7AURdZy4</recordid><startdate>201605</startdate><enddate>201605</enddate><creator>Gandhi, Jayneel</creator><creator>Karakostas, Vasileios</creator><creator>Ayar, Furkan</creator><creator>Cristal, Adrian</creator><creator>Hill, Mark D.</creator><creator>McKinley, Kathryn S.</creator><creator>Nemirovsky, Mario</creator><creator>Swift, Michael M.</creator><creator>Unsal, Osman S.</creator><general>IEEE</general><general>The Institute of Electrical and Electronics Engineers, Inc. (IEEE)</general><scope>97E</scope><scope>RIA</scope><scope>RIE</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>7SP</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope><scope>F28</scope><scope>FR3</scope></search><sort><creationdate>201605</creationdate><title>Range Translations for Fast Virtual Memory</title><author>Gandhi, Jayneel ; Karakostas, Vasileios ; Ayar, Furkan ; Cristal, Adrian ; Hill, Mark D. ; McKinley, Kathryn S. ; Nemirovsky, Mario ; Swift, Michael M. ; Unsal, Osman S.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c312t-d8affd25ced9bc9ffbef1f42bad86cd3744d0a3bc4a76c55c2df0c0bd343a003</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2016</creationdate><topic>Computer memory</topic><topic>Flexibility</topic><topic>Memory management</topic><topic>Operating systems</topic><topic>Paging</topic><topic>translation look-aside buffer</topic><topic>Translations</topic><topic>Virtual memory</topic><topic>Virtual memory systems</topic><topic>Virtual reality</topic><topic>Workload</topic><topic>Workloads</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Gandhi, Jayneel</creatorcontrib><creatorcontrib>Karakostas, Vasileios</creatorcontrib><creatorcontrib>Ayar, Furkan</creatorcontrib><creatorcontrib>Cristal, Adrian</creatorcontrib><creatorcontrib>Hill, Mark D.</creatorcontrib><creatorcontrib>McKinley, Kathryn S.</creatorcontrib><creatorcontrib>Nemirovsky, Mario</creatorcontrib><creatorcontrib>Swift, Michael M.</creatorcontrib><creatorcontrib>Unsal, Osman S.</creatorcontrib><collection>IEEE All-Society Periodicals Package (ASPP) 2005-present</collection><collection>IEEE All-Society Periodicals Package (ASPP) 1998-Present</collection><collection>IEEE Electronic Library (IEL)</collection><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Electronics & Communications Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><collection>ANTE: Abstracts in New Technology & Engineering</collection><collection>Engineering Research Database</collection><jtitle>IEEE MICRO</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Gandhi, Jayneel</au><au>Karakostas, Vasileios</au><au>Ayar, Furkan</au><au>Cristal, Adrian</au><au>Hill, Mark D.</au><au>McKinley, Kathryn S.</au><au>Nemirovsky, Mario</au><au>Swift, Michael M.</au><au>Unsal, Osman S.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Range Translations for Fast Virtual Memory</atitle><jtitle>IEEE MICRO</jtitle><stitle>MM</stitle><date>2016-05</date><risdate>2016</risdate><volume>36</volume><issue>3</issue><spage>118</spage><epage>126</epage><pages>118-126</pages><issn>0272-1732</issn><eissn>1937-4143</eissn><coden>IEMIDZ</coden><abstract>Modern workloads suffer high execution-time overhead due to page-based virtual memory. The authors introduce range translations that map arbitrary-sized virtual memory ranges to contiguous physical memory pages while retaining the flexibility of paging. A range translation reduces address translation to a range lookup that delivers near zero virtual memory overhead.</abstract><cop>Los Alamitos</cop><pub>IEEE</pub><doi>10.1109/MM.2016.10</doi><tpages>9</tpages></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | ISSN: 0272-1732 |
| ispartof | IEEE MICRO, 2016-05, Vol.36 (3), p.118-126 |
| issn | 0272-1732 1937-4143 |
| language | eng |
| recordid | cdi_proquest_journals_1798215796 |
| source | IEEE Electronic Library (IEL) |
| subjects | Computer memory Flexibility Memory management Operating systems Paging translation look-aside buffer Translations Virtual memory Virtual memory systems Virtual reality Workload Workloads |
| title | Range Translations for Fast Virtual Memory |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-11T20%3A37%3A20IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_RIE&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Range%20Translations%20for%20Fast%20Virtual%20Memory&rft.jtitle=IEEE%20MICRO&rft.au=Gandhi,%20Jayneel&rft.date=2016-05&rft.volume=36&rft.issue=3&rft.spage=118&rft.epage=126&rft.pages=118-126&rft.issn=0272-1732&rft.eissn=1937-4143&rft.coden=IEMIDZ&rft_id=info:doi/10.1109/MM.2016.10&rft_dat=%3Cproquest_RIE%3E4095065341%3C/proquest_RIE%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=1798215796&rft_id=info:pmid/&rft_ieee_id=7436661&rfr_iscdi=true |