In this paper, we propose a parallel table compression algorithm using a WRAM of n1-ε processors. The time complexity of the algorithm is O(mnε+(s2)/(n1-ε)). Our algorithm achieves linear speedup.
You are the firstVisitors
Copyright: Institute of Software, Chinese Academy of Sciences Beijing ICP No. 05046678-4
Address:4# South Fourth Street, Zhong Guan Cun, Beijing 100190,Postal Code:100190
Phone:010-62562563 Fax:010-62562533 Email:jos@iscas.ac.cn
Technical Support:Beijing Qinyun Technology Development Co., Ltd.