Job control (computing): Difference between revisions

Revision as of 08:50, 10 September 2017

Latest revision as of 13:56, 2 August 2025

(15 intermediate revisions by 8 users not shown)

Line 1:

{{aboutAbout |Jobjob control in non-IBM (mainframe)general computing|IBM, Unix or non-computing |Job control (disambiguation)}}

|Unix-based job control| Job control (Unix)

{{refimprove|date=August 2017}}

|the IBM Job Control Language| Job Control Language

In [[computing]] '''job control''' refers to the control of multiple tasks or [[Job (software)|jobs]] on a [[computer system]], ensuring that they each have access to adequate resources to perform correctly, that competition for limited resources does not cause a [[deadlock]] where two or more jobs are unable to complete, resolving such situations where they do occur, and terminating jobs that, for any reason, are not performing as expected.

|all job control topics |Job control (disambiguation)}}

{{refimproveMore citations needed|date=August 2017}}

In [[computing]], '''job control''' refers to the automated control of multiple tasks or [[Job (softwarecomputing)|jobsjob]] on a [[computer system]],execution; ensuring that theyeach eachjob havehas access to adequate resources to perform correctly, that competition for limited resources does not cause a [[Deadlock (computer science)|deadlock]] where two or more jobs are unable to complete, resolving such situations where they do occur, and terminating jobs that, for any reason, are not performing as expected. Even with sophisticated automation, most systems, such as [[Job control (Unix)|Unix-like systems]], permit manual operations such as interrupting, pausing and resuming jobs and to execute them in the foreground (interactively) instead of the usual background (batch) mode for fully automated execution.

Job control, a.k.a. [[batch processing]] mostly proceeds without human intervention.<ref>{{cite web

Job control has developed from the early days of computers where human [[Computer operator|operators]] were responsible for setting up, monitoring and controlling every job, to modern [[operating system]]s which take on the bulk of the work of job control.

|url=http://publib.boulder.ibm.com/infocenter/zos/basics/index.jsp?topic=/com.ibm.zos.zmainframe/zconc_batchproc.htm

|title=Mainframe working after hours: Batch processing}}</ref> Job control is configured by [[programmer]]s who decide details including:

Even with a highly sophisticated scheduling system, some human intervention is desirable. Modern systems permit their users to stop and resume jobs, to execute them in the foreground (with the ability to interact with the user) or in the background. [[Job control (Unix)|Unix-like systems follow this pattern]].

* When to run a job

* atUnder times to also indicate under whatwhich conditions to skip a step.

* Which files and/or devices to use for input/output

* Whether a file is to be retained or deleted

* The maximum amount of storage that can be used

== History ==

Job control has developed from [[History of computing| the early days of computers]] where humanwhen [[Computer operator| operators]] were responsible for setting up, monitoring and controlling every jobjobs, to modern [[operating system]]ssystems which take on the bulk of the work of job control.

It became obvious to the early computer developers that their fast machines spent most of the time idle because the single program they were executing had to wait while a slow [[peripheral]] device completed an essential operation such as reading or writing data; in modern terms, programs were [[I/O-bound]], not [[compute-bound]]. [[Data buffer|Buffering]] only provided a partial solution; eventually an output buffer would occupy all available memory or an input buffer would be emptied by the program, and the system would be forced to wait for a relatively slow device to complete an operation.

It became obvious to the earlyEarly computer developers realized that their fast machinescomputers spent most of thetheir time idle because the single program they were executingsoftware had to wait while a relatively slow [[peripheral]] device completed an essential operation such as reading or writing data; in modern terms, programs were [[I/O-bound]], not [[compute-bound]]. [[Data buffer| Buffering]] only provided a partial solution;, but eventually an output buffer would occupy all available memory or an input buffer would be emptied by the programempty, and the system would be forced tothen wait for a relatively slow device to complete anits operationtask.

