Skip to main content
Log in

An Improved Protocol for Deadlock and Livelock Avoidance Resource Co-allocation in Network Computing

World Wide Web Aims and scope Submit manuscript

Abstract

A multitude of applications require simultaneous access to multiple kinds of resources scatted in distributed sites. This problem is known as resource co-allocation which has evolved as a hot topic in network computing. How to design a kind of high-performance protocol for deadlock and livelock avoidance resource co-allocation becomes a challenging problem. In this paper, we propose a new protocol OODP3 (Optimal ODP3) which is based on the currently popular protocol ODP3 (Order-based Deadlock Prevention Protocol with Parallel requests).OODP3 not only inherits the advantage of ODP3 but also guarantees the fulfillment of resource co-allocation within polynomial time. Theoretical proof is conducted to verify the correctness of OODP3. Experimental results also show that OODP3 achieves the better performance improvements than the existing deadlock and livelock avoidance protocol.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Abate, A., D’Innocenzo, A., Benedetto, M.D.D., Sastry, S.: Understanding deadlock and livelock behaviors in hybrid control systems. Nonlinear Anal Hybrid Syst 3(2), 150–162 (2009)

    Article  MATH  MathSciNet  Google Scholar 

  2. Aldous, D.J.: Ultimate instability of exponential back-off protocol for acknowledgment-based transmission control of random access communication channels. IEEE Trans Inf Theory IT-33(2), 219–223 (1987)

    Article  MathSciNet  Google Scholar 

  3. Azougagh, D., Yu, J.L., Kim, J.S., Maeng, S.R.: Resource co-allocation: a complementary technique that enhances performance in grid computing environment. In: Barolli, L. (ed.) International conference on parallel and distributed systems (ICPADS 05), vol. 1, pp. 36–42. IEEE Computer Society, Los Alamitos (2005)

    Chapter  Google Scholar 

  4. Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to algorithms. The MIT (2001)

  5. Czajkowski, K., Foster, I., Kesselman, C.: Resource co-allocation in computational grids. International Symposium on High Performance Distributed Computing, pp. 219–228. IEEE Computer Society, Los Alamitos (1999)

  6. Haji, M.H., Gourlay, I., Djemane, K., Dew, P.M.: A SNAP-based community resource broker using a three-phase commit protocol: a performance study. Comput J 48(3), 333–346 (2005)

    Article  Google Scholar 

  7. Hossein Sheikh Attar, M., Tamer Özsu, M.: Alternative architectures and protocols for providing strong consistency in dynamic web applications. World Wide Web 9(3), 215–251 (2006)

    Article  Google Scholar 

  8. http://en.wikipedia.org/wiki/Network_computing

  9. Kuo, D., Mckeown, M.: Advance reservation and co-allocation protocol for grid computing. In: Stockinger, H., Buyya, R., Perrott, R. (eds.) International conference on e-science and grid technologies, pp. 164–171. IEEE Computer Society, Los Alamitos (2005)

    Google Scholar 

  10. Levitin, L., Karpovsky, M., Mustafa, M.: Deadlock prevention by turn prohibition in interconnection networks, Proceedings of the 2009 IEEE International Symposium on Parallel & Distributed Processing (IPDPS 09)

  11. Maclaren, J., Keown, M.N., Pickles, S.: Co-allocation, fault tolerance and grid computing. In: Cox, S.J. (ed.), UK e-science all hands meeting, pp. 155–162. NeSC (2006)

  12. Netto, M., Buyya, R.: Resource co-allocation in grid computing environments, handbook of research on P2P and grid systems for service-oriented computing: models, methodologies and applications. In: Antonopoulosa, N., Exarchakosa, G., Li, M., Liottac, A. (eds.), IGI Global, USA (Feb. 2010).

  13. Park, J.: A deadlock and livelock free protocol for decentralized internet resource coallocation. IEEE Trans Syst Man Cybern Part A Syst Humans 34(1), 123–131 (2004)

    Article  Google Scholar 

  14. Park, J., Reveliotis, S.A.: Deadlock avoidance in sequential resource allocation systems with multiple resource acquisitions and flexible routings. IEEE Trans Automat Contr 46, 1572–1583 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  15. Solheim, A.G., Lysne, O., Bermudez, A., Casado, R., Sodring, T.: Efficient and deadlock-free reconfiguration for source routed networks, Proceedings of the 2009 IEEE International Symposium on Parallel & Distributed Processing (IPDPS 09)

  16. Takefusa, A., Nakada, H., Kudoh, T., Tanaka, Y., Sekiguchi, S.: GridARS: an advance reservation-based grid co-allocation framework for distributed computing and network resources. In: Frachtenberg, E., Schwiegelshohn, U. (eds.) International workshop on job scheduling strategies for parallel processing. Springer, Berlin (2007)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Zhiang Wu.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Cao, J., Wu, Z. An Improved Protocol for Deadlock and Livelock Avoidance Resource Co-allocation in Network Computing. World Wide Web 13, 373–388 (2010). https://doi.org/10.1007/s11280-010-0088-y

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11280-010-0088-y

Keywords

Navigation