Academic Journal
Data distribution schemes of sparse arrays on distributed memory multicomputers.
| Τίτλος: | Data distribution schemes of sparse arrays on distributed memory multicomputers. |
|---|---|
| Συγγραφείς: | Lin, Chun-Yuan, Chung, Yeh-Ching |
| Πηγή: | Journal of Supercomputing; Jul2007, Vol. 41 Issue 1, p63-87, 25p, 7 Diagrams, 12 Charts |
| Θεματικοί όροι: | Data compression, Coding theory, Encoding, Data transmission systems, Database management |
| Περίληψη: | A data distribution scheme of sparse arrays on a distributed memory multicomputer, in general, is composed of three phases, data partition, data distribution, and data compression. To implement the data distribution scheme, many methods proposed in the literature first perform the data partition phase, then the data distribution phase, followed by the data compression phase. We called a data distribution scheme with this order as Send Followed Compress ( SFC) scheme. In this paper, we propose two other data distribution schemes, Compress Followed Send ( CFS) and Encoding-Decoding ( ED), for sparse array distribution. In the CFS scheme, the data compression phase is performed before the data distribution phase. In the ED scheme, the data compression phase can be divided into two steps, encoding and decoding. The encoding step and the decoding step are performed before and after the data distribution phase, respectively. To evaluate the CFS and the ED schemes, we compare them with the SFC scheme. In the data partition phase, the row partition, the column partition, and the 2D mesh partition with/without load-balancing methods are used for these three schemes. In the compression phase, the CRS/CCS methods are used to compress sparse local arrays for the SFC and the CFS schemes while the encoding/decoding step is used for the ED scheme. Both theoretical analysis and experimental tests were conducted. In the theoretical analysis, we analyze the SFC, the CFS, and the ED schemes in terms of the data distribution time and the data compression time. In experimental tests, we implemented these three schemes on an IBM SP2 parallel machine. From the experimental results, for most of test cases, the CFS and the ED schemes outperform the SFC scheme. For the CFS and the ED schemes, the ED scheme outperforms the CFS scheme for all test cases. [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.) | |
| Βάση Δεδομένων: | Complementary Index |
| FullText | Links: – Type: other Text: Availability: 0 CustomLinks: – Url: https://dx.doi.org/doi:10.1007/s11227-007-0104-x Name: EDS - Springer Nature Journals (s7799221) Category: fullText Text: View record at Springer |
|---|---|
| Header | DbId: edb DbLabel: Complementary Index An: 24976588 RelevancyScore: 833 AccessLevel: 6 PubType: Academic Journal PubTypeId: academicJournal PreciseRelevancyScore: 832.916198730469 |
| IllustrationInfo | |
| Items | – Name: Title Label: Title Group: Ti Data: Data distribution schemes of 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> – Name: TitleSource Label: Source Group: Src Data: Journal of Supercomputing; Jul2007, Vol. 41 Issue 1, p63-87, 25p, 7 Diagrams, 12 Charts – Name: Subject Label: Subject Terms Group: Su Data: <searchLink fieldCode="DE" term="%22Data+compression%22">Data compression</searchLink><br /><searchLink fieldCode="DE" term="%22Coding+theory%22">Coding theory</searchLink><br /><searchLink fieldCode="DE" term="%22Encoding%22">Encoding</searchLink><br /><searchLink fieldCode="DE" term="%22Data+transmission+systems%22">Data transmission systems</searchLink><br /><searchLink fieldCode="DE" term="%22Database+management%22">Database management</searchLink> – Name: Abstract Label: Abstract Group: Ab Data: A data distribution scheme of sparse arrays on a distributed memory multicomputer, in general, is composed of three phases, data partition, data distribution, and data compression. To implement the data distribution scheme, many methods proposed in the literature first perform the data partition phase, then the data distribution phase, followed by the data compression phase. We called a data distribution scheme with this order as Send Followed Compress ( SFC) scheme. In this paper, we propose two other data distribution schemes, Compress Followed Send ( CFS) and Encoding-Decoding ( ED), for sparse array distribution. In the CFS scheme, the data compression phase is performed before the data distribution phase. In the ED scheme, the data compression phase can be divided into two steps, encoding and decoding. The encoding step and the decoding step are performed before and after the data distribution phase, respectively. To evaluate the CFS and the ED schemes, we compare them with the SFC scheme. In the data partition phase, the row partition, the column partition, and the 2D mesh partition with/without load-balancing methods are used for these three schemes. In the compression phase, the CRS/CCS methods are used to compress sparse local arrays for the SFC and the CFS schemes while the encoding/decoding step is used for the ED scheme. Both theoretical analysis and experimental tests were conducted. In the theoretical analysis, we analyze the SFC, the CFS, and the ED schemes in terms of the data distribution time and the data compression time. In experimental tests, we implemented these three schemes on an IBM SP2 parallel machine. From the experimental results, for most of test cases, the CFS and the ED schemes outperform the SFC scheme. For the CFS and the ED schemes, the ED scheme outperforms the CFS scheme for all test cases. [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=24976588 |
| RecordInfo | BibRecord: BibEntity: Identifiers: – Type: doi Value: 10.1007/s11227-007-0104-x Languages: – Code: eng Text: English PhysicalDescription: Pagination: PageCount: 25 StartPage: 63 Subjects: – SubjectFull: Data compression Type: general – SubjectFull: Coding theory Type: general – SubjectFull: Encoding Type: general – SubjectFull: Data transmission systems Type: general – SubjectFull: Database management Type: general Titles: – TitleFull: Data distribution schemes of sparse arrays on distributed memory multicomputers. Type: main BibRelationships: HasContributorRelationships: – PersonEntity: Name: NameFull: Lin, Chun-Yuan – PersonEntity: Name: NameFull: Chung, Yeh-Ching IsPartOfRelationships: – BibEntity: Dates: – D: 01 M: 07 Text: Jul2007 Type: published Y: 2007 Identifiers: – Type: issn-print Value: 09208542 Numbering: – Type: volume Value: 41 – Type: issue Value: 1 Titles: – TitleFull: Journal of Supercomputing Type: main |
| ResultId | 1 |