• Aucun résultat trouvé

IBM System/3 Model 15 User's Guide to Spooling

N/A
N/A
Protected

Academic year: 2022

Partager "IBM System/3 Model 15 User's Guide to Spooling"

Copied!
124
0
0

Texte intégral

(1)
(2)
(3)

IBM System/3 Model 15

User's Guide to Spooling

GC21-7632-5 File No. 53-30

a a a a a a a a

a a a a a a a a

a a a a a a a a a a a a a a a a a a a o a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a

a a a a a a a a

a a a a a a o a

a o a a a a a a

a a a a a a a a

a a a a a a a a a a a a a a a a a a a a a o a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a o a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a o a a a a a a a a a a a a a a a a a

a a a a a a a a a a a a a a a o a a a a a a a a a a a a a a a a a a a o

a a a a a a a a

a a a a o a a a

a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a o a a a a a a a a a a

a a a a a a a a a a a a a a a a a a a a a a

a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a o a a a a a a a a a a a a a a a a a a a a a a a a a a a

a a a a a a a a

a a a a a a a a

a o a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a

a a a a a a a a a a a a

a a a i t a a a a a a a a

a a a a a a a a a a a a

a a a a a a a a a a a a a a a o a a a a a a a a a a a a a a o a a a a a a a a a a a a a a a a a a o a

a a a a a a a a a a a a a a a a a a

a a a a a a a o o a a o a a a a a a a a a a a a

a a a a a a a a

a a o a a a a a

a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a

o a a a a a a a

a a a a a a a a

a a a a a a a a a a a a a a a a a a a a o a a a a a a a a a a

a a a a a a a a a a a a a

a a a a a a a a a a o a a a a a a a a a a a a a a a a a a a a a a

a a a a a a a a a a a a a a o a a a a a a a

a a a a a a a a a o a a a a a a . a a a a a a a a a a a a a a o a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a o a a a o a a a a a a a a a a a a a

o a o a a a a a

a a a a a a a a

a a a a a a a a a a

a a a a a a a a a a a

a a a a a a a a a a a a

a a a a a a a a a a a a a

a a a a a a a a a a a a a a a a a a a a a a o a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a o a o a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a

a a a a a a a a a a a a a a a a a a a a a a a a a a a

a a a a a a a a a a a a a a

a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a

a a a a a

a a a a a

a a a a a

a a a a a a a a a a a a a a a a a a a a a a a

(4)

Preface

T h i s p u b l i c a t i o n i s d e s i g n e d a s a t u t o r i a l a i d fo r I B M S y s - l n o r d e r to u n d e r s t a n d t h e t e x t . th e r e a d e r m u s t b e fa m i l i a r t e m / 3 M o d e l 1 5 s y s t e m o p e r a t o r s ; i t c a n a l s o b e u s e d a s a w i t h t h e o p e r a t i o n o f t h e S y s t e m / 3 M o d e l 1 5 o r w i t h a reference manual for spooling siupport. In general, the pro- System/3 Model 10 Disk System. tBM System/3 Modet l5 g r a m m e r o r a n a l y s t d o e s n o t n e e d t o b e c o n c e r n e d w i t h l n t r o d u c t i o n , G C 2 1 - 5 0 9 4 , d e s c r i b e s M o d e l l 5 c o n c e p t s . s p o o l i n g f u n c t i o n s a n d o p e r a t i o n s ; h o w e v e r , w i t h a n u n d e r - O t h e r re l a t e d p u b l i c a t i o n s a r e :

s t a n d i n g o f s p o o l i n g , h e o r s h e c a n a l t e r t h e a p p l i c a t i o n t o

achieve optimal results. . tBM System/3 Model 15 Operator's Guide, GC21-5075

These topics are described in tl'ris publication: . tBM System/3 Modet l5 System Control programming Reference Manual . GC21-5077 (for 5704-SC1) . S p o o l i n g c o n c e p t s

. l8M System/3 Model l5 System Control Programming

o Processing with spooling Conceptsand Reference Manual , GC21-5162 (for

5704-SC2) o P r o c e s s i n g w i t h o u t s p o o l i n g

. IBM System/3 Model l5 System Generation Reference o The relationship of spooling to other system facilities Manual . GC2l-7616

o OCC (operator control commands) used with spooling o IBM System/3 Modet l5 System Messages, GC21-b076 o S p o o l i n g im p l i c a t i o n s fo r O C L ( o p e r a t i o n c o n t r o l

language)

o S p o o l i n g p e r f o r m a n c e o S p o o l i n g p r o b l e m s i t u a t i o n s

. IBM System/3 Model 1 5 3340 Direct Access Storage Facility Reference Manual , GC21-51 1 1

o l8M System/3 3741 Reference Manual , GC21-5113

I

I o tBM System/3 Model 15 Master Index,GC2|-52O2

I

Sixth Edition (September 1979)

T h i s i s a m a j o r r e v i s i o n o f , a n d o b s o l e t e s , G C 2 1 - 7 6 3 2 - 4 a n d t e c h n i c a l n e w s l e t t e r G N 2 1 - 5 6 3 3 . C h a n g e s o r a d d i t i o n s t o t h e t e x t a n d i l l u s t r a t i o n s a r e i n d i c a t e d b y a v e r t i c a l l i n e t o t h e l e f t o f t h e c h a n g e o r a d c l i t i o n .

