Research Article
Locality-Aware Task Scheduling and Data Distribution for OpenMP Programs on NUMA Systems and Manycore Processors
Algorithm 1
Work-dealing algorithm for NUMA systems.
(1) Procedure deal-work(task T, queues , current node n, cores per node C) | (2) Populate with bytes in T.depend_list; | (3) if and then | (4) find with least NUMA distance-weighted cost to ; | (5) enqueue, T; | (6) else | (7) enqueue(, T); | (8) end | (9) end |
|