2026-09-19T07:10:06Z https://www.ideals.illinois.edu/oai-pmh

oai:www.ideals.illinois.edu:2142/81317 2023-07-11 col_2142_5131 col_2142_8888 com_2142_5130 com_2142_8887 com_2142_234

Torrellas, Josep Zhang, Ye 2015-09-25T20:10:32Z 2015-09-25T20:10:32Z 10000-01-01 1999 1999 The simulation results show that for the applications with dependence, the NPA and PA provide the best performance, because they are less complicated than the SUPAR algorithm, but still can recover efficiently from dependence violation. For applications without dependence, the performances of all the hardware schemes are better than that of the software scheme, because most of the overhead of the software scheme has been removed by the hardware support. Made available in DSpace on 2015-09-25T20:10:32Z (GMT). No. of bitstreams: 2 license.txt: 4848 bytes, checksum: 96035ab3f5e1c23cc7138a224ce498bd (MD5) 9953185.pdf: 8928813 bytes, checksum: f38e8209b20b34a88a0f82bea728b7dc (MD5) Previous issue date: 1999 Embargo set by: Seth Robbins for item 82598 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 185 p. Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1999. http://hdl.handle.net/2142/81317 (MiAaPQ)AAI9953185 eng Computer Science Hardware for Speculative Run-Time Parallelization in Distributed Shared -Memory Multiprocessors text Electrical Engineering Electrical Engineering University of Illinois at Urbana-Champaign Dissertation Ph.D.