T h i s e d i t i o n a p p l i e s to v e r s i o n 0 7 , modification 0O of the IBM System/3 Model 15 S y s t e m C o n t r o l P r o g r a m 5 7 0 4 - S C l; to version 04, modification 00 of the IBM System/3 M o d e l 1 5 S y s t e m C o n t r o l P r o g r a m 5 7 O 4 - S C 2 ; a n d t o a l l s u b s e q u e n t v e r s i o n s a n d m o d i { i c a t i o n s u n t i l o t h e r w i s e in d i c a t e d in new editions or technical newsletters.

C h a n g e s a r e p e r i o d i c a l l y m a d e t o t h e i n f o r m a t i o n h e r e i n ; changes w i l l b e r e p o r t e d i n t e c h n i c a l n e w s l e t t e r s o r i n n e w e d i t i o n s o f t h i s o u b l i c a t i o n .

Use this publication only for the purposes stated in the Preface.

P u b l i c a t i o n s a r e n o t s t o c k e d a t t h e a d d r e s s b e l o w . R e q u e s t s f o r c o p i e s o f I B M p u b l i c a t i o n s and for technical information about the system should be made to your I B M r e p r e s e n t a t i v e o r t o t h e b r a n c h o f f i c e s e r v i n g y o u r locality,

T h i s p u b l i c a t i o n c o u l d c o n t a i n t e c h n i c a l inaccuracies o r t y p o g r a p h i c a l e r r o r s . A d d r e s s y o u r comments about this publication to IBM Corporation, publications, Department 245, R o c h e s t e r , M i n n e s o t a 5 5 9 0 1 . I B M m a y u s e and distribute any of the information you s u p p l y i n a n y w a y i t b e l i e v e s a p p r o p r i a t e w i t h o u t i n c u r r i n g a n y o b l i g a t i o n w h a t e v e r . y o u m a y , o f c o u r s e , c o n t i n u e t o u s e the information you supply.

@ f n t e r n a t i o n a l B u s i n e s s M a c h i n e s C o r p o r a t i o n 1 9 7 4 , 1 9 7 5 , 1 9 7 6 , 1 g 7 j , 1 g 7 8 , 1 g 7 g

(5)

Contents

C H A P T E R 1 . I N T R O D U C T I O N L e v e l s o f S u p p o r t

C o n c e p t s o f S p o o i O p e r a t i o n A d v a n r a - c r e s o { S p o o l i n g . U s e r C o n t r o l

C H A P T E B 2 . P F O C E S S I N G W I T H S P O O L I N G G e n e r a t i n g a S p o o l i n g S y s t e m .

I P L

R e a t l i n g ( l n p u t S p o o l i n g ) J o b S t r e a m

R e a d e r O u e u e E x e c u t i n g J c b s

l d e n t i l i c a t i o n o n t h e O u e u e D e v i c e C o n l e i t t i o n

C o n : ; i d e r a t i o n s O p e r a t o r C o n t r o l P r i n ti n g

D E F E R O p t i o n S p o o l F i l e S e c u r i r y G r o u p i n q J o b S t e p s . R e s t a r t i n g t h e P r i n t W r i t e r . C l r a n g i n g F o r m s .

S t a r t i n g t h e P r i n t W r i t e r U s i n g a F o r m s T y p e F o r m s A l i q n m e n t

l \ , l u l r i p l e C o p i e s

C h a n g i n g t h e P r i n t C h a i n / T r a i n E r r o r C o ; r r i i l i o r r s .

O p e r a i o r C o n t r o l

D i s p l a y i n g t h e C u r r e n t P r i n t e d P a g e C o u n t P r r n t r n g t h e L a s l P a g e s F i r s t

S k i 1 . : p i r r g B a c k S e v e r a l P a g e s P u n c h r n g

I J E F E R O p t i o n S p o o l F r l e S e c u r i t y R B s t d r l r l g t t r e P u r r c l r W r i t e r R e a d r r r g a n d P u r r c t t i n g C h a n q i n q C a r d I y p e s M u l t i p l e C o p r 0 s E r r o r C o n d i t i o n s

O p e r a t o r C o n t r o l o f P u n c h S p o o l i n g

C H A P T E R 3 . P R O C E S S I N G W I T H O U T S P O O L I N G C H A P T E R 4 . P R O C E S S I N G W I T H O T H E R S Y S T E M

F A C I L I T I E S C h e c k p o i n t / R e s t a r t . R o ll o u t / R o i l i n

C H A P T E R 5 . O P E R A T O R C O N T R O L C O M M A N D S F O R S P O O L I N G

C A N C E L . F u n c t i o n s F o r m a t C o n te n ts C o n s i d e ra t i o n s C H A N G T C a r c l T y p e

F u n c t i o n F o r m a t C o n te n ts C o n s i d e r a l i o n s

C H A N G F C o p i e s F u n c t i o n F o r m a t C o n te n ts C o n s i d e r a t i o n s C H A N G E C o r e

F u n c t i o n F o r m a t Con ter'lts C o n s i d e r a t i o n s C H A N G E F o r m s T y p e

F u n c t i o n F o r m a t C o n te n ts C o n s i d e r a t i o n s C H A N G E P a r t i t i o n

F u n c t i o n F o r m a t C o n te n t s C o n s i d e r a t i o n s C H A N G E P r i o r i t y

F u n c t i o n s F c J r m a t C o n te n t s C o n s i d e r a t i o n s D I S P L A Y

F u n c l i o n s F o r n r a t C o n t e n t s C o n s i d e r a t i o n s H I P T Y

F u n c l i o n F o r m a t , C o n t e n t s C o n s i d e r a t i o n s H O L D

F r t n c t i o n s F o r m a t C o n te n ts C o n s i d e r a t i o n s K E E P

F u n c t i o n

t - z

1 - 3

t - J t - J

z - l z - |

2-4

z - c

2-5

l - o

2 . 1 0 2 - 1 0

l - t 3

2-13

a l A

2 . 1 5 2 - 1 6

z - t o z - t o z - t o

2 , 1 7 2 - 1 7 2 . 1 8 2 - 1 A 2 , 1 9

z - z I z - 1 |

t - z I

2-22

') -t', z ' z J

2.23

z - z J z - 1 4

J - l

4 - 1 4 . 1 4-2

5 - 1 5-2 5 . 2 5-2

3 1

5 - 3 5-4 5,4 5,4

. ; - 4 F A

C o n t e n t s F orfilat

5-5 5-5 5-5 5-5 5-5 5-6 5-6 5-6 5-6 5-6 5-7 5-7 5-7 5-7 5-7 5-8 5-8 5-8 5-8 5-8 5-9 5-9 5-9 5-9 5-1 0 5-1 1 5-1 1 5 - 1 1 5-'t 1 5 - 1 5 5-17 5-17 5-17 5-17 5-17 5 - 1 8 5 - 1 8 5-'l8 5 - 1 8 5 - 1 8 5 - 1 9 5 - 1 9

$ 1 9 5 - 1 9 5 - 1 9 5-20 5-20 5-20 +20 5-20 5-21 5-21 5-2'l 5-21 5-21 5-22 5-22 5-22 5-22 5-22 C c n s i d e ra t i o n s

P T Y F u n c t i o n F o r m a t C o n t e n t s C o n s i d e r a t i o n s R E A D E R ,

F u n c t i o n F o r m a t C o n t e n t s C o n s i d r - ' r a t i o n s R E L . E A S E

F u n c t i o n s [: ormat (--ontents C o n s i d e r a t i o n s

(6)

R E S T A R T F u n c r i o n s F o r r n a I C o n t e n t s C o n s r d c r a l io n s R E U S E

F u n L t r ( r l ) F o r n r a t C o n | ( ' n i s C o n s r d e r a t t o n s S T A R T

F u n c t r o n s . F o r m a i C o n te n ts C o n s r d e r a I io n s S T O P ,

F u n c l i o n s F o r m a t C o n te n t s C o n s i d e r a t i o n s

C H A P T E R 6 . O C L C O N S I T I E R A T I O N S . A S S I G N

F u n c t i o n P l a c c m e n t F o r m a t F x a m p l e J O B

5-23

c - z s

s-23 5-23 s-23 5-24 5-24 5-24 5-24 5-24 5-25 5-25 5-25 s-25 5-26 5-27 5-21 5-27 5-27 5-28 6 - 1

b - l

6 - 1

tr- I

6 - 1 6 - 1 6-2

b - 2

6-2 6-2 6-2 6-3 64 6-4 6-4 64 6-4 6-5 6€

6-6 6€

6€

6 €

b - /

6-8 6-8 6-8 6-8

b - 6

6-8 6-9 6-9 6-9 6-9 6 9 6-9

C H A P T E R 7 . P E R F O R M A N C E P e r i o r m a n c e F a c t o r s

S y s t e m C o n s i d e r a r i o n s A p p l i c a t i o n C o n s r d e r a r r o n s . U s e r P r o g r a m C o n s i d e r a t i o n s O p e r a t i o n a l C o n s i d e r a r i o n s .

C H A P T E R 8 . P R O B L E M S I T U A T I O N S . S p o o l F i l e l s F u l l

P e r m a n e n t D i s k E r r o r s D e v i c e F a i l u r e s L o s t J o b s o r J o b S t e p s

C H A P T E R 9 . S E C O N D 1 4 0 3 P R I N T E R O p e r a t o r C o n t r o l Commanos

O p e r a t r o n a l C o n s i d e r a t i o n s P r i n t O u e u e D i s p l a y . M a i n S t o r a g e R e q u i r e m e n t s

A P P E N D I X A . F O R M A T O F T H E O U E U E S A P P E N D I X B . M A I N S T O R A G E R E O U I R E M E N T S A P P E N D I X C . S I Z E O F S P O O L A R E A .

A P P E N D I X D . S I Z E O F T R A C K G R O U P S . A P P E N D I X E . S P O O L M E S S A G E S

A P P E N D I X F . O P E R A T O R C O N T B O L C O M M A N D S ( O C C } S U M M A R Y ,

I n f o r m a t i o n A b o u t S y n t a x l l l u s t r a t i o n s O C C L i s t

G L O S S A R Y I N D E X

7 . 1 7 . 1 7 . 1 7 - 1

7 _ ? t - J

8 - 1 8 - 1 8 - 1 8 - 1 8 - 1 9-1 9 - 1 9 , 1 9,2 9-2 A - 1 B - 1 c - 1 D - 1 E . 1

F - 1

r - l r - I

u l

x - 1

F u n c i l o n P la c e m e n t F o r m a t C o n t e n t s C o n s id e ra t io n s P R I N T E R

F u n c t i o r r s . P la c e m e n t F o r m a t C o n t e n t s C o n s i d e r a t i o n s P U N C H

F u n c t i o n s . P l a c e m e n t F o r m a r C o n te n ts C o n s i r l e r a t io n s R E A D E R

F u n c t i o n P l a c e m e n i F o r n r a t C o n te n ts C o n s i d e r a t i o n s F u n c t i o n s . [ ' l a c e m e n t F o r m a t C o r r t e n t C o n s i d e r a t io n s

(7)

S p o o l i n g is a n o p t i o n a l f a c i l i t y o f t h e s y s t e m c o n t r o l p r o - g r a m s ( P r o g r a m N u m b e r s 5 7 0 4 - S C 1 a n d 5 7 0 4 - S C 2 ) fo r S y s t e m / 3 M o d e l 1 5 .

I n a d d i t i o n t o t h e m i n i m u m s y s t e n l c o n { i g u r a t i o n t o r S y s t e m C o n t r o l P r o g r a m 5 7 0 4 S C 1 , s p o o l r e q u i r e s 5 4 4 5 D i s k S t o r a g e M o d e l 1 ,2 , o r 3 w h e n u s i n g a S y s t e m / 3 M o d e l 1 5 A . F o r i n f o r n r a t r o n c o n c e r n i n g t h e m i n r m u m s y s t e m c o n f i g u r a t i o n s f o r t h e s y s t e m c o n t r o l p r o g r a m s ( 5 7 0 4 S C 1 a n d 5 7 0 4 - S C 2 ) , s e e o n e o f t h e f o l l o w i n g p u b l i c a t i o n s :

. IBM System/3 Model l5 System Generation Reference M a n u a l . c C 2 1 7 6 1 6

. IBM System/3 Model lS lntroduction, cC21-5094 A l t h o u g h p a r t i t i o n 3 ( P 3 ) a n c l 3 3 4 4 D i r e c t A c c : e s s S t o r a g e a r e d i s c u s s e d t h r o u g h o u t t h i s m a n u a l , th e y a r e s u p p o r t e d o n l y b y S y s t e m C o n t r o i P r o g r a m 5 7 0 4 S C 2 .

A c o m p a r i s o r r o f p o s s i b l e d i s k s to r t h e s p o o l f i l e i s q i v e r r i n F i g u r e 1 - 1 .

5704 S;a:2i; i 04 sc2

L , 3 , D 4 , D 3 1 . D 3 2 , D 3 3 , D 3 4 , D 4 1 , D 4 2 , t)43. D44 1 8 6

F i g u r e 1 - 1 . C o m p a r i s o n o f P o s s i b l e D i s k s f o r t h e S p o o l F i l e

W i t h 5 7 0 4 S C 2 , th e s p o o l f i l e c o p v p r o g r a m ( S O C O P Y ) c a n b e u s e d to c o p y e n t r i e s t o a n d f r o m t h e s p o o ! q u e u e s . R e f e r to the IBM Systent/3 Model l5 Sy.sten Control Programming Concepts and Reference Manttal , GC21 5162, for infornration a b o u t $ O C O P Y .

C h a p t e r 1 . I n t r o d u c t i o n

When directly attached to the Model 15, the 3741 Data S t a t i o n M o d e l 1 o t 2 o t 3 7 4 1 P r o g r a m m a b l e W o r k S t a t i o n M o d e l 3 o r 4 c a n b e u s e d a s t h e s o o o l e d in o u t d e v i c e . W h e n th i s o p t i o n i s s e l e c t e d , 1 - t h r o u g h 1 2 8 - b y t e re c o r d s c a n b e r e a d . S p o o l i n g w i l l t r u n c a t e ( o n t h e r i g h t ) o r p a d w i t h b l a n k s ( o n t h e r i g h t ) t h e 3 7 4 1 r e c o r d s t o f i t t h e u s e r p r o g r a m ' s r e q u e s t e d l e n g t h . I n t h i s p u b l i c a t i o n , re f e r e n c e s t o c a r d i n p u t a l s o a p p l y t o i n p u t f r o m t h e d i r e c t l y a t t a c h e d 3 7 4 1 .

I t i s p o s s i b l e t o s p o o l u n i t - r e c o r d d e v i c e s u s e d in a p r o g r a m p a r t i t i o n t h a t i s p e r f o r m i n g te l e p r o c e s s i n g o p e r a t i o n s . l t i s n o t p o s s i b l e t o s p o o l r e a d e r s , p u n c h e s , o r p r i n t e r s a t t a c h e d t o t e r m i n a l s t h a t a r e c o n n e c t e d t o t h e s y s t e m u s i n g th e b i n a r y s y n c h r o n o u s c o m m u n i c a t i o n s a d a p t e r , m u l t i p l e l i n e t e r m i n a l a d a p t e r , o r l o c a l c o m m u n i c a t i o n s a d a p t e r . T h e I B M S y s t e m i 3 M o d e l 1 5 i s a t w o - o r t h r e e - p a r t i t i o n m u l t i p r o g r a m m i n g s y s t e m . ( S C P 5 7 0 4 - S C 1 s u p p o r t s t w o p a r t i t i o n s ; S C P 5 7 0 4 - S C 2 s u p p o r t s t h r e e p a r t i t i o n s . ) S p o o l i n g , a n o p t i o n a l f a c i l i t y o f t h e s y s t e m c o n t r o l p r o - g r a m , c a n i m p r o v e th e t h r o u g h p u t o f a n a p p l i c a t i o n . S y s t e m / 3 M o d e l I 5 o f f e r s a v a r i e t y o f o p e r a t i n g e n v i r o n - m e n t s :

O n e - , tw o - . o r t h r e e - b a t c h p a r t i t i o n s , e a c h w i t h o r w i t h o u t s p o o l i n g

C o m b i n a t i o n s o f b a t c h a n d c o m m u n i c a t i o n s , e a c h w i t h o r w i t h o u t s p o o l i n g

S p o o l i n g s u p p o r t f o r t h e M o d e l 1 5 f a c i l i t a t e s h a n d l i n g u n i t - r e c o r d i n p u t a n d o u t p u t a t d i s k l / O s p e e d , t h e r e b y i n c r e a s i n g t o t a l s y s t e m th r o u g h p u t .

W i t h s p o o l i n g , a j o b i s s t o r e d o n d i s k . W h e n t h e p r o c e s s i n g u n i t b e c o m e s a v a i l a b l e , t h e j o b i s t r a n s f e r r e d f r o m d i s k t o a p r o g r a m p a r t i t i o n . A s t h e j o b e x e c u t e s , i t s p r i n t e d a n d / o r p u n c h e d o u t p u t i s s t o r e d o n d i s k . U p o n o p e r a t o r r e q u e s t , t h e o u t p u t m a y b e p r i n t e d a n d / o r p u n c h e d w h i l e o t h e r i o b s a r e e x e c u t i n g ; t h u s , t h e j o b e x e c u t e s w i t h o u t h a v i n g to w a i t f o r t h e s l o w u n i t - r e c o r d d e v i c e s .

a

D 1 , D 2 , D 3 D 3 1 D 4 D 4 1 S p o o l F i l e D i s k T y p e s

3 3 4 0 M a i n D a t a A r e a

3 3 4 4 M a i n D a t a A r e a S y s t e m C o n t r o l

P r o g r a n t N u n r i r i : r P o s s r b l c U n r l Cocles

M a x i r n u r l S i z i , r n C y l i n d e r s

D 1 , D 2 D 3 , D 4

5 / 0 4 S r l 1

D 1 , D 2 D 3 , D 4

I n t r o d u c t i o n 1 -1

(8)

Whenever a spooled reader, card punch, or printer becomes The following unit-record devices can be spooled:

i n o p e r a t i v e , t h e s y s t e m c o n t i n u e s p r o c e s s i n g j o b s a l r e a d y

o n d i s k . W h e n t h e l / O u n i t b e c o m e s o p e r a t i v e a g a i n , o 5 4 2 4 M F C U r e a d i n g . p u n c h i n g , o r p r i n t i n g c o n t i n u e s w i t h o u t a l o s s o f

o u t p u t o r p r o c e s s i n g t i m e . o 2 5 6 0 M F C M

W i t h s p o o l i n g . p r o g r a m s c a n b e r u n i n d i f f e r e n t p a r t i t i o n s . 1 4 4 2 C a r d R e a d p u n c h without the need for separate unit-record devices for each

partition. The printer, for example. can be used by multiple o Directly attached 3741 Data Station/programmable Work

p a r t i t i o n s if i t i s b e i n g s e r v i c e d b y t h e s p o o l i n g fu n c t i o n . S t a t i o n ( i n p u t o n l y )

Performance of a spooling system varies widely. In some . 2501 Card Reader

cases, such as applications with short programs or with

s m a l l a m o u n t s o f u n i t - r e c o r d ll O , s p o o l i n g m a y o f f e r l i t t l e o 1 4 0 3 P r i n t e r o r n o a d v a n t a g e . In o t h e r c a s e s . s u c h a s th o s e in w h i c h

unit-record device contention is a problem, spooling can The combination of devices that can be used with the

p r o v i d e s u b s t a n t i a l b e n e f i t s in o v e r a l l a p p l i c a t i o n d i f f e r e n t le v e l s o f s p o o l i n g s u p p o r t is s h o w n i n F i g u r e 1 - 2 .

throughput. The user also chooses the program partitions to be supported

by spooling: partition 1 only, partition 2 only, partition 3 o n l y , o r a n y c o m b i n a t i o n o f p a r t i t i o n s .

L E V E L S O F S U P P C I R T

This publication assumes that you have selected input, A u s e r n e e d n o t s p o o l a l l u n i t - r e c o r d l/ O a c t i v i t y ; d u r i n g p r i n t , a n d p u n c h s p o o l i n g .

s y s t e m g e n e r a t i o n , o , n e o f t h e f o l l o w i n g f o u r l e v e l s o f l / O support can be selected:

. P r i n t s p o o l i n g

. P r i n t a n d p u n c h s r p o o l i n g o I n p u t a n d p r i n t s 1 : o o l i n g . I n p u t , p r i n t , a n d p u n c h s p o o l i n g

L E V E L O F S U P P O R T

P r i n t P r i n t/ P u n c h I nput/Print I nput/Print/Punch

P r i n t e r 1 403 X X X X X X X X X X X X X X X X X X X

P u n c h D e v i c e

M F C U X X X X X

M F C M X X X X

14/.2 X X X X X

I nput Device

M F C U X X X

M F C M X X

1442 X X X

2501 X X X X

3741 X X X X

F i g u r e 1 - 2 . C o m b i n a t i o n o f D e v i c e s A v a i l a b l e fo r D i f f e r e n t L e v e l s o f S p o o l i n g S u p p o r t

(9)

C O N C E P T S O F S P O O L O P E R A T T O N

To handle a system's unit-record l/O without depending on l/O device speeds, spooling support utilizes disk space on 5445 Disk Storage or on the main data area of a 3340 Direct Access Storage Facility or 3344 Direct Access Storage as i n t e r m e d i a t e s t o r a g e f o r a r e a s k n o w n a s q u e u e s (s e e F i g u r e 1 - 3 ) . n s j o b s t r e a m s ( i n c l u d i n g o p e r a t i o n c o n t r o l l a n g u a g e s t a t e m e n t s , p r o g r a m s . a n d d a t a ) f o r t h e i n d i v i d u a l p a r t i - tions are read, a spooling routine stores each job in the r e a d e r q u e u e ; th i s r o u t i n e i s c a l l e d th e r e a d e r .

After a job has been completely read and stored in the read- e r q u e u e , it i s r e a d y to b e t r a n s f e r r e d t o t h e a p p r o p r i a t e p a r t i t i o n f o r e x e c u t i o n . A l l r e c o r d s a p p e a r to t h e p a r t i t i o n a s th o u g h t h e y w e r e ju s t r e a d fr o m t h e p h y s i c a l in p u t d e v i c e . W h e n a l l j o b s t e p s in t h e j o b h a v e b e e n e x e c u t e d , th e s p o o l - i n g s u p p o r t r e m o v e s t h e j o b f r o m t h e r e a d e r q u e u e . P r i n t e d a n d p u n c h e d o u t p u t i s a l s o s t o r e d te m p o r a r i l y o n d i s k i n q u e u e s . S p o o l i n g ro u t i n e s c a l l e d th e p r i n t w r i t e r a n d p u n c h w r i t e r e n a b l e p r i n t i n g a n d / o r p u n c h i n g o f t h e d a t a i n t h e p r i n t q u e u e a n d p u n c h q u e u e u p o n o p e r a t o r r e q u e s t (s e e F i g u r e s 1 - 4 a n d 1 - 5 ) .

A D V A N T A G E S O F S P O O L I N G

T h e p r e c e d i n g c o n c e p t s o f s p o o l i n g o p e r a t i o n p o i n t o u t these advantages of spool support:

a A s y n c h r o n o u s o p e r a t i o n o l m p r o v e d s y s t e m p e r f o r m a n c e o R e d u c e d d e v i c e c o n t e n t i o n

Asynchronous operation. Reading the input records from t h e s p o o l e d r e a d e r t o d i s k , p r i n t i n g t h e s p o o l e d p r i n t r e - c o r d s o n t h e p r i n t e r , a n d p u n c h i n g th e s p o o l e d p u n c h r e c o r d s o n t h e c a r d p u n c h a r e f u n c t i o n s o f s p o o l i n g th a t o c c u r i n d e p e n d e n t l y o f p r o g r a m s e x e c u t i n g in t h e p a r t i t i o n s . lmproved system performance. The execution time of any one job is likely to be decreased because unit-record oper- a t i o n s a r e p e r f o r m e d a t d i s k l / O s p e e d s . S p o o l i n g w r i t e s b l o c k e d i n p u t a n d o u t p u t r e c o r d s o n d i s k , f u r t h e r I n c r e a s - i n g s y s t e m th r o u g h p u t b e c a u s e t h e n u m b e r o f d i s k l / O o p e r a t i o n s i s l e s s t h a n t h e e q u i v a l e n t n u m b e r o f u n i t - r e c o r d o o e r a t i o n s ,

Reduced device contenfiol,. Because more than one oarti- t i o n c a n r e f e r e n c e t h e s a m e d e v i c e a t t h e s a m e ti m e , o n e partition does not have to wait for the other partitions to f r e e t h e d e v i c e .

U S E R C O N T R O L

E x e c u t i o n o f t h e s p o o l i n g f u n c t i o n i s c o n t r o l l e d m a i n l y b y the system operator through OCC (operator control com- mands) but also by the system programmer through OCL ( o p e r a t i o n c o n t r o l la n g u a g e ) .

The operator controls system spooling activity by entering, t h r o u g h t h e C R T / k e y b o a r d , O C C t o m o n i t o r , c o n t r o l , a n d communicate with the spooling routines. Through operator control, the spooled reader and output writers can start a n d s t o p in d e p e n d e n t o f p r o g r a m e x e c u t i o n . F o r e x a m p l e , the operator can hold job input in the reader queue for execution at a later time, allowing jobs that need more e x e c u t i o n t i m e to b e h e l d u n t i l t h e s y s t e m i s le s s o c c u p i e d . Or, the operator can hold iob output in the punch and p r i n t q u e u e s u n t i l it i s c o n v e n i e n t t o p u n c h o r p r i n t it . The system programmer can make efficient use of the sys- t e m in d e f i n i n g t h e jo b s a n d s u p p l y i n g O C L fo r e a c h j o b . F o r e x a m p l e , i f o n e jo b ( D ) s p o o l s a l a r g e v o l u m e o f p r i n t and/or punch output, it is advantageous to complete that job before executing a series of processing-oriented jobs

( A , B , C ) :

Job Characteristics

A P r o c e s s i n g - o r i e n t e d B P r o c e s s i n g - o r i e n t e d

C Processing-oriented

D l / O o r i e n t e d

lf the output writers are started while the processing' oriented lobs are executing, the processing unit and the l / O d e v i c e s c a n b e u s e d s i m u l t a n e o u s l v .

A n e x a m p l e o f O C L s p o o l i n g c o n t r o l is th e D E F E R - N O p a r a m e t e r o n t h e P R I N T E R a n d P U N C H s t a t e m e n t s . W h e n the system programmer includes this statement, the

operator can start the print or punch writer while the job step producing the output is still executing.

l n t r o d u c t i o n 1 - 3

(10)

Spool

Spool P u n c h Q u e u e

a n d P r i n t O u e u e

D i s k Data F il e s

f y ' o f e ; U s e r fi l e s o n d i s k a n d m a g n e t i c t a p e s a r e n o t h a n d l e d b y t h e s p o o l i n g fu n c t i o n . Figure 1-3. Processing with Spooling

The JOB statement is read from the spooled reader and q u e u e d o n t h e d i s k b e f o r e th e s t a r t o f a j o b . S i m i l a r l y , th e j o b o u t p u t i s s t o r e d o n t h e d i s k i n p u n c h a n d / o r p r i n t q u e u e s ; p u n c h i n g a n d p r i n t i n g o c c u r s la t e r .

N o t e : A s i n g l e d i s k c o n t a i n s th e r e a d e r , p r i n t , a n d p u n c h q u e u e s .

't4

(11)

S p o o l i n g R o u t i n e s

P a r t i t i o n ' l

P a r t i t i o n 2

P a r t i t i o n 3 S p o o l R e a d e r

( d e s i g n a t e d a s th e s p o o l I n p u t d e v i c e d u r i n g s y s t e m g e n e r a t i o n )

J o b s a r e r e a d b y t h e s p o o l r e a d e r a n d s t o r e d o n d i s k .

Jobs are transferred from the reader queue to one of t h e p a r t i t i o n s , a s r e q u i r e d .

Figure 1-4. Spooling Operation

S p o o l F i l e

P a r t i t i o n 1

P a r t i t i o n 2

P a r t i t i o n 3

l n t r o d u c t i o n 1 - 5

(12)

S u p e r v i s o r

R e a d e r O u e u e S p o o l i n g

R o u t i n e s P r i n t

O r r e r r

P a r t i t i o n 1 P u n c h

Oueue

P a r t i t i o n 2 S p o o l F i l e

P a r t i t i o n 3

A s t h e j o b s a r e e x e c u t e d in t h e p a r t i t i o n s , th e i r o u t p u t i s s t o r e d in t h e s p o o l f i l e .

J o b o u t p u t i s p u n c h e d o r p r i n t e d a t a l a t e r t i m e , i n d e . p e n d e n t o f j o b s c u r r e n t l y e x e c u t i n g in the partitions.

Figure 1.5. Spooling Operation

P a r t i t i o n 2

P a r t i t i o n 3

(13)

This chapter covers the following spooling topics:

. Generating a spooling system o I P L ( i n i t i a l p r o g r a m l o a d ) o R e a d i n g ( i n p u t s p o o l i n g ) a Job execution

o P r i n t i n g o P u n c h i n g

Chapter 2. Processing with Spooling

T h e le v e l o f s p o o l s u p p o r t d e t e r m i n e s w h i c h u n i t - r e c o r d d e v i c e s c a n b e s p o o l e d . T h e s e l e c t e d l e v e l c a n a p p l y to p a r t i t i o n 1 , p a r t i t i o n 2 , p a r t i t i o n 3 , o r a n y c o m b i n a t i o n o f p a r t i t i o n s . l f i n p u t s p o o l i n g i s c h o s e n d u r i n g s y s t e m g e n e r a t i o n , o n e o f t h e f o l l o w i n g i n p u t d e v i c e s m u s t b e s e l e c t e d a s t h e d e v i c e f r o m w h i c h s p o o l e d i n p u t w i l l b e r e a d :

M F C U l ( M F C U p r i m a r y h o p p e r ) M F C U 2 ( M F C U s e c o n d a r y h o p p e r ) 1442

M F C M l ( M F C M p r i m a r y h o p p e r ) M F C M 2 ( M F C M s e c o n d a r y h o p p e r ) 2501

3 7 4 1 ( d i r e c t l y a t t a c h e d )

G E N E R A T I N G A S P O O L I N G S Y S T E M l f p u n c h s p o o l i n g i s c h o s e n d u r i n g s y s t e m g e n e r a t i o n , o n e o f t h e f o l l o w i n g p u n c h d e v i c e s m u s t b e s e l e c t e d a s th e D u r i n g s y s t e m g e n e r a t i o n . t h e u s e r c h o o s e s t h e s p o o l i n g d e v i c e o n w h i c h s p o o l e d o u t p u t w i l l b e p u n c h e d : support needed according to these considerations:

M F C U l ( M F C U P r i m a r Y h o p p e r ) A m o u n t o f m a i n s t o r a g e a v a i l a b l e M F C U 2 (M F C U s e c o n d a r y h o p p e r )

Disk space available 1442

J o b s t r e a m c h a r a c t e r i s t i c s M F C M 1 (M F C M p r i m a r y h o p p e r ) D e s i r e d t h r o u g h p u t M F C M 2 (M F C M s e c o n d a r y h o p p e r )

O n e o f t h e f o l l o w i n g f o u r l e v e l s o f s p o o l i n g s u p p o r t c a n T h e 1 4 0 3 p r i n t e r i s a l w a y s s u p p o r t e d w h e n e v e r s p o o l i n g i s b e s e l e c t e d d u r i n g s y s t e m g e n e r a t i o n : s p e c i f i e d . a n d it i s th e o n l y p r i n t e r t h a t c a n b e s p o o l e d . F o r

5 7 0 4 - S C 2 o n l y , a n a d d i t i o n a l 1 4 0 3 p r i n t e r c a n b e s e l e c t e d P r i n t s p o o l i n g d u r i n g s y s t e m g e n e r a t i o n a n d u s e d b y a s e c o n d s p o o l p r i n t P r i n t a n d p u n c h s p o o l i n g w r i t e r . S e e C h a p t e r 9 f o r i n f o r m a t i o n o n t h e s e c o n d I n p u t a n d p r i n t s p o o l i n g p r i n t e r .

I n p u t , p r i n t , a n d p u n c h s p o o l i n g

F i g u r e 1 - 2 s h o w s t h e c o m b i n a t i o n s o f u n i t - r e c o r d l / O d e v i c e s t h a t c a n b e u s e d w i t h t h e d i f f e r e n t l e v e l s o f s p o o l i n g support.

P r o c e s s i n g w i t h S p o o l i n g 2 - 1

(14)

I n a d d i t i o n t o s e l e c t i o n o f t h e l e v e l o f s p o o l i n g s u p p o r t a n d t h e s p o o l l / O d e v i c e s , t h e f o l l o w i n g s p o o l i n f o r m a t i o n m u s t b e p r o v i d e d d u r i n g s y s t e m g e n e r a t i o n :

S p o o l d i s k u n i t S p o o l d i s k s p a c e T r a c k g r o u p s i z e

Partitions with spool support Forms type and card type Autostart option

Autowrite option

E x t e n d e d re s t a r t o p t i o n ( 5 7 0 4 - S C 2 o n l y ) T i m e r e c o r d i n g o p t i o n

S y s t e m in p u t d e v i c e M a i n s t o r a g e s i z e

Spool Disk Unit

O n l y o n e d i s k u n i t ( s e e F i g u r e 1 - 1 ) c a n b e s p e c i f i e d t o c o n t a i n a l l s p o o l e d d a t a ; t h e s p o o l a r e a c a n n o t b e e x t e n d e d t o a n o t h e r d i s k . T h e u n i t a s s i g n m e n t c a n b e c h a n g e d d u r i n g I P L u s i n g th e S T A R T S P O O L c o m m a n d ( s e e C h a p t e r 5 ) .

Spool Disk Space

T h e a m o u n t o f s p a c e (i n n u m b e r o f c y l i n d e r s ) a l l o w e d fo r s p o o l e d re c o r d s m u s t b e s p e c i f i e d w i t h a m a x i m u m o f 1 9 9 c y l i n d e r s o n a 5 4 4 5 d i s k , 1 6 6 c y l i n d e r s o n a 3 3 4 0 m a i n d a t a a r e a , o r 1 8 6 c y l i n d e r s o n a 3 3 4 4 m a i n d a t a a r e a i n d i c a t i n g f u l l p a c k c a p a c i t y . T h e s p a c e i s o b t a i n e d o n t h e s p e c i f i e d d i s k u n i t d u r i n g I P L a n d r e s e r v e d f o r u s e b y s p o o l i n g u n d e r a f i l e n a m e ( $ S P O O I - ) i n t h e V T O C . I T h e

$SPOOL file is a special type of file that cannot be accessed b y d a t a m a n a g e m e n t ; i t i s l i s t e d w h e n y o u r u n t h e F i l e a n d V o l u m e L a b e l D i s p l a y P r o g r a m ($ L A B E L ) . 1 O n c e t h e s p o o l a r e a is f u l l , s p a c e m u s t b e f r e e d i n o r d e r t o c o n t i n u e . T h e a m o u n t o f d i s k s p a c e c a n b e c h a n g e d d u r i n g I P L b y u s i n g th e S T A R T S P O O L c o m m a n d ( C h a p t e r 5 ) . T h e f o l l o w i n g i t e m s s h o u l d b e c o n s i d e r e d w h e n s p e c i f y i n g t h e s i z e o f t h e s p o o l i n g a r e a ( A p p e n d i x C c o n t a i n s fo r m u l a s f o r e s t i m a t i n g t h e s i z e o f t h e s p o o l a r e a ) :

L e v e l o f s p o o l i n g fu n c t i o n M o d e o f o o e r a t i o n

T y p e o f p r i n t i n g a n d p u n c h i n g V o l u m e

Level of Spooling Function: A systenr with only prrnt s p o o l r n q r e q u i r e s o n l y d i s k s p a c e t o c o n t a i n th e p r i n t r e c o r c l s p r o d u c e d , w h e r e a s a s y s t e m w i t h i n p u t i p r i n t / p u n c h s p o o l r n g s u p p o r t r e q u i r e s d i s k s p a c e t o c o n t a i n t h e i n p u t r e c o r d s r e a d a n d t h e p r i n t a n d p u n c h r e c o r d s c r e a t e d .

Mode of Operation: When the spooled output of a lob s t e p a s c o m p l e t e l y p u n c h e d o r p r i n t e d , th e s p a c e i n t h e s p o o l a r e a is a v a i l a b l e f o r o t h e r o u t p u t r e c o r d s . T h u s , i f t h e p u r p o s e o f s p o o l i n g i s t o s a v e o u t p u t u n t i l a l a t e r ti m e ( s u c h a s s e c c n d s h i f t ) , a l a r g e r s p o o l a r e a is r e q u i r e d t h a n i f t h e r e c o r d s a r e p r . l n c h e d / p r i n t e d a s a v a i l a b l e .

Type of Printing and Punching. Output records containing f e w c h a r a c t e r s r e q u i r e le s s d i s k s p a c e t h a n r e c o r d s c o n t a i n - i n g r n a n y c h a r a c t e r s . T h i s i s b e c a u s e s p o o l r n g s u p p o r t t r u n - c a t e s ri g h t m o s t b l a n k s w h e n s t o r i n g o u t p u t r e c o r d s o n d i s k . F o r e x a r n p l e , J o b A p u n c h e s c o l u m r t s 1 - 2 0 , a n d J o b B p u n c h e s c o l u m n s 1 i - 2 0 a n d 3 0 7 0 . E a c h re c o r d w r i t t e n b y s p o o l t o d i s k f o r J o b A c o n t a i n s th e 2 0 c h a r a c t e r s t o b e p u n c h e d . w h i l e e a c h r e c o r d fo r J o b B c o n t a i n s 7 0 c h a r a c t e r s .

Volume; Jobs that have few lnput records or produce only a f e w o u t p u t r e c o r d s re q u i r e le s s d i s k s p a c e t h a n i o b s t h a t h a v e a l a r q e v o l u m e o f i n p u t d a t a o r c r e a t e a l a r g e v o l u m e o f o u t p r u t re c o r d s .

Track Group Size

T h e d i s k s p a c e f o r t h e s p o o l f i l e i s s e g m e n t e d i n t o e q u a l s i z e g r o u p s o f t r a c k s . E a c h tr a c k g r o u p r e p r e s e n t s a n e x "

t e n t o b t a i n e d b y s p , o o l i n g e a c h ti m e s p a c e i s n e e d e d ' T h e a l l o w e d t r a c k g r o u p s i z e s a r e 1 , 2 , 4 , 5 , a n d 1 0 t r a c k s " T h e s m a l l c r s i z e s n t i n i n t t z e u n u s e d a r e a s w i t h i n s p o o l i n g d i s k s p a c e ; t h e l a r g e r s r z e s i m p r o v e p e r f o r m a n c e f o r l o b s w i t h l a r g e v o l u m e s o f o u t p u t b y m i n i n l i z i n g t h e n r . r t n b e r o f t i n r e s s p o o l i n g is r e q u i r e d to o b t a i n a d d i t i o n z r l d i s k s p a c e ( s e e A p p e n d i x D ) .

Partitions with Spool Support

l f s i n g l e p a r t i t i o n s u p p o r t is d e s i r e d , t h e p a r t t i o n ( 1 , 2 , o r 3 ) t o b e s p o o l e d r n u s t b e s p e c i f i e d . W h e n m L t l t i p l e - p a r t i t i o n s p o o l s u p p o r t i s r : h o s e n , t h e s u p p o r t i s t h e s a m e in e a c h p a r t i ti o n .

(15)

Forms Type and Card Type

T h e f o r m s t y p e a n d c a r d t y p e o p t i o n s s u p p l y t h e d e f a u l t forms type and card type that will be used for spooled p r i n t e d a n d p u n c h e d o u t p u t . A n a l t e r n a t e fo r m s t y p e o r c a r d t y p e m a y b e s u p p l i e d o n t h e P R I N T E R o r P U N C H O C L s t a t e m e n t s a t e x e c u t i o n ti m e o r b y u s i n g a C H A N G E c o m m a n d a f t e r e x e c u t i o n h a s c o m o l e t e d .

Autostart Option

The autostart opt.ion automatically starts the reader, print w r i t e r , a n d / o r p u n c h w r i t e r w h e n s p o o l i n g is a c t i v a t e d a t

l P L . T h i s o p t i o n r e l i e v e s t h e o p e r a t o r o f h a v i n g to e n t e r t h c S T A R T R D R , S T A R T P R T , A N d S T A R T P C H C O M . m a n d s a t I P L ; h o w e v e r , o n c e t h e r e a d e r h a s b e e n t e r m i - n a t e d , a S T A R T R D R c o m m a n d i s r e q u i r e d to a c t i v a t e t h e r e a d e r a g a i n . L i k e w i s e , o n c e t h e w r i t e r h a s b e e n t e r m i n a - t e d , a S T A R T o r R E S T A R T c o m m a n d i s r e q u i r e d to a c t i - vate it again. Because the punch writer and reader cannot b e o p e r a t i n g s i m u l t a n e o u s l y , b o t h c a n n o t b e a u t o m a t i c a l l y s t a r t e d w h e n i n p u t a n d p u n c h s p o o l i n g a r e s u p p o r t e d . Note: lt the autostart option was selected, the print writer o r p u n c h w r i t e r b e g i n s a u t o m a t i c a l l y a t I P L i f t h e r e a r e r e c o r d s a l r e a d y in t h e q u e u e s . l f t h e r e a r e n o r e c o r d s in t h e queues, the output writers are started by the operator r e s p o n s e t o a m e s s a g e t h a t t h e q u e u e s a r e e m p t y o r h e l d .

Autowrite Option

The autowrite option reduces the interaction between s p o o l i n g a n d t h e o p e r a t o r . W h e n t h e p r i n t w r i t e r o r p u n c h w r i t e r s t a r t s , it a u t o m a t i c a l l y p r i n t s o r p u n c h e s w h e n e v e r o u t p u t i s a v a i l a b l e o n t h e q u e u e . W h e n a n o u t p u t q u e u e i s h e l d , a l l s t e p s o r r t h e q u e u e a r e h e l d , o r w h e n t h e q u e u e i s e m p t y , n o m e s s a g e i s w r i t t e n t o t h e C R T i n f o r m i n g t h e o p e r a t o r o f t h e s i t u a t i o n . N o o p e r a t o r a c t i o n i s n e c e s - s a r y to c a u s e t h e w r i t e r t o b e g i n e x e c u t i o n a g a i n . T h e w r i t e r m e r e l y w a i t s u n t i l o u t p u t i s a v a i l a b l e a n d b e g i n s a u t o m a t i c a l l y .

A i o b s t e p s p e c i f y i n g th a t t h e o u t p u t m a y b e p r i n t e d o r p u n c h e d d u r i n g e x e c u t i o n c a u s e s t h e w r i t e r t o b e g i n p r i n t - i n g o r p u n c h i n g if t h e r e i s n o o u t p u t o n t h e q u e u e a h e a d o f t h e e x e c u t i n g , o b s t e p .

The writers can still be stopped and started by using OCC.

W h e n s t o p p e d , th e w r i t e r d o e s n o t a u t o m a t i c a l l y b e g i n w h e n o u t p u t i s a v a i l a b l e ; t h e o p e r a t o r m u s t s t a r t t h e writer before output can begin.

Extended Restart Option (5704-SC2 only)

T h e e x t e n d e d re s t a r t o p t i o n a u t o m a t i c a l l y r e s t a r t s s o m e s y s t e m m e s s a g e s ; t w o s u c h s p o o l m e s s a g e s a r e N O I N P U T J O B A V A I L A B L E a n d R D R O l S E M P T Y / H E L D . W h e n e v e r a j o b i s p l a c e d o n t h e r e a d e r q u e u e , a l l N O I N P U T J O B A V A I L A B L E a n d R D R O l S E M P T Y / H E L D messages will be restarted if the new job can be run in a p a r t i t i o n t h a t i s h a l t e d b y o n e o f t h e s e m e s s a g e s . T h e messages will not be restarted if :

- T h e q u e u e is h e l d ,

- T h e j o b i s f o r a n o t h e r p a r t i t i o n ,

- T h e J O B s t a t e m e n t h a s P R IO R IT Y - O s p e c i f i e d , o r - T h e C O R E p a r a m e t e r va l u e s p e c i f i e d o n t h e J O B s t a t e -

m e n t i s t o o l a r g e .

For information on other system messages that can be automatically restarted, see the IBM Svstem/3 Model l5 System Control Programming Concepts and Reference Manual, GC21 5162.

Time Recording Option

T h e t i m e r e c o r d i n g o p t i o n c a u s e s a m e s s a g e t o b e w r i t t e n i n t h e s y s t e m h i s t o r y a r e a e a c h ti m e t h e p r i n t o r p u n c h w r i t e r c o m p l e t e s a j o b s t e p . T h e m e s s a g e c o n t a t n s t h e d a t e a n d t i m e t h a t t h e o u t p u t f o r t h e j o b s t e p w a s s t a r t e d a n d t h e t i m e t h a t t h e o u t p u t w a s c o m p l e t e d .

T h i s m e s s a g e m a y b e u s e d a s a n a i d f o r p e r f o t m a n c e p l a n n i n g o n a s p o o l i n g s y s t e m . F o r a d d i t i o n a l in f o r m a t i o n a b o u t p e r f o r m a n c e . s e e C h a p t e r 7 . T h e t i m e r e c o r d i n g m e s s a g e m a y a l s o b e u s e d fo r j o b a c c o u n t i n g p u r p o s e s .

N o t e : l I c o n s i s t e n t e l a p s e d t i m e s a r e e x p e c t e d , t h e o u t p u t w r i t e r s s h o u l d h a v e a s y s t e m p r i o r i t y h i g h e r th a n t h a t o f t h e p r o g r a m p a r t i t i o n s . F o r i n f o r m a t i o r r a b o u t t h e P T Y command, see Chapter 5.

System lnput Device

A s y s t e m in p u t d e v i c e is a s s i g n e d t o e a c h p a r t i t i o n ; f o r e x - a m p l e . th e 2 5 0 1 c a n b e a s s i g n e d f o r p a r t i t i o n 1 a n d t h e C R T / K e y b o a r d f o r p a r t i t i o n 2 . W h e n t h e o p e r a t o r In i t i a t e s a j o b f o r a p a r t i t i o n , t h e p a r t i t i o n r e a d s O C L s t a t e m e n t s f r o m i t s i n p u t d e v i c e . A l s o , d u r i n g s y s t e m g e n e r a t r o n , i f i n p u t s p o o l i n g is t o b e u s e d , a n i n p u t d e v i c e rn u s t b e a s - s i g n e d a s t h e s p o o l e d r e a d e r . T h e d e v i c e a s s i g n e o a s t h e s p o o l e d re a d e r c a n b e t h e s a m e d e v i c e s p e c i f i e d a s t h e s y s t e m in p u t d e v i c e .

P r o c e s s i n g w i t h S p o o l i n g 2 - 3

(16)

l f i n p u t s p o o l i n g fo r t h e 2 5 0 i w e r e c h o s e n fo r p a r t i t i o n 1, the 2501 should also be specified as the system input device.

J o b s a r e i n i t i a t e d fr o m t h e r e a d e r q u e u e w h e n t h e s y s t e m i n p u t d e v i c e is a l s o th e s p o o l i n p u t d e v i c e .

A p a r t i t i o n ' s s y s t e m in p u t d e v i c e c a n b e c h a n g e d b y a R E A D E R O C L s t a t e m e n t o r b y a R E A D E R c o m m a n d . C o n s i d e r a s i t u a t i o n w h e r e ( 1 ) t h e s y s t e m in p u t d e v i c e fo r p a r t i t i o n 1 i s t h e 2 5 0 1 , (21 the spool input reader is the M F C M l , a n d ( 3 ) a j o b t o b e e x e c u t e d in p a r t i t i o n 1 c o n - s i s t s o f R P G l l p r o g r a m s t h a t u s e th e M F C M l f o r c a r d i n p u t d a t a . T h e j o b i s p l a c e d in M F C M j, t h e M F C M i s r e a d - i e d , a n d t h e o p e r a t o r is s u e s t h e S T A R T R D R c o m m a n d . A f t e r t h e j o b h a s b e e n r e a d , th e o p e r a t o r s h o u l d n o t initi_

a t e j o b e x e c u t i o n in p a r t i t i o n 1 u n t i l t h e s y s t e m in p u t de_

v i c e fo r p a r t i t i o n 1 i s c h a n g e d . T h i s c a n b e d o n e with a R D R P 1 , M F C M 1 c o m m a n d o r b y p u t t i n g // R E A D E R M F C M l i n t h e 2 5 0 1 . N o w p a r t i t i o n 1 c a n b e s t a r t e d . lf the operator initiated partition I before changing tlre read- er, the system would have attempted to read from the 2 5 0 1 , w h i c h c o u l d b e e m p t y , c o n t a i n b l a n k c a r d s , o r c o n t a i n s o m e o t h e r j o b .

Main Storage Size

T h e a m o u n t o f m a i n s t o r a g e a v a i l a b l e f o r s p o o l i n g s h o u l d b e t a k e n i n t o c o n s i d e r a t i o n b a s e d o n t h e a m o u n t r e a u t r e d t o s u p p o r t t h e d e s i r e d f u n c t i o n s . T h e m a i n s t o r a g e re q u i r e _ ments for the spooling functions selected are stated in A p p e n d i x B .

I P L

S p o o l i n g , s e l e c t e d a s a f e a t u r e d u r i n g s y s t e m g e n e r a t t o n , i s l o a d e d a t I P L w i t h t h e s u p e r v i s o r . U p o n c o m p l e t i o n of the IPL process, the system date can be entered before p r o c e s s i n g c o n t i n u e s . A d i s p l a y o n t h e C R T c o n t a i n s E J m e s s a g e s f o r t h e p a r t i t i o n s . A t t h i s t i m e , b e f o r e in i t i a t i n g any lobs, the operator decides whether to activate or can- c e l t h e s p o o l s u p p o r t . T h e C A N C E L S P O O L c o m m a n c l {see Chapter 5) causes the spooling support to be removed f r o m m a i n s t o r a g e , m a k i n g a d d i t i o n a l m a i n s t o r a g e a v a i l a b l e t o a n y p a r t i t i o n . l f s p o o l i n g s u p p o r t i s d e s i r e d la t e r , the o p e r a t o r m u s t p e r f o r m a n I P L a g a i n .

lf the operator chooses to operate with spool, spooling can b e g i n e i t h e r b y a c o m m a n d p r i o r t o j o b e x e c u t i o n o r b y operator response to an IPL EJ message for a partition.

To start without any changes to the spool disk space, thr,.

o p e r a t o r b e g i n s j o b e x e c u t i o n b y r e p l y i , r g to o r r e cf the I P L E J m e s s a g e s o r e n t e r i n g a S T A R T S P O O L c o m m a n d ( s e e C h a p t e r 5 ) . E i t h e r a c t i o n c a u s e s t h e d i s k s p a c e u s e d b y s p o o l i n g to b e o b t a i n e d a c c o r d i n g t o t h e d i s k u n i t a n d s i z e s p e c i f i e d d u r i n g s y s t e m g e n e r a t i o n . A n y e x r s t i r r g s p o o l e d in p u t a n d / o r o u t p u t r e m a i n s in t h e s p o o l a r e a a r r d i s n o t l o s t .

T o o v e r r i d e s p e c i f i c a t i o n s m a d e d u r i n g s y s t e m g e n e r a t i o n , t h e o p e r a t o r e n t e r s a S T A R T S P O O L c o m m a n d w i t h t h e p a r a m e t e r s t o b e c h a n g e d . T h e o p e r a t o r m a y ( 1 ) a l t e r t h e s p o o l d i s k u n i t u s e d , ( 2 ) c h a n g e th e s i z e o f t h e s p o o l i n g a r e a , (3 ) c h a n g e t h e s i z e o f t h e t r a c k g r o u p s w i t h i n t h e s p o o l i n g a r e a , o r ( 4 ) r e f o r m a t t h e s p o o l a r e a ( c a u s t n g e x l s t . i n g s p o o l e d l/ O d a t a t o b e l o s t ) . O n c e s p o o l i n g is i n i t i a t e d ( a t I P L ) , t h e d i s k p a c k u s e d fo r the spooling area slrould not be removed until another IPL is performed.

N o t e : l f a n o t h e r I P L i s p e r f o r m e d w h i l e s p o o l i n g is b e i n g a c t i v a t e d , t h e r e i s a c h a n c e th a t t h e s p o o l d i s k s p a c e w a s n o t c o m p l e t e l y a l l o c a t e d fo r s p o o l i n g . T h a t i s , t h e s p a c e may have been obtained but an entry was not yet made in the VTOC to account for the space. To determine whether t h i s s i t u a t i o n e x i s t s , e i t h e r a t t e m p t t o u s e th e d i s k p a c k a g a i n f o r s p o o l i n g o r d i s p l a y t h e V T O C u s i n g $ L A B E L . l f t h i s s i t u a t i o n o c c u r s , th e F O R M A T f u n c t i o n o f $ D E L E T w i l l f r e e t h e i n a c c e s s i b l e s p a c e .

A c t i v a t i n g s p o o l i n g d o e s n o t c a u s e t h e r e a d e r , p n n t w n t e r , o r p u n c h w r i t e r t o s t a r t u n l e s s a u t o s t a r t h a s b e e n g e n e r a t e d l f t h e a u t o s t a r t fu n c t i o n w a s s p e c i f i e d d u r i n g s y s t e m g e r r e r - a t i o n , t h o s e d e v i c e s s o s p e c i f i e d a r e a u t o n ' t a t t c a l l V s t a r t e d w h e r r s p o o l i n g is a c t i v a t e d . l f a u t o s t a r t w a s n o t g e n e r a t e d , t h e o p e r a t o r m u s t e n t e r S T A R T c o m m a n d s to i n i t t a t e th e d e s i r e d s p o o l i n g f u n c t i o n .

E n t e r i n g th e S T A R T R D R c o m r n a n d c a u s e s t h e s p o o i e d r n p u t d e v i c e to s t a r t r e a d i n g a n d p l a c i n g th e j o b s i r r t h e r e a d e r q u e u e . E n t e r i n g th e S T A R T P R T o r S T A R I P C F i c o m m a n d s a c t i v a t e s t h e r e s p e c t i v e o u t p u t w r i t e r s o t h e p r i n t i n g o r p u n c h i n g o f s p o o l e d re c o r d s f r o m t h e p r i n t o r p u n c h q u e u e c a n b e g i n . l f j o b s t e p s h a v e n o t p u t a n y r e c o r d s in t o t h e p r i n t o r p u n c h q u e u e s , a m e s s a g e ( P R T O lS E I V I P T Y / H E L D o r P C H Q l S E M P T Y / H E L D ) i s s h o w n o n t h e d i s p l a y s c r e e n "

I t t h e o p e r a t o r a t t e m p t s to s t a r t e i t h e r t h e r e a d e r o r t h e p u r r c h w r i t e r a f t e i t h e o t h e r h a s s t a r t e d , a m e s s a g e a p p e a r s o r r t h e C R T i n d i c a t i n g R E A D E R / W R i T E R A C T I V E s i n c e b o t h t h e r e a d e r a n d t h e p u n c h w r i t e r c a n n o t b e o p e r a t i n g a t t h e s a m e ti m e . A s s o o n a s t h e i n i t i a t e d fu n c t t o n t e r - m i n a t e s , t h e o p e r a t o r c a n s t a r t t h e o t h e r f u n c t i o r - r .

(17)

A t t h i s p o i n t , it m a y b e h e l p f u l f o r t h e o p e r a t o r t o d i s p l a y the system status to determine that the system is set-up as d e s i r e d . T h e D I S P L A Y c o m m a n d ( s e e C h a p t e r 5 ) w i t h t h e STATUS operand shows the system status; for example, f o r 5 7 0 4 - S C 1 :

C - _ - _ - _ S Y S T E M S T A T U S D I S P L A Y ( S P , P 2 , P ] , )

P A R T 1 _ 2 4 K P A R T 2 _ 2 4 K

C A S H F L O I , J S T E P 3 L A S O R S T E P 9 R D R _ M F C M ] ,

P R T - 1 4 0 3 P C H _ M F C M 2

S P O O L ) R D R - 3 2 1 1

S P O O L ) P R T _ 1 , 4 0 3 ( S P O O L ) S P O O L ) P C H - M F C I 4 2 ( S P O O L ) 1 8 K A V A I L A B L E 0 1 , / 2 8 / 1 4 1 ' O t 2 1 ' 2 4 1 ,

S P O O L S T A T U S D I S P L A Y

R D R _ M F C M I / E M P U N I T * D 1 T C Y L - ] ' O O P R T _ 1 , 4 0 3 / A C T / H T K G P S I Z E * 5 / 3 9 8 P C H _ M F C M Z / A C T T K G P S A V A I L _ 3 3 0 E N T E R D I S P L A Y R E O U E S T M S G N O T R S P O 3

