Advanced search options

Advanced Search Options 🞨

Browse by author name (“Author name starts with…”).

Find ETDs with:

in
/  
in
/  
in
/  
in

Written in Published in Earliest date Latest date

Sorted by

Results per page:

Sorted by: relevance · author · university · dateNew search

You searched for subject:(deadlock avoidance algorithms). Showing records 1 – 2 of 2 total matches.

Search Limiters

Last 2 Years | English Only

No search limiters apply to these results.

▼ Search Limiters


Penn State University

1. Sidhu, Amiteshwar Singh. SEARCH-BASED MAXIMALLY PERMISSIVE DEADLOCK AVOIDANCE IN FLEXIBLE MANUFACTURING CELLS.

Degree: MS, Industrial Engineering, 2009, Penn State University

A search based maximally permissive method for deadlock avoidance was developed in this research. The method developed is maximally permissive in that no safe part moves requests are denied. This leads to higher resource utilization than conservative approaches. Maximal permissiveness, however, is associated with a high computational expense. Two different tree search strategies, a depth first search and a hybrid search, were developed to perform the look ahead evaluation of part move requests. Strategies for reducing the amount of search involved in deadlock avoidance were developed and are presented. A strategy for avoiding repetitive search is also presented. A factorial experiment was conducted to evaluate the relative performance of the different deadlock avoidance algorithm combinations presented in this research. The results indicate that depth first search strategy when used with repeat avoidance performs better than the hybrid search. From another experiment it was observed that evaluation of safety of most part move requests did not require evaluation of a large number of reachable states. Only a small percentage of part move requests required evaluation of a large number of reachable states.

Subjects/Keywords: Problem Reduction; Look Ahead Search; Search Algorithms; Flexible Manufacturing Systems; Deadlock Avoidance; Circuit Detection

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Sidhu, A. S. (2009). SEARCH-BASED MAXIMALLY PERMISSIVE DEADLOCK AVOIDANCE IN FLEXIBLE MANUFACTURING CELLS. (Masters Thesis). Penn State University. Retrieved from https://etda.libraries.psu.edu/catalog/10124

Chicago Manual of Style (16th Edition):

Sidhu, Amiteshwar Singh. “SEARCH-BASED MAXIMALLY PERMISSIVE DEADLOCK AVOIDANCE IN FLEXIBLE MANUFACTURING CELLS.” 2009. Masters Thesis, Penn State University. Accessed May 19, 2019. https://etda.libraries.psu.edu/catalog/10124.

MLA Handbook (7th Edition):

Sidhu, Amiteshwar Singh. “SEARCH-BASED MAXIMALLY PERMISSIVE DEADLOCK AVOIDANCE IN FLEXIBLE MANUFACTURING CELLS.” 2009. Web. 19 May 2019.

Vancouver:

Sidhu AS. SEARCH-BASED MAXIMALLY PERMISSIVE DEADLOCK AVOIDANCE IN FLEXIBLE MANUFACTURING CELLS. [Internet] [Masters thesis]. Penn State University; 2009. [cited 2019 May 19]. Available from: https://etda.libraries.psu.edu/catalog/10124.

Council of Science Editors:

Sidhu AS. SEARCH-BASED MAXIMALLY PERMISSIVE DEADLOCK AVOIDANCE IN FLEXIBLE MANUFACTURING CELLS. [Masters Thesis]. Penn State University; 2009. Available from: https://etda.libraries.psu.edu/catalog/10124


Ohio University

2. Zhang, Wenle. Scalable deadlock avoidance algorithms for flexible manufacturing systems.

Degree: PhD, Electrical Engineering & Computer Science (Engineering and Technology), 2000, Ohio University

Existing deadlock prevention and avoidance methods for flexible manufacturing systems have either restricted the class of systems they apply to, or are conservative so that the approach has polynomial complexity. The problem with these restrictions is that the system is not allowed to enter many safe states that contribute to high resource utilization. This work has developed two deadlock avoidance algorithms for flexible manufacturing systems that allow both single capacity and multiple capacity resources. The model further allows choices in part routing; that is, there can be several resources to choose from to visit next at any step of a process plan. Process plans need not be sequential and fixed, but must be finite. Two types of choices have been considered: free choice, where the system controller can pick one of several possibilities; and conditional choice, where factors external to the system influence the choice. An example of conditional choice is routing based on the results of an inspection. The first algorithm developed allows free choices only. The second allows both types of choices. The main strategy of both algorithms is to analyze a potential part movement to determine whether such a move is safe, unsafe, or undetermined. This classification is linear in complexity. A part movement that is classified as undetermined is further analyzed using another procedure, which attempts to empty the system (virtually) to decide whether or not the original move is safe. In this case, the complexity involved in determining the final classification of the proposed part move increases to the cube of the system size <i>L</i>, that is,O( <i>L</i> 3). The methods are proved to be correct, that is, they will not allow a live system to enter a deadlock state. The first method is compared to other popular deadlock detection and avoidance algorithms in the literature. The proposed method is less conservative than the existing algorithms. In addition, the system does not require any preprocessing; so that the mix of parts, as well as the system itself, can be changed on the fly. Examples showing the application of the method are provided. Advisors/Committee Members: Judd, Robert (Advisor).

Subjects/Keywords: Scalable algorithms; deadlock avoidance algorithms; flexible manufacturing systems

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Zhang, W. (2000). Scalable deadlock avoidance algorithms for flexible manufacturing systems. (Doctoral Dissertation). Ohio University. Retrieved from http://rave.ohiolink.edu/etdc/view?acc_num=ohiou1179862449

Chicago Manual of Style (16th Edition):

Zhang, Wenle. “Scalable deadlock avoidance algorithms for flexible manufacturing systems.” 2000. Doctoral Dissertation, Ohio University. Accessed May 19, 2019. http://rave.ohiolink.edu/etdc/view?acc_num=ohiou1179862449.

MLA Handbook (7th Edition):

Zhang, Wenle. “Scalable deadlock avoidance algorithms for flexible manufacturing systems.” 2000. Web. 19 May 2019.

Vancouver:

Zhang W. Scalable deadlock avoidance algorithms for flexible manufacturing systems. [Internet] [Doctoral dissertation]. Ohio University; 2000. [cited 2019 May 19]. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=ohiou1179862449.

Council of Science Editors:

Zhang W. Scalable deadlock avoidance algorithms for flexible manufacturing systems. [Doctoral Dissertation]. Ohio University; 2000. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=ohiou1179862449

.