Abstract

In its first part, the article compares control principles in computer operating systems and in transport systems, and outlines similarities. One part of the control in both systems is handling of deadlock situations. When replacing human control by computer control in transport systems, handling of deadlock situations must be tackled as well. In its second part, the article outlines algorithms used in the operating systems field for that and discusses their potential application in the transport systems field. It comes to a conclusion that avoidance of deadlock by dynamic analysis of requested and assigned resources to processes looks to be the most perspective way generally, although in specific systems, rules for prevention or detection and recovery from deadlock can be also applied.

Highlights

  • I focused on the deadlock theory and handling of deadlocks in the operating systems

  • We have found that handling methods used there can be applied in automatic control in transport systems

  • From the analysis we can see that ● Detection and recovery from deadlock may be applicable, but recovery cost and complexity strongly depends on a concrete transportation system (TS) and a concrete deadlock situation. ● Prevention from deadlock by structural prevention of one or more conditions of deadlock is not applicable in most cases

Read more

Summary

Motivation

As informatics and automatic control are being implemented in the area of transport, the control part is included as well. In the effort of replacing (at least in part) the human by a computer control, handling of deadlock situations must be created That is why another goal of this article is to discuss application of algorithms for solving deadlock situations from the operating systems field in the transport systems field. The process or its threads individually get assigned resources that they need This can be at the beginning or in course of process – according to a prescribed algorithm. As an example, we can imagine calculation of a mathematical problem, printing of a text document, editing of a table in a table processor, scanning of a picture, copying of data from a hard disk to a floppy disk and receiving of data from the computer network All of these jobs process data according to a prescribed algorithm. The data are transformed from input to output, in other cases, they are moved between two places, or both, moved and transformed

Analogy in Control of Transportation System and Operating System
Deadlock theory
Deadlock prevention
Deadlock detection and recovery
Deadlock avoidance
Conclusion

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.