Near optimal Cholesky factorization on orthogonal multiprocessors

作     者：Bansal, SS Vishal, B Gupta, P 

作者机构：Indian Inst Technol Dept Comp Sci & Engn Kanpur 208016 Uttar Pradesh India 

出 版 物：《INFORMATION PROCESSING LETTERS》 (信息处理快报)

年 卷 期：2002年第84卷第1期

页      面：23-30页

核心收录：

学科分类：08[工学] 0812[工学-计算机科学与技术（可授工学、理学学位）] 

主　　题：parallel algorithms Cholesky factorization orthogonal multiprocessors 

摘      要：The effect of data allocation strategies on the running time of parallel Cholesky factorization algorithms on orthogonal multiprocessors has been studied. Four new strategies which give better running time are proposed and their time complexities are analyzed. Finally it is shown that near optimal performance can be obtained using two of our strategies. (C) 2002 Elsevier Science B.V. All rights reserved.