SI9111426A - Computer with extended virtual storage concept - Google Patents

Abstract

On a computer that includes an operating system that it covers the concept of virtual memory organization, which provides memory space for parallel execution programs in pre-assigned partitions virtual address memory that includes shared areas and private areas in a few title spaces, dynamic partitions are provided (P1, P2 .... N1, N2 .... O1, 02, ...) which may be assigned 16 MB AS 1 F2 //// lili lili HU lili F3 BG SA SV F6 in addition to the pre-assigned partitions (F1-F8, Fa, FB, BG) depending on the business to be performed and which can be released after the deal is completed to be released memory area for future use. This concept extends the scope of virtual memory, uses available space more efficiently and allows running multiple programs in parallel.

Description

(57) Dynamic partitions are provided on a computer incorporating an operating system comprising the concept of virtual memory organization that provides memory space for parallel execution of programs in pre-allocated virtual address memory partitions that includes shared areas and private areas in several address spaces (P1, P2 .... N1, N2 .... O1, 02, ...) that can be assigned

MB

AS

F2 //// lili lili

HU lili

F3

BG

SA

SV

F6 in addition to the pre-allocated partitions (F1-F8, Fa, FB, BG) depending on the job to be executed and which can be released after the job is completed to free up memory space for future use. This concept extends the scope of virtual memory, uses available space more efficiently, and allows multiple programs to run in parallel.

NI N2 P2 04

F4

F7

F1

//// //// HU HU UU HH //// //// HU l / U / Ul F8 F5 N1 N2

P2 //// //// nu un

FSP

INTERNATIONAL BUSINESS MACHINES CORPORATION

A computer with the concept of extended virtual memory

The invention relates to a computer comprising an operating system using the concept of virtual memory organization, which provides memory space for parallel execution in previously allocated portions of a virtual memory address, comprising common areas and private areas in individual address spaces. The invention belongs to the field of computers.

The invention solves the problem of increasing virtual memory, thereby ensuring the parallel execution of several programs.

Such a computer and especially such an operating system are e.g. commercially available as IBM Extended Virtual Memory / System Pack Version 4 Release 1, hereinafter referred to as VSE / SP 4.1 for example, e.g. described in more detail in the associated IBM manuals, of which Adminstration is referred to here, Form Number SC33-640501, cited herein for reference. The ALL / SP 4.1 operating system includes the IBM licensed ALL / Enhanced Features (hereinafter referred to as ALL / AF) programs, as well as others, all of which may also be referred to as ALL / POWER. For reference, the IBM IBM VSE Manual / Advanced System Instruction Manual, Form No. SC33-6352. This guide, especially on pages 1 to 20, provides a detailed description of, e.g. to multiprogramming, organizing virtual memory and real memory, partitioning, and memory allocation.

With the current system, virtual memory is limited to 12 parts in up to nine address spaces. This requires a very careful and demanding allocation of memory space in the given address spaces for programs running in parallel. This significantly limits the ability to run programs in parallel, leaving the system to some extent inflexible.

The primary object of the present invention is to make the system more flexible, to increase virtual memory resources, so that multiple programs can be easily executed in parallel, and to make it aware of the existing system.

This and other objects are solved essentially by using the features set forth in claim 1.

The newly introduced dynamic partitions that are shared with the business and released at the end of the job provide a massive expansion of the virtual memory pool to 200 (or more) new partitions. This means that multiple programs can be executed in parallel and that the limitations of existing systems are exceeded.

Further advantages of the invention are provided in the dependent sub-claims. Their specific properties and advantages are explained by themselves or will be explained in connection with the following detailed description.

The invention will be explained in more detail with reference to the exemplary embodiment shown and described and to the drawings in which: FIG. 1 shows the arrangement of memory as known from the prior art or static partitions;

FIG. 2 shows side-by-side arrangement of the address space for static and dynamic partitions of the present invention;

FIG. 3 shows an example of arranging memory with dynamic partitions according to the invention;

FIG. 4 shows an on-screen menu with a scenario for selecting tasks: maintaining dynamic partitions;

