| Project/Area Number |
12558027
|
|---|
| Research Category |
Grant-in-Aid for Scientific Research (B)
|
| Allocation Type | Single-year Grants |
|---|
| Section | 展開研究 |
|---|
| Research Field |
計算機科学
|
|---|
| Research Institution | KYOTO UNIVERSITY |
|---|
Principal Investigator |
TOMITA Shinji Kyoto Univ., Graduate School of Informatics, Prof., 情報学研究科, 教授 (40026323)
|
|---|
| Co-Investigator(Kenkyū-buntansha) |
NAKASHIMA Yasuhiko Kyoto Univ., Graduate School of Economics, Assoc. Prof., 経済学研究科, 助教授 (00314170)
MORI Shinichiro Kyoto Univ., Graduate School of Informatics, Assoc. Prof., 情報学研究科, 助教授 (20243058)
KITAMURA Toshiaki Kyoto Univ., Center for Information and Multimedia Studies, Assoc. Prof., 総合情報メディアセンター, 助教授 (10324683)
TSUMURA Tomoaki Kyoto Univ., Graduate School of Economics, Assoc., 経済学研究科, 助手 (00335233)
GOSHIMA Masahiro Kyoto Univ., Graduate School of Informatics, Assoc., 情報学研究科, 助手 (90283639)
|
|---|
| Project Period (FY) |
2000 – 2001
|
| Project Status |
Completed (Fiscal Year 2001)
|
| Budget Amount *help |
¥12,600,000 (Direct Cost: ¥12,600,000)
Fiscal Year 2001: ¥7,000,000 (Direct Cost: ¥7,000,000)
Fiscal Year 2000: ¥5,600,000 (Direct Cost: ¥5,600,000)
|
|---|
| Keywords | Load Distribution / Computer Cluster / Network Computing / Distributed Shared Memory / Distributed Operating System / Cache / Memory Management / Optical LAN / 並列処理 / 動的負荷分散 / マイグレーション / スーパーコンピューティング / 光接続 / 専用通信ハードウェア / ネットワーク・コンピューティング |
|---|
| Research Abstract |
1. Load Balancing Mechanism
A fundamental protocol for work migration was developed. In this protocol, exactly the minimum amount of private information, like a stack, necessary to resume execution at the destination node is migrated, so that it could reduce the time until the work resumes execution. The rest of information is declared as temporary shared region between source and destination nodes of the migration and is kept not transferred until it is accessed. When it is accessed, a small amount of data close to the accessed address is transferred as a cached copy of shared data.
Then, we proposed the implementation that the work migration mechanism maintains some amount of memory space for its own use and it immediately assigns only a constant amount of area out of this space to the immigrant without any negotiation with a memory management mechanism.
In addition, we proposed the difference transportation method to reduce needless data transfer. When the work migration happens between two nodes in back and forth fashion, by using the past history, this method extracts the difference of the contexts between two nodes and applies a patch using the difference.
2. Computer Colony Experimental Environment
As a prototype environment, a simple shared memory environment where two workstations eauipped with SPARC version LINUX were connected by the originally developed network interface cards which efficiently support shared virtual memory. In order to realize user-level access to this card, we have modified the Linux kernel briefly.
The result of the evaluation of the speed of a fine grain local shared memory access said that the user-level access is about eight times faster than the access through system call. It is also found that the average latency of remote memory access became 2.7 and 2.3 microseconds for Read and Write accesses respectively.
|
