2026-09-20T12:19:33Z https://www.ideals.illinois.edu/oai-pmh

oai:www.ideals.illinois.edu:2142/45603 2023-07-11 col_2142_10761 col_2142_5131 com_2142_10755 com_2142_234 com_2142_5130

Torrellas, Josep Torrellas, Josep Marinov, Darko King, Samuel T. Lu, Shan Qi, Shanxiang 2013-08-22T16:49:19Z 2013-08-22T16:49:19Z 2015-08-22T10:00:28Z 2013-08 2013-08-22T16:49:19Z 2013-08 Multicore machines have become pervasive and, as a result, parallel programming has received renewed interest. Unfortunately, writing correct parallel programs is notoriously hard. One challenging problem is how to ship correct programs. Dynamic analysis tools are very useful to find errors in parallel programs by automatically analyzing the runtime information. They often capture errors from well-tested programs. However, existing dynamic analysis tools suffer from two problems: high false positive rate and high overhead. High false positive rate means lots of errors reported by the dynamic analysis tool may be benign or non-existent. For example, lots of data races detected by a race detection tool could be relatively benign data races. Also, many dynamic software analyses cause orders-ofmagnitude slowdowns, which users cannot tolerate at runtime. This dissertation contains three parts. The first two parts propose two different schemes to reduce the false positives and overhead of race detecting tools. These two schemes can detect and tolerate two different types of harmful races with low overhead: asymmetric data races and IF-condition data races. An asymmetric data race occurs when at least one of the racing threads is inside a critical section. Our proposal to detect and tolerate asymmetric data races is called Pacman. It exploits cache coherence hardware to temporarily protect the variables that a thread accesses in a critical section from other threads’s requests. An IF-condition data race is one where a memory location accessed by a thread (T1) in the control expression of an IF statement suffers a race while T1 is executing the THEN or ELSE clauses. T1 may or may not access again the location in the THEN or ELSE clauses. Our second proposal presents two techniques to handle IF-condition races dynamically. They rely on simple code transformations and, in one case, on additional hardware help. The third part proposes a general hardware framework to provide fine-grained memory monitoring with low overhead. This mechanism can be used to reduce the overhead of many dynamic software analyses. Overall, this dissertation aims at designing novel schemes to reduce the false positive rate and overhead of dynamic software analyses in order to make parallel programs more robust. Item withdrawn by Mark Zulauf (zulauf@illinois.edu) on 2013-06-24T19:07:18Z Item was in collections: University of Illinois Theses & Dissertations (ID: 1) No. of bitstreams: 1 Qi_Shanxiang.pdf: 1707722 bytes, checksum: 142cae5a25a48a1fa7200a181c6b537b (MD5) Made available in DSpace on 2013-08-22T16:49:19Z (GMT). No. of bitstreams: 2 Shanxiang_Qi.pdf: 1707722 bytes, checksum: 142cae5a25a48a1fa7200a181c6b537b (MD5) license.txt: 4058 bytes, checksum: 9042904064fc3e107abe20bac8b3a5b3 (MD5) Restriction data tranferred 2014-07-01T11:35:23-05:00 Original Data Group with Access UIUC Users [automated] Release Date: 2015-08-22 11:49:27 UTC Reason: Author requested U of Illinois access only (OA after 2yrs) in Vireo ETD system Item marked as restricted to the 'UIUC Users [automated]' Group (id=2) by Seth Robbins (srobbins@illinois.edu) on 2013-08-22T16:49:46Z Item is restricted until 2015-08-22T16:49:27Z U of I Only Restriction Lifted for Item 45585 on 2015-08-22T10:00:28Z. http://hdl.handle.net/2142/45603 en Copyright 2013 Shanxiang Qi concurrency bugs data race detection dynamic analysis Techniques to detect and avert advanced software concurrency bugs text Computer Science 1434 Computer Science 0112 University of Illinois at Urbana-Champaign Dissertation Ph.D. PHD:Computer Science -UIUC 10KS0112PHD