FIG. 5 shows a screen menu with a script for adding a dynamic class;

\ sl. 6 shows a screen menu with a scenario for determining dynamic class X;

FIG. 7 shows a screen menu with a script for entering a modified dynamic class table in the library;

FIG. 8 shows a depiction of a console with a script for loading a dynamic class table;

FIG. 9 shows an on-screen menu with a VSE / POWER job creation class (class X), and FIG. 10 shows a console rendering with the ALL / POWER job scenario running.

For a better understanding of the concept of dynamic partitions and how to embed them in ALL operating systems, a brief description of the current partition design is given. In connection with the description of the invention, liquid partitions are called static or pre-partition assignments.

Current ALL version (ALL / SP 4.1) allows up to 12 partitions to be assigned to up to nine address spaces. The address space comprises a common area and a private area. The private area varies depending on the assignment. It is possible to allocate more than one partition in one private area. Static partitions have the following predefined identifier IDs Fl, F2, F3, F4, F5, F6, F7, F8, F9, FA, FB, BG.

The arrangement of memory is shown in FIG. 1 and describes, as an example, a known prior art system with five partitions BG, Fl, F2, F3 and F4 assigned to the AS 1 to 4 address spaces. One address space may have a maximum size of, e.g. 16 megabytes (MB). Title spaces are divided into common areas of SAs (including SAF supervisor) and into private areas of PAs. The private area is the program area for program execution. An operator procedure or ASI (Automated System Initialization) process can assign and initiate partitions and can assign execution priority to each partition. This pre-allocation of static partitions is done during the system setup phase.

Static partitions can receive JCL (Job Control Language) statements from a physical reader or job sorter. All scheduling of transactions controls the execution and output of the spooled transaction using VSE / POWER, meaning that the transaction is controlled by VSE / POWER. ALL / POWER, where POWER stands for Priority Output Writer Execution Reader, and is an IBM licensed program primarily used for spooled input and output, can also create dynamic partitions and execute transactions, meaning that ALL / POWER is full JCL statements and data into a partition. The business is then classified into a type of reader. The output list and output hole can be routed to specific types.

A static partition is available from more than one job. ALL / POWER allows jobs to be executed in classes, i.e. ALL / POWER classes where one or more static partitions can be marked. A class denotes a group of jobs that either come from the same input preparation or go to the same output preparation.

Spool program assigns and starts a dynamic partition for one job as ALL / POWER. ALL / POWER controls the execution of the job and releases a dynamic partition at the end of the job. Free memory is available for another job.

Each dynamic partition has its own address space, which means that only one dynamic partition is allocated in the private area of such address space. Multiple dynamic partitions can be assigned at a time.

In order to reduce the size of common areas, a new one is being introduced, i.e. private, system area for dynamic partition address spaces, i.e. dynamic GETVIS space. The GETVIS dynamic space belongs to a private area. Figure 2 shows a comparison of the address space arrangement of static and dynamic partitions.

The left side of Figure 2 shows the SPASL static partition arrangement, comprising the controller and the shared area in the shared areas, as well as the PrA programming area in the private area, in addition to the invalid inv. The PGA area of the GETVIS partition may also be contained here. This is the memory space within a partition that is available to temporarily allocate to the associated program of that partition.

The right part of Figure 2 shows the DPASL dynamic partition arrangement according to an embodiment of the invention. As can be seen, unlike the static partition arrangement in the private area, an area called the GETVIS dynamic space area is provided.

GETVIS The dynamic space DSGA domain is temporarily assigned along with the dynamic partition and contains system data for the address space. This system data is unique to the business and also to the assigned dynamic partition. Therefore, this information is not required for other partitions and does not need to be contained in a shared area. Therefore, the common area is eliminated for this information and can therefore be kept smaller.

Dynamic partitions can be grouped into classes that correspond to ALL / POWER classes where jobs can be executed. These classes are called dynamic classes.

Only the dynamic class priority can be defined. Dynamic partitions within one and the same class are time-shared.

