Questions tagged [process-scheduling]
Questions about how operating systems decide which process to execute at which time.
33
questions with no upvoted or accepted answers
4
votes
2answers
664 views
Convoy effect in priority scheduling and SJF (Non preemptive)
In books, I have read that FCFS suffers from convoy effect. I think that even SJF and priority(both preemptive and non preemptive) can suffer from convoy effect.
In SJF, if a process with large burst ...
4
votes
0answers
442 views
Problems of cyclic executive approach for scheduling of real time systems
I have a doubt on the cyclic executive approach for scheduling on real time systems. From Alan Burns's book Real-time Systems and Programming Languages.
This final property represents one of the ...
3
votes
2answers
540 views
Paging: Does the page table of a process also gets swapped out when the process gets swapped out from main memory?
Does a process's page table too gets swapped out to secondary storage from main memory when the process gets swapped out to secondary storage from main memory? And gets swapped back in when the ...
2
votes
0answers
20 views
Finding the timestamps of processes implementing Lamport's clocks
I have been asked this question, but don't know how to go about answering it.
Three process, which are implementing Lamport's clocks, are running and a lot of events are taking, place including some ...
2
votes
0answers
119 views
long-lived scheduling using max-flow & push/relabel
I'm writing a scheduler of long-lived Processors which execute long-lived Tasks. Processors and Tasks may each come and go over time, at any time (when a Processor departs, its assigned Tasks now ...
2
votes
0answers
41 views
Identify common mathematical problem behind my task in scheduling area
Having single operator, which could do work and it's time of availability - for example from 8 am till 9 pm. And operator have limited resource - let's call it ...
2
votes
0answers
40 views
How can I talk about priority inversion if it's impossible to specify priority?
In the paper:
Leslie Lamport: What It Means for a Concurrent Program to
Satisfy a Speciļ¬cation: Why No One Has Speciļ¬ed Priority; ACM Symp Principles of Programming Languages, (POPL-12):78-83, ...
1
vote
1answer
142 views
Algorithm favours CPU bound or I/O bound processes
Some scheduling algorithms favour CPU bound processes while others favour I/O bound processes.
Which algorithm favours which type of process?
My answers:
SJF favours I/O bound processes.Explanation: ...
1
vote
0answers
137 views
What are the differences between Earliest Deadline First (EDF) and Earliest Due Date (EDD)?
From my understanding, the EDF (Earliest Deadline First) rule is essentially an iterative "version" of the EDD (Earliest Due Date) rule, which allows for preemption. At every point in time, ...
1
vote
0answers
19 views
Understanding proofs Lemma 11 & 10 in this specific Computer Science Scheduling Paper
I'm having a hard time wrapping my head around the proofs Lemma 11 and Lemma 10 (Pages 10 and 11) in this paper called: Preemptive and Non-Preemptive Real-Time UniProcessor Scheduling.
Generally the ...
1
vote
0answers
91 views
Expected value of next CPU burst using exponential averaging
The burst time is needed for Shortest Job First (SJF) and Shortest Run Time First (SRTF) scheduling. To get the approximate burst time, we use the equation
$$\tau_{n + 1} = t_n + (1 - \alpha)\tau_n$$
...
1
vote
0answers
31 views
What approach to solve an open shop problem with following constraints
Say we have an open shop scheduling problem with following constraints :
No wait-time between operations of a job
Multiple job types (meaning each job type has different set of operations eventhough ...
1
vote
0answers
3k views
Difference between Response time, Execution time, and CPU time
I studied Computer Architecture from David A. Patterson and have came across the idea of Response time.
Response time also called Execution time. The total time required for the computer to ...
1
vote
0answers
75 views
Appropriate algorithm or heuristic for task scheduling
I'm sure this problem has been addressed before, but I'm unable to find an exact description of it.
I have $m$ machines, and $n$ tasks that need processing. Each task takes a variable amount of ...
1
vote
0answers
44 views
Scheduling identical jobs with Cmax/Ci
I have $x$ uniform machines that are identical, except that each runs at a different speed; machine $j$ runs at speed $s_j$. I have $n$ identical jobs. Each machine can handle one job at a time. ...
1
vote
0answers
108 views
Processes running in Distributed Systems (Advanced Operating System)
I had a test today, there was a question that was a bit confusing. Anyway I am asking the question, from memory, and explaining what I answered. It would be great if someone could explain if I did ...
1
vote
0answers
288 views
Optimality of EDF
For Earliest Deadline First, I have read that if utilization is less or equal to 1, the task set is schedulable under EDF. But does this criteria expresses the optimality for EDF? If not, how can we ...
1
vote
0answers
117 views
Processes concurrency
I am getting ready for my end of year exams and I got stuck on this question.
Consider the following 3-process concurrent program which uses semaphores S1,
...
0
votes
0answers
33 views
Is it okay to understand Job Queue Like this?
I have a hard time understanding the concept of job queue.
Is it right if I understand job queue like the following???
For example, when user click the icon of an exe file, the newly created process ...
0
votes
0answers
18 views
How to place the deadlines in āEarliest deadline first schedulingā in this question?
So I followed this tutorial to get the concept of "Earliest deadline first scheduling". I have to implement this task >>> TASK. Now the thing which I am not getting in this Task is ...
0
votes
0answers
51 views
Gantt chart for Round Robin Scheduling using only arrival and completion time
I had the following question in my Operating System 'CPU- Scheduling' assignment-
4 processes A,B,C,D have estimated time of completion of 5,7,9,11 ns each. They are scheduled in a round-robin fashion ...
0
votes
0answers
26 views
Round robin doubt
Consider a system running ten I/O-bound tasks and one CPU-bound task. Assume that the I/O-bound
tasks issue an I/O operation one for every millisecond of CPU computing and that each I/O operation ...
0
votes
1answer
77 views
Cores, threads and sockets: what does it mean the calculation $T = tcs$ and the number on windows task manager performance?
Well, suppose then we have an CPU system such as:
Thread(s) per core $\equiv t$ : 4
Core(s) per socket $\equiv c$: 4
Socket(s) $\equiv s$: 1
Then, we must to perform a simple ...
0
votes
0answers
12 views
Why does Fully Utilized Thread Change over time?
While I was running a simple program which needed to run for a couple minutes, I made an observation I can't find an answer for on google.
Here is a snip of my system monitor which demonstrates my ...
0
votes
0answers
29 views
How to compute this CPU scheduling exercise?
How can I compute this type of problem? My doubts are one the number of jobs, I have tried drawing a Gantt chart, but it becomes huge and unmanageable.
How am I supposed to represent the results?
...
0
votes
1answer
185 views
Questions regarding CPU scheduling algorithms ( Round Robin and Priority scheduling )
Consider the following processes :
1) My First Question is if we need to schedule them using preemptive priority scheduling with Round-Robin for equal processes priorities with a quantum of 3. Here ...
0
votes
0answers
20 views
Preemptive priority scheduling problem with same priority
So if T1(priority 3, arrived first) was preempted it is put back to the runqueue. If there is already T4(priority 3, arrived fourth) inside the runqueue, which one of these two will be handled first?! ...
0
votes
0answers
16 views
In completely fair scheduler in Linux, how to calculate the initial virtual run time of a process
I am trying to implement a completely fair scheduler. I want to know how to calculate the initial value of virtual run time of a process in order to insert the process into a red black tree
0
votes
1answer
202 views
Calculating minimum processing time for many recipes and tools
I originally asked this question on StackOverflow but a comment was made to the effect that my problem pertains to Job Shop Scheduling and that it was more of a comp sci problem than a programming ...
0
votes
0answers
163 views
Why TurnAround Time is considered as Performance Metric for Scheduling Algorithms?
I know what is turn around time but i am confused why wating time is not considred as Performance Metric for Scheduling Algorithms Since it gives the time for which a Process will wait till it gets ...
0
votes
0answers
524 views
why p1 misses it first deadline? Rate monotonic scheduling
I understand that rate monotonic scheduling assigns a priority to a process based on the periodicity of the tasks it generates and the process with the shortest inter-task period has the highest ...
-1
votes
1answer
2k views
Arrival Time vs Burst Time vs Priority Time? If Priority Time is the same, which process dispatch first?
The question is based on if we have the same Priority value when we are given:
Arrival Time = AT, Priority and Burst Time=BT.
1.Say if we a table with AT, Priority and BT. To dispatch a process it is ...
-2
votes
1answer
109 views
OS process management
Assume a process execution interrupted at the middle and CPU started executing a different process.How does the OS handle this situation?
