{"title":"Cost-optimal Gaussian Elimination Algorithm on RCC-FULL","authors":"A. Vyas, R. Maloo, P. Gupta","doi":"10.1080/10637190310001633646","DOIUrl":null,"url":null,"abstract":"This paper presents a cost-optimal parallel algorithm to find the solution of n simultaneous linear equations on RCC-FULL λ(N, L) network. The algorithm is designed following the strategy of the sequential Gaussian Elimination algorithm. The algorithm utilizes strength of the RCC-FULL network which helps to reduce the time complexity and has the time complexity of O(n) with O(n 2) processors.","PeriodicalId":406098,"journal":{"name":"Parallel Algorithms and Applications","volume":"11 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2003-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Parallel Algorithms and Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1080/10637190310001633646","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2
Abstract
This paper presents a cost-optimal parallel algorithm to find the solution of n simultaneous linear equations on RCC-FULL λ(N, L) network. The algorithm is designed following the strategy of the sequential Gaussian Elimination algorithm. The algorithm utilizes strength of the RCC-FULL network which helps to reduce the time complexity and has the time complexity of O(n) with O(n 2) processors.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
