{"id":{"repo_id":"mtu","oai_identifier":"oai:digitalcommons.mtu.edu:etdr-2500"},"canonical_url":"https://search.ndltd.org/etd/mtu/oai:digitalcommons.mtu.edu:etdr-2500","repository":{"repo_id":"mtu","name":"Michigan Technological University","base_url":"https://digitalcommons.mtu.edu/do/oai/"},"display":{"title":"Eager Scheduling of Dependent Instructions","abstract":"Modern superscalar processors are able to potentially issue and execute multiple instructions per cycle. Several techniques over the years have focused on increasing the Instruction Level Parallelism (ILP) that a processor can exploit. However, there are many limitations of ILP that hinder performance, chief of them being the chain of dependencies between instructions that stops instructions from being executed in parallel. We propose a new micro-architecture design which extends the superscalar pipeline with a data-flow pipeline where the dataflow part identifies immediately dependent instructions and executes them early. The dataflow pipeline is able to identify redundant instructions, track changes in the operands of the redundant instructions and execute new instructions early in case of operand change. Our design helps alleviate some of the main limitations of ILP.","abstract_html":"Modern superscalar processors are able to potentially issue and execute multiple instructions per cycle. Several techniques over the years have focused on increasing the Instruction Level Parallelism (ILP) that a processor can exploit. However, there are many limitations of ILP that hinder performance, chief of them being the chain of dependencies between instructions that stops instructions from being executed in parallel. We propose a new micro-architecture design which extends the superscalar pipeline with a data-flow pipeline where the dataflow part identifies immediately dependent instructions and executes them early. The dataflow pipeline is able to identify redundant instructions, track changes in the operands of the redundant instructions and execute new instructions early in case of operand change. Our design helps alleviate some of the main limitations of ILP.","abstract_has_math":false,"creators":["Kasad, Kurush"],"institution":null,"degree_name":"Master of Science in Computer Science (MS)","degree_level":"Open Access Master's Thesis","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:18:36Z","subjects":["Superscalar","Instruction Reuse","Eager Execution","Instruction Level Parallelism","Computer and 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/1394"],"render_values":[{"text":"https://digitalcommons.mtu.edu/etdr/1394","href":"https://digitalcommons.mtu.edu/etdr/1394","code":true}]}],"person_identifier_entries":[]},"links":{"outbound_url":"https://doi.org/10.37099/mtu.dc.etdr/1394","outbound_label":"DOI","outbound_source":"dc:identifier","record_url":"https://doi.org/10.37099/mtu.dc.etdr/1394","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-2500","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":["Kasad, Kurush"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.created","label":"Dc Date Created","values":["2022-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 Master's Thesis"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Master of Science in Computer Science (MS)"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Superscalar","Instruction Reuse","Eager Execution","Instruction Level Parallelism","Computer and 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/1394","https://digitalcommons.mtu.edu/etdr/1394"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["Modern superscalar processors are able to potentially issue and execute multiple instructions per cycle. Several techniques over the years have focused on increasing the Instruction Level Parallelism (ILP) that a processor can exploit. However, there are many limitations of ILP that hinder performance, chief of them being the chain of dependencies between instructions that stops instructions from being executed in parallel. We propose a new micro-architecture design which extends the superscalar pipeline with a data-flow pipeline where the dataflow part identifies immediately dependent instructions and executes them early. The dataflow pipeline is able to identify redundant instructions, track changes in the operands of the redundant instructions and execute new instructions early in case of operand change. Our design helps alleviate some of the main limitations of ILP."]},{"key":"dc:title","label":"Title","values":["Eager Scheduling of Dependent Instructions"]}]}],"canonical_facts":{"dc:contributor":["Soner Onder"],"dc:contributor.committeemember":["Zhenlin Wang","Jianhui Yue","David Whalley"],"dc:creator":["Kasad, Kurush"],"dc:date.created":["2022-01-01T08:00:00Z"],"dc:description.abstract":["Modern superscalar processors are able to potentially issue and execute multiple instructions per cycle. Several techniques over the years have focused on increasing the Instruction Level Parallelism (ILP) that a processor can exploit. However, there are many limitations of ILP that hinder performance, chief of them being the chain of dependencies between instructions that stops instructions from being executed in parallel. We propose a new micro-architecture design which extends the superscalar pipeline with a data-flow pipeline where the dataflow part identifies immediately dependent instructions and executes them early. The dataflow pipeline is able to identify redundant instructions, track changes in the operands of the redundant instructions and execute new instructions early in case of operand change. Our design helps alleviate some of the main limitations of ILP."],"dc:identifier":["10.37099/mtu.dc.etdr/1394","https://digitalcommons.mtu.edu/etdr/1394"],"dc:rights.license":["http://creativecommons.org/licenses/by/4.0/"],"dc:subject":["Superscalar","Instruction Reuse","Eager Execution","Instruction Level Parallelism","Computer and Systems Architecture"],"dc:title":["Eager Scheduling of Dependent Instructions"],"thesis:degree_discipline":["Department of Computer Science"],"thesis:degree_level":["Open Access Master's Thesis"],"thesis:degree_name":["Master of Science in Computer Science (MS)"]},"updated_at":"2026-11-19T08:18:36Z"}