A more general solution is [[Computer multitasking|multitasking]]. More than one running program, or [[Process (computing)|process]], is present in the computer at any given time. If a process is unable to continue, its [[context (computing)|context]] can be stored and the computer can start or resume the execution of another process. At first quite unsophisticated and relying on special programming techniques, multitasking soon became automated, and was usually performed by a special process called the [[Scheduling (computing)|scheduler]], having the ability to interrupt and resume the execution of other processes. Typically a [[device driver|driver]] for a peripheral device suspends execution of the current process if the device is unable to complete an operation immediately, and the scheduler places the process on its [[job queue|queue]] of sleeping jobs. When the peripheral completed the operation the process is re-awakened. Similar suspension and resumption may also apply to [[inter-process communication]], where processes have to communicate with one another in an asynchronous manner but may sometimes have to wait for a reply.

A more general solution is [[Computer multitasking| multitasking]]. MoreA thancomputer oneexecutes runningmultiple programprograms, orconcurrently by loading a program into a [[Process (computing)|process]], isthat presentcan inbe paused when the computerprocessor attime anycan givenbetter time.be Ifused for a process that is unablenot towaiting. continue,The itsprocess's [[context (computing)|context]] canis becached storedin memory and theanother computerprocess's cancontext startis orused resumeto theresume execution of anotherthat process. AtThe firstsoftware quiteresponsible unsophisticatedfor andcontext relyingswapping on special programming techniques, multitasking soon became automated, and was usually performed by a special processis called the [[Scheduling (computing)|scheduler]], havingworks thewith ability to interrupt and resume the execution of other processes. Typically aperipheral [[device driver|driver]]s for a peripheral deviceto suspendssuspend execution of the currentactive process if the device is unable to complete an operation immediately, and the scheduler places the process on its [[job queue |queue]] of sleepinginactive jobs. When the peripheral completedcompletes the operation, the process isavailable re-awakenedto be resumed by the scheduler. Similar suspension and resumption applies to any operation that may alsoinvolve applywaiting; toincluding asynchronous [[inter-process communication]], where processes have to communicate with one another in an asynchronous manner but may sometimes have to wait for a reply.

However this low-level scheduling has its drawbacks. A process that seldom needs to interact with peripherals or other processes would simply hog processor resource until it completed or was halted by manual intervention. The result, particularly for interactive systems running tasks that frequently interact with the outside world, is that the system is sluggish and slow to react in a timely manner. This problem is resolved by allocating a "timeslice" to each process, a period of uninterrupted execution after which the scheduler automatically puts it on the sleep queue. Process could be given different priorities, and the scheduler could then allocate varying shares of available execution time to each process on the basis of the assigned priorities.

However, this scheduling has drawbacks. A process that seldom waits (i.e. does not use a peripheral) would hog the processor until it completed or was interrupted. Other processes would then be starved of processor resources and might become slow. This can be resolved via [[Preemption (computing)|preemptive]] multitasking, a.k.a. time slicing, in which each process is swapping out after it has had the processor for a period of time. Further, a process can be given a priority that allows it to be given more access to the process relative to lower priority processes.

This system of [[Preemption (computing)|pre-emptive]] multitasking forms the basis of most modern job control systems.

=={{anchor}}Batch processing==

{{main article|Batch processing}}

While batch processing can run around the clock, with or without computer operators,<ref>{{cite web

|url=http://publib.boulder.ibm.com/infocenter/zos/basics/index.jsp?topic=/com.ibm.zos.zmainframe/zconc_batchproc.htm

|title=Mainframe working after hours: Batch processing}}</ref> since the computer is much faster than a person, most decision-making occurs before the job even begins to run, and requires planning by the "programmer."

==Language==

=== Batch-oriented features ===

Since batch processing, although there may be a computer operator present, is intended to mostly operate without human intervention, many details must be included in the instructions submitted.

===Batch===

These include:

