All geek questions in one place

RTOS graphical banner planning over multi-core processor

I understand that Gang scheduling is a parallel system scheduling algorithm that schedules related threads or processes to run simultaneously on different processors. Gang scheduling is used so that if two or more threads or processes communicate with each other, they will all be ready to communicate at the same time. However, how does the gang scheduling algorithm determine that a particular set of processes will exchange among themselves and, therefore, distribute related threads or processes for simultaneous launch on different processors?

+4
source share
1 answer

A group planning schedule is usually applied to a task, either by default for the operating system, or because the task is marked for scheduling gangs. All tasks in the task are planned together, not trying to determine whether they all actively communicate.

The following document has an introduction and some quotes that can help you get help with gang planning:

Papazachos, ZC; Karatza, HD ;, “Gang Planning Schedule in a Two-Cluster System with Critical Sporadic Jobs and Migration,” “Evaluation of the Performance of Computer and Telecommunication Systems,” 2009. SPECTS 2009. International Symposium, vol.41, no., Pp.41-48 July 13-16, 2009 URL: http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5224147&isnumber=5224098

0
source

Source: https://habr.com/ru/post/1313023/

More articles:


All Articles