Minimizing communication cost in fine-grain partitioning of sparse matrices
| buir.contributor.author | Aykanat, Cevdet | |
| dc.citation.epage | 933 | en_US |
| dc.citation.spage | 926 | en_US |
| dc.citation.volumeNumber | 2869 | en_US |
| dc.contributor.author | Uçar, B. | en_US |
| dc.contributor.author | Aykanat, Cevdet | en_US |
| dc.date.accessioned | 2016-02-08T10:28:48Z | |
| dc.date.available | 2016-02-08T10:28:48Z | en_US |
| dc.date.issued | 2003 | en_US |
| dc.department | Department of Computer Engineering | en_US |
| dc.description.abstract | We show a two-phase approach for minimizing various communication-cost metrics in fine-grain partitioning of sparse matrices for parallel processing. In the first phase, we obtain a partitioning with the existing tools on the matrix to determine computational loads of the processor. In the second phase, we try to minimize the communication-cost metrics. For this purpose, we develop communication-hypergraph and partitioning models. We experimentally evaluate the contributions on a PC cluster. © Springer-Verlag Berlin Heidelberg 2003. | en_US |
| dc.description.provenance | Made available in DSpace on 2016-02-08T10:28:48Z (GMT). No. of bitstreams: 1 bilkent-research-paper.pdf: 70227 bytes, checksum: 26e812c6f5156f83f0e77b261a471b5a (MD5) Previous issue date: 2003 | en_US |
| dc.identifier.doi | 10.1007/978-3-540-39737-3_115 | en_US |
| dc.identifier.issn | 0302-9743 | |
| dc.identifier.issn | 1611-3349 | |
| dc.identifier.uri | http://hdl.handle.net/11693/24398 | en_US |
| dc.language.iso | English | en_US |
| dc.publisher | Springer | en_US |
| dc.relation.isversionof | https://doi.org/10.1007/978-3-540-39737-3_115 | en_US |
| dc.source.title | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | en_US |
| dc.subject | Sparse Matrice | en_US |
| dc.subject | Communication Volume | en_US |
| dc.subject | Hypergraph Model | en_US |
| dc.subject | Processor Assignment | en_US |
| dc.subject | Fold Phase | en_US |
| dc.title | Minimizing communication cost in fine-grain partitioning of sparse matrices | en_US |
| dc.type | Article | en_US |
Files
Original bundle
1 - 1 of 1
Loading...
- Name:
- Minimizing communication cost in fine-grain partitioning of sparse matrices.pdf
- Size:
- 196.07 KB
- Format:
- Adobe Portable Document Format
- Description:
- Full printable version