JPH0812610B2 - Process allocation control method - Google Patents

Description

DETAILED DESCRIPTION [Overview] Regarding a process allocation control method for allocating a process in response to an access request, a predetermined number of processes are generated for each device in response to an access request, and the generated process is Corresponding to an access request, a new process is dynamically created and allocated when there is not enough, to speed up the response and guarantee the minimum process allocation. If there is a process generation unit that collectively generates a predetermined number of processes and an unallocated process that was previously generated by this process generation unit in response to an access request, a process allocation unit that allocates this process and an access request Then, if there is no unallocated process previously created by this process creation unit, a new process is newly created. A process dynamic allocation unit that dynamically generates and allocates a process, and the process generation unit previously generates a predetermined number of processes for each access request source device, and responds to the access request by the above process. The assigning unit or the process dynamic assigning unit assigns a process and requests a predetermined process.

[Industrial applications]

The present invention relates to a process allocation control system that allocates a process in response to an access request.

[Problems to be Solved by Conventional Techniques and Inventions]

Conventionally, in a system in which a plurality of WSs (workstations) 1 and 2 are connected to one server 21 as shown in FIG. 4, user processes such as WS 1 and 2 are resources of the server 21. When a file or the like is requested to be accessed remotely, the main process generated by a provider (not shown) of the server 21 dynamically generates a stub process and requests processing (requesting file access) each time, and the processing ends. I was trying to make it disappear later.

Therefore, in response to an access request from a user process such as WS1 or 2, a stub process is generated each time, processing is requested, and it is necessary to delete the processing after the processing ends, which causes a problem of slow response. It was Also, when a user process of a certain WS accesses a large amount of resources on the server, a stub process is generated correspondingly, and the stub process cannot be generated in response to the access request of another user process, and the resource can be accessed. There was a problem of disappearing.

The present invention creates a predetermined number of processes for each device in response to an access request, associates the created process with an access request, and dynamically creates and allocates a new process when insufficient. , It aims at making the response quick and guaranteeing the minimum process allocation.

[Means for solving the problem]

 Means for solving the problems will be described with reference to FIG.

In FIG. 1, the process generation unit 4 generates a predetermined number of processes (stub processes) in response to an access request from WS2 or the like.

The process allocation unit 5 allocates a stub process generated in advance by the process generation unit 4 when there is a space in response to an access request from the WS 2 or the like.

The process dynamic allocation unit 6 dynamically generates a stub process each time when a stub process generated in advance by the process generation unit 4 is in use and there is no space in response to an access request from WS2 or the like. To allocate.

The stub processes 3-1 to 3-3 and the like are processes that act on behalf of the processing corresponding to the request from the access request source.

[Action]

According to the present invention, as shown in FIG. 1, in response to a user process 9-1 of WS2, for example, notifying the server 1 of an access request, the process generation unit 4 constituting the generated main process 3 has a predetermined process. A number of stub processes 3-1 to 3-3 and the like are generated for each WS, and the process allocation unit 5 generates the predetermined number of generated stub processes 3-1 to 3-3.
-3, if there is a vacancy, it is allocated and requested to process. On the other hand, when there is no free space in the generated predetermined number of stub processes 3-1 to 3-3, the process dynamic allocation unit 6 dynamically generates a stub process each time and allocates it to the stub process to request processing. I have to.

Therefore, a predetermined number of stub processes are created in advance for each WS in response to an access request, and are sequentially allocated to each WS, and when there is no more space, a stub process is dynamically created and allocated each time, and a process is requested. As a result, the response corresponding to the access request can be speeded up, and access to the minimum resources can be guaranteed.

〔Example〕

Next, the configuration and operation of one embodiment of the present invention will be sequentially described in detail with reference to FIGS. 1 to 3.

In FIG. 1, the server 1 responds to access requests from a plurality of WS2s, etc.
The data read from is transferred.

The provider 2 receives an access request from the WS 8 or the like, generates the main process 3, and requests it.

The main process 3 is a process generation unit 4 that generates a predetermined number of stub processes for each WS in response to an access request, and a process that allocates a stub process that has already been generated in response to an access request when there is a free space. Allocation unit 5 and process dynamic allocation unit 6 that dynamically generates and allocates a stub process each time when there is no free space
Etc.

