V1 MVS

VERSION 1.
0
23 Feb 2022
MVS
Table of Contents
1. INTRODUCTION..................................................................................................................................................... 2
2. OPERATING SYSTEM CONCEPTS .................................................................................................................... 3
2.1 OPERATING SYSTEM – IMPORTANCE AND NEED ........................................................................................... 3

2.2 POSITION OF OS IN A SYSTEM ....................................................................................................................... 3
3. COMPUTING ENVIRONMENT............................................................................................................................ 4
3.1 KEY CONCEPTS AND TERMINOLOGY ............................................................................................................ 4

3.2 DATA PROCESSING ....................................................................................................................................... 4
3.3 MULTI-PROGRAMMING ................................................................................................................................. 5
3.4 MULTI-PROGRAMMING OVERHEADS ............................................................................................................ 6
3.5 RELEVANCE OF MULTI-PROGRAMMING ........................................................................................................ 6
3.6 MULTI-PROCESSING ..................................................................................................................................... 6
3.7 SPOOLING ..................................................................................................................................................... 6
3.8 VIRTUAL STORAGE ....................................................................................................................................... 7
3.9 MEMORY MANAGEMENT .............................................................................................................................. 7
4. CHARACTERISTICS FEATURES OF MVS ....................................................................................................... 9
5. IBM OPERATING SYSTEMS .............................................................................................................................. 10
5.1 IBM FAMILIES OF OPERATING SYSTEMS .................................................................................................... 10

5.2 MVS EVOLUTION ....................................................................................................................................... 11
5.3 MULTIPROGRAMMING WITH FIXED TASK (MFT) ....................................................................................... 13
5.4 MULTIPROGRAMMING WITH VARIABLE TASKS (MVT) .............................................................................. 14
5.5 SYSTEM 370 I/O ARCHITECTURE ................................................................................................................ 18
6. KEY TERMINOLOGY .......................................................................................................................................... 20
6.1 CACHE MEMORY ........................................................................................................................................ 20

6.2 CHANNELS .................................................................................................................................................. 20
6.3 CHANNEL - I/O DEVICE CONNECTIVITY ..................................................................................................... 20
6.4 I/O DEVICES ............................................................................................................................................... 20
6.5 DATA COMMUNICATION NETWORK............................................................................................................ 21
6.6 DATA COMMUNICATION EQUIPMENT ......................................................................................................... 22
7. TYPICAL MAINFRAME CONFIGURATION .................................................................................................. 24
7.1 A SMALL MAINFRAME CONFIGURATION .................................................................................................... 24

7.2 MVS CONCEPTS AND TERMINOLOGY ......................................................................................................... 25
7.3 RSM (REAL STORAGE MANAGER) ............................................................................................................. 28
7.4 ASM (AUXILIARY STORAGE MANAGER).................................................................................................... 28
7.5 VSM (VIRTUAL STORAGE MANAGER) ....................................................................................................... 28
7.6 VIRTUAL STORAGE LAYOUT ...................................................................................................................... 29
8. MVS FUNCTIONS ................................................................................................................................................. 31
DATA MANAGEMENT OVERVIEW ............................................................................................................................. 31
i
MVS
8.1 TYPES OF DATA .......................................................................................................................................... 31

8.2 DATASET ORGANIZATION ........................................................................................................................... 31
8.3 NON-VSAM DATASETS ORGANIZATION ..................................................................................................... 32
8.4 DATASET ORGANIZATION ........................................................................................................................... 32
8.5 VSAM DATASETS ORGANIZATION .............................................................................................................. 33
8.6 DATA ORGANIZATION - SALIENT POINTS ................................................................................................... 33
8.7 DATA SET NAMING RULES ......................................................................................................................... 33
8.8 MVS DATASETS ......................................................................................................................................... 34
8.9 DATA MANAGEMENT ................................................................................................................................. 36
9. MVS CONCEPTS ................................................................................................................................................... 37
9.1 HOW DATASETS ARE ACCESSED?................................................................................................................ 37

10. JOB MANAGEMENT OVERVIEW .................................................................................................................. 38
10.1 WHAT IS A JOB? ..................................................................................................................................... 38

10.2 JOB MANAGEMENT FUNCTIONS ............................................................................................................. 38
10.3 STAGES OF JOB ...................................................................................................................................... 38
10.4 JOB MANAGEMENT ................................................................................................................................ 39
10.5 JOB SCHEDULING ................................................................................................................................... 39
11. DATASET ALLOCATION AND JOB STEP EXECUTION ........................................................................... 42
12. MVS TOOLS OVERVIEW ................................................................................................................................. 44
12.1 JOB MANAGEMENT TOOLS..................................................................................................................... 44

12.2 WHY AND WHAT OF JCL? ..................................................................................................................... 44
12.3 JES - JOB ENTRY SYSTEM ...................................................................................................................... 45
12.4 MVS TOOLS OVERVIEW ........................................................................................................................ 46
12.5 COMPONENTS OF JOB OUTPUT ............................................................................................................... 48
12.6 VTAM – VIRTUAL TELECOMMUNICATIONS ACCESS METHOD .............................................................. 48
12.7 CICS – CUSTOMER INFORMATION CONTROL PROGRAM (OPTIONAL COMPONENT) ................................ 49
12.8 DB2 - DATABASE 2 (OPTIONAL COMPONENT) ........................................................................................ 49
12.9 RACF - RESOURCE ACCESS CONTROL FACILITY ................................................................................... 49
12.10 SMF - SYSTEM MANAGEMENT FACILITY .............................................................................................. 49
12.11 LANGUAGE TRANSLATORS / LINKAGE EDITOR / LOADER ...................................................................... 49
12.12 UTILITIES ............................................................................................................................................... 49
12.13 AN INTRODUCTION TO TSO ................................................................................................................... 50
13. INTERACTIVE SYSTEM PRODUCTIVITY FACILITY (ISPF) .................................................................. 52
13.1 PRIMARY OPTIONS MENU ...................................................................................................................... 52

13.2 TERMINATION PANEL ............................................................................................................................ 54
13.3 KEY MAPPING........................................................................................................................................ 54
13.4 BROWSING DATASETS (OPTION 1) ......................................................................................................... 55
13.5 BROWSE COMMANDS............................................................................................................................. 55
13.6 EDITING DATASETS (OPTION 2) ............................................................................................................. 55
13.7 STANDARD EDITING COMMANDS............................................................................................................ 56
ii
MVS
13.8 EDIT PROFILES ....................................................................................................................................... 56

13.9 PROFILE SETTINGS ................................................................................................................................. 57
13.10 EDIT MODES .......................................................................................................................................... 57
13.11 ADVANCED EDIT OPTIONS ..................................................................................................................... 58
13.12 SHIFTING TEXT SOURCE ......................................................................................................................... 58
13.13 UTILITIES MENU .................................................................................................................................... 59
13.14 LIBRARY UTILITY .................................................................................................................................. 60
13.15 DATASET UTILITY.................................................................................................................................. 61
13.16 NEW DATASET ALLOCATION .................................................................................................................. 61
13.17 RENAMING DATASET ............................................................................................................................. 62
13.18 DATASET INFORMATION ........................................................................................................................ 62
13.19 ALLOCATING DATASETS ........................................................................................................................ 63
13.20 MOVE / COPY ......................................................................................................................................... 64
13.21 MOVE / COPY- 2..................................................................................................................................... 65
13.22 DSLIST UTILITY ................................................................................................................................... 66
13.23 DSLIST DATASET SELECTION ............................................................................................................... 66
13.24 DSLIST COMMANDS ............................................................................................................................. 67
13.25 PRIMARY COMMANDS ........................................................................................................................... 67
13.26 RESET .................................................................................................................................................... 68
14. APPENDIX – A (BIBLIOGRAPHY/REFERENCES) ...................................................................................... 69
iii
MVS
Day-Wise Schedule
Day 1 and Day 2.
Computing Environment -Key Concepts & terminology, Typical IBM MF site.

IBM Operating Systems -
IBM families of OS
IBM Hardware
MVS Implementation
MVS Functions
Data Management Overview
Job Management Overview
MVS Tools Overview
Lab session
Demo on ISPF
Familiarizing with various options of ISPF editor on PCCICS
Assignments ISPF editor
iv
MVS
1. Introduction
1
MVS
1. Introduction
Before you begin to work on the “Mainframe environment”, which by default means “IBM
Mainframe”, you need to have a basic idea of the IBM mainframe operating system. Today, it is
know as MVS, which expands to Multiple Virtual Storage.
The MVS operating system has evolved over many years and has adapted to the changing
technology and modern day requirements. Since the user base of MVS is very large, a change is
not easy to Implement. The costs of the Mainframes are very high and the customer base is mostly
made up of long-term customers with huge application and large databases to support. Most of
these applications are also ‘Mission Critical’ applications. It is therefore imperative that any
change to MVS also be backward compatible.
MVS is designed to work with many hundreds of users working together, located in the same
locality or across continents. The MVS operating System was created by IBM and is said to
‘propriety’ OS. It has the capacity to supports a large number of peripherals like disks, tapes,
printers, Network devices etc. The applications on these “Legacy systems” are typically where
there is a huge amount of data and a large user base. Examples are banking sector, Insurance
Sector, Newspapers, Material and Inventory, Airlines, Credit Card System, Billing, Accounting,
Shipping and others. Company’s that own these mainframes are typically those that are very big
inherently or have to deal with vast amounts of data, which has to be processed fast.
2
MVS
2. Operating System Concepts

2.1 Operating System – Importance and Need
An OS controls the computer and acts as an intermediary between the user of a computer
and the computer hardware. The OS basically programs the task of scheduling the use of
the computer. Sophisticated OS’s increase the efficiency of use of the computer and hence
reduce the cost of using the computer.
2.2 Position of OS in a system
Users
Application Programs
Loaders
OS manages
Memory Device
Hardware
Information Processor
Linkers Compilers
Utilities
Users
The main functions of the Operating System are:
• Keeping track of the resources namely memory, I/O devices, processor and information.
• Decides who gets what resource, and how much?
• Allocate the resources when needed.
• Reclaim the resources back after it has been used, so that they may be allocated
subsequently.
3
MVS
3. Computing Environment
3.1 Key Concepts and Terminology
Command Processing
• Command Issue Mode

This how a user (programmer / end-user) interacts with the computer E.g. To edit a program,
to execute a program
On-line Mode - Using Terminal

Batch Mode - Using Punched Cards or JCL’s
• Command Execution Mode

