Resource allocation method and system for avoiding deadlock
A technology for resource allocation and deadlock avoidance, applied in the field of computer systems, can solve problems such as inability to satisfy users, and achieve the effect of avoiding deadlock and efficiently allocating resources
Active Publication Date: 2017-04-12
NEUSOFT CORP
View PDF5 Cites 0 Cited by
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
In specific projects, real-time users often require better response speed, and this algorithm cannot meet the needs of users
Method used
the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View moreImage
Smart Image Click on the blue labels to locate them in the text.
Smart ImageViewing Examples
Examples
Experimental program
Comparison scheme
Effect test
Embodiment Construction
[0050] Specific embodiments of the present invention will be described in detail below in conjunction with the accompanying drawings.
[0051] Aiming at the problem that the aforementioned existing banker's algorithm cannot quickly respond to the needs of real-time users, when the present invention allocates resources to multiple parallel processes, it digs out the sufficient and sufficient conditions for multi-process resource allocation to be in a safe state through mathematical modeling. Conditions, in the case of avoiding deadlock, real-time and efficient resource allocation can be carried out to the process of applying for resources.
[0052] In order to describe in detail the deadlock-avoiding resource allocation method provided by the present invention, figure 2 The flowchart of the resource allocation method for avoiding deadlock according to the embodiment of the present invention is shown.
[0053] Such as figure 2 As shown, the deadlock-avoiding resource allocat...
the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More PUM
Login to View More Abstract
The invention provides a deadly embrace avoidance resource allocating method and a deadly embrace avoidance resource allocating system, wherein the method comprises the following steps that processes are sequenced according to the demands of the processes on the resources from the low degree to the high degree; the difference value between the current remaining allocatable resource quantity and the current process demand quantity is obtained through adopting a mathematical modeling mode after each process releases the previous resource occupation of all the processes; the allowed processes in the processes applying for the resources are subjected to resource allocation, wherein under the condition that each difference value is respectively the nonnegative value, the resource quantity applied by the allowed processes is not greater than the minimum value in the difference values, and otherwise, the processes applying for the resources are not subjected to resource allocation. Through the method and the system provided by the invention, the resource allocation reasonability can be realized in several concurrent processes, the deadly embrace is avoided, meanwhile, the resource application of users is responded in real time, and the goal of efficiently allocating the resources is reached.
Description
technical field [0001] The present invention relates to the technical field of computer systems, and more specifically, to a deadlock-avoiding resource allocation method and system. Background technique [0002] In the use of computer systems, it often occurs that multiple concurrent processes seize the same resource. If the order in which resources are occupied is not reasonable, deadlock may occur. In order to avoid the occurrence of deadlock, it is necessary for the programmer to ensure that the occupation of resources by each process is in a "safe state". The safe state means that the system can allocate the required resources for each process in a certain order, such as P1, P2, ... Pn, until the maximum demand, so that each process can be completed in sequence. If the system does not have a safe sequence, the system is in an unsafe state. [0003] The problem dealt with by avoiding deadlock is how to ensure that after each allocation of resources, the entire system c...
Claims
the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More Application Information
Patent Timeline
Login to View More Patent Type & Authority Patents(China)
IPC IPC(8): G06F9/50
Inventor 孙浩
Owner NEUSOFT CORP