{"id":{"repo_id":"mtu","oai_identifier":"oai:digitalcommons.mtu.edu:etdr-2931"},"canonical_url":"https://search.ndltd.org/etd/mtu/oai:digitalcommons.mtu.edu:etdr-2931","repository":{"repo_id":"mtu","name":"Michigan Technological University","base_url":"https://digitalcommons.mtu.edu/do/oai/"},"display":{"title":"STATICALLY CONTROLLED SYNCHRONIZED LANE ARCHITECTURES","abstract":"Modern 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.","abstract_html":"Modern 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.","abstract_has_math":false,"creators":["Pomerville, Scott K."],"institution":null,"degree_name":"Doctor of Philosophy in Computer Science (PhD)","degree_level":"Open Access Dissertation","degree_discipline":"Department of Computer Science","degree_department":null,"school":null,"contributors":["Soner Onder"],"advisors":[],"committee_chairs":[],"committee_members":["Zhenlin Wang","Jianhui Yue","David Whalley"],"year":null,"date_issued":"","date_published":null,"updated_at":"2026-11-19T08:19:12Z","subjects":["Static Compiler Scheduling","Computer Architecture","Synchronous Lane Architecture","Microarchitecture","Multithreading","Computer and Systems Architecture","Hardware Systems","Programming Languages and Compilers","Systems Architecture"],"languages":[],"rights":[],"rights_urls":["http://creativecommons.org/licenses/by/4.0/"],"identifier_entries":[{"key":"dc:identifier","label":"Identifier","values":["https://digitalcommons.mtu.edu/etdr/1811"],"render_values":[{"text":"https://digitalcommons.mtu.edu/etdr/1811","href":"https://digitalcommons.mtu.edu/etdr/1811","code":true}]}],"person_identifier_entries":[]},"links":{"outbound_url":"https://doi.org/10.37099/mtu.dc.etdr/1811","outbound_label":"DOI","outbound_source":"dc:identifier","record_url":"https://doi.org/10.37099/mtu.dc.etdr/1811","record_label":"Repository record","record_kind":"doi","record_source":"dc:identifier","download_url":null,"download_label":null,"download_source":null,"access_status":null,"embargo_until":null,"access_note":null},"source_record":{"url":"https://digitalcommons.mtu.edu/do/oai/?verb=GetRecord&metadataPrefix=oai_etdms&identifier=oai%3Adigitalcommons.mtu.edu%3Aetdr-2931","prefix":"oai_etdms"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Soner Onder"]},{"key":"dc:contributor.committeemember","label":"Committee Member","values":["Zhenlin Wang","Jianhui Yue","David Whalley"]},{"key":"dc:creator","label":"Author","values":["Pomerville, Scott K."]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.created","label":"Dc Date Created","values":["2024-01-01T08:00:00Z"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Department of Computer Science"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Open Access Dissertation"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Doctor of Philosophy in Computer Science (PhD)"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Static Compiler Scheduling","Computer Architecture","Synchronous Lane Architecture","Microarchitecture","Multithreading","Computer and Systems Architecture","Hardware Systems","Programming Languages and Compilers","Systems Architecture"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:rights.license","label":"Dc Rights License","values":["http://creativecommons.org/licenses/by/4.0/"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["10.37099/mtu.dc.etdr/1811","https://digitalcommons.mtu.edu/etdr/1811"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["Modern 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."]},{"key":"dc:title","label":"Title","values":["STATICALLY CONTROLLED SYNCHRONIZED LANE ARCHITECTURES"]}]}],"canonical_facts":{"dc:contributor":["Soner Onder"],"dc:contributor.committeemember":["Zhenlin Wang","Jianhui Yue","David Whalley"],"dc:creator":["Pomerville, Scott K."],"dc:date.created":["2024-01-01T08:00:00Z"],"dc:description.abstract":["Modern 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."],"dc:identifier":["10.37099/mtu.dc.etdr/1811","https://digitalcommons.mtu.edu/etdr/1811"],"dc:rights.license":["http://creativecommons.org/licenses/by/4.0/"],"dc:subject":["Static Compiler Scheduling","Computer Architecture","Synchronous Lane Architecture","Microarchitecture","Multithreading","Computer and Systems Architecture","Hardware Systems","Programming Languages and Compilers","Systems Architecture"],"dc:title":["STATICALLY CONTROLLED SYNCHRONIZED LANE ARCHITECTURES"],"thesis:degree_discipline":["Department of Computer Science"],"thesis:degree_level":["Open Access Dissertation"],"thesis:degree_name":["Doctor of Philosophy in Computer Science (PhD)"]},"updated_at":"2026-11-19T08:19:12Z"}