KFUPM ePrints

Avoidance of Priority Inversion in Real Time Systems Based on Resource Restoration

Helmy, Tarek and Jafri, Syed (2006) Avoidance of Priority Inversion in Real Time Systems Based on Resource Restoration. International Journal of Computer Science and Applications, III (1). pp. 40-50.

[img]
Preview
PDF (Computer Scinece)
12Kb

Abstract

Priority inversion is a problem that occurs in concurrent processes when low-priority threads hold shared resources required by some high-priority threads, causing the high priority-threads to block indefinitely. This problem is enlarged when the concurrent processes are in a real time system where high- priority threads must be served on time. A novice approach for avoiding the priority inversion problem is presented for processes in real time systems. This approach is based on backing up and restoring the shared resources. A low priority thread always starts on a shadow version of the shared resource, the original resource remains unchanged. When a high-priority thread needs a resource engaged by a low-priority thread, the low priority thread is preempted, the original resource is restored and the high-priority thread is allowed to use the original resource. The approach has been implemented in Java and the experimental results are fetched which verify that the approach is very suitable for real time systems where high-priority threads must be served on time.



Item Type:Article
Date:2006
Date Type:Publication
Subjects:Computer
Divisions:College Of Computer Sciences and Engineering > Information and Computer Science Dept
Creators:Helmy, Tarek and Jafri, Syed
Email:helmy@kfupm.edu.sa, shomaail@kfupm.edu.sa
ID Code:2639
Deposited By:TAREK HELMY ELBASUNY
Deposited On:14 Jun 2008 15:44
Last Modified:12 Apr 2011 13:12

Repository Staff Only: item control page