PRESENTATION on HoRamamoorthy 2 Phase Deadlock Detection Algorithm

INDEX • Introduction • Experimental Setup • Result Analysis • Conclusion • Future Work

INTRODUCTION • Ho- Ramamoorthy 2 -phase algorithm detects deadlocks when it comes across a

EXPERIMENTAL SETUP • Modified the random flood algorithm. • Deadlocks scenario is obtained while

RESULT ANALYSIS 160 Messages Number of Messages 140 120 100 80 Messages 60 40

Time taken 100 90 80 70 Time 60 50 Time 40 30 20 10

CONCLUSION • With the increase in the number of processes, time taken to detect

FUTURE WORK • Implementing the algorithms in more scalable manner. • Algorithm implementations needs

Slides: 8

Download presentation

PRESENTATION on Ho-Ramamoorthy 2 -Phase Deadlock Detection Algorithm By Nitish Chaparala

INDEX • Introduction • Experimental Setup • Result Analysis • Conclusion • Future Work

INTRODUCTION • Ho- Ramamoorthy 2 -phase algorithm detects deadlocks when it comes across a cycle in the waitfor-graphs. • Cycles are checked for twice before it declares a deadlock. .

EXPERIMENTAL SETUP • Modified the random flood algorithm. • Deadlocks scenario is obtained while processes send messages to each other. • Data-points are used to measure the number of messages sent for a certain number of processes • Time taken for the execution is calculated

RESULT ANALYSIS 160 Messages Number of Messages 140 120 100 80 Messages 60 40 20 0 Number of Processes

Time taken 100 90 80 70 Time 60 50 Time 40 30 20 10 0 Number of Processes

CONCLUSION • With the increase in the number of processes, time taken to detect the deadlock increases. • Also, the number of messages before detecting the deadlock increases.

FUTURE WORK • Implementing the algorithms in more scalable manner. • Algorithm implementations needs to be tested on large real distributed systems. • Want to analyze the performance on various topologies. • The algorithm implementation can be improved to reduce/remove the false deadlock detection possibility.