c stands for circular elevator algorithm in case of disk scheduling algorithms.
4. what does c stand for in case of disk scheduling algorithms?
circular elevator algorithm
Na
Na
multiprocessor scheduling algorithms are static or dynamic. a scheduling algorithm is static if the scheduling decisions as to what computational tasks will be allocated to what processors are made before running the program. an algorithm is dynamic if it is taken at run time. for static scheduling algorithms, a typical approach is to rank the tasks according to their precedence relationships and use a list scheduling technique to schedule them onto the processors.





























section::::see also.





























bullet::::- job shop scheduling, a similar problem for scheduling jobs on machines. some variants of multiprocessor scheduling and job shop scheduling are equivalent problems.





























section::::references.
multiprocessor scheduling