Electrical computers and digital processing systems: multicomput – Computer network managing
Reexamination Certificate
1999-05-12
2004-07-20
Harvey, Jack B. (Department: 2142)
Electrical computers and digital processing systems: multicomput
Computer network managing
C709S228000, C709S203000, C370S232000
Reexamination Certificate
active
06766365
ABSTRACT:
TECHNICAL FIELD OF THE INVENTION
The present invention is directed to global resource management of distributed data processing systems.
BACKGROUND OF THE INVENTION
Continuous multimedia applications are being developed for entertainment (e.g., video-on-demand services), for office automation (e.g., video conferencing), for crisis management, for command and control, and the like. In these continuous multimedia applications, video, audio, and/or image streams are processed within a node and between nodes of a data processing system.
Some continuous multimedia applications are mission critical and some are not. For example, the continuous multimedia applications being developed for entertainment (e.g., video-on-demand services), for office automation (e.g., video conferencing), and the like, are not particularly mission-critical. By contrast, the continuous multimedia applications being developed for crisis management, for command and control, and the like, are often mission critical. Mission-critical continuous multimedia applications are becoming increasingly important.
Mission-critical continuous multimedia applications have at least three unique characteristics—they are criticality driven, they are dynamic, and they operate in real time. With respect to the first of these unique characteristics, media streams in mission-critical continuous multimedia applications may be associated with an attribute of criticality. Criticality is an indication of the importance of a particular application being executed at a given time, and is assigned to the application by a system administrator (or mediator) who reviews all applications to determine the criticality differences between them. For instance, an application which is performing periodic image-capturing and flaw detection in a process control can be more important than an application that monitors floor activities in a controlled plant. Consequently, the periodic image-capturing and flaw detection stream is assigned a higher criticality level by the system administrator than is the video stream relating to the monitored floor activities. In order to support different criticality levels, the data processing system which processes such media streams must be criticality cognitive and must be able to support plural critical multimedia data streams in the presence of multiple service requests.
With respect to the second of these unique characteristics, mission-critical continuous multimedia applications are often dynamic and may vary greatly in their demands on the local resources of the data processing system. In digital battlefield management, for example, detection of a mobile target may trigger a sequence of reactions, such as video monitoring, infrared tracking, image library retrieval for target matching and recognition, media data fusion and filtering, and command and control. Such dynamic demands on the local resources of the data processing system are not predictable a priori, and, therefore, require applications to negotiate on line for, and adapt to, the available local resources, which may include disk i/o bandwidth, CPU cycles, memory space, video compression/decompression capacity, network bandwidth, and the like. Without sufficient resources and proper resource management, multimedia streams may lose their data or timeliness in a random fashion, causing application malfunction.
With respect to the third of these unique characteristics, mission-critical continuous multimedia applications must operate according to a guaranteed latency and data flow rate. Latency is the end-to-end delay from the time when the very first media unit is produced at a stream source to the time it reaches a stream destination. Rate is the number of media data units per second that are processed by a processing node.
Moreover, when execution of an application requires resources of more than one node of a distributed data processing system, the execution of the application by those nodes must be coordinated. Otherwise, execution of the application may fail because one of the nodes, which is to participate in the execution of the application but which does not have the resources allocated for the application, may undermine the execution devoted by the other nodes. This problem becomes increasingly severe as the number of applications to be concurrently executed across the distributed data processing system increases.
The present invention is directed to a global resource management arrangement that coordinates demands on resources of a distributed data processing system in a deterministic, adaptive manner (according to, for example, an application's QoS, timing, and criticality requirements).
SUMMARY OF THE INVENTION
According to one aspect of the present invention, a resource manager for each node of a plurality of nodes of a distributed data processing system comprises determining means, request sending means, response sending means, and commit sending means. Each node may receive an arriving session to process. The determining means determines whether a node corresponding to the determining means can support the arriving session. The request sending means sends, if the corresponding node is a coordinator node or an intermediate node, a support request to child nodes which are to process the arriving session. The response sending means sends, if the corresponding node is an intermediate node or a leaf node, a response to a parent node. The response indicates whether the arriving session can be supported. The commit sending means sends, if the corresponding node is a coordinator node and if the arriving session can be supported by the nodes which are to process the arriving session, a commit message to the child nodes which are to process the arriving session.
According to another aspect of the present invention, a resource manager for each node of a plurality of nodes of a distributed data processing system comprises determining means, request sending means intermediate response sending means, leaf response sending means, and commit sending means. Each node may receive an arriving session to process. The determining means determines whether a node corresponding to the determining means can support the arriving session. The request sending means sends, if the corresponding node is a coordinator node or an intermediate node and if the corresponding node can support the arriving session, a support request to child nodes which are to process the arriving session. The intermediate response sending means sends, if the corresponding node is an intermediate node, a YES response to a parent node if the corresponding node and its child nodes can support the arriving session and a NO response to the parent node if the corresponding node or at least one of its child nodes cannot support the arriving session. The leaf response sending, means sends, if the corresponding node is a leaf node, a YES response to a parent node if the corresponding node can support the arriving session and a NO response to the parent node if the corresponding node cannot support the arriving session. The commit sending means sends, if the corresponding node is a coordinator node and if the arriving session can be supported by the nodes which are to process the arriving session, a commit message to the child nodes which are to process the arriving session.
According to yet another aspect of the present invention, a resource manager for a coordinator node of a distributed data processing system comprises determining means, request sending means, and commit sending means. The coordinator node may receive an arriving session to process. The determining means determines whether the coordinator node can support the arriving session. The request sending means sends, if the determining means determines that the coordinator node can support the arriving session, a support request to child nodes which are to process the arriving session. The commit sending means sends, if the coordinator node and all of the child nodes can support the arriving session, a commit message to the child nod
Huang Jiandong
Wang Yuewei
Harvey Jack B.
Vu Thong
LandOfFree
Ripple scheduling for end-to-end global resource management does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Ripple scheduling for end-to-end global resource management, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Ripple scheduling for end-to-end global resource management will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3256223