Project/Area Number |
18300028
|
Research Category |
Grant-in-Aid for Scientific Research (B)
|
Allocation Type | Single-year Grants |
Section | 一般 |
Research Field |
Media informatics/Database
|
Research Institution | The University of Tokyo |
Principal Investigator |
INABA Mary The University of Tokyo, 大学院・情報理工学系研究科, 准教授 (60282711)
|
Co-Investigator(Kenkyū-buntansha) |
今井 浩 東京大学, 大学院・情報理工学系研究科, 教授 (80183010)
定兼 邦彦 九州大学, システム情報科学研究科, 准教授 (20323090)
菅原 豊 東京大学, 大学院・情報理工学系研究科, 助教 (60401246)
|
Co-Investigator(Renkei-kenkyūsha) |
今井 浩 東京大学, 大学院・情報理工学系研究科, 教授 (80183010)
定兼 邦彦 国立情報学研究所, 情報学プリンシプル研究系, 准教授 (20323090)
|
Project Period (FY) |
2006 – 2009
|
Project Status |
Completed (Fiscal Year 2009)
|
Budget Amount *help |
¥17,460,000 (Direct Cost: ¥14,400,000、Indirect Cost: ¥3,060,000)
Fiscal Year 2009: ¥4,030,000 (Direct Cost: ¥3,100,000、Indirect Cost: ¥930,000)
Fiscal Year 2008: ¥4,290,000 (Direct Cost: ¥3,300,000、Indirect Cost: ¥990,000)
Fiscal Year 2007: ¥4,940,000 (Direct Cost: ¥3,800,000、Indirect Cost: ¥1,140,000)
Fiscal Year 2006: ¥4,200,000 (Direct Cost: ¥4,200,000)
|
Keywords | 超高速情報処理 / ディレクトリ・情報検索 / アルゴリズム / インターネット高速化 / コンテンツアーカイブ / ディレクトリ / インターネット高度化 |
Research Abstract |
With the progress of semiconductor process technology, memory access gap, and thus, the pipeline stall time due to cache misses are increasing. It is often observed in the real world computation that the memory band width plays the role of computation bottleneck. Thus, considering memory hierarchy, it is important to hide the memory access latency with efficient utilization of upper layer memory. In this work, we propose and evaluate a hardware solution to accelerate for full text search with compressed succinct data structure. In addition, as a by-product, we propose an efficient prefetch method using memory map data structure.
|