Performance Analysis of Parallel Database in Grid
This paper presents a grid frame composed of a preprocessing database server and PC nodes. It divides the whole database into different parts for different PC nodes, where the corresponding data are stored. The server is responsible for the clients interaction, order partition and management of the whole grid. It implements the parallel database in grid. The paper calculates the execution time of the operation in parallel database. It deduces the formula of the speedup, considering the network and the data interaction. The method derives the maximum of the speedup by calculating its limit in ideal state. Then for the fixed database size, with the number of grid processor nodes growing and the complexity of the database operation increasing, the speedup of this grid frame achieves its maximum value.
Speedup parallel computing database grid
Wu Weining Song Guozhi Li Xingang
School of Computer Science and Technology, Harbin Institute of Technology, No.92, West Dazhi Street, School of Computer Science & Software Engineering,Tianjin Polytechnic University, No.63 Chenglin Roa Smart Structures and Advanced Composites Laboratory, Harbin Engineering University, Harbin, China
国际会议
2010 International Conference on Computer and Information Application(2010年计算机与信息应用国际会议 ICCIA 2010)
天津
英文
323-325
2010-12-03(万方平台首次上网日期,不代表论文的发表时间)