All computer commands can be executed in two modes
Foreground - Terminal is locked while the command is being executed

Background - Terminal is free while the command is being executed
3.2 Data Processing
How Business applications are executed
• On-line
➢ End User performs business functions
➢ Application programs work interactively with End User
➢ Execution is in foreground mode
➢ Database is immediately updated to reflect the changes
➢ Typically used for transaction processing, queries, master updates functions
• Batch
➢ Application programs are executed in background mode
➢ Periodic business functions are executed automatically
➢ “As and when” business functions are triggered by End User
➢ Operations department is responsible for monitoring the execution
➢ A command file is created to execute these functions
➢ One command file may consist of multiple programs / system utilities
Typically used for bulk transaction processing, report printing, periodic processing (e.g. invoice
generation, payroll calculation)
4
MVS
• Time Sharing
1. Resource Sharing
2. Multiple Users compete for computer resources at the same time
3. At any given point in time only one user can have control of the resources
4. What should be the basis of sharing?
• First come first served?

• Priority based?
• Who so ever can grab it - Law of Jungle?
• Equal - Democratically?
• Need based?
Usually combination of 2 and 4 is used i.e. all are equal but some are more equal!!!
• Time Slice
➢ Each user is given control of resources for a pre-defined period - time slice
➢ The control is passed on to next in queue user at the end of time slice (even if first
user’s work is incomplete)
➢ If the user requires I/O before the time slice is over, the control is handed over to the
next user (since CPU cannot do anything until I/O is complete)
• Priority
➢ Each user / function is assigned a priority level

➢ The higher priority users are serviced first in a round robin fashion
➢ Only if the higher priority users are in “wait” state for I/O completion the users in the
lower priority are serviced
Time Sharing typically refers to sharing of resources in an interactive processing mode.
3.3 Multi-programming
• Why Multi-Programming?
➢ The program has CPU based and Non-CPU based instructions

➢ CPU is kept waiting during the non-CPU based instructions execution
➢ E.g. I/O operations (Disk, Terminal, Printer)
➢ This results in wastage of CPU time - a precious resource
➢ Multi-programming results in better CPU utilization
• How does it Work?
➢ Multiple programs are kept “ready” for execution

➢ CPU can execute only one program at any given point in time
➢ If the currently executing program requires I/O, it is put in a “wait” state
➢ Another program is immediately taken for execution
5
MVS
➢ On completion of I/O the program again becomes “ready” for execution
This results in an illusion that multiple programs are being executed simultaneously, hence
multiprogramming.
3.4 Multi-Programming Overheads
➢ Program Queue Management

➢ Program Status Management
➢ Context Switching during Changeover
➢ Multiple programs must be in main memory
➢ Management of Common Resource Sharing (e.g. Printer)
It is critical to determine optimum level of Multi-programming to maintain certain service level.
3.5 Relevance of Multi-programming
• Multi-programming is applicable even for single user system

• Multi-programming is a must for multi-user system
3.6 Multi-Processing
• There are multiple CPUs (processors) in one machine

• These work together under single operating system
• Each CPU executes a separate program
• O/S assigns programs to each CPU
• Essentially CPU is treated as an allocable device!!!!!
3.7 Spooling
Why Spooling?
➢ Multiple programs may need same printer at the same time

➢ May result in intermixing of output
➢ Exclusive access to a program will hold other programs
➢ Printer is much slower, results in longer “wait” state
How it is implemented?
➢ Output to printer is intercepted and written to a disk i.e. “spooled”

➢ On completion of program “spooled” output is queued for Printing
➢ This queue is processed by O/S print routine
➢ The O/S print routine is multi-programmed along with application programs
6
MVS
3.8 Virtual Storage
Why Virtual Storage?
➢ Required to enable execution of programs with are larger than the main memory size
What is Virtual Storage?
➢ Technique to simulate large amount of main storage

➢ Reality is main storage is much less
➢ E.g. Real main storage is 16MB but virtual storage is 2GB
How Virtual Storage is implemented?
➢ Program executable code is generated assuming virtual storage size

➢ Only part of the program is loaded in main memory
➢ Address translation mechanism is used to map virtual address to actual address
➢ Feasible because only the instruction currently being executed and the corresponding data
need to be in the main storage
Advantages of Virtual Storage
➢ Main memory can be shared by multiple programs

➢ Enables effective use of the limited main storage
Overheads of Virtual Storage
➢ Address mapping
➢ Keeping track of what is in memory and what is not
➢ Data/Instructions need to be “brought in” main memory as an when required
➢ “Remove” from main memory what is not currently required (to make room for
instructions of other program)
➢ Memory Management
3.9 Memory Management

Problem: - Any thing that is to be executed must be in memory. (Memory limitation)
Solution: - 1. Place task in real memory
2. Place task in virtual memory
1. Real Memory implementation:
➢ Code and data are in real memory

➢ Size of code and data limited by size of installed memory
➢ Good performance, low overhead
➢ Possible wastage of memory
7
MVS
2. Virtual memory implementation:
➢ Based on assumption for a task, not all code & data is needed in real memory all the time
➢ Implemented on a combination of real plus auxiliary storage
➢ Operating system takes responsibility of bringing rest part of tasks in real memory when
required
swapped out Perform I/O operation
P1 P1
P2
P2
swapped in DATA
P3 Real Memory
(Only part of program that requires
main memory will be in the main
Virtual Memory memory)
OS
Advantage: code and data size independent of the real memory
8
MVS
4. Characteristics Features Of MVS

1) VIRTUAL STORAGE: The use of virtual storage increases the number of storage locations
available to hold programs and data.
2) MULTIPROGRAMMING: Multiprogramming simply reclaims the CPU during idle periods

to let other programs execute.
3) SPOOLING: To provide shared access to printer devices.
4) BATCH PROCESSING: When batch processing is used, work is processed in units called
“Jobs”. A job may cause one or more programs to be executed in sequence. The system
collectively processes batch jobs.
5) TIMESHARING: In this system, each user has access to the system through a terminal
device. Instead of submitting jobs that are scheduled for later execution, the user enters
commands that are processed immediately.
Time-sharing is also called Online Processing because it lets users interact directly
with the computer.
9
MVS
5. IBM Operating Systems

5.1 IBM Families of Operating Systems
DOS - Disk Operating

System
For Small VM/CMS - Virtual

System/360 Machine
Conversation Monitor
DOS/VSE System
(Virtual Storage
Extended) •Simulates more than
one computer system
on single real machine
•Supports both DOS

and OS
OS - Operating System
For Full range

System/360
MVS
(Multiple Virtual
Storage)
10
MVS
5.2 MVS Evolution
1995 MVS/ESA 5.2.2
1993 MVS/OPEN EDITION (POSIX)
1990 SYSTEM 390
1988 MVS/ESA 16 B
1981 MVS/XA 2 GB (31-bit)
1974 OS/VS2R2 (MVS) 16 MB (24-bit)
1972 OS/VS1 OS/VS2R1 (SVS) 16 MB
1970 SYSTEM 370
1966 OS/MFT OS/MVT 3 MB
1966 PRIMARY CONTROL PROGRAM (PCP)
11
MVS
Operating Systems for

System/360
1965 PCP Primary Control Program
Basically a Primer No Multiprogramming