Static and dynamic partitions can be classified into one ALL / POWER class.

The table that tells the table the dynamic class table contains the characteristics of the dynamic classes. The dynamic class table can be cataloged in the library from which it can be downloaded.

Some examples of properties in a dynamic class table are:

- memory allocation:

defines the dynamic partition's memory requirements, i.e. dynamic GETVIS space and partition allocation for a particular class,

- partition size:

specifies the amount of adjacent virtual memory in the partition that is reserved for executing the program; the rest of the partition is available as a GETVIS partition area,

- GETVIS dynamic space size:

defines the amount of contiguous virtual memory for the GETVIS dynamic space area, (see Fig. 2),

- profile (process):

will run in the partition before the job and conform to the ASI static partition process,

- maximum number of dynamic partitions in a class:

defines the maximum number of partitions that can be allocated concurrently within a given class when sufficient virtual memory and dynamic partitions are available,

- Disabling indication:

allows the dynamic class to be disabled, meaning that the transaction cannot be executed within that class;

- spool of input and output devices:

defines preparations that are connected in a spool, e.g. reader, printers and punches that bind to ALL / POWER.

Dynamic split id tags are created as follows:

<class> <pno> where <class> = dynamic class (one character defined by the user) <pno> = number of partitions within the dynamic class.

The first dynamic partition installed in dynamic class P accepts e.g. tag id Pl.

The following example, as described in Figure 3, shows a memory arrangement with partitions BG, F1 - F8 in address space 1 to 4, dynamic partitions of dynamic class N in address spaces NI and N2, one dynamic partition in address pro7 of P2 and one dynamic partition in address space 04.

In the case of the memory arrangement shown in Figure 3, in dynamic class N, only NI and N2 address spaces are allocated simultaneously, while other address spaces in this class are inactive. The same is true for the P2 address space of class P. From the O class, only the address space 04 is active in the example presented. The configuration of this example shows that only those dynamic partitions in the virtual memory pool that actually execute transactions are active. If the jobs that are assigned to the dynamic partitions are not active, their allocated memory space can be used for other needs. This demonstrates that the concept of dynamic partitioning ensures optimal use of virtual memory, which can be used as always, except that only the virtual memory of the free FSP partition that is actually needed is used.

The following points illustrate how easy it is to handle transactions in dynamic partitions:

1. Defining:

The Dynamic Classes table allows you to define the properties of dynamic partitions in just a few statements (see also Figures 5, 6 and 7).

2. Dynamic partitions allocated as required:

Dynamic partitions are only assigned when the job needs to be executed in the dynamic class. This saves system resources. If the ALL / P0WER class contains static and dynamic partitions, then dynamic partitions will normally be used to execute the job first.

3. Automatic allocation, initialization and deactivation:

The business environment and resources are assigned and released automatically without user intervention.

4. Identical resource allocation within one dynamic class:

Resources required for the transaction are allocated prior to the execution of the transaction.

λ

5. Timing:

There is no need to control CPU intensive work, because after a time slice, the business is exhausted and the business moves to the lowest priority position within the dynamic class.

6. Moving from static to dynamic partitions:

It is easy to move business to dynamic partitions because the design avoids incompatibilities.

The concept shows how dynamic classes can be defined and how dynamic partitions can be created and dissolved when system resources (eg virtual memory) are available.

The following paragraphs describe

a. maintaining a dynamic class table,

b. assigning dynamic partitions,

c. business execution.

1. Submit a business to run in a dynamic class

2. ALL / POWER requires dynamic partition allocation

- create a dynamic partition

3. ALL / POWER starts the dynamic partition

- cause a dynamic partition to be assigned

4. Dynamic partition initialization

- initialize the address space

- execute a dynamic class profile

5. Execution of the transaction

6. End the transaction

7. Deactivate dynamic partition

- release system resources

- Stop the partition

- make it impossible to assign a dynamic partition anymore

8. Release the dynamic partition

- remove the partition from the allocation type.

Assign a Dynamic Class Table (Create, Save, and Upload)

