Matches in SemOpenAlex for { <https://semopenalex.org/work/W4387237440> ?p ?o ?g. }
Showing items 1 to 84 of
84
with 100 items per page.
- W4387237440 endingPage "204" @default.
- W4387237440 startingPage "197" @default.
- W4387237440 abstract "The programming system of any organization comprises various types of interrelationships, like period dependency, sequence dependency, called-calling in-hierarchy dependency, and other types of application-dependent dependencies. The functionalities in the ‘C’ program are normally un-modular and may scatter in number of interdependent programs group. The control flow graph of the C program helps in identifying the navigational paths within the interdependent programs groups. A deadlock is a situation in which two programs, functional units, or modules that share the same resource effectively prevent each other from accessing the resource. Different techniques are available to detect potential deadlocks in the programming system. Analyzing and comprehending each potential deadlock in order to determine whether the deadlock is viable in a real-world execution requires significant programmer effort. In this paper, a novel approach is proposed to detect deadlock and also eliminate deadlock, which is designed by considering the control flow of the program. In the beginning, the control flow of the entire program is abstracted, and then the entries of each called and calling function are entered in a four-column program dependency table. After performing the entry for the entire program, scan the entire table from left to right and top to bottom. If any row in the program dependency table appears more than once, then there is a possibility of deadlock. After identifying the repeated row, find out the functions that are repeated, and then, the deadlock is resolved by copying the functions in the appropriate place without modifying the functionality." @default.
- W4387237440 created "2023-10-02" @default.
- W4387237440 creator A5026383984 @default.
- W4387237440 creator A5040936215 @default.
- W4387237440 creator A5047103946 @default.
- W4387237440 creator A5092981479 @default.
- W4387237440 date "2023-01-01" @default.
- W4387237440 modified "2023-10-16" @default.
- W4387237440 title "Novel Approach to Identify and Eliminate Deadlocks in the ‘C’ Program" @default.
- W4387237440 cites W1733418053 @default.
- W4387237440 cites W2058878393 @default.
- W4387237440 cites W2094498925 @default.
- W4387237440 cites W2123311197 @default.
- W4387237440 cites W2398231325 @default.
- W4387237440 cites W2800593407 @default.
- W4387237440 cites W2999244406 @default.
- W4387237440 cites W4205602908 @default.
- W4387237440 doi "https://doi.org/10.1007/978-981-99-2746-3_21" @default.
- W4387237440 hasPublicationYear "2023" @default.
- W4387237440 type Work @default.
- W4387237440 citedByCount "0" @default.
- W4387237440 crossrefType "book-chapter" @default.
- W4387237440 hasAuthorship W4387237440A5026383984 @default.
- W4387237440 hasAuthorship W4387237440A5040936215 @default.
- W4387237440 hasAuthorship W4387237440A5047103946 @default.
- W4387237440 hasAuthorship W4387237440A5092981479 @default.
- W4387237440 hasConcept C101468663 @default.
- W4387237440 hasConcept C113429609 @default.
- W4387237440 hasConcept C115903868 @default.
- W4387237440 hasConcept C120314980 @default.
- W4387237440 hasConcept C132525143 @default.
- W4387237440 hasConcept C159023740 @default.
- W4387237440 hasConcept C160191386 @default.
- W4387237440 hasConcept C16311509 @default.
- W4387237440 hasConcept C173608175 @default.
- W4387237440 hasConcept C17744445 @default.
- W4387237440 hasConcept C185874996 @default.
- W4387237440 hasConcept C19768560 @default.
- W4387237440 hasConcept C199360897 @default.
- W4387237440 hasConcept C199539241 @default.
- W4387237440 hasConcept C2778514511 @default.
- W4387237440 hasConcept C2779151265 @default.
- W4387237440 hasConcept C41008148 @default.
- W4387237440 hasConcept C45235069 @default.
- W4387237440 hasConcept C77088390 @default.
- W4387237440 hasConcept C80444323 @default.
- W4387237440 hasConceptScore W4387237440C101468663 @default.
- W4387237440 hasConceptScore W4387237440C113429609 @default.
- W4387237440 hasConceptScore W4387237440C115903868 @default.
- W4387237440 hasConceptScore W4387237440C120314980 @default.
- W4387237440 hasConceptScore W4387237440C132525143 @default.
- W4387237440 hasConceptScore W4387237440C159023740 @default.
- W4387237440 hasConceptScore W4387237440C160191386 @default.
- W4387237440 hasConceptScore W4387237440C16311509 @default.
- W4387237440 hasConceptScore W4387237440C173608175 @default.
- W4387237440 hasConceptScore W4387237440C17744445 @default.
- W4387237440 hasConceptScore W4387237440C185874996 @default.
- W4387237440 hasConceptScore W4387237440C19768560 @default.
- W4387237440 hasConceptScore W4387237440C199360897 @default.
- W4387237440 hasConceptScore W4387237440C199539241 @default.
- W4387237440 hasConceptScore W4387237440C2778514511 @default.
- W4387237440 hasConceptScore W4387237440C2779151265 @default.
- W4387237440 hasConceptScore W4387237440C41008148 @default.
- W4387237440 hasConceptScore W4387237440C45235069 @default.
- W4387237440 hasConceptScore W4387237440C77088390 @default.
- W4387237440 hasConceptScore W4387237440C80444323 @default.
- W4387237440 hasLocation W43872374401 @default.
- W4387237440 hasOpenAccess W4387237440 @default.
- W4387237440 hasPrimaryLocation W43872374401 @default.
- W4387237440 hasRelatedWork W2379911191 @default.
- W4387237440 hasRelatedWork W2380314807 @default.
- W4387237440 hasRelatedWork W2981707591 @default.
- W4387237440 hasRelatedWork W3137189469 @default.
- W4387237440 hasRelatedWork W3140720071 @default.
- W4387237440 hasRelatedWork W4245959597 @default.
- W4387237440 hasRelatedWork W4252845830 @default.
- W4387237440 hasRelatedWork W4387237440 @default.
- W4387237440 hasRelatedWork W1776252073 @default.
- W4387237440 hasRelatedWork W2589418455 @default.
- W4387237440 isParatext "false" @default.
- W4387237440 isRetracted "false" @default.
- W4387237440 workType "book-chapter" @default.