Speculative Shared -Memory Architectures

88 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 2002.In this work we present two TLS-based solutions to improve the performance of sequential and parallel codes. We propose a speculative shared-memory system to extract parallelism from codes for which today's parallelizing compilers fail. We distance ourselves from the existing literature by targeting scalability and modularity: Our hierarchical approach largely abstracts away the internals of the node architecture. In particular, we are able to utilize a self-contained speculative CMP as building block, with minimal additions to interface with the rest of the system. We also propose Speculative Synchronization, a speculation mechanism built on top of a shared-memory architecture to enhance existing parallelism in codes that result inefficient at synchronization points, notably barriers, locks, and flags.U of I OnlyRestricted to the U of I community idenfinitely during batch ingest of legacy ETD