Hardware for Speculative Run-Time Parallelization in Distributed Shared -Memory Multiprocessors
Zhang, Ye
This item is only available for download by members of the University of Illinois community. Students, faculty, and staff at the U of I may log in with your NetID and password to view the item. If you are trying to access an Illinois-restricted dissertation or thesis, you can request a copy through your library's Inter-Library Loan office or purchase a copy directly from ProQuest.
Permalink
https://hdl.handle.net/2142/81317
Description
Title
Hardware for Speculative Run-Time Parallelization in Distributed Shared -Memory Multiprocessors
Author(s)
Zhang, Ye
Issue Date
1999
Doctoral Committee Chair(s)
Torrellas, Josep
Department of Study
Electrical Engineering
Discipline
Electrical Engineering
Degree Granting Institution
University of Illinois at Urbana-Champaign
Degree Name
Ph.D.
Degree Level
Dissertation
Keyword(s)
Computer Science
Language
eng
Abstract
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.
Use this login method if you
don't
have an
@illinois.edu
email address.
(Oops, I do have one)
IDEALS migrated to a new platform on June 23, 2022. If you created
your account prior to this date, you will have to reset your password
using the forgot-password link below.