R E A D I N G ( I N P U T S P O O L I N G ) Job Stream

P r i o r t o e x e c u t i n g a n y p r o g r a m s o n t h e M o d e l 1 5 u s i n g spooling support, the system programmer should consider the organization of the job stream. Although no changes i n t h e p r o g r a m s a r e r e q u i r e d ; t h e f o l l o w i n g s h o u l d b e observed:

o Several additional OCL statements can be added.

o The order of program execution can be changed for better performance and device utilization.

T h e i n p u t s t r e a m c o n s i s t s o f t w o d i f f e r e n t u n i t s o f w o r k : jobs and job steps. Each job is a group of related job steps t o b e e x e c u t e d in a s e q u e n t i a l m a n n e r . A j o b i n c l u d e s a l l n e c e s s a r y p r o g r a m s , f i l e d e f in i t i o n s , a n d O C L s t a t e m e n t s n e e d e d t o a c c o m p l i s h a s p e c i f i c f u n c t i o n . W h e n i n p u t s p o o l i n g is u s e d , th e s t e p s m u s t c o n s i s t o f O C L o r O G L p l u s d a t a ; y o u c a n n o t s p o o l o n l y t h e d a t a .

D e f in i n g a s e r i e s o f r e l a t e d s t e p s a s a s i n g l e j o b m a y b e r e - q u i r e d e i t h e r b e c a u s e o f t h e s e q u e n c e o f f u n c t i o n s o r b e - cause it may provide specific advantages. For instance, m u l t i p l e s t e p s w i t h i n a s i n g l e j o b a r e p r e f e r a b l e w h e n t h e e x e c u t i o n o f a l a t e r s t e p i s d i r e c t l y d e p e n d e n t u p o n t h e s u c c e s s f u l c o m p l e t i o n o f a n e a r l i e r s t e p . l f a s t e p t e r m i n - a t e s a b n o r m a l l y , th e r e m a i n i n g s t e p s in t h e j o b a r e b y p a s s e d .

