International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
|
Volume 43 - Issue 9 |
Published: April 2012 |
Authors: S. Mohiadeen Abdul Kadhar, T. Revathi |
![]() |
S. Mohiadeen Abdul Kadhar, T. Revathi . An Efficient Monarchic Reconfiguration Protocol with Deadlock Freedom on Interconnection Networks. International Journal of Computer Applications. 43, 9 (April 2012), 1-6. DOI=10.5120/6128-8347
@article{ 10.5120/6128-8347, author = { S. Mohiadeen Abdul Kadhar,T. Revathi }, title = { An Efficient Monarchic Reconfiguration Protocol with Deadlock Freedom on Interconnection Networks }, journal = { International Journal of Computer Applications }, year = { 2012 }, volume = { 43 }, number = { 9 }, pages = { 1-6 }, doi = { 10.5120/6128-8347 }, publisher = { Foundation of Computer Science (FCS), NY, USA } }
%0 Journal Article %D 2012 %A S. Mohiadeen Abdul Kadhar %A T. Revathi %T An Efficient Monarchic Reconfiguration Protocol with Deadlock Freedom on Interconnection Networks%T %J International Journal of Computer Applications %V 43 %N 9 %P 1-6 %R 10.5120/6128-8347 %I Foundation of Computer Science (FCS), NY, USA
Monarchic Reconfiguration protocol (MRP) is the self- governing, independent and autonomous system to resolve the deadlocking problem during reconfiguration in interconnection networks. Deadlock is the cyclic dependency between the old and new routing functions. Our aim is to protect the routing path with deadlocking freedom and improve the performance drastically. Our proposed method will increase the availability and dependability of the network and reduce 100 % pocket drops ratio with deadlock freedom.