Modeling and analysis of deadlock driven dynamic priority scheduling

dc.contributor.authorHazra, R.
dc.contributor.authorKanjilal, A.
dc.contributor.authorDey, S.
dc.contributor.authorBhattacharya, S.
dc.date.accessioned2026-02-06T06:40:02Z
dc.date.issued2013
dc.description.abstractSpecifying 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.
dc.identifier.citationIEEE Region 10 Annual International Conference, Proceedings/TENCON, 2013, Vol., , p. -
dc.identifier.issn21593442
dc.identifier.urihttps://doi.org/10.1109/TENCON.2013.6718507
dc.identifier.urihttps://idr.nitk.ac.in/handle/123456789/32677
dc.subjectDeadlock
dc.subjectPIP
dc.subjectRTSS
dc.subjectSBPCP
dc.subjectUML
dc.titleModeling and analysis of deadlock driven dynamic priority scheduling

Files