Introduction of JCL- No Priority
(JOB Control Language) No Spooling
(Became obsolete 1n Very unreliable
1969
1966 MFT Multi-programming with

Fixed number of Tasks
Limited multi- Fixed Number of Partitions

programming One Job per Partition
Small improvement Fixed Partition Size
over PCP
1967/68 MVT Multi-programming with

Variable number of Tasks
Storage allocated as per

Reliable Comprehensive
requirement (region)
features
No. of Jobs depends
Predecessor of MVS
upon storage req. and
availability
12
MVS
Single Contiguous Allocation
In the earlier OS’s like OS/360 PCP (Primary Control Program), which was a batch Operating
System, where there is no multiprogramming, memory is allocated to a job as follows.
Operating System
Memory area used by

this program
Area of memory available for use by the
Allocated but not used program
(Wasted)
The OS occupies a portion of the memory and the remaining area of the memory is allocated to
the user program. If the program is smaller than the remaining memory, then there is some unused
space in the memory, which goes waste. On the other hand the program that does not fit in
memory cannot be executed at all.
Disadvantages
• The memory is not fully utilized

• CPU has to wait on the job when an I/O is being performed
• Some portions of the program in the memory may not be accessed at all
Hence there is a poor utilization of memory and the CPU and the job size is limited to maximum
memory available, after use by the OS.
5.3 Multiprogramming with Fixed Task (MFT)
This type of memory management is also called Static Partition Specification.
Here the size of each partition is decided at the time of installation of the OS, this remains fixed
after the OS is loaded and cannot be changed. To change the size of the partition the OS must be
reinstalled, during which the changes are incorporated.
A Partition Status Table, which is shown in the figure, is used to keep track of the use of
partitions.
13
MVS
Partition No Size Status

1 8K In use
2 32K In use
3 32K Not in use
4 120K Not in use
5 520K Not in use
When the user gives a job, he has to specify the maximum memory needed to run it. A partition of
sufficient size is then found and assigned.
This system is satisfactory when the size of the job is almost equal to the partition size. If the size
of the job is diverse then there might be considerable wastage of memory space.
For E.g.: When a job requires 33K, then partition 4 is used (see table) resulting in a colossal waste
of around 87K. At the time of execution of this 33K job, if another job of 80K is to be submitted,
assuming partition 5 (520K size) is already in use, the new job has to wait (as it can be
accommodated only in partition 4 or 5).
5.4 Multiprogramming with Variable Tasks (MVT)
Thus it becomes important that the appropriate partitions are to be allocated to the appropriate
Jobs depending upon the size, so that all partitions are effectively utilized with minimum space
wastage.
This is called the Dynamic Specification. This implies that the partitions are created as and when
job is processed. Here again partition status tables are used.
When a job is to be processed, then a free contiguous area at least as large as the partition desired
must be found. Second, if the area found is large than required, it must be split into allocated and
unallocated portions of the system.
• Migrating from Dos to OS was a major change

➢ VM is not very popular
➢ Today most of the sites use MVS
• Major Handicaps
➢ Limited and inefficient spooling
➢ No Virtual Storage
Utilities to Overcome these Handicaps
➢ HASP - Houston Automatic Spooling Priority

- Developed unofficially (self initiative) by IBM employees
- Distributed free to MVT/MFT users
- Became very popular
14
MVS
- Eventually owned and supported by IBM
• ASP - Attached Support Processor

➢ Developed (officially) by IBM
➢ Intended for MVT
➢ Several mainframes can work together under single O/S (predecessor of multi-
processing?)
➢ Provided better spooling capability
➢ Relatively less takers
System 370
• Announced in early 70s

• Supported Virtual Storage
• New Operating Systems OS/VS were introduced
• OS/VS1 (Virtual System 1) - adopted from MFT
• OS/VS2 (Virtual System 2)
• Version SVS - Single Virtual Storage
- Adopted from MVT (1972)
• Version MVS - Multiple Virtual Storage
- Completely Rewritten (1974)
• HASP and ASP were migrated to OS/VS2 under the names JES2 and JES3
• MVS and its derivatives are the mainstay of IBM O/S now
15
MVS
1974 OS MVS/SP1 Multiple Virtual Storage

/VS2 System/370
24 bit addressability
Greater reliability /
integrity / performance
Virtual storage limitation
of 16MB - A serious
handicap for CICS
MVS/
1983 XA
32 bit addressability Processors :

Virtual storage of 2GB 308x, 3090, 4381
Increased maximum number
of channels and Devices
MVS MVS/SP3 Multiple Virtual Storage
/ESA Enterprise Systems Architecture
1988 ESA/370
Processors :
ES/3090 E and S Models and later
Virtual storage of 16 Terra
4381 Models 90E, 92E, 93E and later
Bytes
1990 MVS MVS/SP4 Multiple Virtual Storage

/ESA Enterprise Systems Architecture
ESA/390
Virtual storage of 16 Terra Processors :

Bytes ES/9000, ES/3090-9000T
ES/3090 J Models
16
MVS
Input-Output Management
Problem: - Application should not worry about device characteristics. I/O device speed is 100
times slower than CPU.
Solution: Let all I/O be handled by a specialized system-I/O Subsystem
2) I/O operation
swapped out
P1 P1
P2
P2 I/O
swapped in
Subsystem File
P3
How is to be done is decided by
I/O subsystem
Virtual Memory
OS Tells What to do
Real Memory Auxiliary Device
17
MVS
5.5 System 370 I/O Architecture
Channel 0
Channel 1
Channel 2
Channel 3
CP Main
U Storage Channel 4
Channel 5
Channel 6
Channel 7
18
MVS
STORAGE
CP CP
Channels
Devices
• Channels
➢ Provide paths between the processor & I/O devices
➢ 3090 processors can have a maximum of128 channels
➢ A channel itself is a computer & executes I/O instructions called channel commands
➢ I/O devices are connected to channels through an intermediate device called “Control
Unit”.
➢ Each channel can have up to 8 control units.
• Control Unit
➢ These are DASD units, can be connected to common control unit, and called “String
Controller”.
➢ String Controller can be connected to a channel directly or indirectly
➢ A control unit called “Storage Control” connects string controllers to a channel.
19
MVS
6. Key Terminology
6.1 Cache Memory
➢ High speed memory buffer (faster than main memory)
➢ Operates between CPU and main memory
➢ Used to store frequently accessed storage locations (instructions)
➢ Usually available on all processors
6.2 Channels
➢ Device Management Concept - Unique to IBM
➢ Provides access path between CPU and I/O devices (DMA)
➢ Up to eight control units can be connected to one channel
➢ Up to eight I/O devices can be connected to one control unit
➢ A channel is a small computer in itself with a set of instructions (Channel commands)
➢ Channel controls the I/O device operations independent of CPU
➢ Cannel processing can overlap CPU processing - improved performance
6.3 Channel - I/O Device Connectivity

➢ Parallel architecture i.e. all bits of a byte are transmitted simultaneously
➢ Information transfer is in unit of two bytes
➢ Sixteen data wires and additional control wires are required
➢ Maximum length of 120 meters (400 feet)
➢ Data speed of 4.5mbps
➢ Use of copper results in heavy, expensive cabling
6.4 I/O Devices
Unit Record Devices - Each record is a single physical unit

➢ Card Devices (now obsolete): Readers / Punches / Reader and Punches
➢ Printer
- Impact Printers - 600 to 2000 LPM
- Non-Impact Printers - 3800 sub-system, 20,000 LPM
➢ Built-in control units for each device
➢ Directly attached to channel
Magnetic Tape
➢ High volume storage
➢ Sequential processing
➢ Normally used as back-up device
➢ Also used for physical transfer of data
➢ 4 to 8 tape drives are connected to one control unit
DASD - Direct Access Storage Device

➢ IBM’s official name for Disk
➢ Non-removable - offers better reliability and are faster
➢ Volume is a specific unit of storage. E.g. Disk pack or DASD, Tape
20
MVS
➢ A group of DASDs of same type are connected together to form a String and are
connected to a string controller
➢ Multiple string controller are connected to a storage controller
➢ Storage controller is connected to channel
channel
connection string controller
1 32
(1 - 128) storage control
(1 - 8)
string controller
1
32
DASD unit
6.5 Data Communication Network
Allows local and remote terminals access to the computer systems.
Components of data communication

➢ Host Computer - System/370 processor
➢ Communications Controller - Attached to the channel
- Devices (terminals and printers) are connected to the terminal controller (also known as
cluster controller)
- Terminal controller is connected to communications controller
- Terminal Controller managing Local terminals / printers can be connected directly to the
channel
➢ Modems and telecommunication lines (telephone line, Satellite Link)

- Remote terminals / printers are connected to terminal controller (at local site)
- Terminal controller is connected to modem
- Modem is connected to telecommunications line
- At the receiving end telecommunications line is connected to modem
- Modem is connected to communication controller
3270 Information Display System

➢ Sub-system of terminals, printers and controllers connected to Host computer
➢ Locally through communications controller or directly to channel
➢ Remotely through communications controller, modem and telecommunications line
21
MVS
➢ A typical 3270 terminal controller (3274) controls up to 32 terminals / printers

➢ Emulator programs (Shine Link, Erma Link) allow computers (typically PCs) to mimic
3270 devices
➢ These are useful since they allow upload / download of data between MF and PC
6.6 Data Communication Equipment
Data Communication equipment lets an installation create a data communication network that lets
users at local terminals & remote terminals to access computer system
System/370 processor Host System

channel
communication controller
modem modem
Telecommunication
Lines
modem modem
terminal controller terminal controller
printer printer
terminal terminal
Remote System Remote System
22
MVS
At the center of the network is the host system, a system/370 processor
The control unit that attaches to the host system’s channels is called a communication controller
➢ It manages the communication function
➢ Necessary to connect remote terminal system
➢ Via modems and telecommunication lines
A modem is a device that translates digital signals from the computer equipment at the sending
end into audio signal that are transmitted over a telecommunication line, which can be telephone
line, a satellite link or some other type of connection. At the receiving end of the line, another
modem converts those audio signals back into digital signal.
23
MVS
7. Typical Mainframe Configuration

With a variety of IBM Mainframe Processors and I/O devices, we can have a number of
Mainframe configurations. So one Mainframe configuration is different from the other.
7.1 A Small Mainframe Configuration

3279 Operator
Consoles (4) 3420 Tape Drives (4) 3350 DASDs (24)
4381 Processor 8M
3211
Printers (2)
Modems (3)
Local 3270 System
Remote 3270 Systems
24
MVS
The figure shows a small mainframe computer system built around a 4381 processor.
7.2 MVS Concepts and Terminology
Multiprogramming and Virtual Storage
• Multiprogramming means operating system allows one or more programs to execute

concurrently. The key to understanding multiprogramming is that at any given time only
one program has control of the CPU. Simply put, more than one program are memory
resident and are in active state
• Virtual storage is a facility that simulates a large amount of main storage by treating
DASDs storage as an extension of Virtual Storage
• In other words, when virtual storage is used, the processor appears to have more storage
than it actually does
Address Spaces
• Main storage consists of millions of individual storage locations, each of which can store
one character, or byte, of information. To refer to a particular location, we use an address,
which indicates the storage location’s offset from the beginning of memory
• The first byte of storage is at address 0; the second byte of storage is at address 1, and so
on. Each successive byte of main storage has an address that is one greater than the
previous byte of storage
• An address space is simply the complete range of addresses and as a result the number of
storage locations that can be accessed by the computer
• The number of digits allowed to represent an address limits the maximum size of a
computer’s address space. To illustrate, suppose a computer records its addresses using six
decimal digits. Such a computer could access storage with addresses from 0 to 999,999
• For most System/370 type processors, a 24 digit or a 24-bit binary number represents an
address. Since the largest number that can be represented in 24 bits is about 16 million, so
it can contain 16M of storage. In MVS/XA or MVS/ESA 31-bit addressing is provided
and so it supports 2GB of storage
• So the concept behind Virtual Storage is that it lets the computer push its address space to
the maximum allowed by the address format, even if the amount of real storage installed
on the processor is less than the maximum. So, in 370-mode, virtual storage can simulate a
16M-address space, even if only 4M or 8M of real storage are actually installed
25
MVS
Multiple Virtual Storage
• MVS uses real storage and areas of DASD storage, called page-data sets, in combination
to simulate several virtual storage address spaces
• Each address space provides an entire 16M range of addresses (2GB if XA is used)
• As a result, to refer to a particular byte of Virtual Storage under MVS, we need to know
two things: (1) the address, which identifies a specific byte of storage within a 16M or
2GB address space, and (2) the address space to which the address applies
• When multiple virtual storages are used, the total amount of virtual storage that can be
simulated is almost limitless because MVS can create an almost unlimited number of
address spaces
• However the size of an address (24 bits or 31 bits) still limits the size of each address
space to 16MB or 2GB and also various factors such as the speed of the processor and the
amount of real storage installed effectively limit the number of address spaces that can be
provided
• A CPU can access only one address space at a time
• When CPU is accessing instructions and data from a particular address space, that address
space is said to be in control of the CPU. So the program in that address space will
continue to execute until MVS intervenes and places the CPU under the control of another
address space
• Multiple Virtual Storage is how MVS implements multiprogramming. Each batch or time-
sharing user is given a separate address space. So each job or user can access up to 16M or
2GB of virtual storage independent of any other job or user on the system
26
MVS
PAGING
• The total amount of virtual storage that can be used under MVS is almost unlimited.
As a result, the amount of real storage present on a particular machine is nearly always
less than the amount of virtual storage being used
• To provide for the larger amount of virtual storage MVS treats DASD storage as an
extension of real storage
• MVS divides virtual storage into 4K sections called pages
• Data is transferred between real and DASD storage one page at a time
• As a result, real storage is divided into 4K sections called page frames, each of which
can hold one page of virtual storage
• Similarly, the DASD areas used for virtual storage, called page data sets, are divided
into 4K page slots, each of which holds one page of virtual storage
• When a program refers to a storage location that isn’t in real storage, a page fault
occurs.
• When there is a page fault, MVS locates the page that contains the needed data on
DASD and transfers it into real storage. This operation is called a page-in
• Sometimes the new page can overlay data in a real storage page frame
• In other cases, data in a page frame has to be moved to a page data set to make room
for the new page. This is called page-out
• So the process of bringing a new page into real storage is called paging
• At any given moment, page frames in real storage contain pages from more than one
address space
• MVS keeps track of what pages are in what page frames by maintaining tables that
reflects the status of real storage and of each address space. The real storage frames
that contain those tables cannot be paged out; they must always remain in real storage
as long as their associated address spaces are active
Swapping
• Depending on the amount of real storage a system has and the types of job’s it is
processing, MVS can efficiently multiprogram only a certain number of jobs at once
• So using a process called swapping, MVS periodically transfers entire address spaces in
and out of virtual storage, so they are temporarily unavailable for processing
27
MVS
• When an address space is swapped out, its critical pages-the ones that contain the tables
that keep track of the location of each virtual storage for the address space-are written to a
special dataset called a swap data set. Later, when the system can accommodate the job
again, the address space is swapped in so it can be processed again
• When the address spaces are swapped out, they cannot compete for virtual storage or the
CPU until they are swapped in
• The swapping is the same thing as paging, only at a higher level
• Rather than move small 4K pieces of virtual storage in and out of real storage, swapping
effectively moves entire address spaces in and out of virtual storage
• Because paging occurs only for address spaces that are currently in virtual storage, paging
does not occur for address spaces that are swapped out
• The paging process is managed by several components of MVS. The 3 major one are:
➢ Real Storage Manager (RSM)
➢ Auxiliary Storage Manager (ASM)
➢ Virtual Storage Manager (VSM)
7.3 RSM (Real Storage Manager)
➢ Manages real storage

