JPH03296823A - Logical space address allocating system - Google Patents

Abstract

(57) [Summary] This bulletin contains application data before electronic filing, so abstract data is not recorded.

Description

DETAILED DESCRIPTION OF THE INVENTION [Field of Industrial Application] The present invention relates to a logical storage space address allocation method in a computer system.

[Prior art]

Logical address assignment in computer systems has conventionally been performed using one of the following two methods.

As shown in Figure 3, one method is to centrally manage the allocation of logical addresses for all programs running in all computing systems that use one control program. allocate a unique fixed logical address across all computer systems,
This is a centralized logical address assignment method in which address resolution processing is completed in advance before a program is called.

The other method, as shown in Figure 4, is that when a program is called and loaded into memory, it refers to the logical address management information held by the system and selects a logical address of the required size from the free space. This is a dynamic logical At1nos allocation method in which the logical address is secured and allocated to the program, address resolution is performed, and when the program processing is completed and the memory is released, the secured logical address is also released as a space at the same time.

In Figures 4 and 5, 1 is the program creator, 2
3 is the target program, 3 is the address resolution/registration means, 4 is the logical Atnos unified allocation management mechanism, external storage space for program registration, 6 is the logical address/source management information, 7 is the program row F means, and 8 is the memory. , 9 is a dynamic address allocation/address resolution/program loading means, 10 is an external storage space for program registration, and 11 is logical Atonenos management information.

[Problem to be solved by the invention]

However, in the unified management logical address assignment method shown in Figure 4, it is necessary to centrally manage the assignment of logical addresses across all systems, and when focusing on individual systems, the logic of programs that are not used is Since the space is also managed as used, there is a problem in that the efficiency of logical space usage is poor and it is difficult to secure a large continuous logical space.

Furthermore, although the dynamic logical address allocation method shown in FIG. 5 does not have the above-mentioned problem, it requires logical address resolution processing every time a program is loaded, and the logical address management information shown in FIG. The number of programs that hold one code in memory increases.

If the program is loaded, the amount of memory used will be enormous and the memory overhead will be large, and if it is placed on the external storage space, the overhead of input/output for management information will increase each time the program is loaded, so the overhead at the time of program loading will be large. There was a pause.

The present invention was made in order to solve the problems described in JR+7, and its object is to provide a technique that can improve the efficiency of logical space use without increasing the overhead during program programming. Encourage me to do it.

The above-mentioned and other objects and novel features of the present invention will become clear from the description of the specification and the accompanying drawings.

[Failure to solve the problem]

In order to solve the above-mentioned problems, the present invention provides a logical atto-nos allocation method for allocating an atto-nos in a logical space in a divider system as a storage area for a program.
The correspondence between logical addresses and assigned programs is fixed for each computer system, and the correspondence between a name that can uniquely identify a program and an assigned logical address, and an empty logical address that is not assigned to any program. Management information regarding the range is maintained in the external storage space, and this information is referenced for a newly registered program to determine the size required by the program from the corresponding range of free logical addresses and the remaining continuous free space. The most important feature is that it updates the management information by assigning a logical address that maximizes the range of logical addresses, and also has means for resolving the address of the program.

[Effect]

According to the above-mentioned means, by having the control program manage the allocation of logical addresses for each individual system, the programs to which logical addresses are allocated are limited to only the programs used in each individual system. In addition to improving usage efficiency, by performing program resolution at the same time as the logical at-node allocation, address resolution processing is completed before the program is called and loaded into memory, reducing overhead when loading the program. It is possible to improve the efficiency of logical space usage without increasing the amount of space.

In other words, the conventional technology is capable of improving the usage efficiency of logical atnodes by limiting the assignment of logical addresses to programs used in individual systems, and that it is possible to improve the efficiency of using logical atnodes by limiting the allocation of logical addresses to programs to programs used in individual systems, and to improve the atnoce resolution processing of programs. A particular difference is that since the program is completed before loading, there is no need to increase the overhead during program loading.

[Embodiments of the invention]

Hereinafter, one embodiment of the present invention will be specifically described using the drawings.

The first section is an explanatory diagram for explaining the logical space 71-1 node allocation method according to one embodiment of the present invention, and FIG. FIG. 3 is an explanatory diagram for explaining the flow of processing.

