東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Scalable dynamic multi-resource allo...

Wang, Xiaodong.

FindBook

Google Book

Amazon

博客來

Scalable dynamic multi-resource allocation in multicore systems.

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Scalable dynamic multi-resource allocation in multicore systems./
作者:	Wang, Xiaodong.
出版者:	Ann Arbor : ProQuest Dissertations & Theses, : 2017,
面頁冊數:	164 p.
附註:	Source: Dissertation Abstracts International, Volume: 78-06(E), Section: B.
Contained By:	Dissertation Abstracts International78-06B(E).
標題:	Computer engineering. -
電子資源:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=10253243
ISBN:	9781369560688

Scalable dynamic multi-resource allocation in multicore systems.
Wang, Xiaodong.

Scalable dynamic multi-resource allocation in multicore systems. - Ann Arbor : ProQuest Dissertations & Theses, 2017 - 164 p.

Source: Dissertation Abstracts International, Volume: 78-06(E), Section: B.

Thesis (Ph.D.)--Cornell University, 2017.

Designing chip multiprocessors (CMPs) that scale to more than a handful of cores is an important goal for the upcoming technology generations. A challenge to scalability is the fact that these cores will inevitably share hardware resources, whether it be on-chip storage, memory bandwidth, the chip's power budget, etc. Efficiently allocating those shared resources across cores is critical to optimize CMP executions. Techniques proposed in the literature often rely on global, centralized mechanisms that seek to maximize system throughput. Global optimization may hurt scalability: as more cores are integrated on a die, the search space grows exponentially, making it harder to achieve optimal or even acceptable operating points at run-time without incurring significant overheads. In this thesis, we present XChange, a framework for scalable resource allocation in large-scale CMPs. Inspired by market mechanisms, which are widely used in real life to allocate social resources at scale, we propose to address the resource allocation problem in large-scale CMPs as a purely dynamic, largely distributed market framework. Each shared resource is assigned a virtual price, which changes over time to reflect its supply-demand relationship. Cores in the CMP act as market players: they seek to maximize their own utilities by bidding for shared resources within their budgets. Because each core works largely independently, the resource allocation becomes a scalable, mostly distributed decision-making process. Cores in the system are able to dynamically monitor and learn their own resource-performance relationship and bid accordingly---no prior knowledge of the workload characteristics is assumed. We show our market-based resource allocation mechanism delivers superior system efficiency and fairness against existing proposals. This approach is purely empirical, however, and thus it does not provide any guarantees on the loss of efficiency and fairness. It is well known, for example, that market mechanisms in equilibrium can sometimes be highly inefficient---this is known as Tragedy of Commons. Therefore, we study the theoretic properties of our market-based approach, and establish a bound on the loss of efficiency and fairness in the market-based resource allocation, by introducing two new metrics, market utility range (MUR) and market budget range (MBR). Further, guided by such theoretic foundations, we propose ReBudget, a budget re-assignment technique that is able to systematically trade off efficiency and fairness in an adjustable manner. In the process of formulating our XChange framework, we propose novel mechanisms to support fine-grain resource management. Specifically, we propose SWAP, a scalable and fine-grain cache management technique that seamlessly combines set and way partitioning. By cooperatively managing cache ways and sets, SWAP ("Set and WAy Partitioning") can successfully provide hundreds of fine-grained cache partitions for the manycore era. We implement SWAP as a user-space management thread on Cavium's ThunderX, a real server-grade 48-core processor, and we show that SWAP significantly improves system throughput by twice as much speedup as what we can obtain by using only ThunderX's way partitioning mechanism. This was a collaboration with Cavium engineers.

ISBN: 9781369560688Subjects--Topical Terms:

621879
Computer engineering.

Scalable dynamic multi-resource allocation in multicore systems.
LDR:04215nmm a2200289 4500 001 2125860
005 20171113103033.5
008 180830s2017 ||||||||||||||||| ||eng d
020 $a 9781369560688
035 $a (MiAaPQ)AAI10253243
035 $a AAI10253243
040 $a MiAaPQ $c MiAaPQ
100 1 $a Wang, Xiaodong. $3 1262922
245 1 0 $a Scalable dynamic multi-resource allocation in multicore systems.
260 1 $a Ann Arbor : $b ProQuest Dissertations & Theses, $c 2017
300 $a 164 p.
500 $a Source: Dissertation Abstracts International, Volume: 78-06(E), Section: B.
500 $a Adviser: Jose F. Martinez.
502 $a Thesis (Ph.D.)--Cornell University, 2017.
520 $a Designing chip multiprocessors (CMPs) that scale to more than a handful of cores is an important goal for the upcoming technology generations. A challenge to scalability is the fact that these cores will inevitably share hardware resources, whether it be on-chip storage, memory bandwidth, the chip's power budget, etc. Efficiently allocating those shared resources across cores is critical to optimize CMP executions. Techniques proposed in the literature often rely on global, centralized mechanisms that seek to maximize system throughput. Global optimization may hurt scalability: as more cores are integrated on a die, the search space grows exponentially, making it harder to achieve optimal or even acceptable operating points at run-time without incurring significant overheads. In this thesis, we present XChange, a framework for scalable resource allocation in large-scale CMPs. Inspired by market mechanisms, which are widely used in real life to allocate social resources at scale, we propose to address the resource allocation problem in large-scale CMPs as a purely dynamic, largely distributed market framework. Each shared resource is assigned a virtual price, which changes over time to reflect its supply-demand relationship. Cores in the CMP act as market players: they seek to maximize their own utilities by bidding for shared resources within their budgets. Because each core works largely independently, the resource allocation becomes a scalable, mostly distributed decision-making process. Cores in the system are able to dynamically monitor and learn their own resource-performance relationship and bid accordingly---no prior knowledge of the workload characteristics is assumed. We show our market-based resource allocation mechanism delivers superior system efficiency and fairness against existing proposals. This approach is purely empirical, however, and thus it does not provide any guarantees on the loss of efficiency and fairness. It is well known, for example, that market mechanisms in equilibrium can sometimes be highly inefficient---this is known as Tragedy of Commons. Therefore, we study the theoretic properties of our market-based approach, and establish a bound on the loss of efficiency and fairness in the market-based resource allocation, by introducing two new metrics, market utility range (MUR) and market budget range (MBR). Further, guided by such theoretic foundations, we propose ReBudget, a budget re-assignment technique that is able to systematically trade off efficiency and fairness in an adjustable manner. In the process of formulating our XChange framework, we propose novel mechanisms to support fine-grain resource management. Specifically, we propose SWAP, a scalable and fine-grain cache management technique that seamlessly combines set and way partitioning. By cooperatively managing cache ways and sets, SWAP ("Set and WAy Partitioning") can successfully provide hundreds of fine-grained cache partitions for the manycore era. We implement SWAP as a user-space management thread on Cavium's ThunderX, a real server-grade 48-core processor, and we show that SWAP significantly improves system throughput by twice as much speedup as what we can obtain by using only ThunderX's way partitioning mechanism. This was a collaboration with Cavium engineers.
590 $a School code: 0058.
650 4 $a Computer engineering. $3 621879
650 4 $a Electrical engineering. $3 649834
690 $a 0464
690 $a 0544
710 2 $a Cornell University. $b Electrical & Computer Engrng. $3 3284554
773 0 $t Dissertation Abstracts International $g 78-06B(E).
790 $a 0058
791 $a Ph.D.
792 $a 2017
793 $a English
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=10253243