2026-09-19T18:16:22Z https://www.ideals.illinois.edu/oai-pmh

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

Lee, Gyungho 2014-12-15T19:25:49Z 2014-12-15T19:25:49Z 10000-01-01 1986 1986 The use of automatic program restructuring and memory access combining for "general-purpose" large scale shared memory machine is investigated. The effects of unpredictable control flows and data accesses on the effectiveness of automatic program restructuring are considered through the experiments of several basic nonnumerical programs. Various loop structures found are classified, and their effects are investigated. Also, the importance of algorithm change is considered. In addition, a way of parallelizing loops with conditional branching is studied. Several schemes of memory access combining are investigated. Inherent limit in the idea of memory access combining is revealed, and the effectiveness of those schemes is studied. An approximate formula to provide bounds on the best possible performance of memory access combining is developed, and a practical scheme to achieve performance close to such bounds in modest sized machines is proposed. Made available in DSpace on 2014-12-15T19:25:49Z (GMT). No. of bitstreams: 1 8701547.pdf: 4226779 bytes, checksum: 3ae59bdd54143721234230e83d9c5055 (MD5) Previous issue date: 1986 Embargo set by: Seth Robbins for item 69728 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 128 p. Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1986. http://hdl.handle.net/2142/69562 (UMI)AAI8701547 Computer Science Some Issues in General-Purpose Shared Memory Multiprocessing: Parallelism Exploitation and Memory Access Combining (Shared Memory Machine, Automatic Restructuring) text Computer Science Computer Science University of Illinois at Urbana-Champaign Dissertation Ph.D.