Any editor or ALL conversation can create and modify a dynamic class table. Table storage services are available to the library from where the operator or ALL / POWER ASI process can load the table.

The loading process validates the values of the dynamic class table and translates the information into an internal representation. Invalid inputs are displayed on the console. Only valid values can be activated, which means that the dynamic class table is stored in system memory, e.g. addressable with system programs. Dynamic classes assume a predefined reporting priority. The operator can change the priority using the priority command.

The following load request can modify or remove the dynamic class table entries. The load request is rejected when the dynamic class to be removed has dynamic partitions assigned.

Assignment

One ALL partition comprises the master task and related subtasks, where the master task always has the lowest priority within the partition.

The current ALL system (ALL / SP 4.1) has two levels of allocation scheme:

1. The highest priority partition ready for implementation shall be selected from the allocation type.

2. The relevant highest priority (sub) task that is ready for execution is selected and assigned.

With dynamic partition support, a new level of allocation for dynamic partitions is introduced. Each dynamic class has its own attribution type that has entries for the assigned dynamic partitions of a given class. As mentioned earlier, dynamic classes are included in the assignment type, leading to a three-tier assignment scheme:

1. A ready-to-deploy static or dynamic partition with the highest priority is selected from the allocation type.

2. If a dynamic class is selected, the most prioritized dynamic partition of the class that it is ready to execute is defined.

3. The highest priority (sub) task that is ready for execution is selected and assigned.

The operator or the startup process can change the priority of static partitions and dynamic classes. To prevent a CPU-intensive partition / class from being able to stop the assignment of lower-priority partitions / classes ALL allows a timed (balanced) group to be assigned. A group member (static partition or dynamic class) losing its time slice gets the position with the lowest priority in the group. If more than one dynamic partition is assigned within a given dynamic class, the same procedure is used.

Doing the job

Choosing a job to perform in a dynamic class is possible if the dynamic class is qualified. This is indicated in the loaded dynamic class table and can be modified by another request or by the load command.

The following paragraphs describe processing after a job was found for a qualified dynamic class table.

ALL / POWER requires dynamic partition allocation to assign dynamic partitions. The assignment service creates an id partition, assigns and initializes control blocks, and creates an address space. Dynamic partition included in do11 \

dynamic class division type. The Partition Startup service allows a dynamic partition to be assigned, i.e., ready to run, and starts initialization. If another dynamic partition is assigned within the same dynamic class, the timing for the dynamic class begins.

During initialization of the dynamic partition, the address space is confirmed, job control is loaded, and a dynamic partition is prepared. Some system programs can run during preparation. Job control performs a profile. If initialization cannot be completed, the partition will be destroyed, deactivated, released, and the dynamic class will be disabled to avoid performing other tasks. After successful initialization, the job is executed, that is, ALL / POWER transfers JCL and data to the dynamic partition. ALL / POWER requires deactivation when the end of the job is reached.

In order to deactivate dynamic partitions, system programs that were called during preparation are notified that a deactivation request is required. The system frees up resources, pauses the dynamic partition, and makes the partitions no longer assignable. ALL / POWER releases the partition.

To release the dynamic partition, the release service releases the partition id and the system space allocated for the control information (control blocks). Removes a dynamic partition from a dynamic class assignment type. If only one dynamic partition remains in the dynamic class, the timing for the dynamic class will be reset.

In connection with FIG. 4 to 10 will describe the definition and use of a dynamic class, that is, a dynamic partition. Images show on-screen menus or panels. The interactive system-user dialogue is conducted through these panels.

The scenario shown is used to define a dynamic class, to update the dynamic class table in the system library, to activate the dynamic class table using ALL / POWER PLOAD commands, and to run ALL / POWER jobs in a specific dynamic class.

In FIG. Figure 4 shows the source definition panel. In this panel, number 7 can be maintained under number 7 by maintaining the partition number by entering number 7.