➢ Directs movements of pages among real and auxiliary
➢ Builds segment and page table
7.4 ASM (Auxiliary Storage Manager)
➢ Keeps track of the contents of the page dataset and swap dataset
➢ Page dataset contain virtual pages that are currently occupying a real storage frame.
7.5 VSM (Virtual Storage Manager)
➢ Controls allocation/de-allocation of virtual storage

➢ Maintain storage use information for Storage Management Facility (SMF)
28
MVS
7.6 Virtual Storage Layout
System Queue
Area (SQA)
Common
Area Pageable Link Pack
Area (PLPA)
Common Service
Area (CSA)
Private Local System Queue

Area Area (LSQA)
User’s Private
AddressSpace Scheduler Work Area
(SWA)
User Region
System
Nucleus
Area System
Region
Each Virtual Storage Address Space consists of a System Area, a Private Area and a Common
Area.
System Area
• It contains the nucleus load module, page frame table entries. Data blocks for system libraries
and so many other things
• Nucleus and other contents of the System Area make up the resident part of the MVS system
control program
• Its contents are mapped one for one into real storage frames at initialization time.
• The size of System Area does not change once it is initialized
Common Area
• It contains parts of the system control program, control blocks, tables and data areas
29
MVS
Private Area
The Private Area is made up of:

➢ Scheduler Work Area (SWA)
➢ System Region
➢ User Region
The user region is the space within Private Area that is available for running the user’s program
Scheduler Work Area
• SWA contain control blocks that exist from task initiation to task termination
• The information in SWA is created when a job is interpreted and used during job initiation
and execution
• It is pageable and swappable
30
MVS
8. MVS Functions
Data Management Overview
Anything that needs to be stored and accessed on user request is a Data for MVS
8.1 Types of Data

Business Data
➢ Database
➢ Indexed Files
➢ Flat Files
Application Components
➢ Source Programs
➢ Executable Programs
➢ Screen Definitions
➢ Record Layout Definitions
➢ Command File Scripts
MVS (System Data)

➢ O/S program
➢ User Information (ID, Password, Profile)
➢ Access Permissions
Temporary Data
➢ O/S Built Data (e.g. task queues, segment table, page table)
➢ Spooled Output
➢ Work Files for Sort
8.2 Dataset Organization
• Dataset organization fall into two categories under MVS: VSAM and NON-VSAM
• Non-VSAM provides four basic ways of organizing data stored in datasets

➢ Physical Sequential
➢ Indexed Sequential
➢ Direct
➢ Partitioned
• VSAM provides four basic ways of organizing data stored in datasets

➢ Entry Sequence Dataset - ESDS
➢ Key Sequence Dataset - KSDS
➢ Relative Record Dataset - RRDS
➢ Linear Dataset - LDS
31
MVS
8.3 Non-VSAM datasets organization
Physical Sequential
• Records are stored one after another in consecutive sequence
• Can reside on just any type of I/O devices
• Appropriate when file’s records don’t have to be retrieved at random
Indexed Sequential
• Includes an index, which relates key field values to the location of their corresponding data
records
Direct
• Permits random access of records
• It doesn’t use an index
• To access record, the disk location address (By hashing) of that record to be specified
Partitioned
• Consists of one or more members
• Each of these members can be processed, as if it were a separate physical sequential file.
• Names of members in a Partitioned dataset (PDS) is stored in a directory
8.4 Dataset Organization
Partitioned Data Set - Salient Features

➢ Commonly referred as PDS
➢ Also known as Library
➢ Used to store application components
➢ PDS is divided into one or many members
➢ Member name can be up to 8 characters long
➢ There is no extension for member
➢ Each member can be processed as an individual unit
➢ Entire PDS can be processed as one unit
➢ Each PDS contains a directory
➢ Directory has an entry for each member in a PDS
- PDS Examples:
PAYROLL.TEST.SOURCE, PAYROLL.PROD.SOURCE,
INV.TEST.LOADLIB
➢ Normally consists of 3 qualifiers called as
- PROJECT
- GROUP
- TYPE
– Personal PDS start with high level qualifier as User ID
– E.g. DA00T23.NEW.SOURCE
– Member Name Examples
– PAB0017, PAB0105, PAC0021 etc.
32
MVS
Usually, the application component type cannot be identified from the member name. For
that naming conventions are used for PDS.
8.5 VSAM datasets organization
ESDS
• Can only reside on DASD
• Functionally equivalent to Physical Sequential File
KSDS
• Functionally equivalent to Indexed Sequential File
RRDS
• Lets you retrieve the record by specifying the location relative to the start of the file
All VSAM datasets must be cataloged
8.6 Data Organization - Salient Points
➢ Non-VSAM Data Organization was developed in mid 1960s

➢ VSAM - (Virtual Storage Access Method) was introduced in early 1970s
➢ VSAM was expected to replace Non-VSAM Data Organization Functions
➢ Today, most sites use both VSAM and Non-VSAM Data Organization
➢ VSAM is the primary data organization for user data
➢ VSAM is also called “native” file management system of IBM
➢ Most of the DBMS running under MVS use VSAM as underlying Data Organization (e.g.
DB2, IDMS)
➢ Physical Sequential Data Organization is used for “flat” files
➢ Index Sequential and Direct Data Organization are not very popular now (these functions
are handled better by VSAM)
➢ Partitioned Data Sets (PDS) also used by MVS to store O/S programs
8.7 Data Set Naming Rules
Data Set Naming Rules

➢ Allows - Alpha, Digits, National Characters @,#$, and “.”
➢ Maximum Length 44 characters for DASD, 17 for Tape
➢ If Length is more than 8, must be broken into qualifiers of maximum 8 characters each
➢ Qualifiers are separated by “.”
➢ “.” are counted in overall length
➢ First character of the qualifier must be alpha or national character
➢ Last character of data set must not be “.”
➢ First qualifier is called high-level qualifier
➢ High-level qualifier has special significance
33
MVS
E.g. Data Set name PAYROLL.P9710.TRAN
➢ Has three qualifiers

➢ High-level qualifier is PAYROLL
➢ Total length is 18
Dataset Tracking
Data Set Tracking Mechanisms

➢ Label
➢ Catalog
Label
• DASD Label
➢ Each DASD is labeled; called Volume Label (VOL1 label)
➢ DASD label contains Volume Serial Number and address of the VTOC file
• Volume Serial Number

➢ Each DASD is identified by a unique number, Volume Serial Number vol-ser
➢ Vol Ser must be specified for accessing the Data Set (which is not cataloged)
• Data Set Label

➢ Each data set is a label record called File label or Data Set Control Block (DSCB)
➢ DSCB describes data set’s name, it’s DASD location and other details
• VTOC
➢ VTOC - Volume Table Of Contents is a special file for each DASD
➢ VTOC contains the file labels for all data sets on the volume
8.8 MVS Datasets
Label Processing
• When a dataset is stored on disk or tape, MVS identifies it with special records called ‘labels’
• There are 2 types of DASD labels: Volume, File Label
• All DASD volumes must contain a volume label, often called a VOL1 label. This label is
always in the same place on a disk volume: the 3rd record of track zeros in cylinder zero
• Volume label has 2 important functions
➢ It identifies the volume by providing a volume serial no: VOL-SER. Every DASD volume
must have a unique six-characters VOL=SER
➢ It contains the disk address of the VTOC
• The VTOC (Volume Table of Contents) is a special file that contains the file labels for the
datasets on the volume
34
MVS
VOL 1 Label
VTOC
Format-4 Format-1 Format-1 Format-1 Format-3 Format-5
VTOC FileA File-B File-C File-B Free Extents
Free Extents
File-A
File-B
File-C
Free Extent
File-B
Free Extent
Catalog
• Obviates the need of specifying VOL SER and UNIT for the data set
• Catalog Types
➢ CVOL
➢ VSAM
➢ ICF (Integrated Cataloging Facility)
• Catalog Features
➢ Each MVS has only one Master Catalog and also functions as system catalog
➢ Master Catalog is used by MVS for system data sets
➢ User Catalog is used for user data sets
➢ There can be multiple User Catalogs
➢ Master Catalog contains one entry of each User Catalog
- VSAM data sets must be Cataloged

- Non-VSAM Data Sets may or may not be cataloged
- An Alias can be created for a Catalog
• Usually, the high-level qualifier of a data set is same as the catalog name or catalog alias name
• Multiple data sets can be cataloged in single user catalog
35
MVS
• Alias helps to catalog data sets with different high-level qualifiers to be cataloged in a single
user catalog
Catalog Name VCAT.MPS800 Alias MMA2 MMA1
Data Set Name MMA2.CUSTOMER.MASTER

