Sparse Block and Cyclic Data Distributions for Matrix Computations

Asenjo, Rafael; Romero, Luis F.; Ujaldón, Manuel; Zapata, Emilio L.

doi:10.1016/s0927-5452(06)80024-9

Cited by 13 publications

(17 citation statements)

References 21 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Zapata et al [2,29] have proposed two data distribution schemes, called Block Row Scatter (BRS) and Multiple Recursive Decomposition (MRD). The BRS scheme is based on the division of any computation domain into several blocks, all of the same spatial shape and size.…”

Section: Related Workmentioning

confidence: 99%

“…Therefore, it becomes an important issue to propose efficient data distribution schemes for multi-dimensional sparse arrays. In the literature, some methods have been proposed to implement data distributions for sparse arrays [2,6,28,29,31]. These methods all belonged to an intuitive scheme, called Send Followed Compress (SFC), for sparse arrays based on the traditional matrix representation (TMR) scheme [19].…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Efficient Data Distribution Schemes for EKMR-Based Sparse Arrays on Distributed Memory Multicomputers

2005

View full text Add to dashboard Cite

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.

show abstract

Section: Related Workmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Efficient Data Distribution Schemes for EKMR-Based Sparse Arrays on Distributed Memory Multicomputers

2005

View full text Add to dashboard Cite

show abstract

“…Zapata et al [2,14] have proposed a data distribution scheme, BRS, for two-dimensional sparse arrays.…”

Section: Related Workmentioning

confidence: 99%

“…To implement the data distribution scheme, many methods have been proposed in the literature [2,6,[13][14]16]. Among them, the Block Row Scatter (BRS) scheme [2,14] has been popularly used to solve other important issues for sparse array problems [2][3][13][14].…”

Section: Introductionmentioning

confidence: 99%