Encyclopedia of Parallel Computing 2011
DOI: 10.1007/978-0-387-09766-4_2262
|View full text |Cite
|
Sign up to set email alerts
|

Resource Management for Parallel Computers

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2023
2023
2023
2023

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(1 citation statement)
references
References 0 publications
0
1
0
Order By: Relevance
“…Note that the arrays χ domain mn and χ core mn have the same size. Additionally, each version of χ core mn is assigned to only a single CPU core in the first parallel do-loop to prevent problematic read/write interactions, i.e., race-conditions [34]. The first parallel do-loop in Algorithm 1 divides the cross-sections within the entire simulation domain over all N cores cores.…”
Section: Parallel Algorithmmentioning
confidence: 99%
“…Note that the arrays χ domain mn and χ core mn have the same size. Additionally, each version of χ core mn is assigned to only a single CPU core in the first parallel do-loop to prevent problematic read/write interactions, i.e., race-conditions [34]. The first parallel do-loop in Algorithm 1 divides the cross-sections within the entire simulation domain over all N cores cores.…”
Section: Parallel Algorithmmentioning
confidence: 99%