The Stack Overflow podcast is back! Listen to an interview with our new CEO.

Questions tagged [process-scheduling]

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

Filter by
Sorted by
Tagged with
1
vote
1answer
2k views

Process Synchronization: Dekker's algorithm

This Screenshot is taken from William Stalling's Operating Systems book. My doubt is that Bounded wait is not satisfied by this solution. For example: P0 and P1 both want to enter critical section ...
1
vote
2answers
759 views

Question on Virtual memory and Physical memory

This is the question where I'm stuck: With a 32-bit virtual address, 4 KB pages(12 offset bits), and 4 bytes per page table entry, we can compute the total page table size: Number of page table ...
1
vote
1answer
382 views

Can the processor just turn off the interrupt request line?

I was doing some of the interrupts question online and found this Multiple choice question How can the processor ignore other interrupts when it is servicing one a) By turning off the interrupt ...
1
vote
2answers
2k views

Switching between user-level and kernel-level threads

After reading difference between user-level threads and kernel-level threads ,now I am in doubt of context switching.Context switching is managed by OS when switching between processes/threads but ...
1
vote
1answer
387 views

processes response time confusion

An OS contains 10 identical processes that were initiated at the same time.Each process contains 15 identical requests. Each request consume 20 msec of CPU time.A request is followed by an I/O ...
1
vote
1answer
57 views

Can a schedule be conflict serializable but not serializable?

A schedule is called conflict serializable if it can be transformed into a serial schedule by swapping non-conflicting operations. Then, My question is: Can a schedule be conflict serializable but ...
1
vote
1answer
38 views

Rate Monotonic maximum execution time

There are several periodic tasks (Period, Execution time), e.g.: A = (20, 9) B = (12, 4) C = (4, X) What methods/tests can be used for finding the maximum execution time X for which the task ...
1
vote
1answer
44 views

Can a process run if there's not enough space for minimum pages?

I'm studying OS and I came up with this scenario where the OS works with a paging scheme and virtual memory, and a process wants to start running, but in memory, there's not enough space to allocate ...
1
vote
1answer
553 views

Difference between Time-sharing computers and computers which use Round Robin scheduling algorithm?

So maybe I'm confused in these concepts but i thought that time sharing computer is a computer which the processor switches between different processes quickly to achieve a good response time but ...
1
vote
1answer
73 views

Number Partitioning targeting a Ratio of subset sums?

I have a problem, which appears to be similar to number partitioning: a set of numbers partitioned (two-way), such that the sum of the numbers in each subset are as close as possible to a targeted ...
1
vote
1answer
3k views

Processor Scheduling (SJF / FCFS)

So I know that scheduling has been covered in other articles, but because my provided values are different and decimals are used, I am having difficulty wrapping my head around it. I have reviewed all ...
1
vote
1answer
1k views

How does the OS Scheduler give/take control of HW?

Imagine a uniprocessor system with a simple operating system with non-threaded processes and basic virtual memory (paging, no segmentation, no replacement to disk, etc). Now assume a simple ...
1
vote
0answers
15 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
1answer
18 views

What is Round Robin's behavior when a process comes at the same time that the old process is swapped out?

Let's say there are two processes: p1 and p2, their arrival time and service time are 0,2 and 3,1 respectively. The time quantum is 2s. After excuting for two seconds, will the processor excute p2 ...
1
vote
0answers
26 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
635 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
1answer
146 views

Proccess scheduling arrival time

If I have a set of processes, let's say 9 and I know the burst time and the waiting time for SJF algorithm and also know that processes arrive in groups of 3 processes at M1 moment, M2 moment, M3 ...
1
vote
0answers
60 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
1answer
222 views

How does CFS prevent a long sleeping task from occupying the CPU?

The Completely Fair Scheduler executes the task that has so far received the least share of CPU time and is thus the most 'disadvantaged'. So if a task sleeps for a really long time, say 3hrs, how ...
1
vote
0answers
43 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
52 views

How to partition a digraph for later parallel computation? [duplicate]

I have a directed graph where all the nodes represent some task that needs to be computed. I need to compute the order of these tasks and also detect any cycles. Running Tarjan's algorithm on the ...
1
vote
0answers
100 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
220 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
114 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
3answers
470 views

How can a spinlock progress when it's busy-waiting?

I read that in spinlock, process keeps on waiting for the lock continuously in a loop until it receives signal(lock) or ...
0
votes
1answer
737 views

Round-Robin Scheduler - What exactly is the quantum time used for?

Suppose you have three stages for a job: Creation stage = the job gets created Executing stage = the job is executed/served Finishing stage = the job is "marked" as finished. Now, say the quantum ...
0
votes
1answer
669 views

Can you explain this exercise solution to me? [closed]

