The accuracy of real-time system depends not only on the systemâ€™s outputs but also on the time at which these outputs are produced. The most important characteristic of real-time systems is that they have strict timing requirements that must be guaranteed and satisfied. The task set can be scheduled by a number of policies including dynamic priority or fixed priority (FP) algorithms. The success of a real-time system depends on whether all jobs of all the tasks can be guaranteed to complete their executions before their timing deadlines. If they can then we say the task set is scheduling.  In resource sharing we have assume set of independent task. However tasks may share resources to communicate with each other e.g. through shared memory. Because resources are sparse e.g. I/O devices duplication would be expensive. The Earliest Deadline First (EDF) algorithm is one of the most widely studied dynamic priority scheduling policies for real-time systems. These resources are typically protected by semaphores or mutexes provided by a real-time operating system (RTOS).  If a high-priority task is suspended waiting for a lower-priority task to complete its use of a non-preemptable resource, then priority inversion occurs. The task is said to be blocked by the lower priority task. For uniprocessor fixed priority scheduled systems, blocking time can be minimised by the use of a Priority Ceiling inheritance Protocol (PCP).
A transaction processing system is a computer database system that balances and control purchases of goods and services within a business network. A common example may be a consumer purchasing a product on an online store .
Keyword : Kalyani Gholap 1, Prof. S.A. Bhura
This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.