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

Describe internal layout of the file system in windows 2000, Describe the i...

Describe the internal layout of the file system in windows 2000. The basic entity in NTFS is a volume and a volume is created by the Windows 2000 disk administrator utility and

How does an operating system make multiprogramming possible, How does an op...

How does an operating system make multiprogramming possible by using single processor?

Why is rotational latency is not taken in disk scheduling, Why is rotationa...

Why is rotational latency usually not considered in disk scheduling? How would you modify SSTF, SCAN, and C-SCAN to include latency optimization? Most disks do not export their

Determine the syntax of the fork and join primitive, Determine the syntax o...

Determine the syntax of the Fork and Join Primitive  Answer: Syntax of the Fork and Join Primitive is as follow: Fork Join

Do ratio analysis of financial statements, Do ratio analysis by comparing t...

Do ratio analysis by comparing the four companies financial statements, analysis and interpretation on the four-basic group : (Refer to attachment A) Liquidity ratio Asset

Explain enhanced second-chance algorithm, Enhanced second-chance algorithm....

Enhanced second-chance algorithm. When we increase the second-chance algorithm by considering both the reference bit and the modify bit as an order pair. We have the following

Define state that process must obtain all resources it needs, Before procee...

Before proceeding with its execution, every process must obtain all the resources it needs is called Hold and wait

Obelia, what do obelia eat and how do they feed

what do obelia eat and how do they feed

Briefly discuss on bankers algorithm, Briefly discuss on Bankers algorithm?...

Briefly discuss on Bankers algorithm? The resource-allocation graph algorithm is not applicable to a resource-allocation system with multiple examples  for each resource type.

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