نظم تشغيل عملي

public static int first_come()
{
int first = 0;
for (int k = 1; k < Ready_Lenght; k++)
if (Ready_Queue[k].arrival_time < Ready_Queue[first].arrival_time)
first = k;
return first;
}
public static void update(int t)
{
for (int i = 0; i < Wait_Lenght; )
Practical Operating System lecture#2/4th Class/2018-2019
MS.C. Rusul Mohammed
if (Wait_Queue[i].arrival_time <= t) {
Ready_Queue[Ready_Lenght++] = Wait_Queue[i];
for (int j = i; j < Wait_Lenght - 1; j++)//shift processes after take one process to ready quue
Wait_Queue[j] = Wait_Queue[j + 1];
Wait_Lenght--;
}
else
i++;
}
public static int first_come()
{
int first = 0;
for (int k = 1; k < Ready_Lenght; k++)
if (Ready_Queue[k].arrival_time < Ready_Queue[first].arrival_time)
first = k;
return first;
}
public static void update(int t)
{
for (int i = 0; i < Wait_Lenght; )
Practical Operating System lecture#2/4th Class/2018-2019
MS.C. Rusul Mohammed
if (Wait_Queue[i].arrival_time <= t) {
Ready_Queue[Ready_Lenght++] = Wait_Queue[i];
for (int j = i; j < Wait_Lenght - 1; j++)//shift processes after take one process to ready quue
Wait_Queue[j] = Wait_Queue[j + 1];
Wait_Lenght--;
}
else
i++;
}
public static int first_come()
{
int first = 0;
for (int k = 1; k < Ready_Lenght; k++)
if (Ready_Queue[k].arrival_time < Ready_Queue[first].arrival_time)
first = k;
return first;
}
public static void update(int t)
{
for (int i = 0; i < Wait_Lenght; )
Practical Operating System lecture#2/4th Class/2018-2019
MS.C. Rusul Mohammed
if (Wait_Queue[i].arrival_time <= t) {
Ready_Queue[Ready_Lenght++] = Wait_Queue[i];
for (int j = i; j < Wait_Lenght - 1; j++)//shift processes after take one process to ready quue
Wait_Queue[j] = Wait_Queue[j + 1];
Wait_Lenght--;
}
else
i++;
}
public static int first_come()
{
int first = 0;
for (int k = 1; k < Ready_Lenght; k++)
if (Ready_Queue[k].arrival_time < Ready_Queue[first].arrival_time)
first = k;
return first;
}
public static void update(int t)
{
for (int i = 0; i < Wait_Lenght; )
Practical Operating System lecture#2/4th Class/2018-2019
MS.C. Rusul Mohammed
if (Wait_Queue[i].arrival_time <= t) {
Ready_Queue[Ready_Lenght++] = Wait_Queue[i];
for (int j = i; j < Wait_Lenght - 1; j++)//shift processes after take one process to ready quue
Wait_Queue[j] = Wait_Queue[j + 1];
Wait_Lenght--;
}
else
i++;
}