W h e n u s i n g in p u t s p o o l i n g , i t i s a l s o a d v a n t a g e o u s t o c o n - s i d e r th e p l a c e m e n t o f j o b s w i t h i n t h e j o b s t r e a m . A i o b with a small amount of input should be placed on the queue before a job with a large amount of input, allowing the first job to begin execution while the second one is being read into the queue.

OCL Considerations

T h e b e g i n n i n g o f a j o b ' s O C L i s i n d i c a t e d b y t h e J O B O C L statement or the statement after a /. statement. All OCL statements and data that follow the JOB statement, up to the next JOB or /. statement, are associated with that job.

A n y n u m b e r o f L O A D / R U N a n d / o r C A L L / R U N c o m b i - nations can be included. Spooling uses the information from the JOB statement to build the queues on disk. For

i n s t a n c e , t h e P A R T I T I O N p a r a m e t e r e n a b l e s i o b s f o r a l l partitions to be read from one system input device by specifying the partition designated for job execution.

T h e P U N C H a n d P R I N T E R O C L s t a t e m e n t s a r e a l s o u s e d b y s p o o l i n g s u p p o r t a n d c a n b e i n c l u d e d in t h e i o b s t r e a m { s e e C h a p t e r 6 ) .

A / . s t a t e m e n t s h o u l d b e u s e d a f t e r e a c h io b a s a d e l i m i t e r . ( A l t h o u g h , if a / . s t a t e m e n t is n o t u s e d , th e J O B s t a t e m e n t f o r t h e n e x t j o b a c t s a s a j o b d e l i m i t e r . ) W h e n t h e j o b b e i n g p u t i n t h e r e a d e r q u e u e i s n o t s e p a r a t e d f r o m t h e n e x t i o b by a /. statement, spooling generates a /. statement as the last statement for the job in the queue. When the system h i s t o r y a r e a is d i s p l a y e d o r p r i n t e d , o r w h e n t h e s t a t e m e n t i s l o g g e d o n t h e s y s t e m lo g g i n g d e v i c e , th i s s t a t e m e n t m a y c o n t a i n u n p r e d i c t a b l e c h a r a c t e r s f o l l o w i n g t h e / . .

