0
Want this question answered?
Be notified when an answer is posted
Add your answer:
Earn +20 pts
What is priority scheduling algorithm?
The priority scheduling algorithm is a kind of CPU scheduling algorithm where the processes that wait for the CPU are scheduled according to their priority..
Which is one of pre-emptive scheduling algorithm?
Priority based algorithm
What kind of process algorithm is used in mac os x?
scheduling algorithm
What CPU scheduling algorithm is used Windows NT?
Windows XP uses a quantum-based, preemptive priority scheduling algorithm
What CPU scheduling algorithm is used by?
same as linux use.
What is the Least Slack Time scheduling algorithm used for?
The Least Slack Time scheduling algorithm is used for assigning priority based on the slack time (temporal difference between the deadline, ready time and run time) of a process.
Is the round robin CPU scheduling algorithm suitable for time sharing OS?
Yes, it is one of many scheduling algorithms suitable for time sharing.However it is not suitable for scheduling in a hard realtime OS that must consistently meet deadlines.
What do you mean by scheduling algorithm in OS?
its the algorithm that tells the os what to process next.goes according to :shortest job firstshortest remaining time firstround robin- first in first out system
Round robin scheduling program in java?
Round robin is the scheduling algorithm that is utilized by the CPU, or central processing unit, during the execution of the process. It is specifically designed for time sharing systems.
What is the best public-key cryptography algorithm and why?
RSA (Rivest, Shamir, and Adelman) is the best public key algorithm.
Which is the best shortest path algorithm?
dijkstra's algorithm (note* there are different kinds of dijkstra's implementation) and growth graph algorithm
What is online scheduling and offline scheduling?
Online scheduling is the useage of competitive analysis (or online algorithms) on scheduling problems. Online algorithms is characterized by making decision "online", which means a point in the time axe. In this point of time, we can not see the future jobs or tasks, whereas we only know the jobs or tasks before or at this point of time. In contrast, in offline scheduling problems, there is no the conception of "point of time". We are lords of the world. We stay outside the real world and can see the past and future (jobs or tasks). TThis aspect is called "offline". Since we can see the past and the future, we know the total knowledge of the problem before we make decision (not depending the time). Even use the simpliest method, such as enumeration, then we can obtain the optimal solution. Nontheless, by not knowing the future knowledge of problem, we must make decision. Then we use a critierion to meaure the performance of online algorithm, called competitive ratio. This is a conception like approximation ratio, compering the objective value obtained by online algorithm and that of offline (optimal) algorithm. Offline scheduling is concerned of the classical scheduling problems. Not introducing the conception of "online". Offline scheduling problem is scheduling problem.