MMA1.CUSTOMER.TRAN
8.9 Data Management
Data Management Functions (for Non-PDS)

➢ Allocate
➢ Process
- Add Records
- Modify Records
- Delete Records
➢ De-allocate (delete)
➢ Copy
➢ Rename
➢ Catalog
Additional Functions for PDS

➢ Compress
➢ Member Management
➢ Create, Modify, Delete, Copy, Rename
How Data Management is achieved?

➢ Interactively using MVS Commands
➢ Executing MVS Utility Programs (batch mode)
➢ Through Application Programs
- On-line Processing
- Batch Processing
36
MVS
9. MVS Concepts
9.1 How Datasets are accessed?
Generally dataset goes through three phases when handled through program:
• Allocation
• Processing
• De-allocation
Allocation
• The process of locating an existing dataset or space for a new dataset and preparing the system
control block needed to use the dataset is called “Allocation”
Allocation occurs at 3 levels

➢ Unit is selected and allocated e.g. SYSALLDA-DASD, TAPE
➢ Volume is allocated
➢ Dataset on that volume is allocated
Processing
Processing involves 3 steps

➢ Opening datasets
➢ Processing I/O
➢ Closing datasets
De-allocation
Each file is automatically de-allocated when step terminates. While de-allocating, disposition of
dataset can be decided, whether you want to retain the file or should be deleted.
37
MVS
10. Job Management Overview

10.1 What is a Job?
Simply put, job is an execution of one or more related programs in sequence
E.g. 1
A job of creating an executable module (load module) from a source program consists of
compilation and link editing a program.
Job - Salient Points

• Executed in a background mode
• Job details are specified using some command language
10.2 Job Management Functions

• Receive the job into operating system
• Schedule the job for processing by O/S
• Execute the Job
• Process the output
10.3 Stages of Job
1. Job Preparation
• User keys-in commands using Editor
• Save as a member in PDS
2. Job Scheduling
• Initiated using TSO SUBMIT command
• Not necessarily on FIFO basis
• Prioritization is implemented using concept of class and priority code
3. Job Execution
4. End of execution (normal, erroneous)

• Intimate the user
• Job log management
• Job output management
• Printer output
• Data set output
Erroneous Termination of job

➢ Type of execution errors
➢ Incorrect commands (command syntax errors)
➢ Required resources (Data Sets, Program Library, Program Load Module) not available
➢ Violation of access permissions for data sets, program load module etc
➢ Mismatch in data set status; as required by job and as it actually exists e.g. a create is issued
38
MVS
for a data set while data set which already exists

➢ Program errors
➢ Mismatch for Data set - Between program definition and actual characteristics
➢ Infinite loop
➢ Data Type mismatch - numeric variable contains non-numeric data
➢ Any abnormal termination of program is called “Abend”
10.4 Job Management
Definitions
JOB - Is an execution of one or more related programs in sequence
JOB STEP - Each program to be executed by a Job is called a job step
JCL (Job Control Language) - Is a set of control statements that provide the specifications
necessary to process a job
JES (Job Entry Subsystem):

Meant for job entry into system, also for job returning after completion
Shares the load on the operating system
Takes care of all inputs and outputs
Do simple basic syntax checking
Resource Initialization
Creation of address space
It is also known as Job Scheduler
Classified into
- JES2-design for uni-processor environment
- JES3-design for multiprocessing environment (Decided at the time of system
initialization)
Jobs are sent to MVS depending on the class priority schemes
How Job Is Entered Into the System
• When you submit the job, JES reads the job stream (sequence of JCL commands) from a
DASD file and copy it to a job queue, which is a part of a special DASD file called JES
SPOOL
10.5 Job Scheduling
How Job Is Scheduled For Execution

• MVS does not necessarily process jobs in the order in which they are submitted. Instead, JES
examines the jobs in the job queue and selects the most important jobs for execution. That
way JES can prioritize its work, giving preference to more important jobs.
• JES uses 2 characteristics to classify a job’s importance, both of which can be specified in the
job’s JCL : Job Class and Job Priority
If two or more jobs are waiting to execute, the JES scheduler selects the one with higher
priority
• Each job class is represented by a single character, either a letter (A-Z) or a digit (0-9). Job
classes are assigned based on the processing characteristics of the job.
39
MVS
• INITIATOR: - An initiator is a program that runs in the system region of an address space.
Each initiator can handle one job at a time. It examines the JES spool, selects an appropriate
job for execution, executes the job in its address space and returns to the JES spool for another
job
• The number of active initiator on a system and as a result the number of address spaces
eligible for batch job processing determines the number of batch jobs that can be multi
programmed at once
Each initiator has one or more job classes associated with it. It executes jobs only from those
classes.
Initiator Eligible Job Classes

1 A
2 B,C,D,H,L,T
3 B,C,D,H,L,T
4 B,C
5 B,C
6 C
Within a job class, initiator selects jobs for execution based on their priorities, which can range
from 0 to 15
If two or more jobs have same class & priority, they are executed in the order in which they are
submitted.
How Job Is Executed
Once an initiator has selected job for execution, it invokes a program called the interpreter. The
interpreter's job is to examine the job information passed to it by JES and create a series of control
blocks in the SWA, a part of the address space’s private area. Among other things, these control
blocks describes all of the datasets the job needs. Now initiator goes through 3 phases for each
step of job. Allocation (required resources are allocated). Processing (region is created and
program is loaded and executed). De-allocation (resources are released). This continues until
there are no more job steps to process. This continues until there are no more job steps to process.
Then, the initiator releases the job and searches the spool again for another job from the proper
class to execute. As a user’s program to execute, it can retrieve data that was included as part of
job stream and stores in the JES spool
40
MVS
Job
JES SPOOL INITIATOR
JCL SYSIN
SYSOUT QUEUE O/P DATA PROGRAM INTERPRETOR

SYSOUT EXECUTION
How The Job’s Output Is Processed
Like Jobs, SYSOUT data is assigned an output class that determines how the output will be
handled
Common O/P classes are:
A - Printer
B - Card Punch O/P
X - Held O/P
[Held O/P stays on the sysout queue indefinitely; Usually, O/P is held so that it can be
examined from a TSO terminal]
How A Job Is Purged
• After the job’s output has been processed, the job is purged from the system, i.e. JES spool
space, the job used, is freed so it can be used by other jobs and any JES control blocks
associated with the job are deleted
Once a job has been purged, JES no longer knows of its existence
41
MVS
11. Dataset Allocation And Job Step

Execution
SWA
After initiator selects a job for
control block
execution, it invokes the
interpreter, which builds the
required control blocks in the
System Region
address space’s SWA.
Interpreter
Initiator
SWA
For each job step, the initiator
control block
invokes allocation routines to
allocate the units, volumes and
datasets required by the job
System Region step
Allocation
Initiator
SWA
After resource allocation, the
control block
initiator creates a user region,
loads the user program into it
User Program
and transfers control to user
System Region
program
Initiator
42
MVS
SWA CONTROL BLOCK
SYSTEM REGION
UNALLOCATION
INITIATOR
When the user program completes, the initiator invokes Unallocation routine to Deallocate the
resources used by the job step
43
MVS
12. MVS Tools Overview

Tools are a set of sub-systems and facilities that;
• Implement MVS functions
• Are directly used by MVS user
These are essentially Software programs; system programs
Interactive Processing Tools (TSO - Time Sharing Option)

• Used by the terminal user to invoke MVS facilities interactively
• TSO internally treats each terminal user as a Job
• Job Stream is created when terminal user logs in
• Each terminal user is given a separate address space
ISPF - Interactive System Productive Facility

• Runs as part of TSO
• Takes advantage of full screen (24 x 80) capability of 3270 terminals
• Panels are provided for terminal users for issuing commands
• Key Functions Implemented Using ISPF
➢ Editor - Program Sources, Job Commands

➢ Data Management - PDS and Physical Sequential Data Set Management
➢ Job Processing - Initiate Job, Check job log
➢ Miscellaneous
• PDF - Program Development Facility is Part of ISPF
12.1 Job Management Tools
• Job Control Language (JCL)

• Used to code job commands
• Job Entry System (JES)
• Manages the job before and after execution; receive, schedule, process output
• Base Control Program (BCP)
➢ Manages the job during execution
• Simultaneous Peripheral Operations on-line (SPOOL)
➢ Used for staging of input and output
12.2 Why and What of JCL?
JCL is the most dreaded word for newcomer to IBM world
Why JCL?
➢ Since the job is executed in background, without user interaction, all information required
for the execution must be supplied in advance
➢ JCL is used to specify this control information
44
MVS
➢ The most common information supplied through JCL is:
- To whom the job belongs (which user id)?

- What is the program / utility that is to be executed?
- Where (in which library / PDS) to find the load module of the program or utility?
- Where (which DASD volume / catalog, what data set name) to find the input data files
for the program / utility?
- Where should (which DASD volume, what data set name) the output files be created?
- The printer output should be directed to which printer?
What is JCL?
➢ Stands for Job Control Language

➢ Connotation is; set for job commands stored as a MEMBER in a PDS e.g. JCL to execute
a batch program, JCL to compile and link a COBOL program, JCL to allocate a VSAM
data set, JCL to SORT and MERGE two Physical Sequential Data Sets
➢ Thus, JCL is nothing but a set of commands
- User keys-in commands using a editor
- Saves as PDS Member e.g. PAYROLL.TEST.JCL(PROG1JCL)
Good grasp of JCL is a must to be a versatile IBM programmer
12.3 JES - Job Entry System
Introduction
➢ Two versions of JES; JES2/JES3
- JES2 is primarily for single processor systems

- JES3 is for multiple processor systems
➢ Each MVS system uses either JES2 or JES3

