2002
DOI: 10.1007/3-540-36265-7_3
|View full text |Cite
|
Sign up to set email alerts
|

A General Data Layout for Distributed Consistency in Data Parallel Applications

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2003
2003
2003
2003

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(1 citation statement)
references
References 16 publications
0
1
0
Order By: Relevance
“…Thus, starting with the sets at the highest level of recursion, the algorithm maps the data at the next level to increase locality of reference and thus, reduce communication. The main steps of the algorithm proceed as follows Given the partitioning and mapping of data to processors, we use the algorithm described in [3] to maintain data consistency.…”
Section: Mapping Of Data To Processorsmentioning
confidence: 99%
“…Thus, starting with the sets at the highest level of recursion, the algorithm maps the data at the next level to increase locality of reference and thus, reduce communication. The main steps of the algorithm proceed as follows Given the partitioning and mapping of data to processors, we use the algorithm described in [3] to maintain data consistency.…”
Section: Mapping Of Data To Processorsmentioning
confidence: 99%