Michigan Technological University
STATICALLY CONTROLLED SYNCHRONIZED LANE ARCHITECTURES
Abstract
dc:description.abstractModern superscalar processors dominate the field of computing. While dynamic execution allows for versatility in code, these processors are complex. Statically scheduled code has historically enabled simpler processor designs, but static scheduling cannot account for variables that are unknown at compile time. Furthermore, static scheduling has many inefficiencies, such as the need to insert a large number of nops for code in traditional Very Long Instruction Word (VLIW) processors. In this dissertation, we explore a novel architectural approach for statically scheduled code by breaking the code into several synchronous instruction streams. By representing code in a fundamentally new way, we demonstrate that we can create robust processors that can handle dynamic levels of instruction level parallelism (ILP), and demonstrate the potential it has to target traditional weaknesses typically associated with statically scheduled processors. This dissertation is an exploration of the consequences of allowing for multiple instruction streams, as well as the possibilities opened up by changing program representation to allow for several simultaneous streams of instructions.
Degree
thesis:*- Name thesis:degree_name
- Doctor of Philosophy in Computer Science (PhD)
- Level thesis:degree_level
- Open Access Dissertation
- Discipline thesis:degree_discipline
- Department of Computer Science
Author and committee
dc:creator, dc:contributor.*- Author dc:creator
-
- Pomerville, Scott K.
- Committee members dc:contributor.committeemember
-
- Zhenlin Wang
- Jianhui Yue
- David Whalley
- Contributors dc:contributor
-
- Soner Onder
Subjects
dc:subject × 9Rights
- Licence dc:rights.license
Identifiers
dc:identifier.*- Identifier
- https://digitalcommons.mtu.edu/etdr/1811