基于RCC-FULL的成本最优高斯消去算法

Parallel Algorithms and Applications Pub Date : 2003-12-01 DOI:10.1080/10637190310001633646

A. Vyas, R. Maloo, P. Gupta

{"title":"基于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":"{\"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}","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

摘要

本文提出了一种求解RCC-FULL λ(n, L)网络上n个联立线性方程组的代价最优并行算法。该算法遵循序贯高斯消去算法的设计策略。该算法利用了RCC-FULL网络的优势，有助于降低时间复杂度，在O(n 2)个处理器的情况下，时间复杂度为O(n)。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Cost-optimal Gaussian Elimination Algorithm on RCC-FULL

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.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Parallel Algorithms and Applications

自引率

0.00%

发文量