➢ JES3 has additional scheduler functions than JES2 (e.g. schedule job at specific time of
the day, interdependent job scheduling)
45
MVS
12.4 MVS Tools Overview
How Job Enters the System?
➢ Job can enter the system from local or remote card readers (now obsolete)
➢ By starting a cataloged JCL procedure (e.g. when user logs in, a predefined set of
commands are executed as a batch job. These commands are stored as cataloged JCL
procedure)
➢ By interactive users ‘thru’ SUBMIT command. Users can create a PDS member in which
commands are specified. On issuing SUBMIT command these are executed as a job.
We will focus on third approach
Input
➢ On SUBMIT, internal reader reads the JCL and creates an input stream
➢ JES2 reads the input stream, assigns a Job Number and places input stream in SPOOL data
set (a message is sent to TSO user about the job number)
➢ Job is put in the conversion queue
Conversion
➢ Converter program analyzes JCL statements
➢ Converts into converter / interpreter text
➢ Checks for Syntax errors
- If any error, Job is queued for output processing
- If no error, Job is queued for processing
Processing
Selection based on job class and priority
➢ Selected job is passed to Initiator
➢ Initiator invokes Interpreter
➢ Interpreter builds control blocks from converter / interpreter text in a Scheduler Work
Area (SWA)
- SWA is part of address space’s private area

- Control blacks describe the data sets required by the job
➢ Initiator allocates resources required by the Job
- Initiator starts the program to be executed

- Builds the user region
- Loads the program in the user region
- Transfers control to the program
➢ On completion of the program execution, initiator de-allocates the resources

➢ The process of allocation / execution and de-allocation is repeated for each job step
46
MVS
Initiator Characteristics
➢ Each initiator can handle one job at a time
➢ There can be multiple initiators
➢ Each initiator has a job class associated with it
➢ System Operators can control the number of initiators and the class/es associated with
each initiator
Input Data
➢ Input data to the user’s program can be specified in the job
➢ Called in-stream data or SYSIN data
➢ SYSIN data is read and stored in JES spool
➢ SYSIN data is treated like a data coming from card reader
Output
➢ Management of System Messages, User Data Sets that need to be Printed / Punched
➢ Organized by output class and device set-up requirements
➢ User ‘s program can produce output data that is stored in a JES spool; called SYSOUT
data
➢ Each SYSOUT data is assigned an output class
➢ Output class indicates the printer selection
➢ “Held” Output
- Special class (usually Z) is assigned to “hold” the output

- “Held” output remains in the SYSOUT indefinitely
- Usually used to verify before printing
- User can change the class and thus release the “held” output
Hard-Copy
➢ Local or remote processing
➢ Device Selection
➢ Queue the output for print /punch
Purge
➢ Release SPOOL and Job Queue space
➢ Intimate TSO user about job completion
Job Output
➢ Output is produced at each stage job processing
➢ Includes output produced by;
- JES
- MVS
- User’s program where SYSOUT is allocated as output device
➢ Job output is available to user (you can see it dynamically)

➢ It can be viewed using ISPF
47
MVS
12.5 Components of Job Output
Component 1- Separator Page

 First and last page of job output
 Inserted by JES
 Helps operator the segregate the job outputs when directed to printer
Component 2 – part I Job Log

 Messages produced by JES
 Also displayed on operator’s console
 If the job Abends, error messages are logged in Job Log
Component 2 – part II Job Statistics

 Summary information of system resources used by the job e.g.;
 Number of JCL cards
 Spool usage
 Execution time
Component 3 - JCL Listing

• List of JCL that was processed for the job
• Should be same as what user has created
Component 4 - Message Log

• Messages regarding job execution
• Messages produced by MVS
• Includes details of
• Resource Allocation
• Program Execution
• Resource De-allocation
• Consists of Message label and message text
• Message label starting with IEF indicates a MVS message
• Installation specific messages
Component 5 - SYSOUT
• Separate sub-component for each SYSOUT allocation
• Each SYSOUT can have different characteristics e.g. class, record length etc.
12.6 VTAM – Virtual Telecommunications Access Method
• Telecommunications (TC) Access Method

• Required to support terminal devices
• Part of SNA – System Network Architecture
• Provides centralized control over all terminals attached to the system
• VTAM Application programs (e.g. TSO, CICS IMS-DC) communicate with
terminal devices via VTAM
48
MVS
12.7 CICS – Customer Information Control Program (optional

component)
• Interactive applications are developed using CICS
• CICS is a VTAM application program
• Works with VTAM to support on-line functions
• CICS implements multi-programming within itself
• Multiple programs which are part of same application are executed within CICS
address space
• CICS selects one program at a time for execution
• CICS itself is multi-programmed by MVS along with other programs
12.8 DB2 - Database 2 (optional component)
• Database Management System

• Relational Implementation
12.9 RACF - Resource Access Control Facility
• Comprehensive Security Package

• Though optional used by most of the installations
• Users and Resources (e.g. Data Sets) are identified to RACF
• Whenever user tries to access a resource the security is checked by RACF
• RACF is a set of routines
• Invoked as and when required
12.10 SMF - System Management Facility
• Keeps track of system usage

– CPU, DASD I/O, Records Printed etc.
• Data collected when job is executed
• Stored in a special data sets
• Used for billing
12.11 Language Translators / Linkage Editor / Loader
• Language Translators- Convert source to object module

• Separate for each language, Assembler Language Translator is part of MVS
• Linkage Editor (part of MVS) - Converts object module to executable i.e. load
module
• Loader - Creates temporary load module (used during testing phase)
12.12 Utilities
• Set of general purpose programs

• Executed like a user program through JCL
49
MVS
• Common Utilities are:
➢ IEBGENER
➢ IEFBR14
➢ SORT
➢ IDCAMS
12.13 An Introduction to TSO
• Time Sharing
• Resource sharing
• MVS handles each TSO user as it handles batch jobs
• The user specific batch job that starts up handles
➢ What datasets are available

➢ What terminal monitor program is to be used
➢ What procedure to auto execute at logon
TSO Commands
• About 26 commands providing a variety of functions can be used.

• Allow Dataset Management functions
• Program Development functions.
• Batch job functions.
• Other functions like Help, Broadcast, Clist, and Rexx.
• You can issue these at the READY prompt or TSO command.
Dataset Management functions
• Allocate Datasets dynamically

• List Datasets
• Print Datasets
• Copy Datasets
• Delete Datasets
• Rename Datasets
• List Catalog Entries
• List VTOC Entries
• Use AMS Services
Program Development functions
• Create program.
• Edit program.
• Compile program.
• Link edit a program.
• View output.
50
MVS
• Route output to a printer
Batch job functions
• Submit Jobs
• Monitor job
• View output
• Route output
Help
• Help on TSO commands can be obtained by typing, “HELP” at the “READY” prompt.
51
MVS
13. Interactive System Productivity Facility

(ISPF)
• Access to ISPF is gained by Keying ISPF at the READY prompt
• This is done as default in the auto executed Clist at startup
• When this is entered you get the Primary Options Menu
13.1 Primary Options Menu
----------------------- ISPF/PDF PRIMARY OPTION MENU ------------------------

OPTION ===> pfshow USERID - MATEKD
0 ISPF PARMS - Specify terminal and user parameters TIME - 06:58

1 BROWSE - Display source data or output listings TERMINAL - 3278
2 EDIT - Create or change source data PF KEYS - 12
3 UTILITIES - Perform utility functions
4 FOREGROUND - Invoke language processors in foreground
5 BATCH - Submit job for language processing
6 COMMAND - Enter TSO Command, CLIST, or REXX exec
7 DIALOG TEST - Perform dialog testing
8 LM UTILITIES - Perform library administrator utility functions
9 IBM PRODUCTS - Additional IBM program development products
10 SCLM - Software Configuration and Library Manager
C CHANGES - Display summary of changes for this release
T TUTORIAL - Display information about ISPF/PDF
X EXIT - Terminate ISPF using log and list defaults
D DATACENTER - Perform Datacenter Defined Functions
S SDSF - Spool Display and Search Facility
U USER - Perform User Defined Functions
F1=HELP F2=SPLIT F3=END F4=RETURN F5=RFIND F6=RCHANGE

F7=UP F8=DOWN F9=SWAP F10=LEFT F11=RIGHT F12=RETRIEVE
52
MVS
PA/PF Key Map

PF1 ===> HELP Enter the Tutorial
PF2 ===> SPLIT Enter Split Screen Mode
PF3 ===> END Terminate the current operation
PF4 ===> RETURN Return to primary options menu
PF5 ===> RFIND Repeat find
PF6 ===> RCHANGE Repeat Change
PF7 ===> UP Move screen window up
PF8 ===> DOWN Move screen window down
PF9 ===> SWAP Activate the other logical screen in split screen mode
PF10 ===> LEFT Scroll screen left
PF11 ===> RIGHT Scroll screen right
PF12 ===> RETRIEVE Retrieve last command
PA1 ===> ATTENTION Interrupt Current operation
PA2 ==> RESHOW Redisplay the current screen
PF1 - PF12 Keys may be duplicated from PF13 to PF24 in 24 key mode.
Split Screen Mode and Tutorial (Help)
• Entered by keying “SPLIT” on the command line

• Or by positioning the cursor where required and pressing PF2
• Context Sensitive help can be accessed by typing help on the command line or through the
PF1 key
List and Log files
• Some ISPF commands generate outputs. Printed output like this is collected and stored in a
special dataset call list dataset
• Whether the list dataset is to be retained, printed and/or deleted can be specified as a default in
the setup panels
• The ISPF operations done are recorded in a Log dataset. The disposition can be specified in
the defaults panel
User Profile
• ISPF maintains a user profile

• This profile contains default values of various entry panels.
Exiting ISPF
To terminate ISPF you can

• type =x at the command line
• or use the PF3 key to exit
If you haven’t specified default dispositions for your List and log datasets then the termination
panel is displayed.
53
MVS
13.2 Termination Panel
------------------- SPECIFY DISPOSITION OF LOG DATA SET ---------------------

COMMAND ===>
LOG DATA SET DISPOSITION LIST DATA SET OPTIONS NOT AVAILABLE
------------------------- -----------------------------------
Process option ===>
SYSOUT class ===>
Local printer ID ===>
VALID PROCESS OPTIONS:

PD - Print data set and delete
D - Delete data set without printing
K - Keep data set (allocate same data set in next session)
KN - Keep data set and allocate new data set in next session
Press ENTER key to complete ISPF termination.

Enter END command to return to the primary option menu.
13.3 Key Mapping
Option 0.3
------------------------ PF KEY DEFINITIONS AND LABELS ------------------------

COMMAND ===>
NUMBER OF PF KEYS ===> 12 TERMINAL TYPE ===> 3278
PF1 ===> HELP

PF2 ===> SPLIT
PF3 ===> END
PF4 ===> RETURN
PF5 ===> RFIND
PF6 ===> RCHANGE
PF7 ===> UP
PF8 ===> DOWN
PF9 ===> SWAP
PF10 ===> LEFT
PF11 ===> RIGHT
PF12 ===> RETRIEVE
PF1 LABEL ===> PF2 LABEL ===> PF3 LABEL ===>