By selection, it can be carried out in accordance with FIG. 4, a dynamic partition maintain panel is shown in FIG. 5. In order to define and add a new dynamic class, in the panel shown in FIG. 5, select option 1 = ADD. This leads to the panel shown in FIG. 6. The column on the left basically shows the properties of the dynamic class and the right column explains those properties. To define a dynamic class, e.g. inserts the X in the center of the column. This dynamic class should have eight partitions, each with 3 Mb of private space and 1 Mb of program size. The GETVIS dynamic space area is set to 64Kbytes. The tuition is set to 1, which means that the class is qualified. The profile that must be implemented is the JCL STDPROF process. All other points are set to embedded values. If all those values are set, they are entered by pressing the enter key.

This again invokes the panel maintenance of dynamic partitions, but now displays in row 4 the added dynamic class X with all the properties as indicated in FIG. 7. If, therefore, FIG. 7 compares with the panel shown in FIG. 5, four dynamic classes C, Y, Z, and X are now present. By pressing the process function that is placed on function key 5, the displayed dynamic class table is now written as a new copy to the system library. Thus, they are now defined and available in the system after activating dynamic partitions in four classes with a maximum of 28 dynamic partitions.

FIG. 8 shows a panel for activating the dynamic class table. Dynamic class table, that is dynamic class X can be used after the ALL / POWER command PLOAD DYNCTAB has been executed from the console. The system then displays the active dynamic classes. As shown in FIG. 8, none of the four classes are currently active. As line 09 shows, the dynamic class table was loaded successfully.

Business can now be done. For this purpose, an ALL / POWER job flow with dynamic class X is provided in the class parameter of the ALL / POWER job statement. Figure 9 shows a scenario of how the business looks.

The panel shown in FIG. 10, shows how the business looks in its execution. When a dynamic partition within class X is available, this transaction will be performed as shown in the example in dynamic partition XI. Upon completion of this transaction, this dynamic partition will be released or deallocated and available for another transaction.

The advantages of the concept according to the invention are that the user only has to define the system resources available for the dynamic partitions (eg virtual memory size, dynamic class table). The system executes jobs, including partition allocation and release, that is, to use system resources only when needed. It can move jobs from static to dynamic partitions because incompatibilities (control blocks, services, etc.) are kept as low as possible. The present invention provides additional new partitions for ALL operating systems. Thus, many more programs can be run in parallel. The concept is very flexible and portable to other operating systems. The concept of dynamic partitions is thus open to further expansion.

In addition, the following definitions are given. Some of the definitions in this list are copied from IBM VSE / AF Planning and Installation Version 4 Release 1, SC336351.

Address space

A subsection of all virtual memory.

ASI (automated system initialization)

A function that provides control information for system startup that must be cataloged for automatic search during system startup.

ASI procedure (ASI procedures)

A set of control statements that defines values for automatic system initialization.

Control program

Computer program designed to sort and control the execution of computer system programs.

Dynamic partition

A partition that is assigned to one job, created and activated on a necessary basis. After processing, the occupied space is released.

GETVIS area

Memory space with a partition or shared virtual space available to allocate programs temporarily.

Job (1) A set of data that completely identifies the unit of work for a computer. The business usually includes all the necessary computer programs, links, files, and operating system instructions.

(2) The actual processing of the unit of work by the computer.

Job control language

Control language that can be used for:

(a) identifying the job to the operating system; (b) describing the job requirements.

Main task

The partition starts with a task called the main task. This job executes the job and can add further tasks (subtasks).

Partition

Allocation of address space available for program implementation. A control program that does not run in this space.

Private area

Division of address space where one or more partitions can be assigned, uniform for all other address spaces.

Program (program)

A sequence of instructions that is appropriate for processing with a computer.

Program area

The partition area where the program should be loaded.

Shared area

A division of the address space common to all address spaces. Shared partitions, a shared virtual realm, and a controller belong to a common realm.

Shared partition

A partition on ALL that is assigned to a program that provides services to and communicates with programs in other partitions of system virtual address spaces. A shared partition is part of a common area.

Common Virtual Area (SVA)