T w o c o n s e c u t i v e / . s t a t e m e n t s i n d i c a t e th e e n d o f t h e e n t i r e j o b s t r e a m . W h e n u s i n g in p u t s p o o l i n g , th e s e tw o c o n s e c u - t i v e / . s t a t e m e n t s c a u s e t h e r e a d e r t o b e t e r m i n a t e d , re l e a s ' i n g t h e i n p u t d e v i c e .

P r o c e s s t n g w r t h S P o o l r n q 2 5

(18)

Perf or ma nce C o ns i derat i o n s

To improve performance, the following items should be c o n s i d e r e d w h e n p l a n n i n g a j o b s t r e a m :

1 . W h e n s p o o l i n g i n p u t , m a k e t h e f i r s t jo b o n e th a t contains little or no input data. The sooner a job is on the reader queue, the sooner a partition can be initiated to execute that lob.

2 . W h e n s p o o l i n g i n p u t , d e f i n e t h e f i r s t jo b w i t h a m i n i m u m n u m b e r o f j o b s t e p s _ preferably o n e . A p a r t i t i o n c a n n o t b e in i t i a t e d u n t i l th e e n t i r e j o b is on the reader queue.

3 . W h e n e x e c u t i n g i n m u l t i p l e p a r t i t i o n s , a v o i d u n n e c e s _ s a r y d i s k c o n t e n t i o n c a u s e d . f o r e x a m p l e , b y r u n n i n g two sort programs at the same time.

