A Deadlock and Livelock Free Protocol for Decentralized Internet Resource Coallocation

IEEE Transactions on Systems, Man, and Cybernetics Part A:Systems and Humans.

Volumn 34, Issue 1, 2004, Pages 123-131

  Park, Jonghun ^a  

^a Korea Advanced Institute of Science and Technology (KAIST)   (South Korea)

Author keywords

Coallocation; Deadlock; Decentralized protocol; Internet computing; Livelock; Resource allocation

Indexed keywords

COMPUTATIONAL METHODS; COMPUTER SYSTEM RECOVERY; DECENTRALIZED CONTROL; DISTRIBUTED COMPUTER SYSTEMS; ELECTRONIC COMMUNITIES; NETWORK PROTOCOLS; RESOURCE ALLOCATION;

COALLOCATION; DEADLOCK; DECENTRALIZED PROTOCOL; INTERNET COMPUTING; LIVELOCKS;

WEBSITES;

EID: 0742325050     PISSN: 10834427     EISSN: None     Source Type: Journal    
DOI: 10.1109/TSMCA.2003.820571     Document Type: Article

References (23)

1. I. Foster and C. Kesselman, The Grid: Blueprint for a New Computing Infrastructure. San Mateo, CA: Morgan Kaufman, 1998.
2. I. Foster, C. Kesselman, and S. Tuecke, "The anatomy of the grid: Enabling scalable virtual organizations," Int. J. Supercomput. Applicat., vol. 15, no. 3, 2001.
3. S. Graham, S. Simeonov, T. Boubez, D. Davis, G. Daniels, Y. Nakamura, and R. Neyama, Building Web Services with Java: Making Sense of XML, SOAP, WSDL, and UDDI. Indianapolis, IN: SAMS, 2001.
4. K. Czajkowski, I. Foster, N. Karonis, C. Kesselman, S. Martin, W. Smith, and S. Tuecke, "A resource management architecture for metacomputing systems," in Proc. IPPS/SPDP Workshop Job Scheduling Strategies Parallel Processing, 1998, pp. 62-82.
5. I. Foster, C. Kesselman, C. Lee, B. Lindell, K. Nahrstedt, and A. Roy, "A distributed resource management architecture that supports advance reservations and co-allocation," presented at the International Workshop on Quality of Service, 1999.
6. K. M. Chandy, "Caltech Infospheres Project Overview: Information Infrastructures for Task Forces," California Inst. Technol., Pasadena, 1996.
7. M. Singhal and N. G. Shivaratri, Advanced Concepts in Operating Systems: Distributed, Database, and Multiprocessor Operating Systems, New York: McGraw-Hill, 1994.
8. M. Singhal, "Deadlock detection in distributed systems," IEEE Computer, pp. 37-48, Nov. 1989.
9. J. Jardine, Q. Snell, and M. Clement, "Livelock avoidance for meta-schedulers," in Proc. 10th IEEE Int. Symp. High Performance Distributed Computing, 2001, pp. 141-146.
10. A. D. Kshemkalyani and M. Singhal, "Distributed detection of generalized deadlocks," presented at the International Conference on Distributed Computing Systems, 1997.
11. J. R. G. de Mendívil, F. Fariña, J. R. Garitagoitia, and J. M. Bernabeu-Auban, "A distributed deadlock resolution algorithm for the AND model," IEEE Trans. Parallel Distrib. Syst., vol. 10, pp. 433-447, May 1999.
12. S. S. Isloor and T. A. Marsland, "The deadlock problem: An overview," IEEE Computer, vol. 13, pp. 58-78, Sept. 1980.
13. F. Cristian, "Probabilistic clock synchronization," Distrib. Comput., vol. 3, pp. 146-158, 1989.
14. H. Garcia-Molina and A. Spauster, "Ordered and reliable multicast communication," ACM Trans. Comput. Syst., vol. 9, no. 3, pp. 242-271, 1991.
15. N. A. Lynch, "Upper bounds for static resource allocation in a distributed system," J. Comput. Syst. Sci., vol. 23, pp. 254-278, 1981.
16. E. Styer and G. L. Peterson, "Improved algorithms for distributed resource allocation," in Proc. 7th Annual ACM Symp. Principles Distributed Computing, 1988, pp. 105-116.
17. I. Page, T. Jacob, and E. Chern, "Fast algorithms for distributed resource allocation," IEEE Trans. Parallel Distrib. Syst., vol. 4, pp. 188-197, Feb. 1993.
18. J. Park and S. Reveliotis, "Deadlock avoidance in sequential resource allocation systems with multiple resource acquisitions and flexible routings," IEEE Trans. Automat. Contr., vol. 46, pp. 1572-1583, Oct. 2001.
19. D. C. Kozen, Automata and Computability. New York: Springer-Verlag, 1997.
20. K. Jensen, Colored Petri Nets. 2nd ed. New York: Springer-Verlag, 1997, vol. 1.
21. M. R. Garey and D. S. Johnson, Computers and Intractability : A Guide to the Theory of NP-Completeness. San Francisco, CA: Freeman, 1979.
22. P. Karn and C. Partridge, "Improving round-trip time estimates in reliable transport protocols," ACM SIGCOMM Computer Commun. Review. vol. 17, no. 5, pp. 2-7, 1987.
23. L. A. Goldberg and P. D. MacKenzie, "Analysis of practical backoff protocols for contention resolution with multiple servers," in Proc. 7th Annual Symp. Discrete Algorithms, 1996, pp. 554-563.