GB1452865A - Data processing apparatus - Google Patents

Data processing apparatus

Info

Publication number
GB1452865A
GB1452865A GB4366574A GB4366574A GB1452865A GB 1452865 A GB1452865 A GB 1452865A GB 4366574 A GB4366574 A GB 4366574A GB 4366574 A GB4366574 A GB 4366574A GB 1452865 A GB1452865 A GB 1452865A
Authority
GB
United Kingdom
Prior art keywords
user
queue
jobs
performance
service
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Expired
Application number
GB4366574A
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
International Business Machines Corp
Original Assignee
International Business Machines Corp
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by International Business Machines Corp filed Critical International Business Machines Corp
Publication of GB1452865A publication Critical patent/GB1452865A/en
Expired legal-status Critical Current

Links

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F9/00Arrangements for program control, e.g. control units
    • G06F9/06Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
    • G06F9/46Multiprogramming arrangements
    • G06F9/48Program initiating; Program switching, e.g. by interrupt
    • G06F9/4806Task transfer initiation or dispatching
    • G06F9/4843Task transfer initiation or dispatching by program, e.g. task dispatcher, supervisor, operating system
    • G06F9/485Task life-cycle, e.g. stopping, restarting, resuming execution
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F9/00Arrangements for program control, e.g. control units
    • G06F9/06Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
    • G06F9/46Multiprogramming arrangements
    • G06F9/50Allocation of resources, e.g. of the central processing unit [CPU]
    • G06F9/5083Techniques for rebalancing the load in a distributed system
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F2209/00Indexing scheme relating to G06F9/00
    • G06F2209/50Indexing scheme relating to G06F9/50
    • G06F2209/5019Workload prediction

Landscapes

  • Engineering & Computer Science (AREA)
  • Software Systems (AREA)
  • Theoretical Computer Science (AREA)
  • Physics & Mathematics (AREA)
  • General Engineering & Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Computer And Data Communications (AREA)
  • Memory System Of A Hierarchy Structure (AREA)
  • Debugging And Monitoring (AREA)
  • Multi Processors (AREA)

Abstract

1452865 Data processing systems INTERNATIONAL BUSINESS MACHINES CORP 9 Oct 1974 [21 Nov 1973] 43665/74 Heading G4A Interactive terminal jobs and batch jobs are swapped between main and auxiliary storage in dependence on measured and estimated rates of usage of system resources by the jobs and in dependence on performance objectives specified for the jobs. When a new user logs on or a new batch job is selected, or, alternatively at regular intervals, a work load manager is invoked to process two queues of user control blocks so as to enable the performance of the system to be optimized. The user control blocks corresponding to jobs which are in main storage form an IN queue, and the first function of the work load manager is to access, 31, Fig. 2, the user control block at the head of the IN queue via a pointer 17, Fig. 1. From the accessed user CB a performance group number which has been assigned to that particular user is used to index an installation performance specification table IPS. The data stored in this table for each performance group includes constants A-C used in calculating the accumulated number of service units for each job and, for each of a number of periods which may be related to the amount of time elapsed or the number of service units accumulated since processing of the job began, a performance objective in the form of a table of service rates and corresponding normalized load levels. The number of service units accumulated by a job may be equal to A times CPU time + B times I/O count + C times a measure of main storage occupancy, the CPU and I/O count being stored in an address space control block corresponding to that user, and the main storage occupancy measure being a function of page count and CPU time. The service rate is calculated as the quotient of the number of service units accumulated divided by a time interval which is equal to the difference between the CPU time in the AS CB and the old CPU time in the user CB. From this calculated service rate the corresponding normalized load level is determined from the table in IPS and the same procedure is carried out for the next user CB in the queue. Finally the user CBs are reordered according to the new calculated normalized load levels. A similar reordering of the user CBs in the OUT queue is performed except that the queue is in reverse order of normalized level and anticipated service data are used since the jobs are not actually in course of execution. Should the normalized level at the head of the OUT queue be greater than the normalized level at the head of the IN queue then a swap between the heads of the two queues takes place. By providing different performance objectives different users can be handled in different ways and the different service rates specified in each performance objective permit the same user to be treated differently depending on the system work load.
GB4366574A 1973-11-21 1974-10-09 Data processing apparatus Expired GB1452865A (en)

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
US41784773A 1973-11-21 1973-11-21

Publications (1)

Publication Number Publication Date
GB1452865A true GB1452865A (en) 1976-10-20

Family

ID=23655618

Family Applications (1)

Application Number Title Priority Date Filing Date
GB4366574A Expired GB1452865A (en) 1973-11-21 1974-10-09 Data processing apparatus