1 and 2, 13 is a registration target program, 14 is system-specific logical address allocation management information, 1
Reference numeral 5 indicates means for registering a program in an external storage space, 16 indicates an external memory space for program registration, 17 indicates logical address assignment/address resolution means for assigning logical addresses to the program and resolving the addresses of the program, and 18 indicates calling of the target program. 19 is a program loading means for loading a program into memory, and 20 is a memory.

First, the program 13 to be registered is registered in the program registration means 1.
5 to the external storage space 16 for program registration (σ, ■, in FIG. 1).

Next, when the program logical address assignment/address resolution means 17 is operated (■ in FIG. 1), the program registration external storage space 16 reads out the registration target program 13 registered in the external storage space, Check that the program name of the target program is registered by referring to the logical address allocation management information 14. If it is not registered, search for an empty logical space from the beginning of the management information and use the logical space required by the target program. Find the smallest contiguous free space above the size, allocate it to the target program, and register the name of the target program and the assigned logical address section in the management information (■ in Figure 1)). Subsequently, address resolution processing for the target program is performed, and the target program for which processing has been completed is stored in the external storage space 16 for program registration (■ in FIG. 1).

Thereafter, when the target program is called by another program in the logical address allocation/address resolution means 17 during system operation ((1) in FIG. 1), the load request from the target program's caller 18 , the program loading means 19 loads the target program from the external storage space 16 for program registration ((2) in FIG. 1).
, is loaded onto the memory 20 ((3) in FIG. 1). At this time, the program's address resolution processing has already been completed, so it is not performed.

As can be seen from the above explanation, according to this embodiment, logical addresses are assigned only to programs used in the system based on logical address management information for each system, and the necessary size is determined by referring to the management information. The minimum contiguous free logical space above is selected, a logical address is secured, and the address is assigned to the program, and the program's address is resolved at the same time. This eliminates the need for address resolution processing when the program is called, thereby reducing overhead during loading. It is possible to simultaneously improve the usage efficiency of logical space and secure continuous free logical space without increasing the number of logical spaces.

The present invention has been specifically explained above based on examples, but
It goes without saying that the present invention is not limited to the embodiments described above, and can be modified in various ways without departing from the spirit thereof.

〔Effect of the invention〕

As described above, according to the present invention, address resolution processing is not required when a program is called, and the efficiency of logical space usage is improved without increasing overhead during loading, and continuous free logical space is secured. can be done at the same time.

[Brief explanation of the drawing]

FIG. 1 is an explanatory diagram for explaining a logical space address allocation method according to an embodiment of the present invention. FIG. 2 is an explanatory diagram for explaining the positional relationship of components on a computer system and the flow of processing in this embodiment. Figure 3 is an explanatory diagram for explaining the problems of the conventional centralized logical address allocation method. Figure 4 is an explanatory diagram for explaining the problems of the conventional dynamic logical address assignment method. It is a diagram. In the figure, 1... program creator, 2... target program, 3... address resolution/registration means, 4... logical address-original allocation management mechanism, 5... external storage space for program registration , 6... Logical address - original management information, 7
. . . Program loading means, 8. Memory, 9. Dynamic logical address assignment/address resolution/program loading means, O. . . External storage space for program registration, 1
1...Logical address management information, ]-2...Memory,
13... Program to be registered, 14... System-specific logical address management information, 15... Program registration means, 16... External storage space for program registration, 17.
...Logical Atonenos assignment/address resolution means, ]8...
-Target program caller, 19...Program loading means, 20...Memory.

Claims (1)

[Claims] In a logical address allocation method that allocates an address in a logical space in a computer system as a storage area for a program, the correspondence between the logical address and the program to be allocated is fixed for each computer system,
Management information regarding the correspondence between a name that uniquely identifies a program and an assigned logical address and the range of free logical addresses that are not assigned to any program is maintained in external storage space, and this information is used for newly registered programs. Refers to the information and updates the management information by allocating a logical address of the size required by the program from the corresponding range of free logical addresses and maximizing the range of remaining continuous free logical addresses, and A logical space address allocation method characterized by having means for performing address resolution.