完整後設資料紀錄
| DC 欄位 | 值 | 語言 |
|---|---|---|
| dc.contributor.author | Vyas, Ashutosh | |
| dc.contributor.author | Maloo, Raghvendra | |
| dc.contributor.author | Gupta, P. | |
| dc.date.accessioned | 2009-06-02T06:19:32Z | |
| dc.date.accessioned | 2020-05-25T06:38:39Z | - |
| dc.date.available | 2009-06-02T06:19:32Z | |
| dc.date.available | 2020-05-25T06:38:39Z | - |
| dc.date.issued | 2006-10-25T07:18:45Z | |
| dc.date.submitted | 2000-12-08 | |
| dc.identifier.uri | http://dspace.lib.fcu.edu.tw/handle/2377/2514 | - |
| dc.description.abstract | In this paper, we have proposed a cost-optimal parallel algorithm to nd the solution of n simulta- neous linear equations on RCC-FULL (N;L) net- work. The algorithm is designed following the strat- egy of the sequential Gaussian Elimination algo- rithm. The algorithm utilizes strength of the RCC- FULL network which helps to reduce the time com- plexiety and has the time complexity of O(n) with O(n²) processors. | |
| dc.description.sponsorship | 中正大學,嘉義縣 | |
| dc.format.extent | 6p. | |
| dc.format.extent | 160932 bytes | |
| dc.format.mimetype | application/pdf | |
| dc.language.iso | zh_TW | |
| dc.relation.ispartofseries | 2000 ICS會議 | |
| dc.subject.other | Communication and Interconnection Networks | |
| dc.title | Cost-Optimal Gaussian Elimination Algorithm on RCC-Full | |
| 分類: | 2000年 ICS 國際計算機會議 | |
文件中的檔案：
| 檔案 | 描述 | 大小 | 格式 | |
|---|---|---|---|---|
| ce07ics002000000022.pdf | 157.16 kB | Adobe PDF | 檢視/開啟 |
在 DSpace 系統中的文件，除了特別指名其著作權條款之外，均受到著作權保護，並且保留所有的權利。