Questions tagged [scheduling]

In computer science, scheduling is the method by which threads, processes or data flows are given access to system resource.

Source: "Scheduling (computing)" article on Wikipedia

Types of scheduling

  • Round-robin

    Processes are given a set amount of time. For more information see

  • First come first serve

    Processes are executed in the order of the queue.

  • Shortest job first

    Processes are executed in order of estimated time.

  • Shortest remaining time

    Similar to shortest job first; however, if a new, shorter process joins the queue, then the scheduler will switch to that one.

  • Multi-level feedback queue

    There is more than just one queue, each queue has a certain priority and the scheduler can move jobs between queues when necessary. Modern operating systems like Windows use this.

2772 questions
5
votes
1 answer

How exactly are tasklets scheduled internally?

I know that Tasklets are deferred interrupt handlers are are executed in interrupt context besides they have the highest priority (most certainly above user processes). However if we have multiple Tasklets with a lot of work to be done, how are…
Eastern Monk
  • 6,395
  • 8
  • 46
  • 61
5
votes
2 answers

Scheduling policies in Linux Kernel

Can there be more than two scheduling policies working at the same time in Linux Kernel ? Can FIFO and Round Robin be working on the same machine ?
5
votes
3 answers

Priority Preemptive Scheduling

When using Priority Preemptive Scheduling, does a higher priority yield way to a process with a lower priority but with a shorter burst time? For example, if I had: Arrival Time Burst Time Priority P1 0 5 3 P2 …
raphnguyen
  • 3,565
  • 18
  • 56
  • 74
5
votes
1 answer

pid of the currently executing process

Friends, I am trying to trace the complete execution of an operating system including the processes running on top of it. For this I want the instructions executed by each process and its execution trace and I want to do this without having to go…
prathmesh.kallurkar
  • 5,468
  • 8
  • 39
  • 50
5
votes
1 answer

How to use Quartz.net in console application [showing error]?

I am using Quartz.Net to schedule task. I have tried like wise. Started a visual studio console application and added two reference i.e Quartz.dll and Common.Logging.dll along with System.Web.Services; Then i coded a little bit for a normal task as…
ItsLockedOut
  • 229
  • 1
  • 4
  • 17
5
votes
3 answers

scheduling algorithm - only first visit paid

I need to know whether the following problem has been studied before: Let's have a directed acyclic graph G. The graph is connected, it has exactly one source vertex (no incomming nodes) and exactly one sink vertex (no outgoing nodes). Each vertex…
danatel
  • 4,844
  • 11
  • 48
  • 62
5
votes
1 answer

What framework to use for advanced job scheduling in Java?

In my application I need to have periodically run background tasks (which I can easily do with Quartz - i.e. schedule a given job to be run at a specific time periodically). But I would like to have a little bit more control. In particular I need…
machinery
  • 3,793
  • 4
  • 41
  • 52
5
votes
13 answers

What's the easiest way to schedule a function to run at a specific time using C#

If I had a lot of messages in a database that I wanted to send, and each row specified a date and time to send the message, and a flag for if it has been sent. These won't always be at fixed intervals, and more than 1 message may want to be sent at…
Dan Harris
  • 1,336
  • 1
  • 21
  • 44
5
votes
1 answer

Database Design: schedules, including recurrence

I need to develop an application that supports "schedules". Example of schedules: Jan 1, 2011 at 9am Jan 1, 2011 from 9am to 10am Every Monday at 9am, from Jan 1, 2011 Every Monday at 9am, from Jan 1, 2011 to Feb 1, 2011 Every Monday at 9am, from…
StackOverflowNewbie
  • 39,403
  • 111
  • 277
  • 441
5
votes
2 answers

Reasons for Soft Lock up?

When we enable CONFIG_DETECT_SOFTLOCKUP to detect soft lockups, it creates a new task called khungtaskd which will run every 1s. If khungtaskd fails to get scheduled for 'n' seconds, then Kernel will declare a soft lockup. My question is what are…
Pavan Manjunath
  • 27,404
  • 12
  • 99
  • 125
5
votes
2 answers

Scheduling algorithm

I have a scheduling problem where new jobs (sets of tasks whose execution is sequentially connected) arrive every few seconds or so. Each job requires some resources to be allocated at known intervals. For example: Job j1 is a set of tasks for which…
PLane
  • 186
  • 1
  • 7
5
votes
2 answers

Does any JVM implement blocking with spin-waiting?

In Java Concurrency in Practice, the authors write: When locking is contended, the losing thread(s) must block. The JVM can implement blocking either via spin-waiting (repeatedly trying to acquire the lock until it succeeds) or by suspending the…
Konrad Reiche
  • 27,743
  • 15
  • 106
  • 143
5
votes
4 answers

How to distinguish between I/O bound and CPU bound jobs ?

How does a long term scheduler decide which job is I/O bound and which one is CPU bound? I heard that by using cpu burst we can distinguish between I/O bound and CPU bound jobs, but how is the CPU burst calculated without processing the program?
user764178
  • 71
  • 1
  • 1
  • 3
5
votes
4 answers

Run at logon a desktop application with elevated privileges

The task is widespread, but I’m not satisfied with the solutions I’ve found so far. The program must work on the background, regularly scan the system for the state change and, on some conditions, show notifying popup windows to users. The program…
Dmitry Tashkinov
  • 1,976
  • 19
  • 16
5
votes
2 answers

mutually-exclusive job scheduling in GNU make?

Using GNU make, is it possible to create a set of targets that will never be scheduled at the same time when using the "--jobs" option? Background: To make this a little more concrete, consider a makefile of the form p1: ...deps... # no…
Mr Fooz
  • 109,094
  • 6
  • 73
  • 101