A process running on CTSS (Compatible Time Sharing System) needs 30 quanta to complete. How many times must it be swapped in, including the very first time (before it has run at all)? • Answer : The ...
0
votes
2answers
130 views

Is the program in secondary memory can be a process?

Let us consider the following scenario, The cpu started executing a program, which is in secondary memory with n lines of code, so, it brings m ( < n ) lines of code in to main memory and started ...
0
votes
1answer
271 views

Does a multi cpu system not improve the first come first serve (fcfs) cpu scheduling algorithm?

I created a program that simulates the fcfs scheduling algorithm. First I implemented it for a single core, then modified it for four homogenoues cpus. I compared the results with several datasets, ...
0
votes
1answer
342 views

How to build/recognise a deadlock-free order of resources

I have been faced with a problem where three concurrent processes X, Y ,Z execute three different code segments that access and update certain shared variables. Before entering the respective code ...
0
votes
1answer
3k views

What happens when time slices are too short or too long?

What bad things can occur when the lengths of the time slices in a multitasking system are too small? What can happen when they are too big? How should the length of the time slice be chosen?
0
votes
2answers
83 views

Why are threads called the unit of dispatch?

Threads called the "unit of dispatch" but what does that mean? I was looking over the web and two operating systems books but I can't find the answer. It seems that processes are defined by two ...
0
votes
1answer
50 views

What is the best Approximation algorithm to schedule a task graph?

If I have a task graph T and want a schedule to optimize the make-span, what is currently the best approximation algorithm for this problem? Are there any constant approximation algorithms?
0
votes
1answer
2k views

Peterson's vs. Bakery Algorithm

From my CS course, the Peterson's Algorithm and the Bakery Algorithm both are solutions which satisfy the 3 requirements of any solution to the critical section problem. a) What are their adv/disadv ...
0
votes
3answers
8k views

Exponential averaging for SJF CPU scheduling

Calculate the exponential averaging with $T_1 = 10$, $\alpha=0.5$ and the algorithm is SJF with previous runs as $8,7,4,16$. 9 8 7.5 None I am getting 4. None as the answer. But ...
0
votes
1answer
15 views

multithreading - duration of jobs

" How long will it take for 2 jobs to complete if they're running in parallel, knowing that both have a total of 20 minutes of CPU usage time and 50% IO" I calculated the CPU usage: ...
0
votes
1answer
63 views

Round-Robin fashion exercise

In my Operating Systems class I have an exercise to sketch out how a round-robin algorithm would apply to a specific scenario, which is the following: Now the correction that I was provided with by ...
0
votes
1answer
681 views

What is the relation between Time Sharing operating systems and Round Robin CPU scheduler?

So i have asked this before, but i still didn't get my answer so I'll try to make my question more clear this time : Based on my O.S book, Time sharing operating systems switch between processes ...
0
votes
1answer
467 views

Troubles understanding this Interval Scheduling question

Can someone explain how to prove what this question is asking? I'm terrible at proofs and the fact that I don't even understand the hint is very troubling. This is a homework question. Consider the ...
0
votes
1answer
124 views

How to schedule n jobs that come at different times on 1 machine (each taking a different time to complete the task)?

Let's say I have to do n jobs, and each job can be done at or after a time T(i) (1<=i<=n). And we have 1 machine and the machine takes a time M to do any job whatsoever. The machine once started ...
0
votes
1answer
264 views

Round Robin Scheduling: No process in Ready Queue

First post here, glad I found this exchange. I am in my Operating Systems course at university learning process scheduling. In my homework assignment we have to fill out a simulated scheduling chart ...
0
votes
1answer
568 views

Does a time quantum affect priority non preemptive scheduling?

I am given a list of processes with their arrival time, CPU, time and Priority. The time quantum is given as 2 seconds. A lower priority number translates to a higher priority. (process #, arrival ...
0
votes
1answer
400 views

Does throughput includes CPU idle time also?

I have 3 processes P1,P2,P3 having gantt chart as follows => Now, CPU remains idle in 0 - 2 sec and 44 - 47 seconds as I/O is taking place. Does, this affect throughput as 3 processes can be ...
0
votes
2answers
4k views

Disk scheduling and process scheduling

Whats the diffrence between Disk scheduling and process scheduling? I mean i know the roles of disks and processes, but it seems to me they both have the same aim. to reduce monopolies, they even both ...
0
votes
0answers
9 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
29 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
13 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
54 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
8 views

Job shop scheduling variant with non-sequential process plans

As the title says, I am looking for a variant of the job shop scheduling problem which allows for non-sequential process plans. For example, I might have a job whose task-order constraints look like ...
0
votes
0answers
294 views

Two Process Solution for Critical Section Problem- Algorithm 1

I have started learning Critical Section Problem and its various solutions. To explain my question, let me first give a brief background of it. The general structure for a two Process Solution for ...