On the Complexity of File Allocation Problem

Chen

1987

BIT

Self Cite

Section: Introductionmentioning

confidence: 98%

Section: Introductionmentioning

confidence: 99%

Performance of two-disk partition data allocations

Chen

1987

BIT

Self Cite

“…Chang and Shieh [5] have shown the difficulty of the multi-disc allocation problem to be NP-hard. Nevertheless, there are many heuristic methods to solve this problem approximately.…”

Section: Introductionmentioning

confidence: 99%

A greedy relaxed generalized disc modulo allocation method for multiple key hashing files on multi‐disc systems

Journal of the Chinese Institute of Engineers

Lee

1996

In this paper, we propose an efficient way for the arrangement of multiple key hashing (MKH) files onto a multiple disc system. We present a greedy strategy to find a proper set of parameters of a hashing function that determines the near "optimal" bucket distribution for facilitating the maximal concurrency of disc accesses. Some experimental results are given to show that our greedy method works well in general cases and can achieve the same performance as the previously proposed method, that can only be used in some restricted cases.

“…Recently, Chang and Lu [8] showed that the multi-disk data allocation problem is NP-hard. Thus it is inevitable that some heuristic method has to be used.…”

Section: Introductionmentioning

confidence: 99%

Application of principal component analysis to multi-disk concurrent accessing

1988

BIT

Self Cite

Abstract.This paper is concerned with the allocation of multi-attribute records on several disks so as to achieve high degree of concurrency of disk access when responding to partial match queries.An algorithm to distribute a set of multi-attribute records onto different disks is presented. Since our allocation method will use the principal component analysis, this concept is first introduced. We then use it to generate a set of real numbers which are the projections on the first principal component direction and can be viewed as hashing addresses.Then we propose an algorithm based upon these hashing addresses to allocate multi-attribute records onto different disks. Some experimental results show that our method can indeed be used to solve the multi-disk data allocation problem for concurrent accessing.