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

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

Padua, David A. Lee, Jaejin 2015-09-25T20:21:12Z 2015-09-25T20:21:12Z 10000-01-01 1999 1999 We introduce two intermediate representations: the concurrent control flow graph, and the concurrent static single assignment form. Based on these representations, we develop an analysis technique, called concurrent global value numbering, by extending classical value partitioning and global value numbering. We also extend commonly used classical compiler optimization techniques to parallel program using those intermediate representations. By doing this, we guarantee the correctness (sequential consistency) of the optimized program and maintain single processor performance in a multiprocessor environment. We also describe a parallel loop overhead reduction technique. Made available in DSpace on 2015-09-25T20:21:12Z (GMT). No. of bitstreams: 2 license.txt: 4848 bytes, checksum: 96035ab3f5e1c23cc7138a224ce498bd (MD5) 9953074.pdf: 4837234 bytes, checksum: a48264696782180c347a355e33c0b5c1 (MD5) Previous issue date: 1999 Embargo set by: Seth Robbins for item 83242 Lift date: Forever Reason: Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs U of I Only 153 p. Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1999. http://hdl.handle.net/2142/81961 (MiAaPQ)AAI9953074 eng Computer Science Compilation Techniques for Explicitly Parallel Programs text Computer Science Computer Science University of Illinois at Urbana-Champaign Dissertation Ph.D.