The stub processes 3-1 to 3-3 act on behalf of processes requested by access requests from the user processes 9-1, 9-2 of WS2, for example, processes of reading and transferring data from the file 7. Is.

 The file 7 stores data.

A plurality of WSs (workstations) 8 are connected to the server 1 and are terminals for performing various processes.

The user processes 9-1 and 9-2 perform various processes corresponding to the user.

The requester 10 notifies the server 1 of access requests from the user processes 9-1 and 9-2.

Next, the operation of the configuration of FIG. 1 will be described in detail with reference to the flowchart of FIG.

In FIG. 2, WAIT is set. this is,
The state in which the server 1 waits for the access request from WS2 is shown. In response to the server 1 being notified of the access request, the following is executed.

Determines whether the stub has been generated. This means determining whether or not a predetermined number of stub processes 3-1 to 3-3 and the like have already been generated for each WS. If YES, do If no, do.

Since it is determined that the stub process is not generated in, the predetermined number (i) of stub processes is generated. This is because the process generation unit 4 constituting the main process 3 in FIG.
-1 to 3-3, for example, means to generate two in association with WS (1) 8-1 and 8-2 as shown in FIG.

Assigns a stub and saves the remaining number. This means that the process allocation unit 5 in FIG. 1 allocates from the stub process generated in response to the access request, and saves the remaining number of stub processes.

Performs a transfer process. This means that the stub process assigned in (4) transfers on behalf of the access request source user process, for example, the data read from the file 7 is transferred to the user process.
And do.

Determines whether or not there is an empty stub. this is,
If YES in (when it is determined that the stub process has already been created), it means that it is determined whether there is a free space in this created stub process (whether there is a remaining number saved in). ing. In the case of YES (when there is a space), the access request is allocated to this empty stub process and the transfer processing is carried out in the same manner as in the case described above. NO
If there is no empty stub process, the process dynamic allocation unit 6 of FIG. 1 dynamically creates a newly created stub process each time, for example, the stub shown by the dotted line in FIG. A process (4) is dynamically newly generated and assigned to the access request, and is transferred by.

In FIG. 3 (a), a fixed number (two) of stub processes are fixedly created in the server 1 for each WS (1) 8-1, 8-2, and this is assigned in response to an access request. Show the situation. By allocating an access request to the stub process that is fixedly created in this way, it is possible to save the trouble of creating the stub process each time, and it is possible to speed up the response, and there are many other WSs. Even if a stub process is generated and a file or the like is accessed, it is possible to guarantee the request for the minimum access request.

FIG. 3 (b) shows that when the stub processes (1) to (3) that are fixedly created are in use,
It shows how a new stub process (4) is dynamically created, assigned, and requested for processing. As a result, it becomes possible to make processing requests in excess of the number of stub processes fixedly generated in response to a large number of access requests.

〔The invention's effect〕

As described above, according to the present invention, a fixed number of stub processes are generated in advance for each WS in response to an access request, sequentially allocated to this, and a stub process is dynamically generated when there is no free space. Since a configuration for allocating and requesting processing is adopted, the response corresponding to the access request can be speeded up, and at the same time, a minimum stub process can be allocated to guarantee access to resources.

[Brief description of drawings]

FIG. 1 is a configuration diagram of an embodiment of the present invention, FIG. 2 is a flowchart for explaining the operation of the present invention, FIG. 3 is an example of stub process generation, and FIG. 4 is an explanatory diagram of a conventional technique. In the figure, 1 is a server, 3 is a main process, 3-1 to 3-3 are stub processes, 4 is a process generation unit, 5 is a process allocation unit, 6 is a process dynamic allocation unit, and 8 is a WS (workstation). , 9-1 and 9-2 represent user processes.

Claims (1)

[Claims] 1. A process allocation control method for allocating a process in response to an access request, wherein a process generation unit (4) for collectively generating a predetermined number of processes corresponding to the access request and an access request Correspondingly, when there is an unallocated process previously generated by this process generation unit (4),
If there is no process allocation unit (5) that allocates this and an unallocated process previously generated by this process generation unit (4) in response to the access request,
A process dynamic allocation unit (6) is newly provided to dynamically generate and allocate a process, and the process generation unit (4) previously generates a predetermined number of processes for each access request source device, A process allocation control method characterized in that the process allocation unit (5) or the process dynamic allocation unit (6) is configured to allocate a process and request a predetermined process in response to a request.