Avoidance of Priority Inversion in Real Time Systems Based on Resource Restoration
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...
محفوظ في:
| المؤلف الرئيسي: | |
|---|---|
| مؤلفون آخرون: | , |
| التنسيق: | article |
| منشور في: |
2006
|
| الموضوعات: | |
| الوصول للمادة أونلاين: | https://eprints.kfupm.edu.sa/id/eprint/2639/1/IJCSA-Abstarct.pdf |
| الوسوم: |
إضافة وسم
لا توجد وسوم, كن أول من يضع وسما على هذه التسجيلة!
|
| _version_ | 1864513382492667905 |
|---|---|
| author | Helmy, Tarek |
| author2 | Jafri, Syed unknown |
| author2_role | author author |
| author_facet | Helmy, Tarek Jafri, Syed unknown |
| author_role | author |
| dc.creator.none.fl_str_mv | Helmy, Tarek Jafri, Syed unknown |
| dc.date.none.fl_str_mv | 2006 2020 |
| dc.format.none.fl_str_mv | application/pdf |
| dc.identifier.none.fl_str_mv | https://eprints.kfupm.edu.sa/id/eprint/2639/1/IJCSA-Abstarct.pdf (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. |
| dc.language.none.fl_str_mv | en |
| dc.relation.none.fl_str_mv | https://eprints.kfupm.edu.sa/id/eprint/2639/ |
| dc.rights.*.fl_str_mv | info:eu-repo/semantics/openAccess |
| dc.subject.none.fl_str_mv | Computer |
| dc.title.none.fl_str_mv | Avoidance of Priority Inversion in Real Time Systems Based on Resource Restoration |
| dc.type.none.fl_str_mv | Article PeerReviewed info:eu-repo/semantics/publishedVersion info:eu-repo/semantics/article |
| description | 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. |
| eu_rights_str_mv | openAccess |
| format | article |
| id | KFUPM_94a02039a9f8741fa3eb747ffb64d0f8 |
| identifier_str_mv | (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. |
| language_invalid_str_mv | en |
| network_acronym_str | KFUPM |
| network_name_str | King Fahd University of Petroleum and Minerals |
| oai_identifier_str | oai::2639 |
| publishDate | 2006 |
| repository.mail.fl_str_mv | |
| repository.name.fl_str_mv | |
| repository_id_str | |
| spelling | Avoidance of Priority Inversion in Real Time Systems Based on Resource RestorationHelmy, TarekJafri, SyedunknownComputerPriority 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.20062020ArticlePeerReviewedinfo:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/articleapplication/pdfhttps://eprints.kfupm.edu.sa/id/eprint/2639/1/IJCSA-Abstarct.pdf (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. enhttps://eprints.kfupm.edu.sa/id/eprint/2639/info:eu-repo/semantics/openAccessoai::26392019-11-01T13:45:45Z |
| spellingShingle | Avoidance of Priority Inversion in Real Time Systems Based on Resource Restoration Helmy, Tarek Computer |
| status_str | publishedVersion |
| title | Avoidance of Priority Inversion in Real Time Systems Based on Resource Restoration |
| title_full | Avoidance of Priority Inversion in Real Time Systems Based on Resource Restoration |
| title_fullStr | Avoidance of Priority Inversion in Real Time Systems Based on Resource Restoration |
| title_full_unstemmed | Avoidance of Priority Inversion in Real Time Systems Based on Resource Restoration |
| title_short | Avoidance of Priority Inversion in Real Time Systems Based on Resource Restoration |
| title_sort | Avoidance of Priority Inversion in Real Time Systems Based on Resource Restoration |
| topic | Computer |
| url | https://eprints.kfupm.edu.sa/id/eprint/2639/1/IJCSA-Abstarct.pdf |