| Presentation | 2007-10-18 Branch Prediction Based on Antidictionary Tree Mikihiko NISHIARA, Hiroyoshi MORITA, Takahiro OTA, |
|---|---|
| PDF Download Page |  PDF download Page Link |
| Abstract(in Japanese) | (See Japanese page) |
| Abstract(in English) | It is necessary to predict by high accuracy the results of the branch commands so as not to obstruct the speed-up of microprocessors by the pipelining. Under the condition of not putting the limitation on the computer resources Kise and Iwata [1] did the branch prediction with high accuracy by means of the technique of Jacquet et al. [2] which is based on the pattern matching. It is theoretically guaranteed that the technique of [2] is asymptotically optimal for stationary mixing sources. On the other hand, Ota and Morita [3] have proposed a modeling technique for the processing that corresponds to the pattern matching at a linear computing time by using the structure that is called an anti-dictionary tree that consists of a suffix tree and reversed MF links on it. In this research, the technique of [3] is applied to the branch prediction to obtain the same results as with [2] at a practical execution speed. As results of the experiments, the execution times are shortened from 1/50 to 1/4600 with hardly more inferior prediction accuracy than [1]. |
| Keyword(in Japanese) | (See Japanese page) |
| Keyword(in English) | Antidictionary / branch prediction / suffix tree / minimal forbidden word / pattern matching |
| Paper # | CAS2007-38,NLP2007-66 |
| Date of Issue |
| Conference Information | |
| Committee | NLP |
|---|---|
| Conference Date | 2007/10/11(1days) |
| Place (in Japanese) | (See Japanese page) |
| Place (in English) | |
| Topics (in Japanese) | (See Japanese page) |
| Topics (in English) | |
| Chair | |
| Vice Chair | |
| Secretary | |
| Assistant | |
| Paper Information | |
| Registration To | Nonlinear Problems (NLP) |
|---|---|
| Language | JPN |
| Title (in Japanese) | (See Japanese page) |
| Sub Title (in Japanese) | (See Japanese page) |
| Title (in English) | Branch Prediction Based on Antidictionary Tree |
| Sub Title (in English) | |
| Keyword(1) | Antidictionary |
| Keyword(2) | branch prediction |
| Keyword(3) | suffix tree |
| Keyword(4) | minimal forbidden word |
| Keyword(5) | pattern matching |
| 1st Author's Name | Mikihiko NISHIARA |
| 1st Author's Affiliation | Faculty of Engineering, Shinshu University() |
| 2nd Author's Name | Hiroyoshi MORITA |
| 2nd Author's Affiliation | Graduate School of Information Systems, The University of Electro-Communications |
| 3rd Author's Name | Takahiro OTA |
| 3rd Author's Affiliation | Department of Electronic Engineering, Nagano Prefectural Institute of Technology |
| Date | 2007-10-18 |
| Paper # | CAS2007-38,NLP2007-66 |
| Volume (vol) | vol.107 |
| Number (no) | 266 |
| Page | pp.pp.- |
| #Pages | 4 |
| Date of Issue | |