54
MVS

13.4 Browsing Datasets (Option 1)
------------------------- BROWSE - ENTRY PANEL ------------------------------

COMMAND ===>
ISPF LIBRARY:
PROJECT ===> MATEKD
GROUP ===> TRG ===> ===> ===>
TYPE ===> JCL
MEMBER ===> (Blank or pattern for member selection list)
OTHER PARTITIONED OR SEQUENTIAL DATA SET:

DATA SET NAME ===>
VOLUME SERIAL ===> (If not cataloged)
DATA SET PASSWORD ===> (If password protected)

MIXED MODE ===> NO (Specify YES or NO)
FORMAT NAME ===>
13.5 Browse Commands
• Cols - for displaying Columns

• Scroll up, down, left right with PF7, PF8, PF10 and PF11 respectively.
• Set Scroll amount to CRSR, HALF, PAGE, n lines, max, DATA
• Scroll by n lines, to top or bottom
• Define/LOCATE {line number}/label.
• FIND string {NEXT/PREV/FIRST/LAST/ALL}.
• PF5 for repeat find and use of “&”.
• Use of PF12 to recall last command.
• Terminate Browse with PF3 Key.
• FIND string {NEXT/PREV/FIRST/LAST/ALL} {CHAR/PREFIX/SUFFIX/WORD} col-1
col-2
• Column limitation search
• T ’text’ - for case insensitive search
• X ’hex-string’ for a hex search
13.6 Editing Datasets (Option 2)
• The Primary Editor entry is similar to that for Browse as regards concatenating datasets and
dataset selection
• Labels can be defined as in browse but may be entered as line commands
55
MVS
• Error messages may be removed by typing RESET on the command line
13.7 Standard editing commands
I/In Insert 1 or n lines.

D(n) Delete line or n lines.
DD Delete the block marked by the 2 DD line commands.
R(n) Repeat 1 or n lines.
RR Repeat the block marked by the 2 RR line commands.
C(n) Copy 1 or n lines.
CC Copy the block marked between the 2 CC line commands.
M(n) Move 1 or n lines.
MM Move the block marked between the 2 CC line commands.
A(n) Copy or Move lines 1 or n times after this line.
B(n) Copy or Move lines 1 or n times before this line.
Creating datasets and exiting editor
To create a new member specify non-existent member name in the current PDS.
You can quit the editor without saving changes by the CANCEL command.
You can update the dataset with the save command
You can exit with implicit save with the END command or PF3 key.
13.8 Edit Profiles
➢ Edit profiles control editing options

➢ Normally editing a new dataset uses the default profile - the dataset type
➢ To display the edit profile type PROFILE on the command line in the editor
➢ To remove it from the screen type RESET.
➢ This gives you a display as follows.
56
MVS
EDIT ---- MATEKD.TRG.JCL(JCL1) - 01.27 ---------------------- COLUMNS 001 072

COMMAND ===> SCROLL ===> CSR
****** ***************************** TOP OF DATA
******************************
=PROF> ....STD (FIXED - 150)....RECOVERY OFF....NUMBER ON STD..................
=PROF> ....CAPS ON....HEX OFF....NULLS ON STD....TABS ON STD....SETUNDO OFF....
=PROF> ....AUTOSAVE ON....AUTONUM OFF....AUTOLIST OFF....STATS ON..............
=PROF> ....PROFILE UNLOCK....IMACRO NONE....PACK OFF....NOTE ON................
=BNDS> <
=TABS>
=COLS> ----+----1----+----2----+----3----+----4----+----5----+----6----+----7--
000100 //MATEKDA JOB LA2719,'PARAG',NOTIFY=MATEKD,
000200 // CLASS=A,MSGCLASS=X
000300 //*
000400 //COBRUN EXEC PGM=PROG11
000500 //STEPLIB DD DSN=MATEKD.TRG.LNK,DISP=SHR
000510 //*STEPLIB DD DSN=MATEKD.TRG.COBOL2,DISP=SHR
000600 //INVMAS DD DSN=MATEKD.TRG.INVMAS,DISP=SHR
000700 //OP1 DD SYSOUT=*
000710 //*OP1 DD DSN=MATEKD.TRG.EXE7,DISP=(NEW,CATLG,CATLG),
13.9 Profile Settings
• To switch to a different profile key “profile <“profile-name”>

• To lock a profile, at the command line key “PROFILE LOCK”
• Any changes made to the locked profile are not saved permanently.
• Caps, number Pack and STATS modes are set each time you begin an edit session
• To define tab stops. Key TABS on the command line and place ‘@’ on the tabs line one
character before where you would like a tab stop. On the command line, Key TABS ON/OFF
<tab-character>
• If you omit the tabbing character hardware tabbing is assumed.
• Line control Commands
➢ Nonumber/NUM OFF turns off line numbering
➢ NUM ON turns on line numbering
➢ AUTONUM resequence line numbers on save
➢ RENUM resequence line numbers
➢ NUM ON COBOL checks for valid COBOL numbering
➢ NUM ON STD checks for standard line numbering
➢ UNNUM removes line numbering.
13.10 Edit Modes
• STATS ON/OFF Controls dataset statistics

• AUTOLIST ON/OFF Controls Automatic listing
• NULLS ON/OFF Controls if nulls or spaces are padded
57
MVS
• RECOVERY ON/OFF Recovers a dataset being edited in case of a system crash. It also
permits
• The use of the UNDO command. This works up to the last save only
• HEX ON/OFF Displays data in HEX/ASCII mode
• CAPS ON/OFF Converts Lower case letters to uppercase if set to on
➢ Line commands for this function are LC or UC. LCLC and UCUC are blocked line
commands.
• PACK ON/OFF Specifies that the data is store in compressed mode.
• AUTOSAVE ON/OFF PROMPT/NOPROMPT Auto save data when PF3 key is pressed
• IMACRO Specify initial macro to be run at startup.
13.11 Advanced Edit Options
To locate a String within another;
FIND string range NEXT/PREV/FIRST/LAST/ALL CHARS/PREFIX/SUFFIX/WORD

X/NX col-1 col-2\
Where:
Range is denoted by 2 labels

String is the string to be found
NEXT start search at current line and locate the next occurrence of the string (default).
PREV start search at current line and locate the previous occurrence of the string.
FIRST locate the first occurrence of the string
LAST locate the last occurrence of the string
ALL Same as first but count the occurrences in the file.
CHARS any occurrence of the string
PREFIX string must be at the beginning of the word
SUFFIX string must be at the end of a word
X/NX Search only excluded/Non excluded lines
col-1 col-2 starting and ending column numbers defining the search boundaries.
To Modify/Change a string with another String;
CHANGE string1 string2 range NEXT/PREV/FIRST/LAST/ALL

CHARS/PREFIX/SUFFIX/WORD X/NX col-1 col-2
String2 replaces string1
13.12 Shifting text source
<--------------Data shift----------> <---------- Column shift ----------->

< <n << ( (n ((n left shifts
> >n >> ) )n ))n right shifts
58
MVS
Data shifts
• Does not drop blank characters

• Does not combine words by drooping spaces
• Does not delete spaces within apostrophes
• COPY [member] [AFTER/BEFORE label]
• MOVE [member] [AFTER/BEFORE label]
• CREATE [member] [range]
• REPLACE [member] [range]
• Edit member-name to edit recursively
13.13 Utilities Menu
Option 3
------------------------- UTILITY SELECTION MENU ----------------------------

OPTION ===>
1 LIBRARY - Compress or print data set. Print index listing.

Print, rename, delete, browse, or edit members
2 DATASET - Allocate, rename, delete, catalog, uncatalog, or
display information of an entire data set
3 MOVE/COPY - Move, copy, or promote members or data sets
4 DSLIST - Print or display (to process) list of data set names
Print or display VTOC information
5 RESET - Reset statistics for members of ISPF library
6 HARDCOPY - Initiate hardcopy output
8 OUTLIST - Display, delete, or print held job output
9 COMMANDS - Create/change an application command table
10 CONVERT - Convert old format menus/messages to new format
11 FORMAT - Format definition for formatted data Edit/Browse
12 SUPERC - Compare data sets (Standard Dialog)
13 SUPERCE - Compare data sets and Search-for strings (Extended Dialog)
14 SEARCH-FOR - Search data sets for strings of data (Standard Dialog)
59
MVS
13.14 Library Utility
Option 3.1
---------------------------- LIBRARY UTILITY --------------------------------

OPTION ===>
blank - Display member list B - Browse member

C - Compress data set P - Print member
X - Print index listing R - Rename member
L - Print entire data set D - Delete member
I - Data set information E - Edit member
S - Data set information (short)
ISPF LIBRARY:
PROJECT ===> MATEKD
GROUP ===> TRG ===> ===> ===>
TYPE ===> JCL
MEMBER ===> (If "P", "R", "D", "B", "E" or blank selected)
NEWNAME ===> (If "R" selected)

DATA SET NAME ===>
60
MVS
13.15 Dataset Utility
Option 3.2
---------------------------- DATA SET UTILITY -------------------------------

OPTION ===> A
A - Allocate new data set C - Catalog data set
R - Rename entire data set U - Uncatalog data set
D - Delete entire data set S - Data set information (short)
blank - Data set information M - Enhanced data set allocation
ISPF LIBRARY:
PROJECT ===> MATEKD
GROUP ===> TRG
TYPE ===> JCL
DATA SET NAME ===>
VOLUME SERIAL ===> (If not cataloged, required for option "C")
13.16 New dataset allocation
Option 3.2.A
------------------------ ALLOCATE NEW DATA SET ------------------------------

COMMAND ===>
DATA SET NAME: MATEKD.TRG.JCLS
VOLUME SERIAL ===> BS3008 (Blank for authorized default volume)
GENERIC UNIT ===> (Generic group name or unit address)
SPACE UNITS ===> BLOCK (BLKS, TRKS, or CYLS)
PRIMARY QUANTITY ===> 26 (In above units)
SECONDARY QUANTITY ===> 12 (In above units)
DIRECTORY BLOCKS ===> 0 (Zero for sequential data set)
RECORD FORMAT ===> FB
RECORD LENGTH ===> 150
BLOCK SIZE ===> 1500
EXPIRATION DATE ===> (YY/MM/DD, YYYY/MM/DD
YY.DDD, YYYY.DDD in Julian form DDDD for retention period
in days or blank)
( * Only one of these fields may be specified)
61
MVS
13.17 Renaming Dataset
Option 3.2.R
---------------------------- RENAME DATA SET --------------------------------

