Author:
Kurnosov M. .,Tokmasheva E. .
Abstract
Algorithm MinNumaDist for barrier’s root selection is proposed. A root process allocates memory pages for shared counters and flags from its NUMA node. Total distance is minimized to all NUMA nodes (closeness centrality) by the algorithm. MinNumaDist reduces barrier’s time by 1035% for asymmetrical NUMA subsystems - for different number of processes on NUMA nodes or different number of NUMA nodes used from each socket.
Publisher
Siberian State University of Telecommunications and Informatics
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Barrier synchronization hierarchical algorithm for multicore shared-memory systems;The Herald of the Siberian State University of Telecommunications and Informatics;2022-07-22