I2SEMS: Interconnects-Independent Security Enhanced Shared Memory Multiprocessor Systems
Protection and security are becoming essential requirements in commercial servers. In this paper, we present a fast and efficient method for providing secure memory and cache-to-cache communications in shared memory multiprocessor systems that are becoming enormously popular in designing servers for...
Gespeichert in:
Hauptverfasser: | , , |
---|---|
Format: | Tagungsbericht |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext bestellen |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
container_end_page | 103 |
---|---|
container_issue | |
container_start_page | 94 |
container_title | |
container_volume | |
creator | Manhee Lee Minseon Ahn Eun Jung Kim |
description | Protection and security are becoming essential requirements in commercial servers. In this paper, we present a fast and efficient method for providing secure memory and cache-to-cache communications in shared memory multiprocessor systems that are becoming enormously popular in designing servers for various applications. Since our scheme is independent of underlying interconnects and cache coherence protocols, we refer to it as interconnects-independent security enhanced shared memory multiprocessor systems (I 2 SEMS). The main challenge in designing I 2 SEMS is how to precompute keystreams in a timely manner, which is critical to minimize performance overhead. We achieve this goal by adopting a single system-wide global counter controller (GCC) and three additional components for each processor: a key stream queue, a key stream cache, and a key stream pool. The GCC assigns a unique range of counters as a way to help processors precompute the counters' keystreams. We have implemented I 2 SEMS using Simics with Wisconsin multifacet general execution-driven multiprocessor simulator (GEMS). We tested our design with SPLASH-2 benchmarks on up to 16-processor shared memory multiprocessor systems. Simulation results show that the overall performance slowdown is 4% on average and the keystream hit rate is as high as 78%. The stable keystream hit rate shows that PSEMS works well with both memory-read and memory-write dominant applications. Similar to the conventional cache, a large keystream pool size is beneficial to high hit rates. |
doi_str_mv | 10.1109/PACT.2007.4336203 |
format | Conference Proceeding |
fullrecord | <record><control><sourceid>ieee_6IE</sourceid><recordid>TN_cdi_ieee_primary_4336203</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>4336203</ieee_id><sourcerecordid>4336203</sourcerecordid><originalsourceid>FETCH-LOGICAL-i633-8965700bdfe57508c199900a7564fce0416bfc03f1b5d7b5b9c8bb290d1c28603</originalsourceid><addsrcrecordid>eNotkE1qwzAUhEV_oG6aA5RufAGnT5IlWd2FkLSGhBbsRXbBkp-JSywbyVn49jU0s_hmYGAWQ8grhRWloN9_1ptyxQDUKuVcMuB3JGIypYnSaXpPnkFJLdicxQOJKGR6LsTxiSxD-IVZXMuZETnmrNgeio84dyN62zuHdgxJ7moccIYb4wLt1bfjFG_duXIW67g4V362A3a9n-LD9TK2g-8thtD7uJjCiF14IY9NdQm4vPmClLttuflK9t-f-Wa9T1rJeZJpKRSAqRsUSkBmqdYaoFJCpo1FSKk0jQXeUCNqZYTRNjOGaaipZZkEviBv_7MtIp4G33aVn063T_gfGddTjQ</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>I2SEMS: Interconnects-Independent Security Enhanced Shared Memory Multiprocessor Systems</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Manhee Lee ; Minseon Ahn ; Eun Jung Kim</creator><creatorcontrib>Manhee Lee ; Minseon Ahn ; Eun Jung Kim</creatorcontrib><description>Protection and security are becoming essential requirements in commercial servers. In this paper, we present a fast and efficient method for providing secure memory and cache-to-cache communications in shared memory multiprocessor systems that are becoming enormously popular in designing servers for various applications. Since our scheme is independent of underlying interconnects and cache coherence protocols, we refer to it as interconnects-independent security enhanced shared memory multiprocessor systems (I 2 SEMS). The main challenge in designing I 2 SEMS is how to precompute keystreams in a timely manner, which is critical to minimize performance overhead. We achieve this goal by adopting a single system-wide global counter controller (GCC) and three additional components for each processor: a key stream queue, a key stream cache, and a key stream pool. The GCC assigns a unique range of counters as a way to help processors precompute the counters' keystreams. We have implemented I 2 SEMS using Simics with Wisconsin multifacet general execution-driven multiprocessor simulator (GEMS). We tested our design with SPLASH-2 benchmarks on up to 16-processor shared memory multiprocessor systems. Simulation results show that the overall performance slowdown is 4% on average and the keystream hit rate is as high as 78%. The stable keystream hit rate shows that PSEMS works well with both memory-read and memory-write dominant applications. Similar to the conventional cache, a large keystream pool size is beneficial to high hit rates.</description><identifier>ISSN: 1089-795X</identifier><identifier>ISBN: 0769529445</identifier><identifier>ISBN: 9780769529448</identifier><identifier>EISSN: 2641-7944</identifier><identifier>DOI: 10.1109/PACT.2007.4336203</identifier><language>eng</language><publisher>IEEE</publisher><subject>Coherence ; Communication system security ; Computer security ; Counting circuits ; Cryptography ; Data security ; Delay ; Multicast protocols ; Multiprocessing systems ; Protection</subject><ispartof>16th International Conference on Parallel Architecture and Compilation Techniques (PACT 2007), 2007, p.94-103</ispartof><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/4336203$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,780,784,789,790,2058,27925,54920</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/4336203$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Manhee Lee</creatorcontrib><creatorcontrib>Minseon Ahn</creatorcontrib><creatorcontrib>Eun Jung Kim</creatorcontrib><title>I2SEMS: Interconnects-Independent Security Enhanced Shared Memory Multiprocessor Systems</title><title>16th International Conference on Parallel Architecture and Compilation Techniques (PACT 2007)</title><addtitle>PACT</addtitle><description>Protection and security are becoming essential requirements in commercial servers. In this paper, we present a fast and efficient method for providing secure memory and cache-to-cache communications in shared memory multiprocessor systems that are becoming enormously popular in designing servers for various applications. Since our scheme is independent of underlying interconnects and cache coherence protocols, we refer to it as interconnects-independent security enhanced shared memory multiprocessor systems (I 2 SEMS). The main challenge in designing I 2 SEMS is how to precompute keystreams in a timely manner, which is critical to minimize performance overhead. We achieve this goal by adopting a single system-wide global counter controller (GCC) and three additional components for each processor: a key stream queue, a key stream cache, and a key stream pool. The GCC assigns a unique range of counters as a way to help processors precompute the counters' keystreams. We have implemented I 2 SEMS using Simics with Wisconsin multifacet general execution-driven multiprocessor simulator (GEMS). We tested our design with SPLASH-2 benchmarks on up to 16-processor shared memory multiprocessor systems. Simulation results show that the overall performance slowdown is 4% on average and the keystream hit rate is as high as 78%. The stable keystream hit rate shows that PSEMS works well with both memory-read and memory-write dominant applications. Similar to the conventional cache, a large keystream pool size is beneficial to high hit rates.</description><subject>Coherence</subject><subject>Communication system security</subject><subject>Computer security</subject><subject>Counting circuits</subject><subject>Cryptography</subject><subject>Data security</subject><subject>Delay</subject><subject>Multicast protocols</subject><subject>Multiprocessing systems</subject><subject>Protection</subject><issn>1089-795X</issn><issn>2641-7944</issn><isbn>0769529445</isbn><isbn>9780769529448</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2007</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><sourceid>RIE</sourceid><recordid>eNotkE1qwzAUhEV_oG6aA5RufAGnT5IlWd2FkLSGhBbsRXbBkp-JSywbyVn49jU0s_hmYGAWQ8grhRWloN9_1ptyxQDUKuVcMuB3JGIypYnSaXpPnkFJLdicxQOJKGR6LsTxiSxD-IVZXMuZETnmrNgeio84dyN62zuHdgxJ7moccIYb4wLt1bfjFG_duXIW67g4V362A3a9n-LD9TK2g-8thtD7uJjCiF14IY9NdQm4vPmClLttuflK9t-f-Wa9T1rJeZJpKRSAqRsUSkBmqdYaoFJCpo1FSKk0jQXeUCNqZYTRNjOGaaipZZkEviBv_7MtIp4G33aVn063T_gfGddTjQ</recordid><startdate>200709</startdate><enddate>200709</enddate><creator>Manhee Lee</creator><creator>Minseon Ahn</creator><creator>Eun Jung Kim</creator><general>IEEE</general><scope>6IE</scope><scope>6IL</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIL</scope></search><sort><creationdate>200709</creationdate><title>I2SEMS: Interconnects-Independent Security Enhanced Shared Memory Multiprocessor Systems</title><author>Manhee Lee ; Minseon Ahn ; Eun Jung Kim</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i633-8965700bdfe57508c199900a7564fce0416bfc03f1b5d7b5b9c8bb290d1c28603</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2007</creationdate><topic>Coherence</topic><topic>Communication system security</topic><topic>Computer security</topic><topic>Counting circuits</topic><topic>Cryptography</topic><topic>Data security</topic><topic>Delay</topic><topic>Multicast protocols</topic><topic>Multiprocessing systems</topic><topic>Protection</topic><toplevel>online_resources</toplevel><creatorcontrib>Manhee Lee</creatorcontrib><creatorcontrib>Minseon Ahn</creatorcontrib><creatorcontrib>Eun Jung Kim</creatorcontrib><collection>IEEE Electronic Library (IEL) Conference Proceedings</collection><collection>IEEE Proceedings Order Plan All Online (POP All Online) 1998-present by volume</collection><collection>IEEE Xplore All Conference Proceedings</collection><collection>IEEE Electronic Library (IEL)</collection><collection>IEEE Proceedings Order Plans (POP All) 1998-Present</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Manhee Lee</au><au>Minseon Ahn</au><au>Eun Jung Kim</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>I2SEMS: Interconnects-Independent Security Enhanced Shared Memory Multiprocessor Systems</atitle><btitle>16th International Conference on Parallel Architecture and Compilation Techniques (PACT 2007)</btitle><stitle>PACT</stitle><date>2007-09</date><risdate>2007</risdate><spage>94</spage><epage>103</epage><pages>94-103</pages><issn>1089-795X</issn><eissn>2641-7944</eissn><isbn>0769529445</isbn><isbn>9780769529448</isbn><abstract>Protection and security are becoming essential requirements in commercial servers. In this paper, we present a fast and efficient method for providing secure memory and cache-to-cache communications in shared memory multiprocessor systems that are becoming enormously popular in designing servers for various applications. Since our scheme is independent of underlying interconnects and cache coherence protocols, we refer to it as interconnects-independent security enhanced shared memory multiprocessor systems (I 2 SEMS). The main challenge in designing I 2 SEMS is how to precompute keystreams in a timely manner, which is critical to minimize performance overhead. We achieve this goal by adopting a single system-wide global counter controller (GCC) and three additional components for each processor: a key stream queue, a key stream cache, and a key stream pool. The GCC assigns a unique range of counters as a way to help processors precompute the counters' keystreams. We have implemented I 2 SEMS using Simics with Wisconsin multifacet general execution-driven multiprocessor simulator (GEMS). We tested our design with SPLASH-2 benchmarks on up to 16-processor shared memory multiprocessor systems. Simulation results show that the overall performance slowdown is 4% on average and the keystream hit rate is as high as 78%. The stable keystream hit rate shows that PSEMS works well with both memory-read and memory-write dominant applications. Similar to the conventional cache, a large keystream pool size is beneficial to high hit rates.</abstract><pub>IEEE</pub><doi>10.1109/PACT.2007.4336203</doi><tpages>10</tpages><oa>free_for_read</oa></addata></record> |
fulltext | fulltext_linktorsrc |
identifier | ISSN: 1089-795X |
ispartof | 16th International Conference on Parallel Architecture and Compilation Techniques (PACT 2007), 2007, p.94-103 |
issn | 1089-795X 2641-7944 |
language | eng |
recordid | cdi_ieee_primary_4336203 |
source | IEEE Electronic Library (IEL) Conference Proceedings |
subjects | Coherence Communication system security Computer security Counting circuits Cryptography Data security Delay Multicast protocols Multiprocessing systems Protection |
title | I2SEMS: Interconnects-Independent Security Enhanced Shared Memory Multiprocessor Systems |
url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-06T13%3A21%3A33IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-ieee_6IE&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=I2SEMS:%20Interconnects-Independent%20Security%20Enhanced%20Shared%20Memory%20Multiprocessor%20Systems&rft.btitle=16th%20International%20Conference%20on%20Parallel%20Architecture%20and%20Compilation%20Techniques%20(PACT%202007)&rft.au=Manhee%20Lee&rft.date=2007-09&rft.spage=94&rft.epage=103&rft.pages=94-103&rft.issn=1089-795X&rft.eissn=2641-7944&rft.isbn=0769529445&rft.isbn_list=9780769529448&rft_id=info:doi/10.1109/PACT.2007.4336203&rft_dat=%3Cieee_6IE%3E4336203%3C/ieee_6IE%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=4336203&rfr_iscdi=true |