Briefly discuss on real-time scheduling, Operating System

Assignment Help:

Briefly discuss on real-time scheduling?

It is divided into two types. 

Hard real-time systems are needed to complete a critical task within a guaranteed amount of time. The scheduler then either admits the process, guaranteeing that the process will complete on time, or rejects the request as impossible.

This is called as resource reservation. Thus, hard real-time systems are composed of special-purpose software running on hardware devoted to their critical process.

Software real-time computing is less restrictive. It needs that critical processes receive priority over less fortune ones.

There are various ways to achieve preemptible to keep dispatch latency low. One is to insert preemption points in long-duration system calls that check to see while a high priority process requires to run. Another method for dealing with preemption is to make the whole kernel preemptible.  

 


Related Discussions:- Briefly discuss on real-time scheduling

Total physical memory and total virtual memory , A practical task specified...

A practical task specified in the Study Guide, Computer architecture, was to record your computer's specifications. Submit the data you recorded, which will contain the following d

Cosled loop, What are the two principles in Hungarian method?

What are the two principles in Hungarian method?

What is the occupation of the object manager, Q. What is the occupation of ...

Q. What is the occupation of the object manager? Answer: Substance present a generic set of kernel mode interfaces to user mode programs. Objects are influenced by the execut

Cpu scheduling algorithm, Q. A CPU scheduling algorithm determined an orde...

Q. A CPU scheduling algorithm determined an order for the execution of its scheduled processes. Convinced n processes to be scheduled on one processor how numerous possible differ

Define projected allocation state is safe - banker algorithm, A system cons...

A system consists of 10 units of resource class Ru. The resource needs of three user processes P1, P2 and P3 are like this                     Using Banker's algorithm, de

Several cpu-scheduling algorithms, Q. Several CPU-scheduling algorithms are...

Q. Several CPU-scheduling algorithms are parameterized for instance the RR algorithm requires a parameter to indicate the time slice. Multilevel response queues require parameters

Operating systems, Ask using a laballed diagram explaining the architecture...

Ask using a laballed diagram explaining the architecture of windows operating ststem

Explain the demand paging system, Question : (a) In the demand paging ...

Question : (a) In the demand paging system, when a process tries to access a page that was not brought into memory, a page fault occurs that involves a series of actions. The

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd