Abstract
Deadlock is a major problem for systems that allocate resources in real time. The key issue in deadlock avoidance is whether or not a given resource allocation state is safe: that is, whether or not there exists a sequence of resource allocations that completes all processes. Although safety is established as NP-complete for certain broad resource allocation classes, newly emerging resource allocation scenarios often exhibit unique features not considered in previous work. In these cases, establishing the underlying complexity of the safety problem is essential for developing the best deadlock avoidance approach. This work investigates the complexity of safe resource allocation for a class of systems relevant in automated manufacturing. For this class, the resource needs of each process are expressed as a well-defined sequence. Each request is for a single unit of a single resource and is accompanied by a promise to release the previously allocated resource. Manufacturing researchers have generally accepted that safety is computationally hard, and numerous suboptimal deadlock avoidance solutions have been proposed for this class. Recent results, however, indicate that safety is often computationally easy. The objective of this article is to settle this question by formally establishing the NP-completeness of safety for this class and investigating the boundary between the hard and easy cases. We discuss several special structures that lead to computationally tractable safety characteristics.
Similar content being viewed by others
References
Araki, T., Sugiyama, Y., Kasami, T., and Okui, J., “Complexity of the Deadlock Avoidance Problem, ” Proceedings of 2nd IBM Symposium on the Mathematical Foundations of Computer Science, IBM Japan, Tokyo, pp. 229–252 (1977).
Banaszak, Z. and Krogh, B., “Deadlock Avoidance in Flexible Manufacturing Systems with Concurrently Competing Process Flows, ” IEEE Transactions on Robotics and Automation, Vol. 6, No. 6, pp. 724–734 (1990).
Banaszak, Z. and Roszkowska, E., “Deadlock Avoidance in Pipeline Concurrent Processes, ” Podstawy Sterowania (Foundations of Control), Vol. 18, pp. 3–17 (1988).
Fanti, M., Maione, B., Mascolo, S., and Turchiano, B., “Event-Based Feedback Control for Deadlock Avoidance in Flexible Production Systems, ” IEEE Transactions on Robotics and Automation, Vol. 13, No. 2, pp. 347–363 (1997).
Fanti, M., Maione, B., and Turchiano, B., “Event Control for Deadlock Avoidance in Production Systems with Multiple Capacity Resources, ” Studies in Informatics and Control, Vol. 7, No. 4, pp. 343–364 (1998).
Garey, M. and Johnson, D., Computers and Intractability: A Guide to the Theory of NP-Completeness, W. H. Freeman, New York (1979).
Gold, M., “Deadlock Prediction: Easy and Difficult Cases, ” SIAM Journal of Computing,Vol. 7, No. 3, pp. 320–336 (1978).
Haberman, A., “Prevention of System Deadlocks, ” Communications of the ACM, Vol. 12, No. 7, pp. 373–377 (1969).
Holt, R., “Some Deadlock Properties of Computer Systems, ” ACMComputing Surveys, Vol. 4, No. 3, pp. 179–196 (1972).
Hsieh, F. and Chang, S., “Dispatching Driven DeadlockAvoidance Controller Synthesis for Flexible Manufacturing Systems, ” IEEE Transactions on Robotics and Automation, Vol. 10, No. 2, pp. 196–209 (1994).
Kumar, P. and Ferreira, P., “Scalable and Maximally Permissive Deadlock Avoidance for FMS, ” Proceedings of the 1998 International Conference on Robotics and Automation, Leuven, Belgium(May 1998).
Lawley, M., “Deadlock Avoidance for Production Systems with Flexible Routing, ” IEEE Transactions on Robotics and Automation, Vol. 15, No. 3, pp. 1–13 (1999).
Lawley, M., Reveliotis, S., and Ferreira, P., “FMS Structural Control and the Neighborhood Policy: Parts 1 and 2, ” IIE Transactions, Vol. 29, No. 10, pp. 877–899 (1997).
Lawley, M., Reveliotis, S., and Ferreira, P., “Application and Evaluation of Banker's Algorithm for Deadlock-Free Buffer Space Allocation in Flexible Manufacturing Systems, ” International Journal of Flexible Manufacturing Systems, Vol. 10, No. 1, pp. 73–100 (1998a).
Lawley, M., Reveliotis, S., and Ferreira, P., “A Correct and Scalable Deadlock Avoidance Policy for Flexible Manufacturing Systems, ” IEEE Transactions on Robotics and Automation, Vol. 14, No. 5, pp. 796–809 (1998b).
Leung, Y. and Sheen, G., “Resolving Deadlocks in Flexible Manufacturing Cells, ” Journal of Manufacturing Systems, Vol. 12, No. 4, pp. 291–304(1993).
Lewis, F., Gurel, A., Bogdan, S., Doganalp, A., and Pastravanu, O., “Analysis of Deadlock and Circular Waits Using a Matrix Model for Flexible Manufacturing Systems, ” Automatica, Vol. 34, No. 9, pp. 1083–1100 (1998).
Narahari, Y. and Khan, L., “Modeling Reentrant Manufacturing Systems with Inspection Stations, ” Journal of Manufacturing Systems, Vol. 15, No. 6, pp. 367–378 (1996).
Reveliotis, S., Lawley, M., and Ferreira, P., “Polynomial Complexity Deadlock Avoidance Policies for Sequential Resource Allocation Systems, ” IEEE Transactions on Automatic Control, Vol. 42, No. 10, pp. 1344–1357 (1997).
Roszkowska, E. and Jentink, J., “Minimal Restrictive Deadlock Avoidance in FMSs, ” Proceedings of European Control Conference, ECC' 93, Vol. 2, pp. 530–534 (1993).
Silberschatz, A. and Peterson, G., Operating Systems Concepts, Addison-Wesley, Reading, MA(1991).
Viswanadham, N., Narahari, Y., and Johnson, T., “Deadlock Prevention and Deadlock Avoidance in Flexible Manufacturing Systems Using Petri Nets, ” IEEE Transactions on Robotics and Automation, Vol. 6, No. 6, pp. 712–723 (1990).
Wysk, R., Yang, N., and Joshi, S., “Detection of Deadlocks in Flexible Manufacturing Cells, ” IEEE Transactions on Robotics and Automation, Vol. 7, No. 6, pp. 853–859 (1991).
Xing, K., Hu, B., and Chen, H., “Deadlock Avoidance Policy for Petri Net Modeling of Flexible Manufacturing Systems with Shared Resources, ” IEEE Transactions on Automatic Control, Vol. 41, pp. 289–295 (1996).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Lawley, M., Reveliotis, S. Deadlock Avoidance for Sequential Resource Allocation Systems: Hard and Easy Cases. International Journal of Flexible Manufacturing Systems 13, 385–404 (2001). https://doi.org/10.1023/A:1012203214611
Issue Date:
DOI: https://doi.org/10.1023/A:1012203214611