In Non-Primitive CPU Algo. once a process is given to the CPU it cannot be preempt,but in primitive Algo. it can be.
a unit cell which do not contain any interior point is called primitive unit cell.and a unit cell which contain extra lattice point not at corners is called non primitive unit cell.
1.) in preemptive scheduling we prempt the currently executing process, in non preemptive scheduling we allow the current process to finish its CPU burst time... 2.) in preemptive scheduling the process is forcibly sent to waiting state when a process with higher priority comes to CPU, in non preeemptive scheduling the process at running state can not be forced to leave the CPU until it completes........
Soft real-time scheduling means that, while processor and other scheduling algorithms may be optimized to give preference to higher-priority processes, no absolute guarantee of performance can be made. The hard real-time computer is designed for specialized purposes, where even the smallest amount of latency can make the difference between life and death.
difference between operating system and system software?
uniprocessor : - A type of architecture that is based on a single computing unit. All operations ( additions, multiplications, etc ) are done sequentally on the unit. . multiprocessor : - A type of architecture that is based on multiple computing units. Some of the operations ( not all, mind you ) are done in parallel and the results are joined afterwards.
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.
678
jhfgg
The main difference between the C-SCAN and SCAN algorithms for disk scheduling is how they handle requests that are located at the end of the disk. C-SCAN moves the disk arm to the other end of the disk after servicing the last request, while SCAN moves the arm back to the beginning of the disk. This difference affects the order in which requests are serviced and can impact the overall efficiency of the disk scheduling algorithm.
A Method that used to be a comouter to soultion of promlems is called algorithm.
One is weighted, the other is not. Simple as.
lol i live for the beach
A procedure can go on forever.Where as an Algorithm, will eventually terminate and will have each step precisely defined.
the basic difference between them is that in greedy algorithm only one decision sequence is ever generated. where as in dynamic programming many decision sequences are generated.
what is difference between mid-point and bresenhams circle algorithm what is difference between mid-point and bresenhams circle algorithm bresenhams circle algorithm results in a much more smoother circle,comparred to midpoint circle algorithm..In mid point,decision parameter depends on previous decision parameter and corresponding pixels whereas in bresenham decision parameter only depends on previous decision parameter...
An algorithm is a method of solving a problem. A flow chart is a tool for visualizing algorithms.
People have developed many encryption algorithms. One particular encryption algorithm is the Rijndael algorithm, usually called the AES or Advanced Encryption Standard.