Adaptive Software Substrate for High Performance Wide Area Computing

用于高性能广域计算的自适应软件底层

• 批准号: 12308012
• 负责人: YONEZAWA Akinori
• 金额: $ 26.32万
• 依托单位: THE UNIVERSITY OF TOKYO
• 依托单位国家: 日本
• 项目类别: Grant-in-Aid for Scientific Research (A)
• 财政年份: 2000
• 资助国家: 日本
• 起止时间: 2000 至 2002
• 项目状态: 已结题
• 来源: https://kaken.nii.ac.jp/grant/KAKENHI-PROJECT-12308012/
• 关键词: Grid Computing; adaptive; Software Substrate; Web Crawling; 自動並列化; 動的負荷分散; 自己組織化ネットワーク; 並列言語; 排他制御; 共有メモリ; 並列メモリ管理; 並列GC; 性能予測モデル; 適応的計算; タスク配置; 並列・分散ごみ集め; 性能予測; ボトルネック; プログラム特化; 動的コード生成

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).

该项目的目的是为建立自适应运行时系统建立基础，这些系统在运行时揭示的各种资源条件（CPU，内存和网络）的表现很好。主要结果如下，（1）我们为共享数据建立了有效的访问控制（例如，相互排除）方法，该方法适应了应用程序中的并行度（以ACM PACT发布）。 （2）我们提出了一个框架，该框架可以在运行时从一组资源迁移到另一组资源，具体取决于资源条件（发布或发布在ACM PPOPP和ACM/IEEE CCGRID中）。 （3）我们解决了资源选择问题，在该问题中，给定应用程序的计算/通信要求以及可用资源的计算/通信能力，试图自动为应用程序选择良好的资源。它提出了问题制定，假设资源需求和条件不会随着时间而变化并进行仿真的算法。 （4）我们建立了一个动态内存管理方案，该方案可以交易分配的内存和总内存要求的线程级别。 （5）对于保守的垃圾收集者，我们的停顿时间很短（少于10毫秒），这在社区中被认为很困难（以ACM ISMM出版）。

项目成果

Toshio Endo, Kenjiro Taura: "Locality - aware parallel BIBOP memory allocator on shared memory parallel machines"JSPP. (2001)

Toshio Endo、Kenjiro Taura：“共享内存并行机上的局部性感知并行 BIBOP 内存分配器”JSPP。

Kenji Kaneda, Kenjiro Taura, Akinori Yonezawa: "Virtual Private Grid ; A command shell for utilizinghundreds of machines efficiently"ACM International Symposium on Cluster Computing and the Grid (CCGrid2002).

Kenji Kaneda、Kenjiro Taura、Akinori Yonezawa：“虚拟专用网格；有效利用数百台机器的命令外壳”ACM 国际集群计算和网格研讨会 (CCGrid2002)。

Kenjiro Taura, Kenji Kaneda, Toshio Endo, Akinori Yonezawa: "Phoenix : a parallel programming model for accommodating dynamically joining/leaving resources"ACM SGPLAN symposium on Principles and Practice of Parallel Programming (PPoPP 2003).

Kenjiro Taura、Kenji Kaneda、Toshio Endo、Akinori Yonezawa：“Phoenix：一种用于容纳动态加入/离开资源的并行编程模型”ACM SGPLAN 并行编程原理与实践研讨会（PPoPP 2003）。

Yoshihiro Oyama, Kenjiro Taura, Akinori Yonezawa: "Fusion of concurrent invocations of exclusive Methods"Proceedings of 6th International Conference on Parallel Computing Technologies (PaCT 2001) volume 2127 of Lecture Notes in Computer Science. 2127. 293

Yoshihiro Oyama、Kenjiro Taura、Akinori Yonezawa：“专有方法的并发调用的融合”第六届国际并行计算技术会议 (PaCT 2001) 计算机科学讲义第 2127 卷的会议记录。

Kenjiro Taura, Andrew Chien: "A heuristic algorithm for mapping communicating tasks on heterogeneous resources"Heterogeneous Computing Workshop, 2000. (2000)

Kenjiro Taura、Andrew Chien：“一种用于在异构资源上映射通信任务的启发式算法”异构计算研讨会，2000 年。(2000)