Time slice rotation algorithm and priority scheduling algorithm are simulated in C language

Aren't the explanations in the links you gave detailed enough?

Time slice rotation scheduling is one of the oldest, simplest, fairest, and most widely used algorithms.

Each process is assigned a period of time, called its time slice, which is the amount of time the process is allowed to run. If the process is still running at the end of the time slice, the CPU is stripped and allocated to another process. If the process blocks or ends before the end of the time slice, the CPU switches immediately.

All the scheduler has to do is maintain a list of ready processes, and when the process runs out of its time slice, it is moved to the end of the queue.

Let's put it this way, if the CPU is compared to a game console, now A, B, and C all want to play, how to allocate it, the time slice rotation scheduling is to allocate the game console, first let A play for three minutes, then let B play for three minutes, then let C play for three minutes, and then let A play for three minutes, and so on.

In the early time slice rotation method, the system queued all ready processes on a first-come, first-served basis, and assigned the CPU to the queue leader process each time it was scheduled, and made it execute a time slice. The time slice is staring at the small from a few ms to hundreds of msWhen the time slice of the Raid Bi Absolute Line runs out, a timer is used.

A clock interrupt request is made, and the scheduler uses this signal to stop the execution of the process and send it to the end of the ready queue; The processor is then assigned to the new queue leader process in the pose queue, and it is also allowed to execute a time slice. This ensures that all processes in the ready queue get a time-slice processor execution time for a given amount of time.

1.There is only one ready queue in the entire system that is shared by multiple processors.

2) Inefficiency.

Threads change processors multiple times during their lifetime, resulting in low cache usage (3) and frequent thread switching.

2.Gang Scheduling method 3Dedicated processor allocation.

Answer] :(1) The rotation scheduling algorithm divides the processing time of the processor into time slices, and the processes in the ready key slag queue take turns to run one time slice. When the time slice is over, let the source manuscript quieter and enter the ready queue to wait for the next scheduling.

2) The time slice is too short, and the process is switched frequently, which increases the system overhead (or reduces the efficiency of processing the wide base). If the time slice is too long, the response time to short interaction requests becomes longer.