2026-09-18T23:59:33Zhttps://dspace.mit.edu/server/oai/requestoai:dspace.mit.edu:1721.1/551172022-01-13T07:54:29Zcom_1721.1_7582com_1721.1_7581col_1721.1_131022
Krste Asanović and Arvind.
Lee, Jae Wook, Ph. D. Massachusetts Institute of Technology
Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science.
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
2010-05-25T20:49:51Z
2010-05-25T20:49:51Z
2009
2009
http://hdl.handle.net/1721.1/55117
593360074
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2009.
Cataloged from PDF version of thesis.
Includes bibliographical references (p. 135-147).
Resource contention among concurrent threads on multicore platforms results in greater performance variability of individual threads than traditionally seen with time-multiplexed threads on single-core platforms. This performance variability makes it hard to provide performance guarantees, degrades parallel program performance, and burdens software writers by making performance tuning and load balancing more challenging. In this thesis, we propose a novel QoS framework, called Globally Synchronized frames (GSF), to combat the performance variability problem in shared memory systems. We first apply GSF to a multi-hop on-chip network to provide QoS guarantees of minimum bandwidth and maximum delay for each flow sharing the network. The GSF framework can be easily integrated with a conventional virtual channel (VC) router without significantly increasing the hardware complexity. We then present an extended version of GSF framework to provide end-to-end QoS for cache-coherent shared memory systems, which is called GSF memory system (GSFM). GSFM employs a single unified framework to manage multiple heterogeneous bandwidth resources such as on-chip networks, DRAM banks and DRAM channels, to achieve better hardware efficiency and composability towards end-to-end QoS than component-wise QoS approaches. Finally, we propose the METERG (MEasurement Time Enforcement and Runtime Guarantee) QoS framework.
(cont.) Independent of GSF, the METERG framework provides an easy method to obtain a tight estimate of the upper bound of a program's execution time for a given resource reservation setting. Our approach is based on simple measurement without involving any expensive program analysis or hardware modeling.
by Jae Wook Lee.
Ph.D.
147 p.
eng
Massachusetts Institute of Technology
M.I.T. theses are protected by
copyright. They may be viewed from this source for any purpose, but
reproduction or distribution in any format is prohibited without written
permission. See provided URL for inquiries about permission.
http://dspace.mit.edu/handle/1721.1/7582
Electrical Engineering and Computer Science.
Globally Synchronized Frames for guaranteed Quality-of-Service in shared memory systems
GSF for guaranteed QoS in shared memory systems
Thesis
application/pdf
Publication
unknown
unknown
<Publication xmlns="https://www.openaire.eu/cerif-profile/1.1/" id="6edb1528-7228-4b5c-b374-59b90c65011e">
<Type xmlns="https://www.openaire.eu/cerif-profile/vocab/COAR_Publication_Types">http://purl.org/coar/resource_type/c_1843</Type>
<Language>eng</Language>
<Title>Globally Synchronized Frames for guaranteed Quality-of-Service in shared memory systems</Title>
<Subtitle>GSF for guaranteed QoS in shared memory systems</Subtitle>
<PublishedIn>
<Publication>
</Publication>
</PublishedIn>
<PublicationDate>2009</PublicationDate>
<Authors>
<Author>
<DisplayName>Lee, Jae Wook, Ph. D. Massachusetts Institute of Technology</DisplayName>
<Affiliation>
<OrgUnit>
</OrgUnit>
</Affiliation>
</Author>
</Authors>
<Editors>
</Editors>
<Publishers>
<Publisher>
<DisplayName>Massachusetts Institute of Technology</DisplayName>
<OrgUnit />
</Publisher>
</Publishers>
<License>http://dspace.mit.edu/handle/1721.1/7582</License>
<Keyword>Electrical Engineering and Computer Science.</Keyword>
<Abstract>Resource contention among concurrent threads on multicore platforms results in greater performance variability of individual threads than traditionally seen with time-multiplexed threads on single-core platforms. This performance variability makes it hard to provide performance guarantees, degrades parallel program performance, and burdens software writers by making performance tuning and load balancing more challenging. In this thesis, we propose a novel QoS framework, called Globally Synchronized frames (GSF), to combat the performance variability problem in shared memory systems. We first apply GSF to a multi-hop on-chip network to provide QoS guarantees of minimum bandwidth and maximum delay for each flow sharing the network. The GSF framework can be easily integrated with a conventional virtual channel (VC) router without significantly increasing the hardware complexity. We then present an extended version of GSF framework to provide end-to-end QoS for cache-coherent shared memory systems, which is called GSF memory system (GSFM). GSFM employs a single unified framework to manage multiple heterogeneous bandwidth resources such as on-chip networks, DRAM banks and DRAM channels, to achieve better hardware efficiency and composability towards end-to-end QoS than component-wise QoS approaches. Finally, we propose the METERG (MEasurement Time Enforcement and Runtime Guarantee) QoS framework.</Abstract>
<Abstract>(cont.) Independent of GSF, the METERG framework provides an easy method to obtain a tight estimate of the upper bound of a program's execution time for a given resource reservation setting. Our approach is based on simple measurement without involving any expensive program analysis or hardware modeling.</Abstract>
<Access xmlns="http://purl.org/coar/access_right"
>
</Access>
</Publication>