東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Active Global Address Space: A Globa...

Kulkarni, Abhishek.

FindBook

Google Book

Amazon

博客來

Active Global Address Space: A Global Memory Model for Adaptive Extreme-Scale Execution.

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Active Global Address Space: A Global Memory Model for Adaptive Extreme-Scale Execution./
作者:	Kulkarni, Abhishek.
出版者:	Ann Arbor : ProQuest Dissertations & Theses, : 2018,
面頁冊數:	163 p.
附註:	Source: Dissertations Abstracts International, Volume: 79-11, Section: B.
Contained By:	Dissertations Abstracts International79-11B.
標題:	Information Technology. -
電子資源:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=10745335
ISBN:	9780355934595

Active Global Address Space: A Global Memory Model for Adaptive Extreme-Scale Execution.
Kulkarni, Abhishek.

Active Global Address Space: A Global Memory Model for Adaptive Extreme-Scale Execution. - Ann Arbor : ProQuest Dissertations & Theses, 2018 - 163 p.

Source: Dissertations Abstracts International, Volume: 79-11, Section: B.

Thesis (Ph.D.)--Indiana University, 2018.

This item must not be added to any third party search indexes.

As the leading edge of high-performance computing advances forward, supercomputers continue to increase rapidly in scale and complexity. To support the evolving architectural trends, an emerging class of runtime systems are centered around the asynchronous, massively multi-threaded model of computation in which lightweight threads operate on data residing in globally shared memory. Global shared memory has well-proven benefits as it provides an abstraction of unified, contiguous memory space on top of distributed memory hardware. Prior approaches to global memory, however, have either been purely static (e.g. partitioned global address space) or plagued by performance issues related to granularity and coherence (e.g. distributed shared memory). Furthermore, maintaining a scalable high- performance virtual global address space using distributed memory hardware has proven to be challenging, particularly in the case of migrating data and dynamic system configurations. This thesis implements an active global address space (AGAS) where data residing in memory can actively migrate from one node to another while retaining its global address. The virtualization of memory resource in the global memory hierarchy provides several key capabilities to the runtime system. Most important of them all, transparent migration of global data, allows the runtime system to optimize locality of execution and remain resilient against faults. This thesis explores several possible models and implementations of global virtual memory in the form of AGAS-both in software and hardware-and develops algorithms and criteria for correctness of execution in presence of concurrently migrating data. In particular, the software implementations make use of concurrent lock-free data structures and lazy cache-coherence protocols to achieve high performance, whereas techniques such as reference counting and message forwarding ensure safe access to migrating data. Hardware-assisted global addressing will play a crucial role in next-generation HPC systems. To that end, this thesis demonstrates a novel scheme to implement AGAS in the network fabric by offloading global addressing to network switches. These ideas have been implemented in the context of High Performance ParalleX (HPX-5), a novel runtime system suited for massive-scale parallel execution. As the dynamic execution capability afforded by AGAS comes at a potential price, one of the important goals of this thesis is to quantify the overhead and opportunity cost of dynamic data and contrast it against the benefits offered by load balancing. We analyze several HPX-5 applications to characterize global data access patterns and understand the nature of load imbalance. Finally, we develop a dynamic load balancing framework in HPX- 5 that relies on novel schemes to automatically migrate data in AGAS, and demonstrate that it helps improve performance of certain applications by up to 30%.

ISBN: 9780355934595Subjects--Topical Terms:

1030799
Information Technology.

Active Global Address Space: A Global Memory Model for Adaptive Extreme-Scale Execution.
LDR:04113nmm a2200337 4500 001 2207786
005 20190923114231.5
008 201008s2018 ||||||||||||||||| ||eng d
020 $a 9780355934595
035 $a (MiAaPQ)AAI10745335
035 $a (MiAaPQ)indiana:15092
035 $a AAI10745335
040 $a MiAaPQ $c MiAaPQ
100 1 $a Kulkarni, Abhishek. $3 3434791
245 1 0 $a Active Global Address Space: A Global Memory Model for Adaptive Extreme-Scale Execution.
260 1 $a Ann Arbor : $b ProQuest Dissertations & Theses, $c 2018
300 $a 163 p.
500 $a Source: Dissertations Abstracts International, Volume: 79-11, Section: B.
500 $a Publisher info.: Dissertation/Thesis.
500 $a Advisor: Lumsdaine, Andrew.
502 $a Thesis (Ph.D.)--Indiana University, 2018.
506 $a This item must not be added to any third party search indexes.
506 $a This item must not be sold to any third party vendors.
520 $a As the leading edge of high-performance computing advances forward, supercomputers continue to increase rapidly in scale and complexity. To support the evolving architectural trends, an emerging class of runtime systems are centered around the asynchronous, massively multi-threaded model of computation in which lightweight threads operate on data residing in globally shared memory. Global shared memory has well-proven benefits as it provides an abstraction of unified, contiguous memory space on top of distributed memory hardware. Prior approaches to global memory, however, have either been purely static (e.g. partitioned global address space) or plagued by performance issues related to granularity and coherence (e.g. distributed shared memory). Furthermore, maintaining a scalable high- performance virtual global address space using distributed memory hardware has proven to be challenging, particularly in the case of migrating data and dynamic system configurations. This thesis implements an active global address space (AGAS) where data residing in memory can actively migrate from one node to another while retaining its global address. The virtualization of memory resource in the global memory hierarchy provides several key capabilities to the runtime system. Most important of them all, transparent migration of global data, allows the runtime system to optimize locality of execution and remain resilient against faults. This thesis explores several possible models and implementations of global virtual memory in the form of AGAS-both in software and hardware-and develops algorithms and criteria for correctness of execution in presence of concurrently migrating data. In particular, the software implementations make use of concurrent lock-free data structures and lazy cache-coherence protocols to achieve high performance, whereas techniques such as reference counting and message forwarding ensure safe access to migrating data. Hardware-assisted global addressing will play a crucial role in next-generation HPC systems. To that end, this thesis demonstrates a novel scheme to implement AGAS in the network fabric by offloading global addressing to network switches. These ideas have been implemented in the context of High Performance ParalleX (HPX-5), a novel runtime system suited for massive-scale parallel execution. As the dynamic execution capability afforded by AGAS comes at a potential price, one of the important goals of this thesis is to quantify the overhead and opportunity cost of dynamic data and contrast it against the benefits offered by load balancing. We analyze several HPX-5 applications to characterize global data access patterns and understand the nature of load imbalance. Finally, we develop a dynamic load balancing framework in HPX- 5 that relies on novel schemes to automatically migrate data in AGAS, and demonstrate that it helps improve performance of certain applications by up to 30%.
590 $a School code: 0093.
650 4 $a Information Technology. $3 1030799
650 4 $a Computer science. $3 523869
690 $a 0489
690 $a 0984
710 2 $a Indiana University. $b Computer Sciences. $3 1018516
773 0 $t Dissertations Abstracts International $g 79-11B.
790 $a 0093
791 $a Ph.D.
792 $a 2018
793 $a English
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=10745335