COMMAND ===>
DATA SET NAME: MATEKD.TRG.JCL

VOLUME: BS3008
ENTER NEW NAME BELOW: (The data set will be recataloged.)
ISPF LIBRARY:
PROJECT ===> MATEKD
GROUP ===> TRG
TYPE ===> JCL

DATA SET NAME ===>
13.18 Dataset information
Option 3.2.s
-------------------------- DATA SET INFORMATION -----------------------------

COMMAND ===>
GENERAL DATA: CURRENT ALLOCATION:

Management class: MCSTANDS Allocated blocks: 26
Storage class: SCNORM Allocated extents: 1
Volume: BS3008 Maximum dir. blocks: 1
Device type: 3390
Data class:
Organization: PO CURRENT UTILIZATION:
Record format: FB Used blocks: 11
Record length: 150 Used extents: 1
Block size: 1500 Used dir. blocks: 1
1st extent blocks: 26 Number of members: 5
Secondary blocks: 12
Data set name type: PDS
Creation date: 1996/08/08

Expiration date: ***NONE***
62
MVS
13.19 Allocating Datasets
------------------------ ALLOCATE NEW DATA SET ------------------------------

COMMAND ===>
MANAGEMENT CLASS ===> MCSTANDS (Blank for default management class)

STORAGE CLASS ===> SCNORM (Blank for default storage class)
VOLUME SERIAL ===> (Blank for authorized default volume)
DATA CLASS ===> (Blank for default data class)
SPACE UNITS ===> BLOCK (BLKS, TRKS, CYLS, KB, MB or BYTES)
PRIMARY QUANTITY ===> 26 (In above units)
SECONDARY QUANTITY ===> 12 (In above units)
DIRECTORY BLOCKS ===> 1 (Zero for sequential data set) *
RECORD FORMAT ===> FB
RECORD LENGTH ===> 150
BLOCK SIZE ===> 1500
DATA SET NAME TYPE ===> PDS (LIBRARY, PDS, or blank) *
EXPIRATION DATE ===> (YY/MM/DD, YYYY/MM/DD
YY.DDD, YYYY.DDD in Julian form
DDDD for retention period in days
or blank)
(* Specifying LIBRARY may override zero directory block)
63
MVS
13.20 Move / Copy
Option 3.3
--------------------------- MOVE/COPY UTILITY -------------------------------

OPTION ===>
C - Copy data set or member(s) CP - Copy and print

M - Move data set or member(s) MP - Move and print
L - Copy and LMF lock member(s) LP - Copy, LMF lock, and print
P - LMF Promote data set or member(s) PP - LMF Promote and print
SPECIFY "FROM" DATA SET BELOW, THEN PRESS ENTER KEY
FROM ISPF LIBRARY: ------ Options C, CP, L, and LP only -------

PROJECT ===> MATEKD
GROUP ===> TRG ===> ===> ===>
TYPE ===> JCL
MEMBER ===> (Blank or pattern for member selection list,
'*' for all members)
FROM OTHER PARTITIONED OR SEQUENTIAL DATA SET:

DATA SET NAME ===>
64
MVS
13.21 Move / Copy- 2
COPY --- FROM MATEKD.TRG.JCL -------------------------------------------------

COMMAND ===>
SPECIFY "TO" DATA SET BELOW.
TO ISPF LIBRARY:
PROJECT ===> MATEKD
GROUP ===> TRG
TYPE ===> JCL
TO OTHER PARTITIONED OR SEQUENTIAL DATA SET:

DATA SET NAME ===>
"TO" DATA SET OPTIONS:

IF PARTITIONED, REPLACE LIKE-NAMED MEMBERS ===> YES (YES or NO)
IF SEQUENTIAL, "TO" DATA SET DISPOSITION ===> OLD (OLD or MOD)
SPECIFY PACK OPTION FOR "TO" DATA SET ===> (YES, NO or blank)
65
MVS
13.22 DSLIST Utility
Option 3.4
--------------------------- DATA SET LIST UTILITY -----------------------------

OPTION ===>
blank - Display data set list * P - Print data set list

V - Display VTOC information only PV - Print VTOC information only
Enter one or both of the parameters below:

DSNAME LEVEL ===> MATEKD.TRG.*
VOLUME ===>
INITIAL DISPLAY VIEW ===> VOLUME (VOLUME,SPACE,ATTRIB,TOTAL)

CONFIRM DELETE REQUEST ===> YES (YES or NO)
* The following line commands will be available when the list is displayed:
B - Browse data set C - Catalog data set F - Free unused space

E - Edit data set U - Uncatalog data set = - Repeat last command
D - Delete data set P - Print data set
R - Rename data set X - Print index listing
I - Data set information M - Display member list
S - Information (short) Z - Compress data set TSO cmd, CLIST or REXX exec
13.23 DSLIST Dataset Selection
DSLIST - DATA SETS BEGINNING WITH MATEKD.TRG.* ----------------- ROW 1 OF 23

COMMAND ===> SCROLL ===> PAGE
COMMAND NAME MESSAGE VOLUME

-------------------------------------------------------------------------------
MATEKD.TRG.ACCOUNT MIGRAT
MATEKD.TRG.BADCOBOL MIGRAT
MATEKD.TRG.COBOL MIGRAT
MATEKD.TRG.COBOL1 MIGRAT
m MATEKD.TRG..JC BS3008
MATEKD.TRG.LNK MIGRAT
66
MVS
13.24 DSLIST Commands
M - Member list
C - Catalog a dataset
D - Delete a dataset
E - Edit a dataset
F - Free unused dataspace in a dataset
I - Display information for a dataset
M - Display a memberlist
P - Print a dataset
R - Rename a dataset
S - Display a shortened version of dataset information
U - Uncatalog a dataset
X - Print a dataset indexed listing
Z - Compress a dataset
= - Repeat the last command
13.25 Primary Commands
LOCATE To locate a dataset

TSO SUBMIT To execute Clists from the command line
SHOWCMD ON/OFF To show the expanded form of the command
CONFIRM ON/OFF Same as Confirm delete request Yes/NO on the delete panel
SORT Sorts the dataset list based on the fields shown on the next transparency
FIND Finds occurrence of a string with the list of datasets
SAVE dataset-name Saves the current dataset list into the dataset name specified
SELECT pattern [line command] To make a selection of datasets to be acted upon determined
by the line command
67
MVS
13.26 Reset
Option 3.5
-------------------------- RESET ISPF STATISTICS ----------------------------

OPTION ===>
R - Reset (create/update) ISPF statistics

D - Delete ISPF statistics
NEW USERID ===> (If userid is to be changed)

NEW VERSION NUMBER ===> (If version number is to be changed)
RESET MOD LEVEL ===> YES (YES or NO)
RESET SEQ NUMBERS ===> YES (YES or NO)
ISPF LIBRARY:
PROJECT ===> MATEKD
GROUP ===> TRG
TYPE ===> JCL
MEMBER ===> (Blank or pattern for member selection
list, '*' for all members)
OTHER PARTITIONED DATA SET:

DATA SET NAME ===>
68
MVS
14. Appendix – A (Bibliography/References)

MVS JCL By Doug Lowe
OS/VS2 MVS OVERVIEW By IBM
THE MVS PRIMER By David Shelby Kirk
EXPERT MVS/XA JCL By Caranthsis Mani
MVS JCL,2/ED. By Doug Lowe
69

V1 MVS

Uploaded by

Copyright:

Available Formats

V1 MVS

Uploaded by

Document Information

Original Description:

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

V1 MVS

Uploaded by

Copyright:

Available Formats

VERSION 1.

2. OPERATING SYSTEM CONCEPTS .................................................................................................................... 3

2.1 OPERATING SYSTEM – IMPORTANCE AND NEED ........................................................................................... 3

3.1 KEY CONCEPTS AND TERMINOLOGY ............................................................................................................ 4

5. IBM OPERATING SYSTEMS .............................................................................................................................. 10

5.1 IBM FAMILIES OF OPERATING SYSTEMS .................................................................................................... 10

6.1 CACHE MEMORY ........................................................................................................................................ 20

7.1 A SMALL MAINFRAME CONFIGURATION .................................................................................................... 24

8.1 TYPES OF DATA .......................................................................................................................................... 31

9.1 HOW DATASETS ARE ACCESSED?................................................................................................................ 37

10.1 WHAT IS A JOB? ..................................................................................................................................... 38

12. MVS TOOLS OVERVIEW ................................................................................................................................. 44

12.1 JOB MANAGEMENT TOOLS..................................................................................................................... 44

13.1 PRIMARY OPTIONS MENU ...................................................................................................................... 52

13.8 EDIT PROFILES ....................................................................................................................................... 56

Day 1 and Day 2.

Computing Environment -Key Concepts & terminology, Typical IBM MF site.

2. Operating System Concepts

2.2 Position of OS in a system

The main functions of the Operating System are:

• Command Issue Mode

On-line Mode - Using Terminal

• Command Execution Mode

Foreground - Terminal is locked while the command is being executed

3.2 Data Processing

How Business applications are executed

• First come first served?

➢ Each user / function is assigned a priority level

Time Sharing typically refers to sharing of resources in an interactive processing mode.

➢ The program has CPU based and Non-CPU based instructions

• How does it Work?

➢ Multiple programs are kept “ready” for execution

➢ On completion of I/O the program again becomes “ready” for execution

3.4 Multi-Programming Overheads

➢ Program Queue Management

It is critical to determine optimum level of Multi-programming to maintain certain service level.

3.5 Relevance of Multi-programming

• Multi-programming is applicable even for single user system

• There are multiple CPUs (processors) in one machine

➢ Multiple programs may need same printer at the same time

➢ Output to printer is intercepted and written to a disk i.e. “spooled”

3.8 Virtual Storage

Why Virtual Storage?

What is Virtual Storage?

➢ Technique to simulate large amount of main storage

How Virtual Storage is implemented?

➢ Program executable code is generated assuming virtual storage size

Advantages of Virtual Storage

➢ Main memory can be shared by multiple programs

Overheads of Virtual Storage

3.9 Memory Management

1. Real Memory implementation:

➢ Code and data are in real memory

2. Virtual memory implementation:

Advantage: code and data size independent of the real memory

4. Characteristics Features Of MVS

2) MULTIPROGRAMMING: Multiprogramming simply reclaims the CPU during idle periods

3) SPOOLING: To provide shared access to printer devices.

5. IBM Operating Systems