4 . W h e n n o t u s i n g p u n c h s p o o l i n g s u p p o r t , c a r e f u l l y p l a n th e p l a c e m e n t o f j o b s t e p s t h a t r e q u i r e t h e p u n c h d e v i c e .

5. Avoid contention between the reader and the punch device and also between punch requests to the same d e v i c e f r o m m u l t i p l e p a r t i t i o n s a t t h e s a m e t i m e .

Limitations of lnput Spooling

T h e fo l l o w i n g l i m i t a t i o n s a p p l y to a n y i n p u t b e i n g s p o o l e d from the job stream:

Output operations (such as stacker selection or combined f i l e s ) c a n n o t b e p e r f o r m e d o n s p o o l e d in p u t f iles.

The following record lengths for each device are used:

a. From the MFCM, 2501, and 1442, only g0-byte records are written in the reader aueue.

b . F r o m t h e M F C U , o n l y 9 6 - b y t e r e c o r d s are written i n t h e r e a d e r q u e u e .

c . O t h e r c a r d s i z e s , s u c h a s 5 l - c o l u m n c a r d s , c a n n o t be used.

d . F r o m t h e 3 7 4 1 , 1 - t o 1 2 8 - b y t e re c o r d s are wfltten i n t h e r e a d e r q u e u e .

