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

Evolution of operating system, breifly write a note on about evolution of o...

breifly write a note on about evolution of operating system?

Explain the procedure for handling the page fault, The procedure for handli...

The procedure for handling the page fault is as follows 1. We check the internal table to verify whether the reference was valid or invalid. 2. If the reference was invalid,

File system versus swap space, Q. What are the tradeoffs concerned in rerea...

Q. What are the tradeoffs concerned in rereading code pages from the file system versus using swap space to store them? Answer: If codes pages are accumulate in swap space th

Describes responsibilities of the I/O manager, Q. Describes responsibilitie...

Q. Describes responsibilities of the I/O manager? Answer: The I/O manager is responsible for file systems and device drivers and network drivers. The I/O manager keeps follow

Multiprogramming, explain how response time are reduced by allowing time sh...

explain how response time are reduced by allowing time sharing on top of multiprogramming

Deadlock detection, Deadlocks can be detected while the program is running,...

Deadlocks can be detected while the program is running, by running cycle detection algorithms on the graph that de?nes the current use of resources. De?ne this graph as follows:

Explain page traffic, The term ‘page traffic’ explains   Page traffic’...

The term ‘page traffic’ explains   Page traffic’ explains the movement of pages in and out of memory.

Explain lru second chance algorithm, Second chance Algorithm When the p...

Second chance Algorithm When the page is chosen the reference bit is checked to see whether it has been referenced before. If that is the case after that it is given a second c

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