| Project/Area Number |
11480064
|
|---|
| Research Category |
Grant-in-Aid for Scientific Research (B).
|
| Allocation Type | Single-year Grants |
|---|
| Section | 一般 |
|---|
| Research Field |
計算機科学
|
|---|
| Research Institution | University of Tokyo |
|---|
Principal Investigator |
KITSUREGAWA Masaru University of Tokyo, Institute of Industrial Science, Professor, 生産技術研究所, 教授 (40161509)
|
|---|
| Co-Investigator(Kenkyū-buntansha) |
NEMOTO Toshihiro Univ.of Tokyo, Institute of Industrial Science, Research Associate, 生産技術研究所, 助手 (20272510)
|
|---|
| Project Period (FY) |
1999 – 2000
|
| Project Status |
Completed (Fiscal Year 2000)
|
| Budget Amount *help |
¥15,100,000 (Direct Cost: ¥15,100,000)
Fiscal Year 2000: ¥4,800,000 (Direct Cost: ¥4,800,000)
Fiscal Year 1999: ¥10,300,000 (Direct Cost: ¥10,300,000)
|
|---|
| Keywords | transaction processing / speculative processing / distributed DBMS processing |
|---|
| Research Abstract |
In this research, we propose the speculation processing mechanism in order to accelerate the run time performance (throughput and response time) drastically.
At the first year, we considered the speculative protocol mechanism and the implementation issues of our proposed protocol on distributed transaction processing by simulation. We put the speculative lock mechanism into the usual 2 phase locking protocol and added the speculative lock as a new mode. We investigated the selializability correctness of our speculative lock mechanism. Then, we simulated our speculative protocol under unlimited resources (number of CPU, memory size and number of threads) and reported the upper limit of performance improvement.
At the second year, we simulated the speculative protocol under limited resources such as memory size and the number of transaction threads by varying the number of remote data, the distribution of access, the execution time of transaction processing, the occurencey of transaction, the latency of network and the number of nodes. From these simulation results, the performance of speculative protocol under limited resources is almost similar to that under unlimited resources.
|
