| Project/Area Number |
13680389
|
|---|
| Research Category |
Grant-in-Aid for Scientific Research (C)
|
| Allocation Type | Single-year Grants |
|---|
| Section | 一般 |
|---|
| Research Field |
計算機科学
|
|---|
| Research Institution | University of Tsukuba |
|---|
Principal Investigator |
MAEDA Atusi University of Tsukuba, Institute of Information Science and Electronics, Associate Professor, 電子・情報工学系, 助教授 (50293139)
|
|---|
| Co-Investigator(Kenkyū-buntansha) |
YAMAGUCHI Yoshinori University of Tsukuba, Institute of Information Science and Electronics, Professor, 電子・情報工学系, 教授 (00312827)
MATSUI Shogo Kanagawa University, Faculty of Science, Associate Professor, 理学部, 助教授 (00221581)
TANAKA Yoshio National Institute of Advanced Industrial Science and Technology, Grid Technology Research Center, Grid Infraware Team Leader, グリッド研究センター, 基盤ソフトチーム長 (10357460)
|
|---|
| Project Period (FY) |
2001 – 2003
|
| Project Status |
Completed (Fiscal Year 2003)
|
| Budget Amount *help |
¥3,500,000 (Direct Cost: ¥3,500,000)
Fiscal Year 2003: ¥1,000,000 (Direct Cost: ¥1,000,000)
Fiscal Year 2002: ¥1,000,000 (Direct Cost: ¥1,000,000)
Fiscal Year 2001: ¥1,500,000 (Direct Cost: ¥1,500,000)
|
|---|
| Keywords | Garbage Collection / Real-Time Processing / Threads / Memory Allocation / Java / 並列処理 / システムプログラム / プログラミング言語 / 言語処理系 |
|---|
| Research Abstract |
On developing GC algorithm applicable to multi-threaded, hard real-time environment, we tried two different approaches. The first approach is to make incremental mark-sweep algorithm real-time. We improved the garbage collector of jexc, a Java language implementation, so that search time of free-list for allocation be performed in bounded time, with price of possible increase of fragmentation. But fragmentation will not be a problem in practical application. We chose Snapshot-at-the-Beginning algorithm as incremental garbage collector with Return Barrier, As a result, pause time is bounded even when stack level gets increased, and achieved real-time requirement in single-threaded applications. The second approach is to combine generational garbage collector and incremental garbage collector. This novel algorithm performs major collection incrementally every time minor collection is invoked, effectively removing long pause time caused by major collection. Using this approach, we implemented and evaluated coarse-grained incremental garbage collector which is a combination of copy-based generational collector and Treadmill-based incremental collector. The result was presented in IPSJ 45th SIGPRO.Experiments show that the garbage collector achieves high CPU efficiency, with pause time acceptable for many applications, although the algorithm is not hard real-time.
|
