2002 Fiscal Year Final Research Report Summary
Adaptive Software Substrate for High Performance Wide Area Computing
| Project/Area Number |
12308012
|
|---|
| Research Category |
Grant-in-Aid for Scientific Research (A)
|
| Allocation Type | Single-year Grants |
|---|
| Section | 一般 |
|---|
| Research Field |
計算機科学
|
|---|
| Research Institution | THE UNIVERSITY OF TOKYO |
|---|
Principal Investigator |
YONEZAWA Akinori The University of Tokyo, Graduate School of Information Science and Technology, Professor, 大学院・情報学環, 教授 (00133116)
|
|---|
| Co-Investigator(Kenkyū-buntansha) |
MASUHARA Hidehiko The University of Tokyo, Graduate School of Arts and Sciences, Associate Professor, 大学院・総合文化研究科, 助教授 (40280937)
SUMII Eijirou The University of Tokyo, Interfaculty Initiative in Information Studies, Research Associate, 大学院・情報学環, 助手 (00333550)
TAURA Kenjirou The University of Tokyo, Graduate School of Information Science and Technology, Associate Professor, 大学院・情報理工学系研究科, 助教授 (90282714)
KOBAYASHI Naoki Tokyo Institute of Technology, Graduate School of Information Science and Engineering, Associate Professor, 大学院・情報理工学研究科, 助教授 (00262155)
|
|---|
| Project Period (FY) |
2000 – 2002
|
| Keywords | Grid Computing / adaptive / Software Substrate / Web Crawling |
|---|
| Research Abstract |
The objective of this project was to establish foundations for building adaptive runtime systems, which behave well under various resource conditions (of CPU, memory, and network) that reveal at runtime. Main results are as follows, (1) We established an efficient access control (e.g., mutual exclusion) method for shared data, which adapts to the degree of parallelism in the application (published in ACM PaCT). (2) We proposed a framework in which parallel applications can migrate from a set of resources to another at runtime, depending on resource conditions (published or to be published in ACM PPoPP and ACM/IEEE CCGrid). (3) We tackled the resource selection problem in which the system, given computation/communication requirements of the application and computation/communication capacity of available resources, tries to select good resources for the application automatically. It proposed the problem formulation, an algorithm assuming resource requirements and conditions do not change over time, and conducted a simulation. (4) We established a dynamic memory management scheme that can trade thread-level locality of allocated memory and the total memory requirements. (5) We achieved a very short pause time (less than 10ms) for conservative garbage collectors, which have been considered to be difficult in the community (published in ACM ISMM).
|
Research Products
(12 results)
