Abstract
dc:descriptionIn 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.
Degree
thesis:*- Name thesis:degree_name
- Ph.D.
- Level thesis:degree_level
- Dissertation
- Discipline thesis:degree_discipline
- Computer Science
- Grantor
- University of Illinois at Urbana-Champaign
- Year dc:date
- 2015
Author and committee
dc:creator, dc:contributor.*- Author dc:creator
-
- Martinez, Jose Fernando
- Contributors dc:contributor
-
- Torrellas, Josep
Subjects
dc:subject × 1Rights
- Language dc:language
- eng
Identifiers
dc:identifier.*- Identifier
- (MiAaPQ)AAI3070379
- OAI identifier oai:identifier
- oai:www.ideals.illinois.edu:2142/81609