{"id":{"repo_id":"uiuc","oai_identifier":"oai:www.ideals.illinois.edu:2142/15995"},"canonical_url":"https://search.dev.ndltd.org/etd/uiuc/oai:www.ideals.illinois.edu:2142/15995","repository":{"repo_id":"uiuc","name":"University of Illinois - Urbana-Champaign","base_url":"https://www.ideals.illinois.edu/oai-pmh"},"display":{"title":"Tolerating asymmetric data races with minimal hardware support","abstract":"Data races are a common type of concurrency bug in parallel programs. An important type of race that has not received much attention is Asymmetric data races. In these races, the state of well tested, correct threads is corrupted by racing threads from external, typically third-party code. Current schemes to detect and tolerate these races are software based, and have substantial execution overhead. This thesis proposes the first scheme to detect and tolerate asymmetric data races in hardware. The approach, called Pacman, induces negligible execution overhead and requires minimal hardware modifications. In addition, compared to past software-based schemes, Pacman eliminates deadlock cases. Pacman is based on using hardware address signatures to detect the asymmetric races. Processor, cache coherence, and protocol messages remain unchanged. We evaluate Pacman for all the SPLASH2 and PARSEC applications. Our results show that Pacman is effective and has minimal overhead. ii","abstract_html":"Data races are a common type of concurrency bug in parallel programs. An important type of race that has not received much attention is Asymmetric data races. In these races, the state of well tested, correct threads is corrupted by racing threads from external, typically third-party code. Current schemes to detect and tolerate these races are software based, and have substantial execution overhead. This thesis proposes the first scheme to detect and tolerate asymmetric data races in hardware. The approach, called Pacman, induces negligible execution overhead and requires minimal hardware modifications. In addition, compared to past software-based schemes, Pacman eliminates deadlock cases. Pacman is based on using hardware address signatures to detect the asymmetric races. Processor, cache coherence, and protocol messages remain unchanged. We evaluate Pacman for all the SPLASH2 and PARSEC applications. Our results show that Pacman is effective and has minimal overhead. ii","abstract_has_math":false,"creators":["Qi, Shanxiang"],"institution":"University of Illinois at Urbana-Champaign","degree_name":"M.S.","degree_level":"Thesis","degree_discipline":"Computer Science","degree_department":null,"school":null,"contributors":["Torrellas, Josep"],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2010,"date_issued":"2010-05-18T18:55:33Z","date_published":"2010-05-18T18:55:33Z","updated_at":"2026-07-22T22:25:08Z","subjects":["computer architecture","software reliability","concurrency bugs"],"languages":["en"],"rights":["Copyright 2010 Shanxiang Qi"],"rights_urls":[],"identifier_entries":[]},"links":{"outbound_url":"http://hdl.handle.net/2142/15995","outbound_label":"Handle","outbound_source":"dc:identifier"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Torrellas, Josep"]},{"key":"dc:creator","label":"Author","values":["Qi, Shanxiang"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["2010-05-18T18:55:33Z","2012-05-19T10:00:15Z","2010-5"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Computer Science"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Thesis"]},{"key":"thesis:degree_name","label":"Degree Name","values":["M.S."]},{"key":"thesis:institution_name","label":"Thesis Institution Name","values":["University of Illinois at Urbana-Champaign"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["computer architecture","software reliability","concurrency bugs"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language","label":"Dc Language","values":["en"]},{"key":"dc:rights","label":"Dc Rights","values":["Copyright 2010 Shanxiang Qi"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["http://hdl.handle.net/2142/15995"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["Data races are a common type of concurrency bug in parallel programs. An important type of race that has not received much attention is Asymmetric data races. In these races, the state of well tested, correct threads is corrupted by racing threads from external, typically third-party code. Current schemes to detect and tolerate these races are software based, and have substantial execution overhead. This thesis proposes the first scheme to detect and tolerate asymmetric data races in hardware. The approach, called Pacman, induces negligible execution overhead and requires minimal hardware modifications. In addition, compared to past software-based schemes, Pacman eliminates deadlock cases. Pacman is based on using hardware address signatures to detect the asymmetric races. Processor, cache coherence, and protocol messages remain unchanged. We evaluate Pacman for all the SPLASH2 and PARSEC applications. Our results show that Pacman is effective and has minimal overhead. ii","Item withdrawn by Mark Zulauf (zulauf@illinois.edu) on 2010-04-16T18:49:15Z Item was in collections: University of Illinois Theses & Dissertations (ID: 1) No. of bitstreams: 1 Qi_Shanxiang.pdf: 951213 bytes, checksum: d0ecfcb56b563d6ebf7a5a090a27bdbf (MD5)","Made available in DSpace on 2010-05-18T18:55:33Z (GMT). No. of bitstreams: 2 Qi_Shanxiang.pdf: 951213 bytes, checksum: d0ecfcb56b563d6ebf7a5a090a27bdbf (MD5) license.txt: 4058 bytes, checksum: ab04adfe5adc3da5d5ef2a0c2c0d1736 (MD5)","Item marked as restricted to the 'Administrator' Group (id=1) by William Ingram (wingram2@illinois.edu) on 2010-05-18T18:56:42Z Item is restricted until 2012-05-18T18:56:42Z","Item reinstated by Sarah Shreeves (sshreeve@illinois.edu) on 2012-05-19T10:00:15Z Item was in collections: Dissertations and Theses - Computer Science (ID: 587) University of Illinois Dissertations and Theses (ID: 204) No. of bitstreams: 3 Qi_Shanxiang.pdf.txt: 62093 bytes, checksum: b18298f9bfa254542d91edf7871ce301 (MD5) Qi_Shanxiang.pdf: 951213 bytes, checksum: d0ecfcb56b563d6ebf7a5a090a27bdbf (MD5) license.txt: 4058 bytes, checksum: ab04adfe5adc3da5d5ef2a0c2c0d1736 (MD5)","Item released from any restrictions by Sarah Shreeves (sshreeve@illinois.edu) on 2012-05-19T10:00:15Z"]},{"key":"dc:title","label":"Title","values":["Tolerating asymmetric data races with minimal hardware support"]}]}],"canonical_facts":{"dc:contributor":["Torrellas, Josep"],"dc:creator":["Qi, Shanxiang"],"dc:date":["2010-05-18T18:55:33Z","2012-05-19T10:00:15Z","2010-5"],"dc:description":["Data races are a common type of concurrency bug in parallel programs. An important type of race that has not received much attention is Asymmetric data races. In these races, the state of well tested, correct threads is corrupted by racing threads from external, typically third-party code. Current schemes to detect and tolerate these races are software based, and have substantial execution overhead. This thesis proposes the first scheme to detect and tolerate asymmetric data races in hardware. The approach, called Pacman, induces negligible execution overhead and requires minimal hardware modifications. In addition, compared to past software-based schemes, Pacman eliminates deadlock cases. Pacman is based on using hardware address signatures to detect the asymmetric races. Processor, cache coherence, and protocol messages remain unchanged. We evaluate Pacman for all the SPLASH2 and PARSEC applications. Our results show that Pacman is effective and has minimal overhead. ii","Item withdrawn by Mark Zulauf (zulauf@illinois.edu) on 2010-04-16T18:49:15Z Item was in collections: University of Illinois Theses & Dissertations (ID: 1) No. of bitstreams: 1 Qi_Shanxiang.pdf: 951213 bytes, checksum: d0ecfcb56b563d6ebf7a5a090a27bdbf (MD5)","Made available in DSpace on 2010-05-18T18:55:33Z (GMT). No. of bitstreams: 2 Qi_Shanxiang.pdf: 951213 bytes, checksum: d0ecfcb56b563d6ebf7a5a090a27bdbf (MD5) license.txt: 4058 bytes, checksum: ab04adfe5adc3da5d5ef2a0c2c0d1736 (MD5)","Item marked as restricted to the 'Administrator' Group (id=1) by William Ingram (wingram2@illinois.edu) on 2010-05-18T18:56:42Z Item is restricted until 2012-05-18T18:56:42Z","Item reinstated by Sarah Shreeves (sshreeve@illinois.edu) on 2012-05-19T10:00:15Z Item was in collections: Dissertations and Theses - Computer Science (ID: 587) University of Illinois Dissertations and Theses (ID: 204) No. of bitstreams: 3 Qi_Shanxiang.pdf.txt: 62093 bytes, checksum: b18298f9bfa254542d91edf7871ce301 (MD5) Qi_Shanxiang.pdf: 951213 bytes, checksum: d0ecfcb56b563d6ebf7a5a090a27bdbf (MD5) license.txt: 4058 bytes, checksum: ab04adfe5adc3da5d5ef2a0c2c0d1736 (MD5)","Item released from any restrictions by Sarah Shreeves (sshreeve@illinois.edu) on 2012-05-19T10:00:15Z"],"dc:identifier":["http://hdl.handle.net/2142/15995"],"dc:language":["en"],"dc:rights":["Copyright 2010 Shanxiang Qi"],"dc:subject":["computer architecture","software reliability","concurrency bugs"],"dc:title":["Tolerating asymmetric data races with minimal hardware support"],"thesis:degree_discipline":["Computer Science"],"thesis:degree_level":["Thesis"],"thesis:degree_name":["M.S."],"thesis:institution_name":["University of Illinois at Urbana-Champaign"]},"updated_at":"2026-07-22T22:25:08Z"}