Modeling and analysis of deadlock driven dynamic priority scheduling
| dc.contributor.author | Hazra, R. | |
| dc.contributor.author | Kanjilal, A. | |
| dc.contributor.author | Dey, S. | |
| dc.contributor.author | Bhattacharya, S. | |
| dc.date.accessioned | 2020-03-30T10:23:10Z | |
| dc.date.available | 2020-03-30T10:23:10Z | |
| dc.date.issued | 2013 | |
| dc.description.abstract | Specifying and designing Real Time Software Systems (RTSS) is a complex matter, because it requires logical correctness as well as timing correctness. Unified Modeling Language (UML), the standard visual object-oriented modeling language, is suitable to deal with this complexity. In RTSS, scheduling of tasks with hard deadlines has been an important area of research in today's life. In this paper a model is developed using UML 2.0 to highlight the deadlock occurrence as a drawback of Priority Inheritance Protocol (PIP). Further an improved model has been developed to prevent deadlock using the Stack Based Preemption Ceiling Protocol (SBPCP). � 2013 IEEE. | en_US |
| dc.identifier.citation | IEEE Region 10 Annual International Conference, Proceedings/TENCON, 2013, Vol., , pp.- | en_US |
| dc.identifier.uri | https://idr.nitk.ac.in/handle/123456789/8971 | |
| dc.title | Modeling and analysis of deadlock driven dynamic priority scheduling | en_US |
| dc.type | Book chapter | en_US |