Area ALL, containing a list of commonly used phases, resident programs common to partitions, and a system support area.

Spooling

Reading and writing input and output streams on intermediate preparation in a format suitable for later processing or output.

Static partition

A partition assigned by an operator or an ASI process that is typically available for more than one transaction.

Subtask

A task that is triggered by a master task or another (sub) task.

Supervisor

Part of a control program that coordinates the use of resources and maintains the flow of processor operations.

Task

The basic unit of synchronous program execution. The task competes with other tasks for system resources such as processing time and input / output channels.

Tim Slicing

A mode of operation in which some processes are assigned time quanta on the same processor.

ALL / POWER

An IBM licensed program primarily used for input and output spools and is a short version (Virtual Storage Extended / Priority Output Writer Execution Reader).

For

INTERNATIONAL BUSINESS MACHINES CORPORATION:

patent office

Ljubljana t k16

Claims (10)

1. A computer comprising an operating system comprising the concept of virtual memory organization providing storage space for parallel execution of a program in pre-allocated virtual address memory partitions comprising common areas and private areas in several address spaces, characterized in that depending on the job to be performed, one or more dynamic partitions (Pl, P2, ... NI, N2, ... Ol, 02, ...) can be assigned in addition to the pre-allocated partitions (F1-F8, FA , FB, BG) and are released after the job is completed to free up memory space for later use. Computer according to claim 1 or 2, characterized in that each dynamic partition has its own address space and is provided in the private area of such address space. Computer according to claim 1, characterized in that multiple dynamic partitions can be assigned simultaneously. A computer according to any one of the preceding claims, characterized in that a private system area is provided in the private area for dynamic partition address spaces (GETVIS dynamic space area) for the reduction of the common area size, which is temporarily assigned system information for the address space together with said dynamic partition. Computer according to any one of the preceding claims, characterized in that said dynamic partitions are arranged in classes (dynamic classes) in which transactions can be performed. Computer according to claim 5, characterized in that the priority of said dynamic class can be determined. Computer according to claim 5 or 6, characterized in that the dynamic partitions within the same class are temporally dissected. Computer according to any one of claims 5 to 7, characterized in that the previously allocated (static) and dynamic partitions can be classified into the same class. A computer according to any one of the preceding claims, characterized in that a table (dynamic class table) is provided containing the properties of said dynamic partitions, wherein the dynamic properties table can be cataloged in the library from which the session can be loaded. A computer according to claim 9, characterized in that some of the dynamic table properties are: a) memory allocation; defining a memory request for a dynamic partition, especially for a dynamic GETVIS space and assigning a partition, all in a given class; b) partition size, determining the size of adjacent virtual memory in the partition reserved for program execution; c) the size of the GETVIS dynamic space, determining the amount of contiguous virtual memory for the GETVIS dynamic space area; d) the profile or process that will be performed in the partition will run before the job; e) the maximum number of dynamic partitions within one class, defining the maximum number of partitions that can be allocated in parallel within a given class when sufficient virtual memory and dynamic partitions are available, f) indication of incapacitation allowing disabling of a dynamic class, that is, no business can be performed within that class; g) spool of input / output devices, definition of spool of devices, e.g. reader, printer, punchers bordering the input / output spooler, e.g. ALL / POWER. For INTERNATIONAL BUSINESS MACHINES CORPORATION: iiltHlHA KlSAHBM LJUBLJANA " 1½ 22533 / VII / 94 ABSTRACT A computer with the concept of extended virtual memory A dynamic partition (Pl, P2, ... NI, N2, ... Ol, 02, ...), which can be assigned to additional pre-allocated partitions (F1-F8, FA, FB, BG) depending on the job that is need to be implemented and which can be released after the job is completed to free up memory space for future use. This concept extends the scope of virtual memory, uses available space more efficiently, and allows multiple programs to run in parallel. AS mm mm mm mm mm mm mm mm mm F1 /////// /////// /////// /////// /////// /////// /////// /////// /////// F4 F2 BG F3 SA SV FIG. 1 16 MB