WEKO3
-
RootNode
アイテム
Scalable Work Stealing of Native Threads on an x86-64 Infiniband Cluster
https://ipsj.ixsq.nii.ac.jp/records/158050
https://ipsj.ixsq.nii.ac.jp/records/15805029e6634f-1a8d-49bf-af5e-ad7ec3cde42c
名前 / ファイル | ライセンス | アクション |
---|---|---|
![]() |
Copyright (c) 2016 by the Information Processing Society of Japan
|
|
オープンアクセス |
Item type | Trans(1) | |||||||||
---|---|---|---|---|---|---|---|---|---|---|
公開日 | 2016-03-08 | |||||||||
タイトル | ||||||||||
タイトル | Scalable Work Stealing of Native Threads on an x86-64 Infiniband Cluster | |||||||||
タイトル | ||||||||||
言語 | en | |||||||||
タイトル | Scalable Work Stealing of Native Threads on an x86-64 Infiniband Cluster | |||||||||
言語 | ||||||||||
言語 | eng | |||||||||
キーワード | ||||||||||
主題Scheme | Other | |||||||||
主題 | [高性能計算] task parallelism, lightweight multithreading, thread migration, inter-node work stealing, remote direct memory access, Infiniband | |||||||||
資源タイプ | ||||||||||
資源タイプ識別子 | http://purl.org/coar/resource_type/c_6501 | |||||||||
資源タイプ | journal article | |||||||||
著者所属 | ||||||||||
The University of Tokyo | ||||||||||
著者所属 | ||||||||||
The University of Tokyo | ||||||||||
著者所属(英) | ||||||||||
en | ||||||||||
The University of Tokyo | ||||||||||
著者所属(英) | ||||||||||
en | ||||||||||
The University of Tokyo | ||||||||||
著者名 |
Shigeki, Akiyama
× Shigeki, Akiyama
× Kenjiro, Taura
|
|||||||||
著者名(英) |
Shigeki, Akiyama
× Shigeki, Akiyama
× Kenjiro, Taura
|
|||||||||
論文抄録 | ||||||||||
内容記述タイプ | Other | |||||||||
内容記述 | Task parallelism on large-scale distributed memory environments is still a challenging problem. The focuses of our work are flexibility of task model and scalability of inter-node load balancing. General task models provide functionalities for suspending and resuming tasks at any program point, and such a model enables us flexible task scheduling to achieve higher processor utilization, locality-aware task placement, etc. To realize such a task model, we have to employ a thread―an execution context containing register values and stack frames―as a representation of a task, and implement thread migration for inter-node load balancing. However, an existing thread migration scheme, iso-address, has a scalability limitation: it requires virtual memory proportional to the number of processors in each node. In large-scale distributed memory environments, this results in a huge virtual memory usage beyond the virtual address space limit of current 64bit CPUs. Furthermore, this huge virtual memory consumption makes it impossible to implement one-sided work stealing with Remote Direct Memory Access (RDMA) operations. One-sided work stealing is a popular approach to achieving high efficiency of load balancing; therefore this also limits scalability of distributed memory task parallelism. In prior work, we propose uni-address, a new thread migration scheme which significantly reduces virtual memory usage for thread stacks and enables RDMA-based work stealing, and implements a lightweight multithread library supporting RDMA-based work stealing on top of Fujitsu FX10 system. In this paper, we port the library to an x86-64 Infiniband cluster with GASNet communication library. We develop one-sided and non one-sided implementations of inter-node work stealing, and evaluate the performance and efficiency of the work stealing implementations. \n------------------------------ This is a preprint of an article intended for publication Journal of Information Processing(JIP). This preprint should not be cited. This article should be cited as: Journal of Information Processing Vol.24(2016) No.3(online) ------------------------------ |
|||||||||
論文抄録(英) | ||||||||||
内容記述タイプ | Other | |||||||||
内容記述 | Task parallelism on large-scale distributed memory environments is still a challenging problem. The focuses of our work are flexibility of task model and scalability of inter-node load balancing. General task models provide functionalities for suspending and resuming tasks at any program point, and such a model enables us flexible task scheduling to achieve higher processor utilization, locality-aware task placement, etc. To realize such a task model, we have to employ a thread―an execution context containing register values and stack frames―as a representation of a task, and implement thread migration for inter-node load balancing. However, an existing thread migration scheme, iso-address, has a scalability limitation: it requires virtual memory proportional to the number of processors in each node. In large-scale distributed memory environments, this results in a huge virtual memory usage beyond the virtual address space limit of current 64bit CPUs. Furthermore, this huge virtual memory consumption makes it impossible to implement one-sided work stealing with Remote Direct Memory Access (RDMA) operations. One-sided work stealing is a popular approach to achieving high efficiency of load balancing; therefore this also limits scalability of distributed memory task parallelism. In prior work, we propose uni-address, a new thread migration scheme which significantly reduces virtual memory usage for thread stacks and enables RDMA-based work stealing, and implements a lightweight multithread library supporting RDMA-based work stealing on top of Fujitsu FX10 system. In this paper, we port the library to an x86-64 Infiniband cluster with GASNet communication library. We develop one-sided and non one-sided implementations of inter-node work stealing, and evaluate the performance and efficiency of the work stealing implementations. \n------------------------------ This is a preprint of an article intended for publication Journal of Information Processing(JIP). This preprint should not be cited. This article should be cited as: Journal of Information Processing Vol.24(2016) No.3(online) ------------------------------ |
|||||||||
書誌レコードID | ||||||||||
収録物識別子タイプ | NCID | |||||||||
収録物識別子 | AA11833852 | |||||||||
書誌情報 |
情報処理学会論文誌コンピューティングシステム(ACS) 巻 9, 号 1, 発行日 2016-03-08 |
|||||||||
ISSN | ||||||||||
収録物識別子タイプ | ISSN | |||||||||
収録物識別子 | 1882-7829 | |||||||||
出版者 | ||||||||||
言語 | ja | |||||||||
出版者 | 情報処理学会 |