Questions tagged [process-scheduling]

Questions about how operating systems decide which process to execute at which time.

Filter by
Sorted by
Tagged with
0
votes
0answers
27 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
42 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
19 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
14 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
0answers
106 views

Advantages of Preemptive Scheduling

I'm currently studying for an exam which includes operating systems. I'm solving the exams from previous years and I'm stuck on a particular question: "One of the advantages of preemptive scheduling ...
0
votes
0answers
45 views

Process scheduling accounting for multiple factors

I'm attempting to solve a problem that consists of scheduling two types (A and B) of processes to run. The system must be non-preemptive (once a process starts executing it must finish before another ...
0
votes
0answers
10 views

How to do Distributed Job Scheduling after the Leader was elected and slaves are known - (bully)

I'm building a system that processes key,value pairs on a continuous basis in a loop, until terminated. How do I schedule tasks on the leader and make slaves execute them? This is a realm of ...
0
votes
1answer
42 views

Calculation of speed up of a program executed in multi-threaded system

Speed up of execution of a program is to be calculated within a multi-threading rather than a single thread system. The program's 30% instruction can be executed serially & rest can be executed ...
0
votes
0answers
37 views

Segmentation with paging

Question: A virtual memory system uses both paging and segmentation. Process virtual addresses consist of a total of 32 bits. The page size is 1024 (210) bytes. A page table may occupy at most one ...
0
votes
1answer
84 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
1answer
3k views

Operating Systems - SJN/Round Robin - turn around time + waiting time

2.(10 pts) a) You are given 4 processes in a batch system that all arrive at time 0 with the following CPU burst times: P1 : 35, P2: 25, P3: 13, P4: 22. Assuming there is no context switch ...
0
votes
0answers
149 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
1answer
136 views

Where to start on SJF Cpu schedualing homework problem?

So the question is; For the following three jobs: P1: 10 (3,2,5); P2: 4 (2,2); P3: 16 (2,3,5,6) Execute the three jobs using Exp Ave Alpha =0.6, default=2 I know the formula to get the exponential ...
0
votes
0answers
483 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
650 views

Two threads are waiting on a mutex. Which one is unblocked?

Suppose there are three threads A, B, C and thread A has acquired a mutex lock and it is processing. If threads B and C try to acquire the same mutex, they will be blocked according to the mutex lock ...
-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
2answers
2k views

I/O bound processes over CPU bound processes [closed]

will an OS which favors I/O bound processes over CPU-Bound processes, experience less average waiting time? If yes, why?
-2
votes
1answer
98 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?
-3
votes
1answer
477 views

A Dead-lock in an Operating System is

A Dead-lock in an Operating System is Desirable process Undesirable process Definite waiting process All of the above My attempt: As "If a process is unable to change its state indefinitely because ...
-3
votes
1answer
61 views

Which process comes first?

Let's say we have 3 processes: Process 1 service time 6 arrival time 0 Process 2 service time 2 arrival time 1 Process 3 service time 5 arrival time 3 We know that: after 1 time, process 2 will ...

1 2
3