Algorithms for Optimization of Processor and Memory Affinity for Remote Core Locking Synchronization in Multithreaded Applications

Alexey Paznikov,Yulia Shichkina

doi:10.3390/info9010021

Alexey Paznikov, Yulia Shichkina

Open Access

https://doi.org/10.3390/info9010021

Copy DOI

Journal: Information	Publication Date: Jan 18, 2018
Citations: 11	License type: CC BY 4.0

Affiliation: Saint Petersburg State Electrotechnical University

Abstract

This paper proposes algorithms for optimization of the Remote Core Locking (RCL) synchronization method in multithreaded programs. We propose an algorithm for the initialization of RCL-locks and an algorithm for thread affinity optimization. The algorithms consider the structures of hierarchical computer systems and non-uniform memory access (NUMA) in order to minimize the execution time of multithreaded programs with RCL. The experimental results on multi-core computer systems show the reduction of execution time for programs with RCL.

Highlights

Available computer systems (CS) [1] are of large scale and include multiple architectures.These systems are composed of shared memory multi-core compute nodes (SMP, non-uniform memory access (NUMA) systems) equipped with universal processors, as well as specialized accelerators
This paper considers the Remote Core Locking (RCL) method [16,17], which assumes the execution of critical sections by dedicated processor cores
Algorithms for optimization of the execution of multithreaded programs based on Remote Core

Summary

Introduction

Available computer systems (CS) [1] are of large scale and include multiple architectures. These systems are composed of shared memory multi-core compute nodes (SMP, NUMA systems) equipped with universal processors, as well as specialized accelerators (graphics processors, massively parallel multi-core processors). Effective execution of parallel programs on these systems is a significant challenge. System software must consider the large scale, multiple architectures and hierarchical structure. Parallel programs for multi-core CS with shared memory are multithreaded, in most cases. Software tools must ensure linear speedup with a large amount of parallel threads. Thread synchronization while accessing shared data structures is one of the most significant problems in multithreaded programming

Objectives

Results

Conclusion