Early computer [[resident monitor]]s and [[operating system]]s were relatively primitive and were not capable of sophisticated resource allocation. Typically such allocation decisions were made by the computer operator or the user who submitted a job. [[Batch processing]] was common, and interactive computer systems rare and expensive. Job control languages (JCLs) developed as primitive instructions, typically punched on cards at the head of a deck containing input data, requesting resources such as memory allocation, serial numbers or names of magnetic tape spools to be made available during execution, or assignment of filenames or devices to device numbers referenced by the job. A typical example of this kind of language, still in use on mainframes, is [[IBM]]'s [[Job Control Language]] (also known as JCL). Though the format of early JCLs was intended for [[punched card]] use, the format survived the transmissiontransition to storage in computer files on disk.

* which program(s) to run

* using which file(s) &/or device(s)<ref>and many more details, such as whether the file is to be retained or deleted, the maximum of disk space to which it can grow, the name of a tape to be pre-mounted</ref> for input/output, and

* at times to also indicate under what conditions to skip a step.

====BANG Joband controlother languagesnon-IBM JCLs====

Non-IBM mainframe [[batch processing|batch]] systems had some form of job control language, whether called that or not; their syntax was completely different from IBM versions, but they usually provided similar capabilities. [[Interactive computing|Interactive]] systems include "[[command language]]s"&mdash;command files (such as PCDOS ".bat" files) can be run non-interactively, but these usually do not provide as robust an environment for running unattended jobs as JCL. On some computer systems the job control language and the interactive command language may be different. For example, [[Time Sharing Option|TSO]] on z/OS systems uses [[CLIST]] or [[Rexx]] as command languages along with JCL for batch work. On other systems these may be the same.

Early computer [[resident monitor]]s and [[operating system]]s were relatively primitive and were not capable of sophisticated resource allocation. Typically such allocation decisions were made by the computer operator or the user who submitted a job. [[Batch processing]] was common, and interactive computer systems rare and expensive. Job control languages (JCLs) developed as primitive instructions, typically punched on cards at the head of a deck containing input data, requesting resources such as memory allocation, serial numbers or names of magnetic tape spools to be made available during execution, or assignment of filenames or devices to device numbers referenced by the job. A typical example of this kind of language, still in use on mainframes, is [[IBM]]'s [[Job Control Language]] (also known as JCL). Though the format of early JCLs was intended for [[punched card]] use, the format survived the transmission to storage in computer files on disk.

The Non-IBM JCL of what at one time was known as ''the BUNCH'' (Burroughs, Univac/Unisys, NCR, Control Data, Honeywell), except for [[Unisys]], are part of the BANG<ref>what Xerox Data Systems and its SDS purchase called its ''exclamation mark'' {{cite web |title=Operating systems list |url=https://sites.google.com/site/thanhphong37vn/interview-questions-guide/operating-system/operating-systems-list}}</ref><ref>the SLASH SLASH of its JCL, called ''SLANT SLANT'' by some. The remainder of this footnote is a reminder, dedicated to the first person from whom I heard SLANT SLANT, the late senior computer operator and retired Military Officer who taught many people-oriented lessons. Let this be added to his citations.</ref> that has been quieted.

===Interactive===

As time sharing systems developed, interactive job control emerged. An end-user in a time sharing system could submit a job interactively from his remote [[computer terminal|terminal]] ([[remote job entry]]), communicate with the operators to warn them of special requirements, and query the system as to its progress. He could assign a priority to the job, and terminate (kill) it if desired. He could also, naturally, run a job in the foreground, where he would be able to communicate directly with the executing program. During interactive execution he could interrupt the job and let it continue in the background or kill it. This development of [[interactive computing]] in a multitasking environment led to the development of the modern [[shell (computing)|shell]].

=== JCL, fileFile systems and device independence ===

The ability to not have to specify part or all of the information about a file or device to be used by a given program is called ''device independence''.

device independence.

==Real-time computing==

Line 55 ⟶ 56:

== External links ==

* [https://www.gnu.org/software/libtoolbash/manual/libchtml_node/Job-Control-Basics.html Job Control - The GNU C LibraryBasics]

== See also ==