2006 Fiscal Year Final Research Report Summary
Research on the speculative Processing of computer systems based on the information theory approach
| Project/Area Number |
17360178
|
|---|
| Research Category |
Grant-in-Aid for Scientific Research (B)
|
| Allocation Type | Single-year Grants |
|---|
| Section | 一般 |
|---|
| Research Field |
Communication/Network engineering
|
|---|
| Research Institution | The University of Electro-Communications |
|---|
Principal Investigator |
TE Sun Han The University of Electro-Communications, Graduate School of Information Systems, Professor (80097287)
|
|---|
| Co-Investigator(Kenkyū-buntansha) |
MORITA Hiroshi The University of Electro-Communications, Graduate School of Information Systems, Professor (80166420)
NAGAOKA Hiroshi The University of Electro-Communications, Graduate School of Information Systems, Associate Professor (80192235)
NISHIARA Mikihiko The University of Electro-Communications, Graduate School of Information Systems, Research Associate (90333492)
YOSHINAGA Tsutomu The University of Electro-Communications, Graduate School of Information Systems, Associate professor (60210738)
KISE Kenji Tokyo Institute of Technology, Graduate School of Information Science and Engineering, Assistant Professor (50323887)
|
|---|
| Project Period (FY) |
2005 – 2006
|
| Keywords | Basic information theory / Information engineering / Information theory / Speculative router / Branch prediction / Model selection for predictions / Architecture design / Predictive Switching |
|---|
| Research Abstract |
This research examined the various universal data prediction techniques argued in the field of information theory as application to the speculative processing in computer systems. Two research groups, the information theory group and the computer architecture group, jointly carried out the research and build the data structure suitable for the speculative processing in computer systems. Moreover, we designed the speculation execution architecture which uses the proposed data structure, and evaluated its performance. The main results of this research are as follows.
1. Antidictionary data structure suitable for speculative processing
The compressing method called the anti-dictionary using the set of the minimum series which does not appear for a data series was examined. We present a fast and memory-efficient algorithm to construct an antidictionary for a binary string using a suffix tree. It is proved that the complexity of the algorithm is linear in space and time, and its effectiveness is demonstrated by simulation results.
2. Branch prediction for microprocessors
The branch prediction scheme using the pattern matching with a branch history and an instruction address was proposed, and its prediction accuracy was examined. We verified the good prediction accuracy of the scheme compared with the conventional branch prediction only using a branch history when there was no restriction of computational complexity or the amount of hardw are resources.
3. Switching router with predictions
In order to realize the predictive switching router which operates efficiently, we proposed the technique of reducing prediction mistake packets, and the technology of detecting and canceling a prediction mistake packet. We performed the evaluation by a simulation about the effect of predictive switching in consideration of a dynamic communication collision and verified the high performance of the proposed technique.
|
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
[Presentation] 反辞書木を用いた分岐予測手法2007
Author(s)
西新 幹彦, 森田 啓義, 太田 隆博
Organizer
電子情報通信学会技術報告, CAS2007-38
Place of Presentation
武蔵工業大学
Year and Date
20071000
Description
「研究成果報告書概要(和文)」より
-
-
-
-
-
-
-
-
[Presentation] Predictive Switching in 2-D Torus Routers2006
Author(s)
T. Yoshinaga, S. Kamakura, M. Koibuchi
Organizer
Proc. of the 9th Int. Workshop on Innovative Architecture for Future Generation High・Performance Processors and Systems(IWIA06)
Place of Presentation
IEEE-CS
Year and Date
20061200
Description
「研究成果報告書概要(欧文)」より
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
