Research of methods for dynamic determining the presence of a binding process to the processor in Linux kernel

N.V. Kudryavtsev

Abstract


This article presents a generalized analysis of the migration process between the processors in the Linux kernel. The problem is considered as applied to supercomputers systems, which is undesirable for extra modules and third-party software. It is performed a comparison of methods for determining the binding process to the processor and identified the optimal method for determining the criteria of likelihood of migration, of the tasks execution time and of the influence  degree of the method to perform other tasks.


Full Text:

PDF (Russian)

References


Chuanpeng Li, Chen Ding, Kai Shen , “Quantifying The Cost of Context Switch ”, this work was supported in part by the National Science Foundation (NSF) grants CCF-0448413, CNS-0509270, CNS-0615045, and CCF-0621472.

Daniel P. Bovet, Marco Cesati, “Understanding the Linux Kernel, 3rd Edition ”, Publisher: O'Reilly , 2005

http://linux.die.net/man/3/sched_getcpu

https://www.kernel.org/doc/Documentation/kprobes.txt

http://www.thinkingparallel.com/2006/08/18/more-information-on- pthread_setaffinity_np-and-sched_setaffinity/

Jim Keniston, Ananth Mavinakayanahalli, Prasanna Panchamukhi , Vara Prasad , ”Ptrace, Utrace, Uprobes: Lightweight, Dynamic Tracing of User Apps”, Copyright c IBM Corporation, 2007


Refbacks

  • There are currently no refbacks.


Abava  Absolutech Convergent 2020

ISSN: 2307-8162