I am a computer science student and I have an exam tomorrow on operating systems. I have the exam questions of past years and there is one scenario in a question. There are two tasks in the ready-to-run (I don’t what’s its name) queue. And the scheduling algorithm is Shortest Time to Completion First (STCF). And two semaphores, S1 and S2. Lets call the task one T1 and task two T2. Here is the sce..
Tag : scheduling
I have a set of jobs that start by querying an external server for a payload. On receiving the payload, the internal server takes a variable amount of time to complete the job, hence the ‘weight’. What I’d like to do is schedule the jobs in such a way that stress on the external server is minimized: if I ran lots of consecutive ‘light’ jobs, for instance, the server might not be able to handle the traffic and go down. I can think of some easy approaches, like just alternating light jobs with heavy ones, but is this problem formally stated somewhere? It’d be nice to refer to..