Country Status (4)

Country Link
JP (1) JPS5081749A (en)
CA (1) CA1019454A (en)
DE (1) DE2453526A1 (en)
GB (1) GB1452865A (en)

Cited By (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP0119973A1 (en) * 1983-03-18 1984-09-26 Telefonaktiebolaget L M Ericsson Apparatus for load regulation in computer systems
US4495562A (en) * 1980-06-04 1985-01-22 Hitachi, Ltd. Job execution multiplicity control method
GB2194086A (en) * 1986-07-25 1988-02-24 Hitachi Ltd Job scheduling
GB2210482A (en) * 1987-09-29 1989-06-07 Alan Lush Performance-related resource allocation
FR3031203A1 (en) * 2014-12-24 2016-07-01 Bull Sas METHOD FOR THE ORDERING OF TASKS AT THE KNOB LEVELS OF A COMPUTER CLUSTER, ORDERER OF TASKS AND CLUSTER ASSOCIATED
US11044302B2 (en) 2016-09-29 2021-06-22 International Business Machines Corporation Programming interface and method for managing time sharing option address space on a remote system

Families Citing this family (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPS54118743A (en) * 1978-03-08 1979-09-14 Nec Corp Job mix deciding device
JPS54118745A (en) * 1978-03-08 1979-09-14 Nec Corp Job mix selecting device
JPS54118746A (en) * 1978-03-08 1979-09-14 Nec Corp Job mix selecting device
DE19632832A1 (en) * 1996-08-14 1998-02-19 Siemens Nixdorf Inf Syst Method for operating a multiprocessor data processing system and multiprocessor data processing system operating according to this method

Cited By (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US4495562A (en) * 1980-06-04 1985-01-22 Hitachi, Ltd. Job execution multiplicity control method
EP0119973A1 (en) * 1983-03-18 1984-09-26 Telefonaktiebolaget L M Ericsson Apparatus for load regulation in computer systems
GB2194086A (en) * 1986-07-25 1988-02-24 Hitachi Ltd Job scheduling
US4852001A (en) * 1986-07-25 1989-07-25 Hitachi, Ltd. Job scheduling method and system
GB2210482A (en) * 1987-09-29 1989-06-07 Alan Lush Performance-related resource allocation
FR3031203A1 (en) * 2014-12-24 2016-07-01 Bull Sas METHOD FOR THE ORDERING OF TASKS AT THE KNOB LEVELS OF A COMPUTER CLUSTER, ORDERER OF TASKS AND CLUSTER ASSOCIATED
US10698729B2 (en) 2014-12-24 2020-06-30 Bull Sas Method for organizing tasks in the nodes of a computer cluster, associated task organizer and cluster
US11044302B2 (en) 2016-09-29 2021-06-22 International Business Machines Corporation Programming interface and method for managing time sharing option address space on a remote system

Also Published As

Publication number Publication date
JPS5081749A (en) 1975-07-02
DE2453526A1 (en) 1975-05-22
CA1019454A (en) 1977-10-18

Similar Documents

Publication Publication Date Title
US3702006A (en) Method for balancing the utilization of input/output devices
US4542458A (en) Method of and apparatus for assigning software resources to memory devices
US5745880A (en) System to predict optimum computer platform
US8627330B2 (en) Workload manager managing a workload of an enterprise data warehouse
GB1452865A (en) Data processing apparatus
GB1269300A (en) Data processing system
Saltzer A simple linear model of demand paging performance
ES8403641A1 (en) System for controlling key storage unit.
JPS5638542A (en) Controlling method for engine
CN112416596A (en) Node scheduling method, device and equipment
US5537595A (en) Device management system in a computer system
CN110209350A (en) It is a kind of to mix in storage architecture HPC system using the dynamic dispatching method of I/O request
CN108429704B (en) Node resource allocation method and device
Potier et al. Adaptive allocation of central processing unit quanta
Bard An analytic model of CP-67-VM/370
ES443674A1 (en) Data processing system
Pohm Cost/performance perspectives of paging with electronic and electromechanical backing stores
KR940005348B1 (en) Method and apparatus for data distribution
JPH01173236A (en) Selecting system for file storage medium
CA1167986A (en) Communication multiplexer sharing a free running timer among multiple communication lines
Bowdon Sr et al. Simulation: a tool for performance evaluation in network computers
JPH0354371B2 (en)
White Relative effects of central processor and input-output speeds upon throughput on the large computer
GB2604758A (en) Method for concurent execution of database operations
Bryan JOSS: User scheduling and resource allocation

Legal Events

Date Code Title Description
PS Patent sealed
PCNP Patent ceased through non-payment of renewal fee