Disk Allocation Methods Using Genetic Algorithm

スポンサーリンク

概要

• 論文の詳細を見る

• The disk allocation problem examined in this paper is finding a method to distribute a Binary Cartesian Product File on multiple disks to maximize parallel disk I /O accesses for partial match retrieval. This problem is known to be NP-hard, and heuristic approaches have been applied to obtain suboptimal solutions. Recently, efficient methods such as Binary Disk Modulo (BDM) and Error Correcting Code (ECC) methods have been proposed along with the restrictions that the number of disks in which files are stored should be a power of 2. In this paper, a new Disk Allocation method based on Genetic Algorithm (DAGA) is proposed. The DAGA does not place restrictions on the number of disks to be applied and it can allocate the disks adaptively by taking into account the data access patterns. Using the schema theory, it is proven that the DAGA can realize a near-optimal solution with high probability. Comparing the quality of solution derived by the DAGA with the General Disk Modulo (GDM), BDM, and ECC methods through the simulation, shows that 1) the DAGA is superior to the GDM method in all the cases and 2) with the restrictions being placed on the number of disks, the average response time of the DAGA is always less than that of the BDM method and greater than that of the ECC method in the absence of data skew and 3) when data skew is considered, the DAGA performs better than or equal to both BDM and ECC methods, even when restrictions on the number of disks are enforced.

• 社団法人電子情報通信学会の論文
• 1999-01-25

著者

• Park Kyu-ho

  Computer Engineering Research Laboratory Department Of Electrical Engineering And Computer Science K

• Park Kyu-ho

  O System R&d Team

• Ahn Dae-young

  Computer Engineering Research Laboratory Department Of Electrical Engineering Korea Advanced Institu

関連論文

• A Quantum-Inspired Evolutionary Computing Algorithm for Disk Allocation Method
• Disk Allocation Methods Using Genetic Algorithm

スポンサーリンク