KR20020024895A - Apparatus and method for managing memory and ipc task - Google Patents

Abstract

PURPOSE: A method for managing an IPC task and a memory is provided to assign tasks according to an RTR(Real Time Request) value, so as to synchronize the tasks and prevent the displacement of priority as well as smoothly managing tokens for assigning resources. CONSTITUTION: A controller maintains a standby state(100). The controller checks whether a resource assignment request is generated from a predetermined task(102). If so, the controller assigns resources(104). The controller checks whether a token is returned from a resource assigned with tokens(106). If not, the controller checks whether other task requests a token(108). If so, the controller checks whether an RTR value of the task requesting the token is T(True)(110). If so, the controller receives a returned token from a presently-working task, and holds the working(116). The controller sets priority of the presently-working task to top, and records the task in a standby list(118). The controller assigns a resource to the task having the true RTR value(120), and returns to the step '108'.

Description

APPARATUS AND METHOD FOR MANAGING MEMORY AND IPC TASK}

The present invention relates to a method for managing a task and a memory in a given system, and more particularly, to a method for managing a task and a memory in a system developed by a pSOS.

In general, in a large system such as a transmission system or an exchange system, an operating program (OS) is developed by using a program called PISOS. Most of the operation programs developed as described above are composed of several tasks that share and use resources. Therefore, in order to use one resource, it is configured to have a Semaphore that manages it and to give tokens so that data can be used according to the connection order of each task. That is, when three different tasks want to use a specific resource A, for example, when one resource is used in task A, task B, and task C, one resource cannot be used at the same time. Therefore, in order to allocate resources, an allocation is requested to the manager. In this way, a resource is allocated to a task so that a resource to be used can be used by giving a token. In other words, when task A is granted a token, other tasks must wait until the acquisition of the token is made. After task A has used the resource, it must return the token to the manager so that it can be used by the next task, either task B or task C.

However, such a manager is not an accurate manager for obtaining and returning the token. In other words, there is a problem that the acquisition and return of tokens are not made correctly because the management of the task that took the tokens is not made. In addition, when priority is different among tasks, resources are allocated to the task having high priority. Therefore, while being used for task synchronization, Knoll could have failed to synchronize if the use of resources from prioritized tasks is required. In addition, there was a problem that inversion of priorities between tasks could occur.

Accordingly, an object of the present invention is to provide an apparatus and method capable of managing a memory and a task to perform token management and resource management in a system developed using PIOS.

Another object of the present invention is to provide a memory and task management apparatus and method for smoothly allocating resources in a system developed by using a source, and accurately synchronizing the system without inverting priorities.

The present invention for achieving the above objects is a task management apparatus for managing the IP task and memory, and performs a predetermined operation of the system, when the resource allocation request, and transmits the real-time request signal with the resource allocation request signal Manage tasks, resources used from at least two tasks, and tokens to allocate the resources, check priorities when requesting resource allocation from tasks, and allocate resources from higher priority tasks; If a resource allocation is requested from a task in which the real-time request signal is successful when the resource is being allocated, the token is recovered from the task in which the resource is used, the token is assigned to the task in which the real-time request signal is successful, and the resource is allocated. That queues the task with the highest priority of the task in use Characterized by a configured group.

The present invention for achieving the above objects is a method for managing resources from resources used from at least two or more tasks and tasks requiring the allocation of the resources in a given system, the resource allocation in the presence of a token request Checking a real-time request value when a resource allocation signal is received from another task during the allocation; and holding a work in progress by returning a token from the task to which the resource is allocated if the real-time request value is successful. Setting a priority of the task returning the token to the highest priority, allocating a resource to the task for which the real-time request value is successful, and waiting the task if the real-time request value is not successful. Registering with, and if there is a return of the token, the priority of the waiting list It is characterized by consisting of assigning tokens to tasks with high ranking.

1 is a block diagram illustrating a relationship between a manager for allocating and managing resources in a predetermined system according to the present invention, and a task for requesting resources and resources;

2 is a control flowchart performed in the manager according to a preferred embodiment of the present invention.

Hereinafter, the present invention will be described in detail with reference to the accompanying drawings.

1 is a block diagram illustrating a relationship between a manager for allocating and managing resources in a predetermined system according to an embodiment of the present invention, and a task for requesting resources and resources. Hereinafter, an operation of each block and a connection relationship thereof will be described in detail with reference to FIG. 1.