T h e r e a d c a r d i m a g e ( c o l u m n b i r r a r y ) o p e r a t i o n is not supported.

Reader Oueue

Once the job stream has been constructed, the records have been placed into the reader, and lpL has been c o m p l e t e d o n a s y s t e m w i t h i n p u t s p o o l i n g , th e r e a d e r q u e u e c a n b e b u i l t o n d i s k . l f a u t o s t a r t was specif i e d f o r i n p u t s p o o l i n g d u r i n g s y s t e m g e n e r a t i o n , t h e r e a o e r starts reading records when spool is activated following an lPL. lf autostart is not in effect, the operator musr e n t e r a S T A R T R D R c o m m a n d w h e n j o b s a r e to be read into the reader queue.

T h e r e a d e r q u e u e is b u i l t o n d i s k a s t h e j o b s t r e a m is r e a d ( s e e F i g u r e 2 - 1 ) . T o t h e s p o o l r e a d e r . a J O B s t a t e m e n t indicates the beginning of a new job; a l. or another JOB s t a t e m e n t in d i c a t e s t h e e n d o f t h e j o b . O n e r e a d e r q u e u e entry is created for each job read. All steps within a job a r e s c h e d u l e d f o r s e q u e n t i a l e x e c u t i o n in t h e s a m e p a r t i t i o n . E a c h jo b i s i d e n t i f ie d o n t h e q u e u e b y t h e j o b n a m e . lf a n y e r r o r s a r e f o u n d o n t h e J O B s t a t e m e n t . th a t j o b i s a s s i g n e d a p r i o r i t y o f 5 o n t h e r e a d e r q u e u e . I n a d d i t i o n , i f t h e j o b n a m e is m i s s i n g o r i n v a l i d , th e d e f a u l t n a m e J O B i s a s s i g n e d t o t h a t j o b o n t h e r e a d e r q u e u e .

