Academic Journal
Efficient Data Distribution Schemes for EKMR-Based Sparse Arrays on Distributed Memory Multicomputers.
| Title: | Efficient Data Distribution Schemes for EKMR-Based Sparse Arrays on Distributed Memory Multicomputers. |
|---|---|
| Authors: | Lin, Chun-Yuan, Chung, Yeh-Ching, Liu, Jen-Shiuh |
| Source: | Journal of Supercomputing; Dec2005, Vol. 34 Issue 3, p291-313, 23p |
| Subject Terms: | Data compression, Array processors, Image processing, Molecular dynamics, Finite element method, High performance computing |
| Abstract: | Multi-dimensional sparse array operations can be used in the atmosphere and ocean sciences, the image processing, and etc., and have been an extensively investigated problem. Therefore, it becomes an important issue to propose efficient data distribution schemes for multi-dimensional sparse arrays. In our previous work, we have proposed two data distribution schemes Compress Followed Send (CFS) and Encoding-Decoding (ED) for sparse arrays based on the traditional matrix representation (TMR) scheme. We have proposed another scheme, called extended Karnaugh map representation (EKMR), to represent sparse arrays. The EKMR scheme can obtain better performance than the TMR scheme for some sparse array operations. Hence, in this paper, we want to propose efficient data distribution schemes for EKMR-based sparse arrays. We extend the CFS and the ED schemes for TMR-based sparse arrays to EKMR-based sparse arrays first. Then, we compare the performance of these two schemes with that of the Send Followed Compress (SFC), which is an intuitive data distribution scheme for sparse arrays. Finally, we compare these three schemes for EKMR-based sparse arrays with those of TMR-based sparse arrays, respectively. Both the theoretical analysis and the experimental tests were conducted. From the theoretical analysis and the experimental results, we can see that the ED scheme is superior to the CFS scheme that is superior to the SFC scheme for most of testing EKMR-based sparse arrays; the performance of these three schemes for EKMR-based sparse arrays is better than that of TMR-based sparse arrays for all of testing cases, respectively. [ABSTRACT FROM AUTHOR] |
| Copyright of Journal of Supercomputing is the property of Springer Nature and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) | |
| Database: | Complementary Index |
| FullText | Links: – Type: other Text: Availability: 0 CustomLinks: – Url: https://dx.doi.org/doi:10.1007/s11227-005-0788-8 Name: EDS - Springer Nature Journals (s7799221) Category: fullText Text: View record at Springer |
|---|---|
| Header | DbId: edb DbLabel: Complementary Index An: 18156183 RelevancyScore: 832 AccessLevel: 6 PubType: Academic Journal PubTypeId: academicJournal PreciseRelevancyScore: 832.36083984375 |
| IllustrationInfo | |
| Items | – Name: Title Label: Title Group: Ti Data: Efficient Data Distribution Schemes for EKMR-Based Sparse Arrays on Distributed Memory Multicomputers. – Name: Author Label: Authors Group: Au Data: <searchLink fieldCode="AR" term="%22Lin%2C+Chun-Yuan%22">Lin, Chun-Yuan</searchLink><br /><searchLink fieldCode="AR" term="%22Chung%2C+Yeh-Ching%22">Chung, Yeh-Ching</searchLink><br /><searchLink fieldCode="AR" term="%22Liu%2C+Jen-Shiuh%22">Liu, Jen-Shiuh</searchLink> – Name: TitleSource Label: Source Group: Src Data: Journal of Supercomputing; Dec2005, Vol. 34 Issue 3, p291-313, 23p – Name: Subject Label: Subject Terms Group: Su Data: <searchLink fieldCode="DE" term="%22Data+compression%22">Data compression</searchLink><br /><searchLink fieldCode="DE" term="%22Array+processors%22">Array processors</searchLink><br /><searchLink fieldCode="DE" term="%22Image+processing%22">Image processing</searchLink><br /><searchLink fieldCode="DE" term="%22Molecular+dynamics%22">Molecular dynamics</searchLink><br /><searchLink fieldCode="DE" term="%22Finite+element+method%22">Finite element method</searchLink><br /><searchLink fieldCode="DE" term="%22High+performance+computing%22">High performance computing</searchLink> – Name: Abstract Label: Abstract Group: Ab Data: Multi-dimensional sparse array operations can be used in the atmosphere and ocean sciences, the image processing, and etc., and have been an extensively investigated problem. Therefore, it becomes an important issue to propose efficient data distribution schemes for multi-dimensional sparse arrays. In our previous work, we have proposed two data distribution schemes Compress Followed Send (CFS) and Encoding-Decoding (ED) for sparse arrays based on the traditional matrix representation (TMR) scheme. We have proposed another scheme, called extended Karnaugh map representation (EKMR), to represent sparse arrays. The EKMR scheme can obtain better performance than the TMR scheme for some sparse array operations. Hence, in this paper, we want to propose efficient data distribution schemes for EKMR-based sparse arrays. We extend the CFS and the ED schemes for TMR-based sparse arrays to EKMR-based sparse arrays first. Then, we compare the performance of these two schemes with that of the Send Followed Compress (SFC), which is an intuitive data distribution scheme for sparse arrays. Finally, we compare these three schemes for EKMR-based sparse arrays with those of TMR-based sparse arrays, respectively. Both the theoretical analysis and the experimental tests were conducted. From the theoretical analysis and the experimental results, we can see that the ED scheme is superior to the CFS scheme that is superior to the SFC scheme for most of testing EKMR-based sparse arrays; the performance of these three schemes for EKMR-based sparse arrays is better than that of TMR-based sparse arrays for all of testing cases, respectively. [ABSTRACT FROM AUTHOR] – Name: Abstract Label: Group: Ab Data: <i>Copyright of Journal of Supercomputing is the property of Springer Nature and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract.</i> (Copyright applies to all Abstracts.) |
| PLink | https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=edb&AN=18156183 |
| RecordInfo | BibRecord: BibEntity: Identifiers: – Type: doi Value: 10.1007/s11227-005-0788-8 Languages: – Code: eng Text: English PhysicalDescription: Pagination: PageCount: 23 StartPage: 291 Subjects: – SubjectFull: Data compression Type: general – SubjectFull: Array processors Type: general – SubjectFull: Image processing Type: general – SubjectFull: Molecular dynamics Type: general – SubjectFull: Finite element method Type: general – SubjectFull: High performance computing Type: general Titles: – TitleFull: Efficient Data Distribution Schemes for EKMR-Based Sparse Arrays on Distributed Memory Multicomputers. Type: main BibRelationships: HasContributorRelationships: – PersonEntity: Name: NameFull: Lin, Chun-Yuan – PersonEntity: Name: NameFull: Chung, Yeh-Ching – PersonEntity: Name: NameFull: Liu, Jen-Shiuh IsPartOfRelationships: – BibEntity: Dates: – D: 01 M: 12 Text: Dec2005 Type: published Y: 2005 Identifiers: – Type: issn-print Value: 09208542 Numbering: – Type: volume Value: 34 – Type: issue Value: 3 Titles: – TitleFull: Journal of Supercomputing Type: main |
| ResultId | 1 |