| Project/Area Number |
12680341
|
|---|
| Research Category |
Grant-in-Aid for Scientific Research (C)
|
| Allocation Type | Single-year Grants |
|---|
| Section | 一般 |
|---|
| Research Field |
計算機科学
|
|---|
| Research Institution | Fukui University |
|---|
Principal Investigator |
TUJI Tatsuo Fukui University, Faculty of Engineering, Professor, 工学部, 教授 (80115302)
|
|---|
| Co-Investigator(Kenkyū-buntansha) |
HIGUCHI Ken Fukui Univ., Facility of Eng., Research Assoc., 工学部, 助手 (50293410)
HOCHIN Teruhisa Fukui Univ., Faculty of Eng., Associate Prof., 工学部, 助教授 (00251984)
|
|---|
| Project Period (FY) |
2000 – 2001
|
| Project Status |
Completed (Fiscal Year 2001)
|
| Budget Amount *help |
¥3,000,000 (Direct Cost: ¥3,000,000)
Fiscal Year 2001: ¥1,100,000 (Direct Cost: ¥1,100,000)
Fiscal Year 2000: ¥1,900,000 (Direct Cost: ¥1,900,000)
|
|---|
| Keywords | Complex Object / Index / Parallel Retrieval / Termination Detection / Multithread / Massively Parallel System / 超並列システム / マルチスレッド |
|---|
| Research Abstract |
In this research, we have studied parallel indexing schemes for complex objects. The following major contributions have been made.
(1) Horizontal and vertical index splitting schemes are proposed, and parallel index retrieval methods are presented and evaluated.
2) Parallel index system with online modification capability is proposed and evaluated.
(3) A parallel index retrieval scheme is provided and implemented for complex queries combined by AND, OR, NOT logical operators.
A fundamental problem on retrieval performance is recognized in the process of constructing above prototype systems. That is, many data packets of low filling up ratio are produced and the communication cost among the related processors much increases. Against this problem, we have invented a scheme of merging more than one packets into a single packet. The scheme incorporates increasing the filling up ratio of packets and effective parallel retrieval termination detecting mechanism. But it was recognized that the scheme suffers from the following drawbacks. That is, a retrieval request may be outrun by the one issued later due to the assumed asynchronous parallel retrieving environment. To incorporate an efficient termination detection scheme, the filling up ratio would be inevitably decreased and the average turnaround time would be increased due to the increase of the communication cost. Against this problem, we have proposed a implementation scheme in which the outrunning of the retrieval requests never occur by scheduling and activating a different set of machines for a new request.
We have constructed a parallel index retrieval system that incorporate the scheme and evaluated its performance.
|