(19)

S p o o l i n g R o u t i n e s

P a r t i t i o n 1

P a r t i t i o n 2

S p o o l F i l e

F i g u r e 2 - 1 . B u i l d i n g t h e R e a d e r O u e u e

P r o c e s s i n g w i t h S p o o l i n g 2 - 7

Références

Documents relatifs

Ing. Karol Kósa, vedúci odboru rozvoja PS, Slovenská elektrizačná prenosová sústava, a.. • Postup pri pripojovaní nových zdrojov do PS SR podľa TP SEPS, a..

Functional Description: The user's combined Dictionary will be searched for the specified term. Functional Description: GO gives control to the roost recently

Once multiple channel programs have been initiated on one channel, the interleaving of data transfer operations is controlled by block multiplexer channel

drastically by the use of high-speed buffer storage, which eliminates CPU to processor storage fetches for approximately 95% of the fetches required. The

Once multiple channel programs have been initiated on one channel, the interleaving of data transfer operations is controlled by block multiplexer channel

Bit Test Note: Translate feature· is not supported.. including standard and special features, input/output devices, buffers, etc. For details about processor

When a System/370 operates in EC mode, the number of perrnanently assigned loca.tions in lower processor storage is increased to include fields for

The extended ETRN command is issued by the client host when it wishes to start the SMTP queue processing of a given server