The tasks 11, 12, and 13 are blocks for performing and controlling a predetermined operation in the system to which the present invention is applied. In each of the blocks, hypocrisy has task A (11) priority 1, task B (12) has priority 2, and task C (13) has priority 2. Each of the above tasks has a priority and a real time request value (True or Fail) in order to use a token, that is, to use a predetermined resource. Demands together. Therefore, each task always sends a request for the token to the manager 21 together, waits for the allocation of the token, and when the token is allocated, occupies and uses the resource 31 accordingly.

The manager 21 checks the authentication and log of the token and allocates resources. At this time, resource allocation is based on priority and real-time request value. That is, a task having a higher priority may use a resource first. However, if a task having a real-time request value of success (T) is accessed, the resource allocation is changed according to the status of the task to which the current resource is allocated. If task A 11 uses a resource while task C 13 requests a token from manager 21, an example will be described. If task A (11) first receives and uses resource 31 from manager 21, task C (13) requests the allocation of resource (31).

First, the task A 11 continuously allocates the resource 31 to the task A 11 when the real time request value is success T.

Second, when task A 11 has a real time request value of failure T, resource 31 continues to perform task A 11 when the real time request value of task C 13 fails. Is assigned to.

Third, when the task A 11 has a real time request value of failure T, when the real time request value of the task C 13 is success T, the controller 21 selects the resource 31 as the task C ( 13). Task A 11 holds the work being performed and changes the priority of task A 11 to the highest priority.

That is, the above-described method can prevent the synchronization from being out of sync by allowing a resource whose task is successful in synchronization with the real-time request value to be used first. In addition, if another task is occupying the resource 31, it is possible to control to smoothly perform the task by changing the priority of the task occupied to the highest and setting it higher than the priority of another task which is subsequently connected.

2 is a control flowchart performed in the manager according to a preferred embodiment of the present invention. Hereinafter, the control operation performed by the manager 21 according to the present invention will be described in detail with reference to FIGS. 1 to 2.

The controller 21 maintains the standby state in step 100. In step 102, it is checked whether a resource allocation request exists from a predetermined task. If the resource allocation request exists as a result of the check, the process proceeds to step 104 to allocate resources. In other words, this allows the task to perform its work. In step 106, it is checked whether there is a return of the token from the resource to which the token is allocated. In other words, when the task using the resource 31 completes the work, the token is returned to check whether the work is finished. If there is a token return, proceed to step 100; otherwise, go to step 108 to check whether there is a request for a token from another task. If the token is requested, the process proceeds to step 110. If there is no token request, the process proceeds to step 106.

If there is a request of the token as a result of the check in step 108, it is checked whether a real time request (RTR) value of the task requesting the token is success (T). If the RTR value is successful, go to step 116; otherwise, go to step 112. First, the case proceeds to step 112. The manager 21 registers the task requesting the token in the waiting list according to the priority. Proceed to step 114 to check if the token is returned. If the token is returned, the process proceeds to step 104 and the token is allocated to the task having the highest priority among waiting tasks. However, if there is no return of the token, go to step 108.

On the contrary, if the RTR value of the check result of step 110 is success (T), the manager 21 proceeds to step 116 and returns the token from the task currently being performed and holds the job. Then proceed to step 118 to set the priority of the task you were working on as the highest and put it on the waiting list. The manager 21 proceeds to step 120 and allocates resources to the task having a successful RTR value.

As described above, since the assignment of the task is allocated according to the RTR value, there is an advantage of achieving synchronization between tasks, and at the same time, there is an advantage of preventing the case of priority being transposed. It also has the advantage of smoothly managing tokens for allocating resources.

Claims (3)

In the task management apparatus for managing an IP task and memory, Tasks for performing a predetermined operation of the system, and delivers the real-time request signal along with the resource allocation request signal when the resource allocation request; Resources used from at least two tasks, Manage tokens to allocate the resources, check priorities upon resource allocation requests from tasks, allocate resources from high priority tasks, and from tasks where real-time request signals are successful if resources are being allocated When resource allocation is required, the manager collects tokens from tasks that are using resources, assigns tokens to tasks with real-time request signal success, allocates resources, and puts them on the waiting list with the highest priority of the tasks using those resources. Apparatus for managing IP tasks and memory, characterized in that consisting of. CLAIMS What is claimed is: 1. A method for managing resources from resources used from at least two tasks and from tasks requiring allocation of the resources within a given system. Allocating resources if a token request exists; Checking a real-time request value when a resource allocation signal is received from another task during the allocation; If the real-time request value is successful, returning a token from the task to which the resource is allocated and holding a work in progress; Setting the priority of the task that returned the token to the highest level; And allocating a resource to the task for which the real-time request value is a success. The method of claim 2, Registering the task in a waiting list if the real-time request value is not successful; And allocating a token from a task having a high priority in the waiting list when the token is returned.