容错处理器阵列的多逻辑列并行重构算法
处理器阵列的容错重构技术是片上网络多核、众核高性能体系结构的可靠性技术之一。现有的最大逻辑阵列并行重构技术仅对单条逻辑列的构造实现了并行化,而对多条逻辑列的同步并行仍未见可行算法。依据处理器阵列的潜在并行性,在分治策略的基础上,提出了一种阵列分块的并行重构算法。算法对处理器阵列实施横向分块划分,对每个阵列块进行并行重构,并对所得逻辑子阵列进行归并,实现了多条逻辑列的同步并行重构。与现有的并行算法相比,新算法同样能够生成最大逻辑列,并且减少了通信开销与计算中的数据冗余,有效提高了运行速度。实验结果表明,在物理阵列大小为64×64的处理器阵列上,运行速度比现有并行算法提高39.55%,并且具有良好...
Saved in:
| Published in | 计算机工程与科学 Vol. 40; no. 1; pp. 24 - 33 |
|---|---|
| Main Author | |
| Format | Journal Article |
| Language | Chinese |
| Published |
广东工业大学计算机学院,广东广州,510006
2018
|
| Subjects | |
| Online Access | Get full text |
| ISSN | 1007-130X |
| DOI | 10.3969/j.issn.1007-130X.2018.01.004 |
Cover
| Abstract | 处理器阵列的容错重构技术是片上网络多核、众核高性能体系结构的可靠性技术之一。现有的最大逻辑阵列并行重构技术仅对单条逻辑列的构造实现了并行化,而对多条逻辑列的同步并行仍未见可行算法。依据处理器阵列的潜在并行性,在分治策略的基础上,提出了一种阵列分块的并行重构算法。算法对处理器阵列实施横向分块划分,对每个阵列块进行并行重构,并对所得逻辑子阵列进行归并,实现了多条逻辑列的同步并行重构。与现有的并行算法相比,新算法同样能够生成最大逻辑列,并且减少了通信开销与计算中的数据冗余,有效提高了运行速度。实验结果表明,在物理阵列大小为64×64的处理器阵列上,运行速度比现有并行算法提高39.55%,并且具有良好的可扩展性。 |
|---|---|
| AbstractList | 处理器阵列的容错重构技术是片上网络多核、众核高性能体系结构的可靠性技术之一。现有的最大逻辑阵列并行重构技术仅对单条逻辑列的构造实现了并行化,而对多条逻辑列的同步并行仍未见可行算法。依据处理器阵列的潜在并行性,在分治策略的基础上,提出了一种阵列分块的并行重构算法。算法对处理器阵列实施横向分块划分,对每个阵列块进行并行重构,并对所得逻辑子阵列进行归并,实现了多条逻辑列的同步并行重构。与现有的并行算法相比,新算法同样能够生成最大逻辑列,并且减少了通信开销与计算中的数据冗余,有效提高了运行速度。实验结果表明,在物理阵列大小为64×64的处理器阵列上,运行速度比现有并行算法提高39.55%,并且具有良好的可扩展性。 TP303; 处理器阵列的容错重构技术是片上网络多核、众核高性能体系结构的可靠性技术之一.现有的最大逻辑阵列并行重构技术仅对单条逻辑列的构造实现了并行化,而对多条逻辑列的同步并行仍未见可行算法.依据处理器阵列的潜在并行性,在分治策略的基础上,提出了一种阵列分块的并行重构算法.算法对处理器阵列实施横向分块划分,对每个阵列块进行并行重构,并对所得逻辑子阵列进行归并,实现了多条逻辑列的同步并行重构.与现有的并行算法相比,新算法同样能够生成最大逻辑列,并且减少了通信开销与计算中的数据冗余,有效提高了运行速度.实验结果表明,在物理阵列大小为64×64的处理器阵列上,运行速度比现有并行算法提高39.55％,并且具有良好的可扩展性. |
| Abstract_FL | Efficient fault-tolerant reconfiguration techniques are essential for improving the reliability of high performance architecture such as mesh-connected processor arrays.Meanwhile,reconfiguration must be achieved as fast as possible to meet the real-time constraints.Existing techniques of generating maximum logic array on parallel reconfiguration are only for the single logical column,and no maximum logic array algorithm is reported for reconfiguring multi-logical columns in parallel on processor arrays.According to the potential parallelism of mesh-connected processor arrays,based on the divide and conquer strategy,this paper proposes a parallel algorithm to reconstruct the logical array.The proposed algorithm divides processors array into subarrays,then reconfigures each subarray in parallel.After that,it merges the logical subarrays in parallel.The proposed algorithm can effectively accelerate the running speed by reducing the data redundancy in communication and calculation.Moreover,it is proved that the proposed algorithm can generate the maximum logic array.Experimental results show that the proposed algorithm is faster by nearly 39.6％ than the existing parallel algorithm on a 64× 64 processor array and has good scalability. |
| Author | 章子凯;武继刚;姜文超;刘竹松 |
| AuthorAffiliation | 广东工业大学计算机学院,广东广州510006 |
| AuthorAffiliation_xml | – name: 广东工业大学计算机学院,广东广州,510006 |
| Author_FL | ZHANG Zi-kai JIANG Wen-chao LIU Zhu-song WU Ji-gang |
| Author_FL_xml | – sequence: 1 fullname: ZHANG Zi-kai – sequence: 2 fullname: WU Ji-gang – sequence: 3 fullname: JIANG Wen-chao – sequence: 4 fullname: LIU Zhu-song |
| Author_xml | – sequence: 1 fullname: 章子凯;武继刚;姜文超;刘竹松 |
| BookMark | eNo9j71KA0EURqeIYIx5CbGx2PXOzuzMpJTgHwRsUtiFycxO3FUnmkU0nUUwFgoKSkwKQUhhlUYUguDbbJJ9CzdEbO7H_Tjcy1lBOdu0AULrGFxSYqXNyA3j2LoYgDuYwKHrARYuYBeA5lD-v19GxTgO6wDMZ8LnOI9YMhqnT_1k2Jk-3CT99_TlM7ntTQedZDhIr79nP4_Zmoy_Zm93afd-8tqZjnqTj-dVtGTkSRwU_7KAqjvb1fKeUznY3S9vVRzFsO94ASFaG9DSnw_DOHBBAuxJU1KepymWOqCqrpUnOFAFVJtAMeFx40taF6SANhZnL6U10jZqUfOiZbOHtSiOGqp9fDUXhczPz9i1BauOmrZxHmb0WSs8la12jXFKBFCCyS-GRWvf |
| ClassificationCodes | TP303 |
| ContentType | Journal Article |
| Copyright | Copyright © Wanfang Data Co. Ltd. All Rights Reserved. |
| Copyright_xml | – notice: Copyright © Wanfang Data Co. Ltd. All Rights Reserved. |
| DBID | 2RA 92L CQIGP W92 ~WA 2B. 4A8 92I 93N PSX TCJ |
| DOI | 10.3969/j.issn.1007-130X.2018.01.004 |
| DatabaseName | 维普期刊资源整合服务平台 中文科技期刊数据库-CALIS站点 维普中文期刊数据库 中文科技期刊数据库-工程技术 中文科技期刊数据库- 镜像站点 Wanfang Data Journals - Hong Kong WANFANG Data Centre Wanfang Data Journals 万方数据期刊 - 香港版 China Online Journals (COJ) China Online Journals (COJ) |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| DocumentTitleAlternate | A parallel multiple logical columns reconfiguration algorithm on fault-tolerant processor arrays |
| DocumentTitle_FL | A parallel multiple logical columns reconfiguration algorithm on fault-tolerant processor arrays |
| EndPage | 33 |
| ExternalDocumentID | jsjgcykx201801005 674380431 |
| GrantInformation_xml | – fundername: 国家自然科学基金; 广东省科技计划应用专项基金; 广东省自然科学基金 funderid: (61572144,61672171); (2015B010129014); (2016A030313703) |
| GroupedDBID | 2RA 92L ALMA_UNASSIGNED_HOLDINGS CDYEO CQIGP W92 ~WA 2B. 4A8 92I 93N PSX TCJ |
| ID | FETCH-LOGICAL-c615-2e33ddf0da5f0daf670783e12af9c22d41ade4cbdc28704c04dfec6827f5a4b83 |
| ISSN | 1007-130X |
| IngestDate | Thu May 29 04:04:00 EDT 2025 Wed Feb 14 10:01:24 EST 2024 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 1 |
| Keywords | 处理器阵列 processor arrays 重构 parallel algorithm reconfiguration 容错 并行算法 fault-tolerant |
| Language | Chinese |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c615-2e33ddf0da5f0daf670783e12af9c22d41ade4cbdc28704c04dfec6827f5a4b83 |
| Notes | 43-1258/TP |
| PageCount | 10 |
| ParticipantIDs | wanfang_journals_jsjgcykx201801005 chongqing_primary_674380431 |
| PublicationCentury | 2000 |
| PublicationDate | 2018 |
| PublicationDateYYYYMMDD | 2018-01-01 |
| PublicationDate_xml | – year: 2018 text: 2018 |
| PublicationDecade | 2010 |
| PublicationTitle | 计算机工程与科学 |
| PublicationTitleAlternate | Computer Engineering ＆ Science |
| PublicationTitle_FL | Computer Engineering and Science |
| PublicationYear | 2018 |
| Publisher | 广东工业大学计算机学院,广东广州,510006 |
| Publisher_xml | – name: 广东工业大学计算机学院,广东广州,510006 |
| SSID | ssib006568571 ssib017479296 ssib001050383 ssib015938883 ssib001102936 ssib051375740 ssib023646326 ssib036438059 ssib000459496 |
| Score | 2.127312 |
| Snippet | 处理器阵列的容错重构技术是片上网络多核、众核高性能体系结构的可靠性技术之一。现有的最大逻辑阵列并行重构技术仅对单条逻辑列的构造实现了并行化,而对多条逻辑列的同步并... TP303; 处理器阵列的容错重构技术是片上网络多核、众核高性能体系结构的可靠性技术之一.现有的最大逻辑阵列并行重构技术仅对单条逻辑列的构造实现了并行化,而对多条逻辑列... |
| SourceID | wanfang chongqing |
| SourceType | Aggregation Database Publisher |
| StartPage | 24 |
| SubjectTerms | 处理器阵列 容错 并行算法 重构 |
| Title | 容错处理器阵列的多逻辑列并行重构算法 |
| URI | http://lib.cqvip.com/qk/94293X/201801/674380431.html https://d.wanfangdata.com.cn/periodical/jsjgcykx201801005 |
| Volume | 40 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVEBS databaseName: Inspec with Full Text issn: 1007-130X databaseCode: ADMLS dateStart: 20130501 customDbUrl: isFulltext: true dateEnd: 99991231 titleUrlDefault: https://www.ebsco.com/products/research-databases/inspec-full-text omitProxy: false ssIdentifier: ssib015938883 providerName: EBSCOhost |
| link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1Ba9VAEF5qC-JFFBVrVYp0jq9uXrLJ7nHzXkoR68UKvT2SbNJS4bXaV9CePBT1oKCg1PYgCD146kUUiuC_eW2fv8KZTZqXihT1EjYz3052dpLdyWZnwthUnHAnVwlvSLwdGvj-JRrSzxRtXEtj46jMVRScPHfPn33g3VkQCyMjP2u7ltZ7yXS68ce4kv-xKtLQrhQl-w-WrYQiActoXzyihfH4VzaGSICOIFQQKVAeKGUp6B56EAWgOEifKEjX0mIkhIIoUoIKLEZbsK2FZcRIDmEIESIjUE4NLOhCoU8s7YBsWXAAsg2RDyoqL4rtIbAPoQvFjy2PfV9bMaK6dZhqQaitcCQKy5IgsQEehFiILCUoW6LboKulRMsJQfOSo2wBW6RnwA1JtoUTDBXSwbEq2nKFldqyTfCpFmmMBVFyCSnLS1AHI6yNXVJfJTkxpNNiLM7UC_Uxv0gRdeLeLgdwr-YKFCk6fp9kXOUrO8mQ-OlKPG0TlDYFLPeGk2u15ZGCPSRlMjrDxpq0djTKxnR77u79unOtvFryQ8em6qlHPXP0zYZ89MTxAatGZ_RLXSmHeHzVDND3rfD0pwC_5qzjKTZo6MwKxw1EUEQQH-t0lk2VCt8-TV3KS7K00l18hN6WDX7r5nF3seanzV9g58sXrEldPC0X2cjG0iXm9_f2B--2-7ubh2-e97c_Dz587b_cOtzZ7O_uDJ59P_rxFk_7-9-OPr0avHh98HHzcG_r4Mv7y2x-JppvzTbKP4Y0UvTMG83MdY3JuYkFHXKfUlm5mdOMc5U2m8ZzYpN5aWJS-rzvpdwzeZb6shnkIvYS6V5ho92VbnaVTRoXJQaGZ44JvDgzKpVISnMuk4SbhI-ziUrlzmqRGKZT2Xic3So7oVMOF2ud5bXlxfTpwyfUb2hbLq6dKmKCnSNksdp3nY32Hq9nN9D_7SU3yxvnF_02hBA |
| linkProvider | EBSCOhost |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=%E5%AE%B9%E9%94%99%E5%A4%84%E7%90%86%E5%99%A8%E9%98%B5%E5%88%97%E7%9A%84%E5%A4%9A%E9%80%BB%E8%BE%91%E5%88%97%E5%B9%B6%E8%A1%8C%E9%87%8D%E6%9E%84%E7%AE%97%E6%B3%95&rft.jtitle=%E8%AE%A1%E7%AE%97%E6%9C%BA%E5%B7%A5%E7%A8%8B%E4%B8%8E%E7%A7%91%E5%AD%A6&rft.au=%E7%AB%A0%E5%AD%90%E5%87%AF%3B%E6%AD%A6%E7%BB%A7%E5%88%9A%3B%E5%A7%9C%E6%96%87%E8%B6%85%3B%E5%88%98%E7%AB%B9%E6%9D%BE&rft.date=2018&rft.issn=1007-130X&rft.volume=40&rft.issue=1&rft.spage=24&rft.epage=33&rft_id=info:doi/10.3969%2Fj.issn.1007-130X.2018.01.004&rft.externalDocID=674380431 |
| thumbnail_s | http://utb.summon.serialssolutions.com/2.0.0/image/custom?url=http%3A%2F%2Fimage.cqvip.com%2Fvip1000%2Fqk%2F94293X%2F94293X.jpg http://utb.summon.serialssolutions.com/2.0.0/image/custom?url=http%3A%2F%2Fwww.wanfangdata.com.cn%2Fimages%2FPeriodicalImages%2Fjsjgcykx%2Fjsjgcykx.jpg |