An Analysis of Resolution of Deadlock in Mobile Agent System Through Different Techniques

  • Rashmi PriyaEmail author
  • R. Belwal
Conference paper
Part of the Advances in Intelligent Systems and Computing book series (AISC, volume 553)


Mobile Agents are the set of processes that can move from one host to another host. The request granted by the client machine is executed by movement of mobile agents from a host machine to another host machine. The processes called by client are executed on a machine. The host machine must have all the resource needed to implement the service. This paper deals with allocation of resources through a proposed technique. In order to implement the tasks offered by the client, the mobile agents resume execution at the new machine (Nelson in Remote Procedure Call, PhD thesis, Computer Science, Carnegie Mellon University, 2002) [1]. The extension of client and server model is followed in the development of mobile agents. This paper also analyses the resolution of deadlock through different methods of study. The client only performs the operations provided by the server. There is scope of network scalable system when a particular server does not provide request desired by the client (Almes et al. in The Eden System: A Technical Review, IEEE Transactions on Software Engineering, 1998) [2].


Mobile agents Deadlock Client server Resource 


  1. 1.
    Nelson, B.J., “Remote Procedure Call”, PhD thesis, Computer Science, Carnegie Mellon University, (2002).Google Scholar
  2. 2.
    Almes, G.T., A.P. Black, E.D Lazowska, “The Eden System: A Technical Review”, IEEE Transactions on Software Engineering, vol. 11, (1998).Google Scholar
  3. 3.
    Choudhary, A. L., W. H. Kohler, J. A. Stankovic, and D. Towsley, “A Modified Priority Based Probe Algorithm for Distributed Deadlock Detection and Resolution,” IEEE Trans. on Software Engineering, 2008.Google Scholar
  4. 4.
    Chandy, K. M., and L. Lamport, “Distributed Snapshots: Determining Global States of Distributed Systems, “ACM Trans. on Computer Systems, 2003.Google Scholar
  5. 5.
    Bacor, J.M., and K.G. Hamilton, Distributed Computing with RPC: The Cambridge Approach, “ACM Transaction on Computer Systems”, vol. 5, (2003).Google Scholar
  6. 6.
    Goldman, B., “Deadlock Detection in Computer Networks,” Technical Report MIT/LCS/TR185, MIT, 2006.Google Scholar
  7. 7.
    Cheriton, D.R., “The V Distributed System”, Communications of the ACM, Vol. 30, (2000).Google Scholar
  8. 8.
    Badal, D. J. “The Distributed Deadlock Detection Algorithm,” ACM Trans. on Computer Systems, (1998).Google Scholar
  9. 9.
    Elmagarmid, A.K., N. Soundararajan, and M.T. Liu. “A Distributed Deadlock Detection and Resolution Algorithm and Its Correctness,” IEEE Trans. on Software Engineering, 2007.Google Scholar
  10. 10.
    Gligor, V. D. and S. H. Shattuck. “On Deadlock Detection in Distributed System,” IEEE Trans. on Software Engineering, 2010.Google Scholar
  11. 11.
    Bracha, G., and S. Toueg, “Distributed Deadlock Detection,” Distributed Computing, (2000).Google Scholar
  12. 12.
    Bracha, G., and S. Toueg, “A Distributed Algorithm for Generalized Deadlock Detection,” Proc. Of the ACM Symposium on Principles of Distributed Computing, Aug. 1999.Google Scholar
  13. 13.
    Chandy, K. M., J. Misra, and L. M. Haas. “Distributed Deadlock Detection,” ACM Trans. on Computer Systems, 2005.Google Scholar
  14. 14.
    Lampson, B., “Remote Procedure Calls”, Lecture Notes in Computer science, vol. 105, Springer Verlag, New York, (2004).Google Scholar
  15. 15.
    Chang, E., “Echo Algorithms: Depth Parallel Operations on General Graphs,” IEEE Trans. on Software Engineering, July 2007.Google Scholar

Copyright information

© Springer Nature Singapore Pte Ltd. 2017

Authors and Affiliations

  1. 1.TMUMoradabadIndia
  2. 2.AITHaldwaniIndia

Personalised recommendations