2005
DOI: 10.1007/11535294_19
|View full text |Cite
|
Sign up to set email alerts
|

Efficient Communication Scheduling Methods for Irregular Data Redistribution in Parallelizing Compilers

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2006
2006
2006
2006

Publication Types

Select...
1

Relationship

1
0

Authors

Journals

citations
Cited by 1 publication
(2 citation statements)
references
References 12 publications
0
2
0
Order By: Relevance
“…Step TPDR scheduling algorithm [7] employs two scheduling phases: a degree reduction iteration phase and an adjustable coloring mechanism phase. The aim of degree reduction phase is to reduce the maximal degree (d max ) of the bipartite graph equals to 2.…”
Section: Preliminarymentioning
confidence: 99%
See 1 more Smart Citation
“…Step TPDR scheduling algorithm [7] employs two scheduling phases: a degree reduction iteration phase and an adjustable coloring mechanism phase. The aim of degree reduction phase is to reduce the maximal degree (d max ) of the bipartite graph equals to 2.…”
Section: Preliminarymentioning
confidence: 99%
“…Section 4 presents the proposed local message reduction (LMR) technique. A detailed description of incorporating the LMR scheme with TPDR scheduling algorithm [7] will also be investigated. The theoretical performance analysis and experimental comparison will be given in Section 5.…”
Section: Introductionmentioning
confidence: 99%