A11103 afiT7T4

NAFL INST OF STANDARDS & TECH R.I.C.

/r,H., A1 11 03089794

K"r5rNH5J,«^ ^CE & TECHNOLOGY:

National Bureau ol Standards

Ubiaty, E-01 Admin. BligOCT 1 1981

191057

ICO

MSI

GUIDELINE I JOB ACCOU

The System I Facilities (SIV

for IBM Syst

under OS/M

QC

100

U57 i

UO . 500-^0 \

1978 \

Q 2

^fEAvy o»

NBS Special Publication 500-40

U.S. DEPARTMENT OF COMMERCE

National Bureau of Standards
NATIONAL BUREAU OF STANDARDS

The National Bureau of Standards' was established by an act of Congress March 3, 1901. The

Bureau's overall goal is to strengthen and advance the Nation's science and technology and

facilitate their effective application for public benefit. To this end, the Bureau conducts

research and provides: (1) a basis for the Nation's physical measurement system, (2) scientific and technological services for industry and government, (3) a technical basis for equity in trade, and (4) technical services to promote public safety. The Bureau's technical work is performed by the National Measurement Laboratory, the National Engineering Laboratory,

and the Institute for Computer Sciences and Technology.

THE NATIONAL MEASUREMENT LABORATORY provides the national system of

physical and chemical and materials measurement; coordinates the system with measurement

systems of other nations and furnishes essential services leading to accurate and uniform

physical and chemical measurement throughout the Nation's scientific community, industry,

and commerce; conducts materials research leading to improved methods of measurement,

standards, and data on the properties of materials needed by industry, commerce, educational

institutions, and Government; provides advisory and research services to other Government

Agencies; develops, produces, and distributes Standard Reference Materials; and provides

calibration services. The Laboratory consists of the following centers:

Absolute Physical Quantities^ — Radiation Research — Thermodynamics and

Molecular Science — Analytical Chemistry — Materials Science. THE NATIONAL ENGINEERING LABORATORY provides technology and technical

services to users in the public and private sectors to address national needs and to solve national problems in the public interest; conducts research in engineering and applied science

in support of objectives in these efforts; builds and maintains competence in the necessary

disciplines required to carry out this research and technical service; develops engineering data and measurement capabilities; provides engineering measurement traceabihty services; develops test methods and proposes engineering standards and code changes; develops and

proposes new engineering practices; and develops and improves mechanisms to transfer

results of its research to the utlimate user. The Laboratory consists of the following centers:

Applied Mathematics — Electronics and Electrical Engineering^ — Mechanical

Engineering and Process Technology^ — Building Technology — Fire Research —

Consumer Product Technology — Field Methods.

THE INSTITUTE FOR COMPUTER SCIENCES AND TECHNOLOGY conducts

research and provides scientific and technical services to aid Federal Agencies in the selection, acquisition, application, and use of computer technology to improve effectiveness and

economy in Government operations in accordance with Public Law 89-306 (40 U.S.C. 759), relevant Executive Orders, and other directives; carries out this mission by managing the Federal Information Processing Standards Program, developing Federal ADP standards

guidelines, and managing Federal participation in ADP voluntary standardization activities; provides scientific and technological advisory services and assistance to Federal Agencies; and

provides the technical foundation for computer-related policies of the Federal Government.

The Institute consists of the following divisions:

Systems and Software — Computer Systems Engineering — Information Technology.

'Headquarters and Laboratories at Gaithersburg, Maryland, unless otherwise noted; mailing address Washington, D.C. 20234. 'Some divisions within the center are located at Boulder, Colorado, 80303.

The National Bureau of Standards was reorganized, effective April 9, 1978.
NOV 2 8 1978

COMPUTER SCIENCE & TECHNOLOGY: do

GUIDELINE ON MAJOR

JOB ACCOUNTING SYSTEMS: c ^

The System Management

Facilities (SMF)

for IBM Systems

under OS/MVT

Gary Durbin, Todd Kinney,

Peter Lamasney, Edward Newman, and

Edward Syrett

Tesseract Corporation

101 Howard Street San Francisco, California 94120

Sponsored by the

Institute for Computer Sciences and Technology

National Bureau of Standards Washington, D.C. 20234

U.S. DEPARTMENT OF COMMERCE, Juanita M. Kreps, Secretary

Dr. Sidney Harman, Under Secretary

Jordan J. Baruch, Assistant Secretary for Science and Technology

NATIONAL BUREAU OF STANDARDS, Ernest Ambler, Director

Issued October 1 978
Reports on Computer Science and Technology

The National Bureau of Standards has a special responsibility within the Federal

Government for computer science and technology activities. The programs of the

NBS Institute for Computer Sciences and Technology are designed to provide ADP

standards, guidelines, and technical advisory services to improve the effectiveness of

computer utilization in the Federal sector, and to perform appropriate research and

development efforts as foundation for such activities and programs. This publication

series will report these NBS efforts to the Federal computer community as well as to interested specialists in the academic and private sectors. Those wishing to receive

notices of pubHcations in this series should complete and return the form at the end

of this publication.

National Bureau of Standards Special Publication 500-40

Nat. Bur. Stand. (U.S.) Spec. Publ. 500-40, 170 pages (Oct. 1978) CODEN: XNBSAV

Library of Congress Catalog Card Number 78-600113

U.S. GOVERNMENT PRINTING OFFICE

WASHINGTON: 1978

For sale by the Superintendent of Documents, U.S. Government Printing Office, Washington, D.C. 20402

Stock No. 003-003-01989-5 Price $4.00

(Add 25 percent additional for other than U.S. mailing)
GUIDELINE ON MAJOR JOB ACCOUNTING SYSTEMS:

THE SYSTEM MANAGEMENT FACILITIES (SMF)

FOR IBM SYSTEMS UNDER OS/MVT

by

Gary Durbin, Todd Kinney, Peter Lamasney

Edv/ard Newman, Edward Syrett

ABSTRACT

This document reports the results of a study

which was commissioned in response to the

need for a better understanding of how job

accounting systems work, what they measure,

and how accurately they measure. The

accounting system described is IBM's System

Management Facilities (SMF) for 360/370

environments operating under OS/MVT.

Considerable detail is provided on SMF's

activity in collecting the data necessary to

account for resources utilized by the

individual jobs in a multiprogramming system

and to provide some indicators of the

performance of the system itself. Included

within the scope of this study was an investigation of the accuracy, both absolute

and relative, of SMF as a measurement tool

and the costs entailed in the use of SMF.

The experimental methodology used to explore

these questions is summarized in the report,

as are the conclusions reached. Performance

analysts, system programmers, and managers

interested in optimal use of their computer

resources will find much help here in the

application of a valuable measurement tool.

Keywords: Computer performance analysis; computer performance

measurement; CPU time; data accuracy; data validation; EXCP

counts; IBM OS/MVT; job accounting systems; resource

utilization measurement; System Management Facilities; system

wait time.

iii
NBS FOREWORD

The usefulness of vendor-supplied job accounting systems in

improving the performance of computer installations has long been

recognized. Originally designed for user chargeback, these

supervisor-resident programs produce data on workload and

resource utilization that are essential to the estimation of

installation efficiency. They are comprehensive, convenient to use and--being bundled with standard-release operating system

software--essenti al 1 y free of charge. They have been used to

forecast workload, drive prediction models, estimate capacity,

reconfigure equipment, and set priorities for software

optimization. They are arguably the most widely available and

most widely used of performance measurement tools.

Taken as a group, job accounting systems have one additional

characteristic that makes them particularly interesting to

auditing and standards activities: nearly all contemporary

med i urn- 1 0- 1 a rge scale computer installations have them. Some

collect accounting data but make no practical use of it, while

others use it only to charge customers for the computing services

they receive. Yet nearly all have the capability of collecting

this data and the potential for making productive use of it. It

is not surprising, therefore, that some federal managers have

begun to turn to this tool as the basis for describing the

performance of whole classes of computer installations, and even

comparing performance from one site to another.

Several technical obstacles stand in the way of these

expanded uses of accounting data, however. Different job

accounting systems reflect unique vendor ideas of hardware and

software architecture and attitudes toward the accounting

function. Consequently, they measure different things, measure

the same things differently, and record resource demands that may

not be duplicated for the same workload on any other system. It

is not always clear what specific system event a measurement

represents, how precisely it is being measured, or what

calibration it requires. Any extended use of job accounting

data--either at the local installation level or for complex

performance evaluation purpose s- -wi 1 1 require an exact

understanding of the accounting system as an instrumentation

device.

The study on which the following report is based was

commissioned in response to the need for better understanding of

how accounting systems work, what they measure and how well they

measure it. It attempts to apply rigorous criteria of

description, analysis and validation to an already valuable and

potentially influential method of computer instrumentation. The

report deals with the job accounting system used by most federal

installations equipped with third-generation IBM mainframes: the

System Management Facilities (SMF) for OS/MVT sytems. More than

200 medi um-to- 1 arge scale federal installations are capable of

generating SMF data under the OS-series of operating systems.

iv
To managers and technicians at these installations and

others like them in the private sector, this report is

recommended reading before attempting to use job accounting data

for performance improvement, reporting, prediction or control.

It is intended neither as an endorsement of specific job

accounting systems and the equipment that supports them, nor as a criticism of those systems for falling short of objectives they

were never intended to meet. On the contrary, it is offered in

recognition of the fact that accounting data already gives us an invaluable window on computer performance, but that its

application must be qualified by an understanding of its

limitations.

Seymour Jeffery, Chief

Systems and Software Division

Institute for Computer Sciences

and Technology

National Bureau of Standards

V
Authors' Preface

The purpose of this report is to describe SMF, to suggest

what it is good for, and to caution against what it is not good

for. "SMF" refers to the System Management Facilities of IBM

OS/360 MVT. As part of Tesseract's investigation of SMF, a series of controlled tests were performed to measure the accuracy

and reliability of SMF data, and the overhead incurred in

collecting and recording . the data. The results of this

validation experiment are summarized in Section VI.

The intended readership of this report consists of three

major groups: installation managers, performance analysts, and

system programmers. Since the detailed analysis of SMF presented

here requires extensive use of specialized terminology and

acronyms, a glossary of abbreviations and an introductory section

have been included to assist those readers not in daily contact

with OS internals. Obviously, system programmers could bypass

these sections, especially on first reading this report.

Similarly, some of the most detailed analyses of the structure

and function of SMF might well be skipped by readers concerned

with the overall evaluation of its suitability for their sites'

needs. This level of detail was included in the hope that this

report could serve the system programmers among its readership as

a Program Logic Manual (PLM) for SMF, concentrating in one short

document material scattered throughout the existing PLM's (<4>,

<5>, <10>, <11>, <12>, <13>) , or in some cases available only in

microfiche form. It should be noted, however, that this report

deals only with SMF on the MVT version of the IBM Operating

System. The Time-Sharing Option (TSO) , Virtual Storage (VS) , and

Multiprogramming with a Fixed number of Tasks (MFT) are not

covered in this report, though occasional references to them

occur

.

This report assumes that its readers have ready access to

the OS SMF manual (<2>) for elaboration of background material

which is only outlined here. Although the SMF manual is not a prerequisite, this report is intended to be read in conjunction

with it. For those readers who are not familiar with OS/360 from

either the user's or the operator's viewpoint, the manual

entitled IBM System/360 Operating System; Introduction (Order

Number GC28-6534) is highly recommended.

The organization and readability of this report have

benefitted immensely from the constructive criticism, guidance

and suggestions provided by Richard Dunlavey and Dennis Conti of

the National Bureau of Standards. The authors gratefully

acknowledge the wholehearted cooperation of everyone on the staff

of Greyhound Computer Corporation's San Francisco Data Center,

especially the invaluable assistance of the customer engineers in

the hardware monitoring phase of the project. Several obscure

technical points were clarified in enlightening discussions with

Michael W. Haven of the G.C.C. systems programming department.

Naturally, any deficiencies of the report are the responsibility

of the authors.

vi
Table of Contents

NBS Foreword iv

Authors' Preface . vi

Table of Contents vii

I. Introduction to SMF Concepts

A. General Overview

1. Purpose and background of SMF 1 2. Outline of SMF capabilities 3

B. Methods of Data Collection

1. Internal data collection 5 2. External data collection 6

II. Installation and Operation of SMF

A. Installation and Maintenance of Software

1. Hardware requirements 7 2. System generation options 8

3. System programming and vendor support requirements. 9

B. Operating Considerations

1. Normal startup and data collection procedures ... 10

2. System failure and lost-data procedures 12

III. Description of SMF Files

A. Structure of SMF Files

1. Online log collection files 15

2. Dumped log files 15

B. Structure of Records

1. General discussion 15

2. System records 17

3. Job step records 18

4. Data set records 20

C . Da ta El ements

1. Symbolic names and formats 21

2. Sources and precision 22

vii
IV. Design of SMF

A. Components of SMF

1. Batch programs '25 2. User-written exit routines 26

3. SMF recording modules 28

4. SMF data collection modules 31

5. Data-collection code within OS modules 36

6. The SMF initialization program 39

B. Interfaces Between SMF and OS 40

C. Internal Flow of Data Within SMF

1. Job Accounting Control Table 42

2. Step Accounting Control Table 44

3. System Management Control Area 46

4. Job Management Record . ,' 48

5. Timing Control Table 50

6. Timing Control Task Input/Output Table 52

7. Table Interconnections During Job Step Execution . 54

8. Other SMF data sources 56

V. SMF and Performance Measurement

A. General 57

B. Human Resources 59

1. Tape mounts 60

2. Disk mounts 60

C. Hardware Resources

1. CPU time .61

2. Main storage 62

3. Direct-access storage 64

4. Channels 65

5. I/O devices 66

6. Media 69

7. Volumes 69

8. Shared DASD 70

D. Software Resources

1. Device allocation 71

2. Data set names 72

3. Transient areas 72

4. System catalog 73

5. Work queue 73

6. Initiators 74

7. Spool/HASP 74

8. Communications task 76

9. The SMF writer 77

VI. Summary and Recommendations 79

viii
Appendix A: Summary of Job Management 85

Appendix B: Summary of Task Management 87

Appendix C: Summary of Data Management 93

Appendix D: Symbolic Names and Sources of Data Elements . . 96

Notes on the Table of Symbolic Names in SMF . . 128

Appendix E: IFASMFR Macro Expansion 131

Appendix F: Removing SMF from OS/MVT, Release 21.6 154

Appendix G: Chained Scheduling and EXCP Counting 155

Appendix H: Glossary of Acronyms 158

Appendix I: Bibliography I60

ix

I. Introduction to SMF Concepts

A. General Overview

1. Purpose and background of SMF

The purpose of SMF, as stated in the IBM manual (<3>), is to

"provide the means for gathering and recording information that

can be used for billing customers or evaluating system usage."

The need for such d at a- ga t her i ng facilities arises directly from

the fundamental concept of t h i rd- gener at i o n computer

architecture, namely, the sharing and concurrent use of diverse

resources by several jobs running independently under the control

of an operating system. During one second of operation, the

central processing unit (CPU) of a large-scale, modern computer

may perform calculations for several jobs and also spend some

time idle, while the channels simultaneously move data to and

from disks, tapes, card readers and printers on behalf of several

other jobs. The only way to account for the costs of individual

jobs in such a system is to have the supervisory program keep

track of how much of each resource it dispenses to each job, and

for how long. Actually, since the natural unit of program

execution is the job step, most resources are accounted for on a

j ob step basi s

.

The accounting capabilities of the IBM 360 Operating System

have evolved from release to release along with most other OS

functions. Initially, all that was provided was an exit to an installation-written accounting routine at the end of each job

step and at the end of each job. This routine was given

relatively little information about the resources requested by

the job or job step, and almost none about the amounts actually

used. Many large-scale 360 users found the accounting exit

inadequate, but their discontent with this and other aspects of

OS was alleviated somewhat with the appearance of HASP. This IBM

field-developed spooling package supplemented the operating

system in the area of job queuing as well as in operator

communication and storage of output awaiting printing or punching. Because of the way that HASP insinuated itself into

control of functions normally reserved for the operating system,

it provided a convenient "window" on resource allocation at a detailed level. Modifying HASP or adding code to it was easier

than interfacing directly with OS, so many installations came to

rely on HASP as their major source of accounting data. Still,

there were many areas in which HASP could supply little

information. Perhaps the most important of these was the use of

space, both in main memory and on direct access storage devices.

As installations accumulated experience with

t h i rd- gener at i on systems, they became increasingly interested in

improving throughput and turnaround by using the many control

options available to operators and system programmers. But

before they could improve their performance, they first had to be

able to measure it. Thus there arose another more stringent

requirement for the system to make available quantitative

1
information, not only on the use of resources by jobs, but also

on its own behavior. Ideally, such data could be displayed

dynamically in a form enabling the operator to eliminate

bottlenecks and maximize the system's performance.

In response to these different but related demands, IBM made

the SMF option available in Release 18 of OS. Many of the

properties of SMF which are discussed in detail later in this

report, properties observed in shops using SMF and confirmed by

the analysis and validation experiments, were predictable from

the history of its development. It was added to the operating

system as an afterthought, not designed into it from the start.

It had to be compatible with the old step-end accounting exit.

For economic reasons, it could not involve any major redesign of

OS, nor add significantly to the system's overhead. Under these

circumstances, it is remarkable that SMF comes as close as it

does to satisfying the requirement for collection and recording

of data on which a reasonably fair and repeatable assignment of

costs to jobs can be based.

As a case in point, the amounts of CPU time reported by SMF

as being used by two job steps performing identical calculations

on the same hardware may differ by more than 25%. The main

reason for this is that the overhead of supervising input/output

operations is distributed randomly over all jobs in the system

rather than being charged to the jobs which originate the I/O.

Technically, this happens because the I/O Supervisor fails to

turn off the task timer immediately after an I/O interruption.

Historically, it happens because SMF uses the job step timing

facility of OS, which was originally designed to detect and

automatically cancel any program which took more CPU time than

its user estimated it should need. For that purpose, a 25%

variability is obviously acceptable. For performance

measurement, something better is needed; this often turns out to

be a hardware monitor (<16>, <18>).

As a tool for overall system tuning, SMF is even more

severely limited, although some use can still be made of it

(<14>, <15>). The major limitation of SMF for performance

evaluation is that it provides next to no information on OS

overhead. Another limitation is its failure to record

significant operator actions such as mounting disks and tapes or

resetting the time-of-day clock. Again taking CPU time as an example, the OS SMF manual suggests using the relationship:

System time = Elapsed time - (Wait time + Total job time)

to compute the CPU time spent performing system tasks. The

trouble with this method is that both elapsed time (determined

from time stamps on the SMF records) and wait time can be

rendered meaningless by operator actions like resetting the clock

or stopping the system temporarily, actions which are not

recorded by SMF.

2
In general, if SMF data is accumulated over a long enough

time span to average out anomalies due to operator actions and

system failures, it can provide a qualitative picture of

performance and reveal chronic weaknesses in the configuration of

the system. The shorter the time span, the less reliable SMF

data is for performance evaluation. For locating transient

bottlenecks or tuning the system dynamically to its workload, SMF

is essentially useless.

2. Outline of SMF capabilities

The principal functions provided by SMF are:

* collection of data on system performance;

* collection of data on use of resources by jobs

and j ob steps ; * collection of data on creation and use of data sets;

* organization of such data into records of various types;

* writing of these records onto data sets on disk or tape;

* backing up ("dumping") of these data sets to archival

storage ; * execution of installation-supplied routines as components of the operating system at specific

times during processing of each job;

* communication with the operator concerning these

activities.

The principal function not provided by SMF is the production

of reports based on analysis of the data which it collects and

records. Each installation must separately acquire or devise its

own analysis and reporting tools.

Whether SMF is included in the system at all is the

installation's option at the time the system is generated from

the materials distributed by IBM. The first stage of this system

generation (Sysgen) process consists of the specification of a large number of symbolic parameters in mac ro i n st r uc t i o ns which

are expanded by the 360 assembler into control statements; in

the second stage, these control statements determine the

selection of optional OS components from IBM's menu. The

specific parameters pertaining to SMF are discussed below in

section II. A. 3.

Once SMF is included in the operating system, the

installation has many options at its disposal, such as classes of

data to be collected and recorded, size of SMF data sets and

buffers, and execution of user-written SMF exit routines. SMF

exits are discussed further in section IV. A. 1 below. Various SMF

options are controlled by specification of parameters in the

member SMFDEFLT of the system library SYSl . PARML IB . If the

parameter OPI=YES is specified in SMFDEFLT, the operator is

allowed to modify the other SMF parameters each time the system

is loaded. The major options available here are to limit or suppress the recording of SMF data.

3
SMF collects performance data at system, job, and job step

levels. The system performance data collected by SMF includes

the time of each IPL, a list of devices online at IPL time, the

address of each device varied online or offline, the amount of

free space on each direct-access volume online and ready at IPL

time, and magnetic tape error statistics. The time spent by the

CPU in the wait state is accumulated over 10-minute intervals and

recorded in the SMF data set somewhat less often. Not included

in the SMF system performance data are such desirable items as CPU time used by specific system tasks, usage counts for OS

modules, lengths of internal system queues, I/O counts for system

data sets such as SYSl.LINKLIB and SYSl.SVCLIB, the reason for

each IPL, and a record of the request for and performance of each

volume (tape or disk) mount.

The data collected by SMF on the use of resources by jobs

and job steps includes the elapsed time, CPU time, main storage

utilization and counts of I/O accesses by device and data set for

each job step. SMF records the time each job is read into the

system, the time it is enqueued for execution, the time it is

selected for execution, and the total CPU time it uses. Whenever

a device is brought online specifically to satisfy the allocation

requirements of one particular job step, a special SMF record is

written identifying the device and job step involved. In systems

without HASP, where spooling of output to be printed or punched

is handled by OS itself, SMF provides the number of records

written per form number and output class for each job.

The CPU time figures recorded by SMF are subject to

variability, as mentioned above. The usefulness of the I/O

counts ranges from near zero for graphics terminals and

teleprocessing lines to a high level for sequential files with

fixed block sizes. Under the newer MVS operating system, even

this limited usefulness is severely impaired by the introduction

of variability into the I/O counts for most sequential

processing. The main storage figures reported are satisfactory

for cost accounting but inadequate for performance analysis,

since storage fragmentation or "checkerboarding" is not revealed

by the SMF data.

Complementary to the dynamic use of resources by jobs is the

static use of disk and tape storage by data sets. To account for

this service, SMF writes a record every time a user data set is

closed, re-named or scratched. While these records provide

voluminous quantities of information about each data set, they

lack certain features essential to any practicable tape and disk

space accounting system. The most obvious loophole is that a job

can create a data set and reserve any available amount of disk

storage for it with no indication of this in the SMF records

until the first time something is actually written into the data

set. In the meantime the space is unavailable to other users.

Because of this and other deficiencies in the SMF data set

records, few installations have tried to use them as a source of

data for tape and disk space accounting.

4
One positive feature of SMF is its o pen- ended ness . An

installation may design its own SMF records to supplement or

supplant the standard ones, and use the IBM-supplied routines for

recording them via a convenient wel 1 -documented interface. A few

simple fixes to OS and judicious use of exit routines could make

up for many of SMF's shortcomings.

The most common use of SMF exit routines is to enforce

installation standards. Since the user's job control statements

are accessible to certain exit routines, they can check for

validity of account numbers or any other significant parameters.

SMF exit routines have the power to cancel unacceptable jobs, or

to override their parameters to force compliance with standards.

They can also collect additional data on job and system status,

construct supplementary records and have them written to the SMF

data set, and cause messages to appear on the user's printout or the operator's console. Thus the SMF exit points are convenient

places to "hook" OS to tailor it to an installation's

requirements. Even here, however, something needed for

performance analysis is lacking, namely, an exit taken at regular

time intervals to permit sampling of system status. All of the

SMF exits in OS/MVT are triggered by events in the lives of jobs

moving through the system, and thus occur at unpredictable times.

The cost in additional overhead incurred by including SMF in

an MVT system is low compared to the cost of the programming

effort (or software package purchase) necessary to derive

significant benefits from SMF. Besides the data reduction and

reporting functions required for job accounting, exit routines

should be supplied and some changes to OS itself might be

advisable for purposes of operational control and performance

analysis. Major improvements to SMF should not be expected from

IBM, either in MVT or in the v i rtual - storage (VS) versions of the

system. The later releases of VS2 offer a system activity

measurement facility, MF/1, which serves as a software monitor.

Also available in OS/VS is the Generalized Trace Facility (GTF),

whose use in performance analysis is covered in <40>.

B. Methods of Data Collection

1. Internal data collection

Within OS/360, resourcp- related control information resides

in queues representing unsatisfied resource requirements of

tasks, and tables identifying available resources. These queues

and tables are typically composed of control blocks chained

together by pointers. A control bl ock is a contiguous area of

main memory or auxiliary storage containing control information

and pointers to other control blocks. A pointer is simply the

address of some location in main memory or auxiliary storage.

During operation of the system, control blocks are created as needed by various components of OS, or in some cases by

user-written programs. Other modules maintain, update and refer

to the information they contain. When control blocks are no longer needed, pointers to them are erased and the storage they

used is made available for reallocation.

5
As each job moves through the system, control blocks

containing information on its resource usage are thus created,

maintained, and eventually deleted. Such information tends to

migrate from one control block to another as time goes by. The

basic method used by SMF to collect its data is to construct

records in a buffer in main memory by piecing together fields

derived from various system control blocks. These records are

then written onto the SMF data set on disk or tape, provided that

their writing has not been suppressed by the installation and

that data set space is available. In the MVT version of OS/360,

there are 20 types of basic SMF records, containing different

collections of data elements derived from a wide variety of

sources. The record types are discussed below in section III.B.

The data elements are tabulated in Appendix D, followed by more

detail on some of the most significant data elements. A

discussion of the variability of CPU time and EXCP counts is

presented in the summary section. Section VI.

2. External data collection

The external sources of SMF data are:

* JCL and commands from incoming job streams;

* commands and replies entered through the operator's

consol e( s) ; * member SMFDEFLT of the system parameter 1 ibrary

SYSl. PARMLIB ; * data set and volume labels; and

* the system control panel, especially the LOAD and

STOP keys.

Most of the information derived from these sources is

converted by the operating system to an internal representation

as part of some control block. It is then captured by internal

SMF data collection routines and scheduled for recording as outlined in the previous section. Only two of the above sources

are specific to SMF; all the others are converted to internal

form as part of the normal operation of OS, e.g., reading and

interpretation of incoming job streams.

The two SMF-specific external data sources are the SMF

options and the SWITCH command. The SMF options are initially

read from SMFDEFLT at IPL time, and may be modified or corrected

by operator responses to messages from OS. In this case, the

conversion to internal form is performed by components of SMF

itself. While the SWITCH command does not have any parameters to

be converted and collected as data, it does cause a special SMF

record to be written, as well as a switching of SMF data sets.

6
II. Installation and Operation of SMF

A. Installation and Maintenance of Software

1. Hardware requirements

Since SMF is a component of OS/360, it requires at least the

hardware needed to support that system: specifically, an IBM 360

or 370 mainframe, having enough processor storage to accommodate

the OS nucleus. System Queue Area (SQA), and link pack area, with

storage left over for concurrently executing job steps; the

mainframe must be connected through its channels with at least

one direct-access storage device. In the special case of Model

65 Multiprocessing, the M65MP option of OS/MVT, two mainframes

can be used with SMF. For details see <9>, <22>, <23> pp.

91-93, <24> Appendix D, and primarily <25>.

The OS SMF manual (<2>) states that the additional main

storage required for SMF in the resident nucleus of an MVT system

Is 1700 bytes. The amount of storage used by SMF in the SQA

varies dynamically with the workload. Of this amount, the part

consisting of the SMF buffer and the System Management Control

Area (SMCA) is fixed in size at IPL time. The SMCA occupies 124

bytes, and the SMF buffer takes at least 400 bytes; values like

1400 or 2800 bytes are more representative of the buffer sizes

likely to be used to avoid spanning of records and to optimize

use of d i rect- access space on various devices. The variable part

of the SQA requirement is the space for a Timing Control Table

(TCT) for each active job step in the system. If only job

accounting is requested, by specifying 0PT=1 in SMFDEFLT, each

TCT takes 96 bytes of SQA space. If 0PT=2 is specified to

request job-step accounting, then each TCT is augmented by a Timing Control Task Input/Output Table (TCTIOT) whose size

depends on the number of DD statements and the number of units

allocated for the job step. The formula given by <2> for TCT

size with 0PT=2 is

TCT = 112 + 12*a + 8*b

where "a" is the number of DD statements and "b" is the number of

units, counting each unit as many times as it was allocated to

data sets in the job step.

Further requirements for SQA space depend on the presence

and characteristics of user-written exit routines. When such

routines are included in the system, the region sizes for the

Re ader/ I n terpreter and Initiator/Terminator and the size of the

link pack area must be increased to accommodate them.

The OS SMF manual would seem to imply that a system with SMF

must have at least one tape drive, since the SMF data set{s) must

either be allocated on tape or dumped from disk to tape

periodically. This is not strictly true, however, since private,

removable disk packs can be used in place of tapes as the media

to which the SMF data is dumped. What is required, assuming

7
SYSl.MANX and SYSl.MANY to be on a Direct Access Storage Device

(DASD), is that these data sets be allocated sufficient space on

a volume or volumes mounted prior to IPL on a device or devices

v/hich must be online and ready during IPL. If two devices are

used, they must be of the same type. Any device used for SMF

data recording becomes permanently resident at IPL time; this

means that the volume on that device cannot be dismounted.

The amount of DASD space to be allocated to the SMF data

sets depends so completely on the installation's workload

characteristics and archiving strategy that no meaningful

estimate can be given here. However, a detailed example of how

to arrive at an estimate, given realistic assumptions about the

frequencies of such events as IPL's, VARY commands, job

submissions, and step terminations, can be found in <2>, Table

12. The additional space required for system libraries amounts

to six 2314 tracks, a quite negligible fraction of the thousands

of tracks commonly devoted to these libraries ( S YS 1 . L I NKL IB

,

SYSl.SVCLIB, SYSl. NUCLEUS and SYS 1 . PARML IB )

.

Altogether, the hardware requirements of SMF are modest and

should not strain the resources of any OS/MVT installation.

About the only way to create a noticeable impact would be to

allocate the SMF data set on tape, thereby in effect reducing by

one the number of tape drives available on the system's

configuration.

2. System generation options

To include SMF in the operating system, certain parameters

must be specified at the time the system is generated. Also,

some optional features of SMF require action by the system

programmer at this time if they are to be usable later.

In the SCHEDULR macro instruct ion, coded as part of the first

stage of system generation, the prospective SMF user must:

* specify ACCTRTN=SMF;

* specify ESV=SMF if error statistics by volume are

desired, i.e., if a Type 21 SMF record is to be

written each time a user data set on magnetic tape

is closed or processed by e nd- of - vol ume

;

* increase the value of the JOBQLMT parameter by 2 to

allow work queue space for two extra SMF messages;

* increase the value of the MINPART parameter to provide

sufficient main storage space for as many of the

user-written exit routines (lEFUJI, lEFUSI and

lEFACTRT) as are supplied.

8
In the SUPRVSOR mac ro i n st r uc t i o n , also part of stage I Sysgen, the SMF user must:

* specify T IMER=JOB STEP ; and

* specify RESIDNT=ACSMETH to make certain access

method modules resident in main storage.

The BSAM modules IGG019BA and IGG019BB must always be

resident for SMF. If SMF data is to be recorded on magnetic

tape, modules IGG019BD and IGG019CC must also be resident. If

the SMF data sets are allocated on DASD, the module IGGG19CD must

be resident; if the device is one having the Rotational Position

Sensing (RPS) feature, e.g., an IBM 3330, the modules IGG019CJ

and IGG019FN must also be resident. To improve performance of

systems with SMF, module IGC0008C (the first load of SVC 83)

should be made resident. If data-set information is requested

{DSV=2 or 3) then the modules IFG0202H and IFG0202I should also

be made resident; they are called to build a Type 14 or 15 SMF

record whenever a user data set is closed or processed by EOV.

User-written routines such as SMF exits should be

link-edited into the distribution library SYS1.CI505 before the

system generation process is begun. For detailed information on system generation, refer to <9>.

3. System programming and vendor support requirements

a. System programming requirements

SMF requires very little direct maintenance in that there

are few problems with the components and few new features. The

system programming time required to implement SMF is almost

entirely spent either setting up operating procedures for

archiving the SMF data or developing programs for the analysis of

the data. The operating procedures are a one-time expenditure

that, if conscientiously done, will need very little maintenance.

The analysis programs, on the other hand, can require as much

time as an installation is willing to commit. Several software

packages that provide reports from SMF data are currently on the

market

.

b. Vendor support

SMF is fully integrated into the operating system and

supported as Type I programs. IBM-developed PTE's (Program

Temporary Fixes) are available in SMP format (<34>) starting with

release 21.8. Outstanding SMF APAR's (suspected bugs) are listed

in the OS Early Warning microfiche TNL S2C0-0149.

9
B. Operating Considerations

1. Normal startup and data collection procedures

a. General discussion

SMF records can be written on magnetic tape or on disk. If

tape is chosen as the first storage medium for SMF records, the

file simply remains there for further processing. If the SMF

records are to be written on disk, however, two data sets must be

provided: SYSl.MANX, the primary SMF data set, and SYSl.MANY,

the alternate SMF data set. SMF adds records to one of these

files (beginning with SYSl.MANX) until the file is full. At this

point, SMF notifies the operator that the currently active data

set should be dumped, and switches automatically to the other

one. If the reserve data set is also full, recording of SMF data

is suspended until an empty data set is available to receive it.

Dumping an SMF data set to tape requires submitting a job to

execute the IBM-supplied SMF dump routine (IFASMFDP); the

operator could do this via a START command- Rather than waiting

for the active SMF data set to fill up and cause an automatic

switch to the reserve data set, the operator can force switching

to the reserve by means of the SWITCH command.

Magnetic disk is the storage medium most frequently used for

the purpose ascribed to it above; but, in fact, any DASD can

serve as the first repository for SMF records. Furthermore, when

the occasion of dumping the direct-access file arises, the file

may be dumped not only to tape, as described above, but,

additionally or alternatively, to another DASD or almost any

other medium. For further discussion of the post-dump storage of

SMF records, see III. A. 2 "Dumped log files" below.

Frequent use of the swi tch-and-dump procedure described

above is liable to create operational problems, since the

operator must submit (or start from the console) the proper one

of two possible jobs: one that dumps SYSl.MANX and one that

dumps SYSl.MANY. To simplify the swi tch-and-dump procedure and

reduce the likelihood of human error, some installations (<8>)

have modified SMF to start the proper dump job automatically

whenever a switch takes place, rather than asking the operator to

do so. Another approach is to have the dump job first dump the

primary, then simulate console entry of a SWITCH command to

resume recording in the now-empty primary, and finally dump the

alternate. Using this scheme, very little space would be needed

for the alternate data set.

b. Normal IPL procedure

At startup (IPL) time, the operator may receive a console

message asking him to correct or redefine the SMF parameters read

by the system from member SMFDEFLT of S YS 1 . PA RML I B . This will

happen if one or more parameters are improperly specified, if a required parameter is omitted, or if the parameter OPI=YES is

present. If the unit and volume to be used for the SMF data

10
set(s) are not defined in SMFDEFLT, if the data set is not

allocated on the specified device, or if the device is

unavailable, a message is sent to the operator warning him that

the SMF function is disabled. Otherwise, the system opens the

SMF data set(s); this action may cause one or two expiration

date override messages, to which the operator should reply 'U'.

Expiry date protection of the SMF data sets (and any other

valuable files in the system) is recommended to prevent

inadvertent or malicious destruction of their contents.

If both SMF data sets on direct-access storage contain data,

the operator will receive a message requesting him to dump the

one with more data in it. Meanwhile, SMF recording will begin on the other data set. If only one data set is non-empty, it is

selected for recording; if both data sets are empty, the primary

(SYSl.MANX) is selected. In any case, a console message tells

the operator where the SMF data is being recorded.

Since speed is usually of the essence during IPL, the

interaction of the operator with SMF should be minimized by the

following procedures:

(1) Allocate the SMF data sets on drum or permanently resident disk.

(2) Once the SMF IPL parameters have been debugged,

shut the operator communication option off by

setting CPI=NO in SMFDEFLT. This procedure

also insures uniform collection of data.

e. Normal data collection

In order to protect against accidental loss of data due to

full SMF data sets and decrease exposure to hardware failures,

the following procedures may be used:

(1) Regularly perform the SMF dump function as a part

of normal operations, either at the beginning of

each shift or at a particular time each day.

Performing this function on a regularly scheduled

rather than a demand basis will improve the

reliability of data collection.

(2) Assign the responsibility for SMF data collection

to someone other than a computer operator.

This insures that the process will not be

overlooked during a period of heavy system

activity.

(3) Produce printed reports from the collected data

for delivery to installation management or for

use in daily operations.

11
A data collection procedure that minimizes both disk storage

requirements and exposure to hardware errors is:

(1) Allocate enough space in the MANX data set to collect

records for the collection period plus a substantial

margin for growth. This space estimate can be checked

from time to time by listing the VTOC for the data set

immediately prior to dumping and then examining

the last TTR pointer to determine the high water mark.

Only a minimum of space is allocated to the MANY

data set, to allow for a few hours' data collection.

(2) At the beginning (or end) of each shift (or each day),

the operator issues the SWITCH command and starts the

MANX dump from the console. When that dump completes,

the operator issues another SWITCH command and starts

the MANY dump.

(3) The operators are instructed to consider any forced

switch as a serious problem and immediately start the

MANX dump and report the occurrence of the event to

the systems maintenance staff.

(4) The MANX and MANY dumps run from disk to disk with

each one allocating an output data set on resident

work volumes. Following successful emptying of the

collection data sets, the intermediate data sets can

be copied to backup and archive files. Care must

be exercised when setting up the JCL for these

processes, since there is no way to recapture data

that is accidentally scratched or is written

on a bad device.

One method of decreasing the risk of I/O errors is to create

two or more copies of the collected data or the merged archive

file. This is particularly desirable when the data is moved to a more volatile medium, such as tape. Before scratching the

intermediate disk data set, then, two copies of the data should

be made--for example, one tape copy of the two intermediate files

concatenated together, and a week-to-date merged file. Once all

copies are complete, the intermediate data sets can be deleted

for the next dump process.

2. System failure and lost-data procedures

Some provision has been made in SMF for recovery from errors

in other components of OS, both hardware and software, and even

from a catastrophic failure of the entire system. For example,

after each block is written to the SMF data set, a temporary

CLOSE is performed to place a recognizable end-of-file marker in

the data set immediately following the last block. This

precaution keeps the loss of data due to most system crashes to

at most one block of records. Without careful planning by the

user, however, significant losses are still possible. The worst

12
case is obviously that of a mechanical failure causing physical

damage to the storage medium on which the SMF data is being

recorded. Loss due to this type of accident can be minimized by

using fairly small SMF data sets on disk and dumping them

frequently. However, as discussed previously in section II.B.l,

this strategy increases the risk of operational errors.

If it becomes impossible to record SMF data because the

currently active data set is full and the reserve data set is not

empty, SMF suspends writing of records but continues to generate

them internally and tallies the number not written. When the

reserve data set becomes available, SMF resumes writing,

beginning with a Type 7 (Data Lost) record that tells how many

records were generated but not written during the hiatus. This

situation may arise because of some difficulty in dumping the

reserve data set, e.g., the dump job terminates abnormally and

the operator fails to notice it. It should be observed that if

an IPL were to occur just before the active data set overflowed,

and if the alternate were only, say, half full but was scheduled

to be dumped because of a SWITCH command, SMF data would start

being recorded in the alternate after the IPL. This would

definitely cause records to appear out of sequence in the dumped

SMF data; it could also lead to the attempted dumping of an SMF

data set while records were being written into it by the system.

The IFASMFDP program, however, refuses to dump the active data

set

.

The situation just outlined in which a disk-to- tape SMF dump

job survives an IPL and attempts to dump the wrong data set is

only one of a variety of pathological cases that can be avoided

entirely by writing the SMF records directly on tape in the first

place. Proper chronological sequencing of the records is then

guaranteed. There are, however, several drawbacks to this

approach. First, it requires dedicating a tape drive full-time

to a function which is not directly productive. Second, its

future potential is limited, since the OS/VS version of SMF

requires the use of direct-access storage for the SMF data sets.

Third, it is quite vulnerable to I/O errors on the tape, since

the response of the SMF writer to a permanent I/O error is to act

as though no more space is available for writing SMF records.

Another potential trouble area is failure of the access

method routines which are used to write records to the SMF data

set. In case of an ABEND (software failure) in one of these

routines, the SMF writer suspends further movement of jobs

through the system (see section IV. B. 2 below) while it sends a message to the operator asking his permission to continue with

SMF recording disabled. (The alternative is for the operator to

take a system dump to aid in analysis of the failure.)

b . Ty pe s 0 f f a i 1 ur e

Several classes of failures affect SMF data and its

collection; they fall into three general categories: software

failures, hardware failures, and operational errors.

13
i. Software failures

The failure of the system software components responsible

for collection of SMF data will generally cause failure of the

operating system itself and require an IPL. The net result of

such a failure is incomplete data since many job steps in

progress will not complete and termination records will not be

written. It is possible with some failures to bring the system

to an orderly shutdown and thereby collect some of the SMF data

using the procedures outlined in section II.B.l above.

i i . Ha rdwa re failures

These failures, if not correctable by the operating system,

are either CPU or channel failures that bring the operating

system down or device failures affecting the SMF data sets. If

the operating system is stopped due to hardware failure, the data

on steps in progress is lost. Simple I/O errors on the SMF data

sets will normally result in the loss of SMF records, but loss of

the SMF data sets may be considered severe enough by the

installation to force shutdown of the operating system.

iii. Operational errors

Whenever there are hardware or software failures, a few SMF

records may be lost, but operational errors can destroy or

invalidate a whole day or shift worth of data. Proper procedures

and operator training are essential if the SMF data set is to be

consistently usable.

A common operator error is improper system shutdown.

Whenever the operation of the system is terminated, whether due

to some type of failure or simply a weekend, all never-ending

tasks such as HASP should be stopped and a HALT command issued to

complete writing of records.

The careful use of the set clock command must be enforced,

since much analysis of SMF data is heavily dependent upon the

accuracy of the system clock.

14
III. Description of SMF Files

A. Structure of SMF Files

1. Onl ine 1 og col 1 ecti on f i 1 es

SMF records are v ari abl e- 1 ength , blocked, and spanned. In

this format, data is stored in physical records called "blocks",

each of which may contain one, more than one, or part of one

logical record. Each block begins with a Block Descriptor Word,

in which is stored the length of the block. The rest of the

block consists of one or more segments. Each segment starts with

a Segment Descriptor Word, which contains the length of the

segment and a code indicating whether the segment is a complete

logical record or is at the beginning, middle, or end of one.

The types of records, if any, to be written in the SMF data

sets are controlled by the values of the parameters in member

SMFDEFLT of data set S YS 1 . PA RML I B . If SMF as well as user

records are to be written (parameter MAN=ALL), the first record

in the original (pre-dump) SMF file for each run (where "run"

denotes a period between consecutive IPL's) will be a Type 0

(IPL) record.

2. Dumped log files

Dumped log files are much the same as the original online

files, except that each file is preceded by a Type 2 (Dump

Header) record and followed by a Type 3 (Dump Trailer) record.

There are many ways to provide for the long-term storage of

SMF data. Among these are:

a. generation data group on disk or tape (<1>, <6>, <7>);

b. consecutive files on unlabelled tape (<7>);

c. addition of data to the end of a disk or tape data set

by use of a D I SP= ( MOD , KE EP ) parameter in the

JCL for the dump (<7>). Note that in this case,

the Type 2 and 3 records actually serve a purpose: they delimit consecutive dumps.

B. Structure of Records

1. General discussion

Each SMF record generated by the IBM-supplied routines

begins with a standard 18-byte header, including the four-byte

Segment Descriptor Word mentioned in section III.A.l above. The

OS SMF manual (<2>) recommends that records produced by

user-written routines should also include this standard header.

Its format is as follows:

15
Decimal Hex Field Data Description

Offset Offset Size Format of Contents

0 0 2 B i n ary Record length in

bytes

2 2 2 Bi nary Segment control

code

4 4 1 Bi nary Header flag byte

c0c0 1 D 1 n d ry

6 6 4 B i n ary Time in lOOths of

seconds

10 A 4 Packed Date as OOyydddF

14 E 4 EBCDIC System & model

identifier

The segment control code has the following possible values

and meanings (values given in hexadecimal):

Va 1 ue Me an i ng

0000 Complete logical record, not segmented

0100 First segment of a multisegment record

0200 Last segment of a multisegment record

0300 Intermediate segment of a multisegment record

The header flag byte is always binary zeroes for OS/MVT; it is

reserved for use with VS. The record type is an eight-bit,

unsigned binary number; values 0 through 127 are reserved for

records generated by IBM-supplied routines, while numbers 128

through 255 are available for identification of any additional

record types created by a particular installation.

OS SMF writes 31 types of records, with numbers ranging from

0 to 42. Type numbers 16, 22 through 29, 36, 37 and 39 are

unassigned. Records numbered 30 and above are produced only in

systems with the Time-Sharing Option, and will not be discussed

in this report. Record Type 13 is peculiar to OS/MFT or OS/VSl;

since this report is confined to OS/MVT systems, discussion of

record Type 13 is also omitted. The remaining 20 types, which

are referred to in this report as "basic SMF records," can be

grouped into system records, job step records and data set

records. These are discussed in turn in the following sections.

16
2. System records

The system records are those SMF records containing only

data elements describing some change of status in the operating

system or the underlying hardware. Each of these will be

mentioned briefly in this section; for a detailed presentation

of the data elements contained in each record, refer to Appendix

D.

The Type 0, or I PL , record is produced at I PL (Initial

Program Loading) time, i.e., each time the system is started or restarted. It contains the maximum job wait time value and the

SMF options derived from member SMFDEFLT of SYSl . PARML IB , as well

as the hardware-defined main storage size in kilobytes. Its time

stamp serves to identify the start of a sequence of SMF records,

and the beginning of a period of availability of the system to

its users.

The Type 1, or Wa i t Time , record contains only one four-byte

field beyond tTie 18-byte standard header. It gives the amount of

time the CPU spent in the wait state during one or more

ten-minute intervals of elapsed time.

As mentioned previously the Ty pe 2 (Dump He ader

)

and Ty pe 3^ (Dump Trail er) records are produced by the SMF Dump program and

serve merely to delimit the output of the dump. These records

each consist only of the standard header, with no additional

data.

The Type 7, or Data Lost , record is produced when SMF

recording begins again following a period of time during which no output data set was available. This record tells when the hiatus

in SMF recording began and how many records were lost; through

the date/time stamp in its standard header it also tells when the

hiatus ended.

The Ty pe 8, or I /O Configuration , record consists of the

standard header plus one four-byte entry for every device on line

at IPL time. The entry gives the device class, unit type,

channel address and unit address.

The Type 2> or VARY ONLINE , record identifies the system

resources being added To TFe configuration by a VARY ONLINE

command. In addition to the standard header, it contains one

four-byte entry for each CPU, channel, I/O device or core box

brought onl ine.

The Type 1

1

, or VARY OFFLINE , record is identical to the

Type 9 except that the resources it describes ' are being removed

from the configuration rather than added to it.

The Type 12 , or End- of-Day , record is written whenever a HALT EOD or SWITCH SMF command puts an end to recording of data

on the currently active SMF data set. Apart from the type

number, this record is identical to the Wait Time record.

17
The Ty pe 1

9

, or Pi rect-Access Vo 1 ume , record provides space

information for a direct-access volume wh i c h is mounted on a unit

that is online and ready. It contains the volume serial number,

VTOC address, owner identification, device type, number of unused

alternate tracks, number of unallocated cylinders and tracks,

size of the largest free extent, number of free extents, channel

and unit address, and module identification for the 2314 and

3330. At IPL time and at the time a HALT or SWITCH command is

processed, one Type 19 record is produced for each online, ready

d i rect- access unit. When a user volume is dismounted, a Type 19

record is written for that volume only.

The Ty pe 21 , or Error Stati st i cs by Vol ume , record is

written whenever a user data set is processed by End- of-Vol ume

,

provided the ESV=SMF option was selected during system generation

(see II. A. 3 above). It provides statistics on temporary read and

write errors, start I/O's, permanent read and write errors, noise

blocks, erase gaps and cleaner actions. It also gives the

channel and unit address and the four-byte UCB type field for the

device, the recording density and serial number of the volume,

and the block size of the data set being processed.

3. Job step records

Under this heading are listed the SMF records which describe

the usage of resources by a particular job or job step.

The Type 4, or St e p Termi nation , record is written at the

end of each job step to .^ecord such resource-related data as elapsed time, CPU time, main storage allocated and used, number

of Sysin records, I/O devices and EXCP counts. The job is

identified by the job log number, which consists of the

eight-byte job name taken from the JOB card and the eight-byte

date/time stamp provided by the OS reader when it recognized the

JOB card. The step within the job is identified by the

eight- byte user identification field from the exit routines'

common parameter area, the step number, and the eight-byte step

name taken from the EXEC card. Also to be found in the Type 4

record are the step completion code, the dispatching priority,

the name of the program specified in the EXEC statement, the

device allocation time, and the accounting data, if any, from the

EXEC card.

The Ty pe 5^ or Job Termi nati on , record is written at the end

of each job to summarize its resource usage. This record

includes the start and stop time for processing of the job by the

Reader/ I nterpreter , the job initiation time and date, the number

of steps in the job, the number of card-image records in "DD *" or "DD DATA" data sets, an indicator of which Sysout classes were

used by the job, a c hec k po i nt/ r est a rt indicator, the device class

and unit type of the reader device, the storage protect key, and

the total CPU time used by the job. To identify the job, the job

log number is accompanied by the user identification from the

common parameter area, as well as the priority, input class,

programmer name and accounting fields from the JOB statement.

18
The completion code for the last step of the job which was

actually executed is augmented by a job termination indicator

byte, which reveals whether one or more steps of the job

terminated abnormally, and whether the job was cancelled by one

of the user-written SMF exit routines.

The Type 6^, or Out put Wr i ter , record is written when a writer has finished processing a Sysout class or a form within a class, for each job in the system. The job is identified by job

log number and user identification field, the writer by Sysout

class and form number. The Type 6 record includes the date and

time the writer began processing this job, the number of records

written per form number and class, an I/O error flag, and the

total number of data sets processed by the writer for this job.

The Type 10 , or Al 1 oc at ion Recovery , record is written

whenever special action involving operator intervention succeeds

in making a previously offline device available for allocation to

a job step that needs it. A typical example of allocation

recovery would be a sort/merge step requesting several large work

files on separate direct-access devices, at a time when only a couple of drives have packs up containing much free space. The

system sends a message to the operator asking for one of four

replies:

* "WAIT" - this tells OS to suspend initiation of the

sort/merge step until some other job step terminates,

possibly freeing enough disk space to permit allocation.

* "NOSEP" - this tells OS to try to satisfy the sort step's

space needs, ignoring the requirement that the work

files be on separate devices.

* "CANCEL" - this tells OS to cancel the sort/merge job.

* A device name - this tells OS to bring the device

specified by the three-character channel and unit

address online (if it was offline originally), and

then retry the allocation. To facilitate this

response, the system accompanies the original message

with a menu of devices that are currently offline.

If the last of these four possibilities results in

successful allocation, a Type 10 record is written, identifying

the device brought online by device class, unit type and device

address. The job log number for the job requesting allocation,

and the user identification field are also given in the Type 10

record. If allocation recovery was for a system task rather than

a job step, the job name and user identification fields contain

blanks and the job entry time and date fields contain binary

zeros. Type 10 records also have the usual date/time stamp and

CPU identification.

19
4. Data set records

These records, containing information on all tape or DASD

data sets that are explicitly created, read, updated, extended,

rewritten, scratched, or renamed in a user job step, are produced

by SMF, provided DSV=2 or DSV=3 is specified in SMFDEFLT. While

the EXCP counts in the step termination records reflect I/O

activity per device for each job step, the data set records go

beyond this to permit analysis of I/O activity by data set as well. Like the job step records, the data set records identify

the job to which they refer by the job log number, consisting of

the jobname, entry time and entry date. Most of them also

contain the 44-character symbolic name (DSname) of a specific

data set.

The principal data set records are the Type 14 , or CI ose/ EOV

I n put , record and the Type 1

5

, or CI ose/ EOV Out put , record.

These records are identical in format, structure, and function,

differing only in the type number, which is 14 if the data set

being closed or reaching end- of- vol ume was opened for input or

read-backwards, or 15 if the data set was opened for output,

update, input followed by output, or output followed by input.

For brevity's sake, these records will be referred to

collectively as "the Close/EOV records" in further discussion.

They are the largest SMF records, ranging in length from a minimum of 288 bytes (316 for indexed sequential data sets) up to

a maximum of 6412 bytes. For each unit beyond the first

allocated to the data set, 24 bytes are added to the Close/EOV

record; thus, the maximum length corresponds to the highly

unlikely case of an indexed sequential data set occupying 255

volumes. Note that Close/EOV records are not written for "DD *" or "DD DATA" data sets, nor for Sysout data sets. JOBLIB and

STEPLIB data sets also escape observation through Close/EOV

records since they are opened and closed by the

In i ti ator/ Termi nator , not by the job step itself.

The Close/EOV records contain a wide variety of data

elements taken from various control blocks describing the data

set (DCB, DEB, JFCB, TIOT, and L'CB); in fact, the entire JFCB,

comprising all the information from the DD statement for the data

set, is included in the record. (In the case of a data set

occupying more than five volumes, only the first five volume

serial numbers are contained in the JFCB. The JFCB extension,

containing the additional volume serial numbers, is not included

in the Close/EOV record.) The records also contain the EXCP

counts for each unit allocated to the data set. Two points are

worth noting regarding the EXCP counts: first, they are

accumulated on a job step basis, so that if a data set is closed,

reopened and closed again in one step, the EXCP counts in the

second Close/EOV record will include those in the first. The

second point is that a similar situation can arise for multi-reel

tape data sets which are processed at least once by End- of- Vol ume

as well as by Close. If multiple reels are mounted on the same

unit, the EXCP counts for that unit in successive Close/EOV

records will be cumulative.

20
The Type 17 , or Sc ratch , record is written whenever a data

set is scratched. Depending on the number of volumes for the

data set, the length of the record varies from 100 to 2140 bytes.

Besides the job log and data set name, the Type 17 record

contains the number of volumes and the volume serial numbers.

The Ty pe 1

8

, or Ren ame , record is written whenever a data

set is renamed. It varies in length from 144 to 2184 bytes,

again depending on the number of volumes. In addition to the

volume serial numbers, it contains both the old and new data set

names.

Although the Ty pe 20 , or Job Commenc ement , record is

classified as a data set record, it does not refer to any data

set, but resembles the job step records in that it contains

information about a particular job. Its purpose is to correlate

the other data set records with the job accounting fields so that

I/O charges can be distributed to the jobs incurring them even if

a system failure prevents the Job Termination record from being

written. The presence of the Type 20 record also facilitates the

analysis of SMF data when records for one job are split across

two SMF data sets. The Type 20 record is variable length, and

contains the job log, programmer name, user identification,

system and model identification, and the job accounting fields.

C. Data El ements

1. Symbolic names and formats

Appendix D to this report consists of a tabulation of the

individual data elements contained in the basic SMF records. For

each record, this table tells which components of OS construct it

and write it, i.e., issue SVC 83 to have it moved to the SMF

buffer. For each field in the record, other than the standard

record type and length fields, the table gives the symbolic name

assigned by expansion of the IFASMFR ma c ro i n st r uc t i o n , the format

and length (e.g., PL4 for a four-byte packed field), a capsule

description, the external source (e.g., the OS operator), and the

source control block. It should be noted that the macro

definition for SMF record layouts is not included in the OS/MVT

system, but is distributed with OS/VS as member IFASMFR of data

set SYSl.AMODGEN on volume DLIBA2.

The table also identifies the OS components which create the

source control block, initialize the field and maintain the

field. These last two columns (the fifth and sixth in the table)

tell which components initialize and maintain the field in the

source control block from which the data element is derived,

unless the sixth column contains the notation 'N/A'; in that

case, the fifth column tells which OS component initializes the

field in the SMF record itself. This arrangement provides for a precise definition of most of the data elements supplied by SMF.

However, some data elements require more discussion; this

follows the Table of Symbolic Names as a series of paragraphs

that are keyed to the appropriate data elements in the Table.

21
Appendix E to this report is an edited assembly listing of

the expansion of the IFASMFR mac ro i n st r uc t i on , including the

cross-reference. In this listing the fields appear in the same

order as they physically occur in the records, while in Appendix

D the fields are listed alphabetically by symbolic name within

each record. By using these Appendices together, the reader can

find the format and source{s) of any standard SMF data element by

searching either for its symbolic name or the record type in

which it appears.

2, Sources and precision

The sources of most of the SMF data elements are tabulated

in Appendix D, as noted above. For a few of these elements,

further discussion of their derivation is warranted. Also in

this section some of the abbreviations used in the "External

Source" columns of Appendix D are explained in more detail.

Every field whose contents are a date or a time-of-day is

shown in Appendix D as having "OS Operator or TOD Clock" as its

external source. On a 360 system, the date and time-of-day are

maintained by the Timer Second-Level Interruption Handler, using

the hardware interval timer to measure the elapsed time from the

reference value supplied by the operator as part of the IPL

procedure. The precision of the interval timer will be discussed

in the next section; at this point it need only be observed that

the timer is sufficiently precise to make the operator the

primary source of date and time-of-day values. On a 370 system,

the built-in time-of-day clock is used to provide consistent

timing across IPL's and periods of system downtime. This clock

runs when the CPU is in the wait or stopped state or in the

i n st r uc t i 0 n- st ep , single-cycle, or test mode; in particular, it

need not be reset after each IPL.

The interval timer on an IBM System/360 works by

decrementing bit positions 21 and 23 of the fullword at location

80 (decimal) in low memory sixty times a second, based on the

frequency of the AC power lines. Hence measurements made using

this timer have an inherent error of plus or minus 17

milliseconds, approximately, per sample. In addition to this

minimum error, other sources of imprecision may arise depending

on the load on the system. The IBM System/3 60 Pr i nc i pi es of

Operation manual (<21>) states: "Timer updating may B'e omTtted

wh en I /O data transmission approaches the limit of storage

capability, when a channel sharing CPU equipment and operating in

burst mode causes CPU activity to be locked out, or when the

instruction time for READ DIRECT is excessive. The program is

not alerted when omission of updating causes the real-time count

to be lost."

In normal daily operating practice, however, the most

significant source of imprecision in timing values collected by

SMF is operator action. While the CPU is in the stopped state,

the interval timer is not decremented. The SMF records give no indication of when or for how long the operator stopped the

22
system to change disk packs or deal with other routine operating

exigencies. Another problem is the fact that SMF keeps no record

of the operator's SET command, which can be used to reset the

value of the software-maintained time-of-day clock on the

System/360. This can make steps appear to terminate before the

jobs containing them were initiated; such anomalies complicate

the analysis of SMF data.

In Appendix D, the reference to "hardware" as the source of

the real storage size (SMFORST) means that this number is

determined by the Nucleus Initialization Program at IPL by the

use of the hardware feature that checks for use of non-existent

addresses in instructions. By testing progressively higher

memory locations and handling the program check interruption that

eventually occurs, NIP can find the top of main storage and thus

its size.

The contents of the user identification field in the JMR,

which appears in the SMF Job/Step records, are shown in Appendix

D as having "installation standard" as their external source.

This is because that JMR field is intended to be filled in by

user-written exit routines, the most likely candidate being

lEFUJI, the j ob- i n i t i at i 0 n exit.

In the Type 19 record, the SMF19IND field contains a DASD

module identification or drive number obtained from the hardware

as follows: the SVC 78 routine executes a channel program

containing a special sense command, which causes the 2314 or 3330

disk unit to return the desired value.

23

IV. Design of SMF

A. Components of SMF

SMF i s us er-wr i tten

recording or

OS modules,

time. These

turn.

implemented by a mixture of batch programs,

exit routines, OS modules devoted exclusively to SMF

data collection, data-collection code within other

and routines that initialize SMF functions at IPL

six types of SMF components will now be discussed in

1. Batch programs

As part of the distributed material for OS, IBM supplies

three batch programs specific to SMF, namely the SMF dump

program, the ESV utility, and the user exit test driver. The SMF

dump program consists of a single load module named IFASMFDP

which may be executed as the main program in a job step or invoked as a subroutine of a user-written main program. It uses

the Basic Sequential Access Method (BSAM) of OS Data Management

to copy an SMF data set from d i rect- access storage (DDname

DUMPIN) to a backup ("dump") data set (DDname DUMPOUT). The

DUMPOUT data set is usually on magnetic tape. If no errors occur

during copying, IFASMFDP resets the DUMPIN data set to an empty

condition. Errors encountered while opening the data sets or

reading and writing records cause a diagnostic message to be

written to DDname SYSPRIMT; then all files are closed and a code

of 16 is returned to the caller.

Before opening the DUMPIN data set, IFASMFDP uses the RDJFCB

macroi nstruct i on to read the Job File Control Block, which

contains information derived from the DD statement. The JFCB is

used to determine whether DUMPIN specifies the currently active

SMF data set; if so, the program writes a message to the

operator's console informing him of the error and requesting a reply of 'CANCEL'. When this reply is entered, the program

acknowledges its receipt via another console message and

terminates with a return code of 16.

IFASMFDP determines that DUMPIN is the active data set

whenever (1) the first eight characters of the data set name are

'SYSl.MAN'; (2) the ninth character agrees with the SMCAXORY

field in the SMCA; (3) the first volume serial number in the

JFCB agrees with the volume serial number of the active data set

as recorded in the SMCA; and (4) it is not the case that both

SMF data sets are f ul 1

.

When IFASMFDP succeeds in opening the DUMPIN and DUMPOUT

data sets, it writes a Type 2 (Dump Header) SMF record to

DUMPOUT. Next, it issues a series of READ, WRITE, and CHECK

macros to copy one block at a time from DUMPIN to DUMPOUT, until

end-of-file is reached on DUMPIN. Then a Type 3 (Dump Trailer)

record is written to DUMPOUT and both files are closed. Finally,

DUMPIN is opened for output and immediately closed, so that its

final status is empty.

25
The ESV utility program, IFHSTATR (<6>), given SMF data as input, produces a report on tape error statistics by formatting

Type 21 records into 120-column print lines. The user exit test

driver, TESTEXIT (<2>), is supplied in assembly-language source

form, would normally reside in a user library, and is intended

for use in debugging user-written SMF exit routines. With the

aid of this program, user exit routines can be tested in a batch

setting even though they will eventually run as part of the

operating system. The test facility provided by TESTEXIT does

not allow convenient simulation of a real OS environment,

however; the main objection to it raised in <39> is that calls

to various exits cannot be interspersed as they would be in

normal operation.

Two PL/I programs are available from IBM for the analysis

and graphic presentation of SMF data. One is SMFPOST (<2>, pp.

35-37), distributed as a member of the source library

SYSl . SAMPLIB ; it merely formats and prints each SMF record whose

type number is less than 14. It is not intended for production

use, but rather as an example of how to begin constructing an SMF

analysis program in PL/I. The second is the SMF Selectable

Analyzer (<28>), a field-developed program not distributed as part of OS but available on an "as is" basis by special request.

This program handles all basic SMF records and produces 13

varieties of reports. These include detailed and summary

reports, histograms and a generalized accounting routine.

However, the vendor makes no warranty as to correctness of this

program, nor does the vendor accept any maintenance

responsibility. Thus it is realistic to assume, as the SMF

manual does, that each installation using SMF must determine what

reports it wants and where the programs to produce these reports

wi 1 1 be obta i ned

.

In addition to these SMF-specific modules, IBM supplies a variety of utility programs that could be used in moving,

copying, or restructuring the SMF files (<6>). TESTEXIT uses one

of these utilities (lEBDG) as a sub-program to generate simulated

test data to be passed to user exits.

2. User-written exit routines

Interfaces to six user-written routines are provided in the

OS control program as part of SMF. Whether these exit routines

are actually invoked during operation of the system is determined

by the EXT and OPT parameters in the SMFDEFLT member of

SYS 1 . PARML IB , which may optionally be overridden by the operator

at IPL time. If EXT=NO, no user exits are taken. If EXT=YES and

0PT=1, only the exit routines named lEFUJV, lEFUJI, lEFUTL and

lEFACTRT are taken. If EXT=YES and 0PT=2, exit routines lEFUSI

and lEFUSO are used, as well as those named above; in addition,

lEFUTL and lEFACTRT are invoked on a step-by-step rather than a job-by-job basis.

26
In general, these exit routines make it possible to modify

or suppress standard SMF records, write installation-defined

records to the SMF data set, or scan each user's JCL for

adherence to local conventions and enforce these by penalizing

non-complying jobs.

Vendor support for these routines includes documentation of

the interfaces to them (<2>) and provision of a mac ro i n st r uc t i o

n

(SMFWTM) to facilitate writing of user-defined SMF records.

Sample versions of four of the six exit routines, namely lEFUJV,

lEFUJI, lEFACTRT and lEFUTL, are supplied as members of the

distribution source library S YS 1 . SAMPL I B . As mentioned above,

IBM also provides facilities for testing user-written exit

routines in a batch environment.

a . lEFUJV - JCL Val idation

This exit in the OS Reader/Interpreter is taken each time a non-null JCL record (card image) is read into the system, and

also just before a job is placed in the work queue to await

execution. The routine can inspect and modify each JCL record

before it is interpreted, and can cause a job to be cancelled

before it is enqueued for execution.

b. lEFUJI - Job Initiation

This exit in the OS I n i ti ato r/ Term i n ator is taken whenever a job is selected for initiation. It has access to the programmer

name, accounting and priority fields from the JOB statement in

the JCL for the job. By returning a code of 4 to its caller, it

can have the job cancelled.

c. lEFUSI - Step Initiation

This exit in the Initiator/ Terminator is taken just before

each job step is initiated. Among the parameters it is passed

are the step name, the progra,m name, and the accounting

information from the EXEC statement in the JCL for the job step.

It has the option of cancelling the remainder of the job.

d. lEFUSO - Sysout Limit

This exit is scheduled by the I/O Supervisor whenever the

limit on the number of records to be written to a Sysout data set

is exceeded. Such a limit exists only when the OUTLIM=nnn

parameter is specified on the DD statement defining the data set;

this should not be confused with the practical limit imposed by

the finite amount of auxiliary storage space allocated to the

data set. The lEFUSO routine may cause the output limit to be

extended or may allow the standard system action, which is to

terminate the job step abnormally.

27
e. lEFACTRT - Termination

This exit in the Initiator/Terminator is taken whenever a job or a job step is terminated. Its interface to the system is

more elaborate than those for the other user exits. One of the

many parameters passed to it by the I n i t i a to r/ Te rm i nator is the

SMF Type 4 (step termination) or 5 (job termination) record,

which it may inspect and alter. The lEFACTRT routine may also:

* prevent the SMF Type 4 or 5 record from being written;

* write a user-defined record to the SMF data set;

* write a message to the user- s pec i fi ed system

message class (this would cause it to be printed along

with the JCL and Initiator/Terminator messages for

the j ob) ; *cancelthejob.

f. lEFUTL - Time Limit

This exit from the Timer Second-Level Interrupt Handler is

taken whenever a job, step or wait time limit expires; a code is

passed in a register to tell the user's routine which of these

limits was exceeded. lEFUTL may grant an extension of the time

limit, or it may allow the standard system action (abnormal

termination of the job step).

3. SMF recording modules

The SMF recording function is performed by two routines, the

SMF writer and the SVC 83 routine, which communicate with each

other via WAIT and POST mac ro i n st r uct i o n s . When an OS component

or user-written exit routine has constructed an SMF record, it

places a pointer to the record area in general - pur po se register 1 and issues SVC 83; this linkage is provided by the SMFWTM

macroi n St r uc t i on . The SVC 83 routine copies the record into the

SMF buffer, and when the buffer is half full it signals the SMF

writer to output one block to the SMF data set. The operation of

these two routines will now be outlined in turn; for more

detailed descriptions, the reader is referred to the Job

Ma nagement Program Reference Ma nual (<5>) or the microfiche

listings of the modul es

.

a. The SMF Writer

The SMF writer task, which runs as a subtask of the Master

Scheduler, performs the functions of record transfer (from the

SMF buffer to the SMF data set), data set switching, space

analysis, and initialization of the SMF data sets. This task is

executed by the SMF writer routine, module name lEESMFWR. It

communicates with the SVC 83 routine via the SMCA, primarily

through two ECB's: the writer ECB and the buffer ECB. The

writer routine waits on the writer ECB; when that ECB is posted.

28
the writer tests flag bits in the SMCA to determine what function

is required, performs it, posts the buffer ECB to signal

completion of that function and goes back to waiting on the

writer ECB again.

The space analysis function of the writer routine serves to

detrmine whether the currently active SMF data set contains

enough space for a record that must be written in segments. This

guards against the possibility of a record being split across

data sets with the eventual result being the occurrence of a Type

3 and a Type 2 record between successive segments of a longer

record.

The SMF writer uses BSAM WRITE and CHECK mac ro i n st r uc t i on

s

to transfer records from the buffer to the active data set. When

the CHECK macro determines that the WRITE was successful,

lEESMFWR issues a CLOSE mac ro i n st r uct i o n specifying the TYPE=T

parameter. This temporarily closes the data set by writing an end-of-file mark following the last record and updating the

last-track-written and track-balance fields in the DCB and the

DSCB. Note that a temporary CLOSE (with TYPE=T), unlike a standard CLOSE, does not cause a Type 14/15 SMF record to be

written; consequently, there is no recursion between

Open/Cl ose/EOV and the SMF writer.

An I/O error return from the CHECK routine is treated the

same as running out of space on the active data set, namely, by

switching to the reserve data set and requesting the operator to

dump the full data set. Abnormal termination of the BSAM

routines is handled by means of a STAE retry routine, which

quiesces activity in the system by requesting exclusive control

of the work queue, and then issues a console message informing

the operator of the ABEND. When the operator replies to this

message, the SMF writer task then goes into a permanent wait.

b. The SVC 83 routine

The SVC 83 instruction is issued (as part of the expansion

of an SMFWTM macroi nstruction , or directly) whenever an OS module

or user exit routine wishes to move an SMF record from the work

area in which it was built to the SMF buffer. In addition to

servicing these requests, the SVC 83 routine performs

initialization and housekeeping functions. The SVC 83 routine

consists of three modules: IEESMF8C (the record transfer

routine), lEESMFOP (the Open routine), and lEESMFAL (the

allocation routine).

The record transfer routine is the first load of SVC 83, and

as such is also referred to as IGC0008C. If register 1 contains

a pointer to the SMCA, control is transferred to lEESMFOP; this

happens at initialization time, when the SMF writer requests

opening of the SMF data sets. The Open routine in turn passes

control to the allocation routine, which finds the UCB for the

first data set, marks it as allocated and permanently resident,

and transfers control back to lEESMFOP again. At this time

29
lEESMFOP places a pointer to the UCB in the Master Scheduler TIOT

and opens the data set. If the SMF data sets are on DASD, the

allocation module is invoked a second time. After opening the

second data set to be allocated, the Open routine must determine

which of the data sets SYSl.MANX and SYSl.MANY is to be used

first. If both already contain data, the one containing less (in

absolute terms, not proportionally to the size of the data set)

is chosen and the operator is requested to dump the other one.

If just one data set is empty, the non-empty one is selected; if

both are empty, SMF recording begins on SYSl.MANX. Once this

determination has been made, the Open routine notifies the

operator of its choice and exits to its caller.

When register 1 does not point to the SMCA at entry to the

record transfer module, that module tests the miscellaneous

indicators field in the SMCA to determine whether both SMF and

user records, user records only, or no records at all are to be

written to the SMF data set. On this basis, it either exits

immediately to the Supervisor or attempts to move the record to

the SMF buffer. At this point, the data and time stamp (acquired

via the TIME ma c ro i n st r uc t i o n ) and the system ID (from the SMCA)

are filled into the record, unless it is a job or step

termination or a user record.

The attempt to move the SMF record to the buffer begins with

the record transfer routine issuing an ENQ macroinstruction. The

major and minor queue names (SYSSMFOl and BUF) represent the SMF

buffer; the ENQ prevents two concurrently executing tasks from

attempting to move records into the buffer simultaneously. If

the record fits in the space remaining in the buffer, it is moved

there; otherwise, the record transfer module posts the SMF

writer ECB in the SMCA to request that the current contents of

the buffer be written out, and waits on the buffer ECB for a signal that the buffer is free. If the record will now fit in

the empty buffer, it is moved there. Once the record has been

moved and the av a i 1 abl e- s pace counter updated, the record

transfer module issues the DEQ macroinstruction to permit other

tasks to use the buffer; then it exits to the Supervisor.

The description of the SVC 83 routine in the OS/360 MVT Job

Management PLM (<5>) disagrees with the microfiche assembly

listing in one noteworthy respect. The discrepancy involves the

testing of the contents of register 1 at entry to the record

transfer routine. This test determines whether a record transfer

actually is performed or whether, instead, control is transferred

to the SMF Open routine.

According to <5>, the record transfer is performed if

register 1 is positive at entry to IGC0008C. The test actually

made is a logical comparison of the absolute value of the

contents of register 1 with the contents of the SMCA pointer

field in the CVT. If these values differ, the record transfer is

performed; if they a g ree , I EESMFOP is given control to carry out

initialization or data set switching. The rationale for this

appears to be that the address of the record to be transferred is

30
normally placed in register 1 just before SVC 83 is issued to

move the record to the buffer. Such an address might or might

not appear negative, but it would never equal the address of the

SMCA.

The reader is referred to <5> for a description of the

processing performed by the SVC 83 routine and the SMF writer

when the record to be moved must be segmented because it will not

fit in the empty buffer.

4. SMF data collection modules

Several modules of OS are entered only when SMF is being

used; they serve to build specific types of SMF records, provide

linkage to user-written exit routines, and collect data for later

recording. Most of these modules are discussed briefly in

subsection a. below; the EXCP counting routine, the SMF storage

routines and the system wait time collection routine are covered

in greater depth in subsections b., c., and d.

a. Record construction and exit interface routines

The SMF VARY record handler, IGC2303D, which builds the Type

9 (VARY Online) and Type 11 (VARY Offline) records, is executed

as part of the processing of the VARY command by the Master

Sc hedul er

.

Two modules of Ope n/ CI o se/ EOV are dedicated to SMF data

collection functions. Construction of the Type 14/15 record

during closing or end- of- vol ume processing of a data set is begun

by module IFG0202H; it is also completed by that module unless

the data set resides on a d i rect- access device, in which case

module IF60202I is invoked to finish building the record.

As part of the servicing of RENAME (SVC 30) requests by the

DADSM routines, the SMF record Type 18 processing module,

IGC03003, is entered to construct the record and have it moved to

the buffer. The Type 18 record contains the old and new data set

names, and the serial number of each volume on which the data set

resides.

When SMFDEFLT specifies DSV=2 or 3, and the job was not

cancelled by the user-written initiation exit, a job start record

(Type 20) is constructed for each job by the user exit

initialization routine, lEFSMFIE. This module performs several

other SM F- s pec i f i ed functions each time a job step is selected

for initiation. First, it determines whether a Timing Control

Table (TCT) must be built, i.e., whether this is the first step

of the job. If so, lEFSMFIE acquires main storage for the TCT

and the first forty bytes of the Job Management Record (JMR).

After initializing the TCT, lEFSMFIE reads the JMR from the work

queue data set and copies its first forty bytes for use as the

SMF Common Exit Table, which is passed as the first parameter to

every user exit routine. If exits were specified, lEFSMFIE reads

the job's ACT into main storage and passes control to the job

31
initiation exit routine, lEFUJI; otherwise, it builds the Type

20 record and has it moved to the SMF buffer.

When lEFSMFIE determines that the TCT is already in

existence, it updates the time stamp in the JMR; if user exits

are to be taken, it then reads the step's ACT into main storage,

and passes control to the step initiation exit routine, lEFUSI.

If the return code from lEFUJI or lEFUSI indicates that the job

is to be cancelled, lEFSMFIE sets the job-failed bit in the JCT.

Another module of the initiator which is bypassed when SMF

is omitted from the system is the TCTIOT construction routine,

lEFSMFAT. As its name implies, this module obtains main storage

for the Timing Control Task Input/Output Table, which is used to

collect EXCP counts and other data set statistics. It is invoked

by the initiator's attach routine (module IEFSD263) just before a job step task is attached. By that time, devices have been

allocated and a region acquired for the step. lEFSMFAT finishes

filling in the TCT with the following information:

* lowest address allocated at the high end of the region;

* highest address allocated at the low end of the region;

* the amount of unused storage in the region;

* the wait time limit;

* the address of the user time-limit exit routine, lEFUTL;

* the address of the Sysout limit exit routine, lEFUSO;

* the address of the TCTIOT; and

* the current time and date, to record when loading

of the problem program was requested.

Several SMF functins are performed at step and job

termination time by the terminator's user accounting linkage

routine. The source module for this routine is named lEFSMFLK,

but its entry point is lEFACTLK. Before SMF was added to OS,

this module was the interface to the original user accounting

exit. The first operation attempted by lEFSMFLK when it gets

control is the construction of the Type 1, or Wait Time, record.

The routine checks a field in the SMCA (field name SMCAWAIT) into

which cumulative wait time values are added every ten minutes by

the Timing Supervisor. If SMCAWAIT contains zero, no Type 1 record is written at this time; otherwise, lEFSMFLK builds the

Type 1 record, moves the wait time into it, and zeroes out the

SMCAWAIT field before issuing SVC 83 to write the Type 1 record.

It next reads the proper Accounting Control Table (ACT) into main

storage, determines the maximum amount of core used, and then

invokes the SMF termination record construction routine,

lEFSMFWI, to build the Type 4 or Type 5 record. After lEFSMFWI

returns control, lEFSMFLK puts together the parameter list for

the user's termination exit routine, lEFACTRT, and then calls it.

Depending on the return code from lEFACTRT, lEFSMFLK may cancel the job, omit writing of the Type 4 or 5 record, or issue SVC 83

to have the record moved to the SMF buffer.

32
The SMF t ime/ out put limit expiration routine, lEATLEXT,

resides in the nucleus and serves as an interface to both the

user's time limit exit routine, lEFUTL, and the user's Sysout

limit exit routine, lEFUSO. It runs under the control of an IRB/IQE created by either the timer Second-Level Interrupt

Handler (SLIH) or the EXCP counting routine, lEASMFEX, depending

on which limit expired. The SMF-related activities of the timer

SLIH are described in section IV. A. 5, v/h i 1 e lEASMFEX is discussed

in subsection b., immediately below.

In the case of time limit expiration, lEATLEXT sets up a register save area and the proper parameter list and calls

IEFUTL-, with register 0 set to 0, 4, or 8 to indicate which limit

was exceeded: job CPU time, step CPU time, or job wait time.

The exit routine may return a code of 4 in register 15 and a number of timer units in register 1; if so, lEATLEXT does the

bookkeeping necessary to extend the expired limit by the given

number of timer units. If lEFUTL returns a code of 0, lEATLEXT

schedules the job step to be abnormally terminated with a code of

322 for too much CPU time or 522 for too long in the wait state.

In the case of Sysout limit expiration, lEATLEXT again sets

up a save area and a parameter list and calls lEFUSO, which may

return a code of 4 in register 15 and a count of additional

blocks permitted in register 1. If it does, lEATLEXT adds the

specified value to the output limit field in the appropriate

TCTIOT entry. Otherwise, lEATLEXT schedules the job step for

abnormal termination with a code of 722.

b. The EXCP counting routine

This routine, whose entry point name is lEASMFEX, resides in

the nucleus in module lEAQNUOO. It is called by the EXCP

validity checking routine of the I/O Supervisor whenever the

control blocks governing an EXCP (SVC 0) or an error EXCP (SVC

15) appear acceptable to the lOS. It is also called by the I/O

Interruption Supervisor immediately upon return from the PCI

Appendage routine in the event of a Program-Controlled

Interruption (PCI). This fact is significant for I/O operations

that use chained scheduling, since under OS such operations cause

one PCI to occur for each block read or written. Chained

scheduling and its significance for I/O accounting and

performance measurement under both OS and MVS (VS2 Release 2 and

later releases) are discussed in Appendix G to this report; the

effects of chained scheduling on EXCP counts and CPU time

variability are discussed in section VI.

When lEASMFEX is entered, it performs a complex series of

tests to determine whether it should count the EXCP (or PCI).

The first few of these deal with the situation where I/O was

requested by an SVC routine: their effect is to count the EXCP

only if the issuing routine is servicing an OPEN, CLOSE, OPEN

TYPE=J or CLOSE TYPE=T request made by a problem program. When

the issuing routine is itself a problem program, lEASMFEX will

check the DCBOFLGS field of the DCB to ensure that the data set

33
is either open or in the process of being opened or closed. If

the corresponding flag bits in this field are both zero, the EXCP

is not counted. Since these flags are accessible to the problem

program (the DCB is not copied into key 0 under OS) and since

resetting the "open" flag has no effect on normal I/O operations

other than inhibiting EXCP counting, this test constitutes an open invitation to cheat any accounting system which charges for

I/O on the basis of EXCP counts.

Following these tests, lEASMFEX checks a field in the

current task's TCB for the presence of a pointer to a Timing

Control Table (TCT). (See sections IV. C. 5, IV. C. 6 and IV. C.

7

below.) If the current task is a system task, this field will

contain binary zeroes, and the EXCP will not be counted.

Otherwise, the field in the TCT that should point to a TCTIOT is

tested; if it is zero, EXCP counting is not in effect, and

lEASMFEX returns control to the I/O Supervisor.

At this point, the decision to count the EXCP has been made,

and the TCTIOT is searched for the entry containing the counter

to be incremented. By referring to the description of the TCTIOT

in section IV. C. 6 below, the reader can see that a two-level

associative search is required. First, the DD entry must be

located by matching the TIOT offset in the DCB against a list of

halfword fields in the TCTIOT; then the DD entry itself must be

searched for a subentry whose UCB address field correspondonds to

the unit on which I/O was requested. The time required to

perform these searches is the sum of three terms. The first is

constant, the second is proportional to the number of DD

statements preceding the one for this data set, and the third is

proportional to the number of devices for this data set preceding

the one on which I/O is being requested.

After incrementing the proper EXCP counter, lEASMFEX rescans

the entire DD entry summing the counts for all units to get a total EXCP count for the data set. Then it tests the output

limit field, and if it is non-zero, compares it with the total

EXCP count. Exceeding the Sysout limit causes lEASMFEX to create

an IRB/IQE for the time/output limit expiration routine

(lEATLEXT) and schedule it for execution. However, if SMF exits

are not to be taken, exceeding the Sysout limit causes lEASMFEX

to terminate the job step abnormally with a code of 722.

The cost of this Sysout limit checking could be considerably

reduced by testing for a limit of zero, i.e., a non-Sysout data

set, before computing the total EXCP count. There is no need for

this total unless the data set is Sysout.

c. The SMF storage routines

The two SMF storage routines comprise a module named

lEASMFGF which maintains core usage information in the TCT

(timing control table). When SMF is active in the system, they

are called as subroutines by the resident SVC routines which

service GETMAIN and FREEMAIN requests. If no TCT pointer is

34
present in the TCB for the requesting task, the SMF storage

routines return control immediately to their caller.

The function of these routines is determined by the

structure of the TCT, which in turn depends on the way

GETMAIN/FREEMAIN works. Storage within a region is allocated

from the top down and from the bottom up, so that the largest

contiguous area of free storage is typically (but not

necessarily) in the middle of the region. Furthermore, the

360/370 machine architecture forces storage to be converted from

key 0 to the requestor's protect key in multiples of 2048 bytes.

Thus the unallocated key 0 core in the middle of the region is

always an exact number of 2K blocks in size, as is the region

itself. The low and high ends of this central free area are

referred to in IBM documentation as the "low water mark" (LWM)

and the "high water mark" (HWM) respectively. Their difference,

a multiple of 2K, gives the size of the central free area; SMF

maintains the minimum value of this difference in the TCT. At

step termination, this minimum value is subtracted from the

region size to derive the core-used figure, SMF4H0ST.

When core is requested within a region, the GETMAIN routine

first inspects its storage control queues to determine whether

the amount wanted is available and, if so, where it should be

allocated. Then it calls its SMF storage subroutine at entry

point GMSMFCRE within lEASMFGF. If a TCT is present, GMSMFCRE

checks for a new LWM or HWM and updates the proper TCT entry as needed. It then takes the diference between the HWM and the LWM

in units of 2K blocks, and updates the minimum difference in the

TCT if the new value is lower. Likewise, when core within a region is freed, the FREEMAIN routine calls lEASMFGF at entry

point FMSMFCRE to update the HWM or LWM if necessary.

d. The system wait time collection routine

This nucleus-resident routine, named lEAQWAIT, works in

conjunction with the OS Dispactcher and the Timer SLIH to measure

and accumulate the intervals of time that the CPU spends in the

wait state. This process is entirely distinct from job wait

timing which uses the separate mechanisms described in the next

section.

When no task in the system is ready to use the CPU, the

Dispatcher sets up the system wait pseudo-task as the current TCB

and "dispatches" it by loading a PSW with the wait bit on. If

SMF is in effect, the Dispatcher saves the value of the interval

timer in the first word of a special two-word save area,

SYSWSAVE, just before loading the wait-state PSW. When an I/O or

external interruption reactivates the CPU, the first-level

interruption handler calls lEAQWAIT. If the current TCB is not

the system wait pseudo-task, lEAQWAIT returns control

immediately; if it is, lEAQWAIT reads the interval timer and

subtracts the first word of SYSWSAVE from it to determine the

number of timer units spent in the wait state. This number is

then added to the value in the second word of SYSWSAVE.

35
When a supervisor 10-minute time interval expires, the timer

SLIH adds the accumulated wait time in the second word of

SYSWSAVE into a field in the SMCA (System Management Control

Area) and resets the second word of SYSWSAVE to zero. The system

wait time thus passes through two intermediate areas, which may

be thought of as accumulators or buffers, on their way to the

Tyoe 1 or Type 12 record. SYSWSAVE is "filled" by lEAQWAIT and

"emptied" by the timer SLIH; SMCAWAIT is "filled" by the timer

SLIH and "emptied" by the user accounting linkage routine,

lEFSMFLK, of the Terminator when it builds a Type 1 record. Both

"buffers" are "emptied" by the Halt/Switch command processor,

IEE1403D, when it builds a Type 12 record.

5. Data-collection code within OS modules

Six of the basic types of SMF records are constructed by

code within OS modules that also serve other purposes. Besides

these modules, several others are involved in the creation and

maintenance of data items that eventually find their way into SMF

records. One of the OS components most intimately involved with

SMF data collection is the Timing Supervisor, also known as the

Timer SLIH. It and the OS Dispatcher are discussed below in

subsection a. The construction of the Type 6 record by various

modules of the OS output writer is described in subsection b,

while the other data-collection functions are lumped together in

subsection c.

a. Job step timing

SMF job step timing uses the ST IMER/TT IMER facility provided

by the Timing Supervisor to measure the CPU time used by all

tasks in the job step. The Timer SLIH is also concerned with

preventing non-system tasks from remaining in wait status for

longer than the maximum time specified by the JWT parameter in

SMFDEFLT. Before the initiator attaches a job step, it issues an STIMER request specifying the amount of CPU time allowable for

the job step. The Timing Supervisor services this request by

creating a timer queue element (TQE) of task type, with a special

flag indicating that an initiator issued the STIMER.

The Timer SLIH uses TQE ' s to perform a wide variety of

timing functions by means of the single hardware interval timer

built into the IBM 360 CPU. When a TQE is placed on the timer

queue (this may be thought of as starting its clock running), the

interval specified in the STIMER mac ro i n st r uc t i o n is converted to

an absolute t ime- of- ex pi rat i o n , which determines the TQE '

s

position on the queue. The value in the interval timer is always

the difference between the current time and the nearest

t ime- of-ex p i rat ion . When this goes to zero, an external

interruption occurs; the external SLIH recognizes its source as timer expiration and gives control to the Timer SLIH. The SLIH

removes from the timer queue its topmost element, which

represents the interval just expired, and takes appropriate

action depending on its type (and on whether it belongs to an initiator). Meanwhile, the interval from the current time to the

36
time-of-expi ration of the next TQE on the queue is placed into

the timer, which continues to run.

For CPU timing, the TQE is task-type, and such TQE ' s require

the cooperation of the OS Dispatcher to ensure that their

"clocks" run only when the corresponding tasks have control of

the CPU. When a task switch occurs, the Disptacher must

deactivate any task-type TQE ' s for the old task and activate any

that belong to the new task. A system task will generally have

no TQE ' s ; an ordinary job step task or subtask will have one;

and a job step task or subtask that has issued a task-type STIMER

of its own will have two, including the one belonging to its

initiator.

Deactivating a task-type TQE involves converting its

t i me- of- ex p i r at i 0 n to a t i me- rema i n i ng interval and removing the

TQE from the timer queue. Reactivating it is just the reverse.

Both actions are accomplished by a call from the Dispatcher to a routine within the Timing Supervisor which subtracts or adds the

current time-of-day to convert expiration times to intervals or

vice versa. Note that the time-of-day is derived from the

current value of the interval timer, which may change between

successive calls by the Dispatcher. This can le^d to some

peculiar results when task times obtained by programs that

measure their own CPU usage via STIMER are compared with

SMF-reported step CPU times.

When a TQE belonging to an initiator is deactivated, it is

not just set aside, but rather is coverted to a specially flagged

TQE with a real (not task) time interval of JWT. Thus the same

TQE is used to monitor cumulative CPU time and maximum wait

interval for the job step. If the wait or CPU interval expires,

the Timer SLIH sets up linkage to the SMF time/Output Limit

Expiration routine by converting the TQE into an IRB/IQE for

lEATLEXT.

Finally, as mentioned in the previous section, the Timer

SLIH maintains the supervisor 10-minute interval which governs

transfer of accumulated system wait time from the special save

area SYSWSAVE to the SMCA field where the terminator looks for

it. The TQE corresponding to this interval is assembled into the

nucleus of a system with SMF. When it expires, the Timer SLIH

performs the above-mentioned transfer, resets the

t i me- of- ex p i rat i 0 n to ten minutes hence, and puts the TQE back on the timer queue.

b. Data collection in the output writer

The Type 6, or Output Writer, record is built by the DSB

handler, module IEFSD085; in a system with HASP, the Type 6

record would usually be written by the HASP print processor.

Module IEFSD085 is the component of the system output writer

which receives control when a Data Set Block (DSB) is read from

the output queue entry for a job. The DSB describes a system

output (Sysout) data set which has been written on d i r ec t- ac ces

s

37
storage to await transcription to an output device. In a system

with SMF, the last 28 bytes of the DSB contain information

similar to that contained in the first 28 bytes of the Job

Management Record. This "job log" portion of the DSB forms the

basisfortheType6record.

When the OS output writer is preparing to transcribe an outpput data set, the DSB handler determines whether the form

number has changed from that for the previous data set and

whether the Sysout record count is nonzero. If both these

conditions are satisfied, it copies the job log from the previous

DSB into the Type 6 record area, fills in the Sysout class and

form number, uses the TIME macro in struct ion to supply the writer

stop time and date, and issues SVC 83 to have the record moved to

the SMF buffer. Then the DSB handler moves the stop date/time

stamp to the writer start date/time field in the record area and

zeroes out the Sysout record count and data set count fields.

This initializes the Type 6 record area for the next form number

to be processed.

A Type 6 record is always written by the output writer's job

delete routine, module IEFSD079, after the last Sysout queue

entry for a job has been processed. The job delete routine is

also entered, and also writes a Type 6 record, when Sysout

processing for a job is suspended because of an I/O error on the

output data set. In this case, the data set delete routine,

module IEFSD171, puts the job back in the queue, with a special

System Message Block (SMB) inserted in front of its queue entry.

This SMB points to the DSB for the data set that was being

processed when the error occurred. When the next attempt is made

to write the output for that job, it will begin with that data

set and skip over all SMB's and DSB's already processed. Note

that in such cases there will be more than one Type 6 SMF record

for the same form number, Sysout class, and job log.

Several modules of the output writer contribute data

elements to the Type 6 record. The data set delete routine

(IEFSD171) adds 1 to the data set count just after scratching a Sysout data set that has been successfully transcribed. The put

routine, module IEFSD089, increments a counter in the work area

containing the Type 6 record every time it sends a Sysout record

to the output data set. The job delete routine (IEFSD079)

consolidates the I/O error indicators supplied by other routines

into a one-byte field. The standard writer routine, module

IEFSD087 does its SMF processing just before closing the input

data set; this consists of flagging any input errors, updating

the Sysout record count from the counter used by the out routine,

and resetting that counter to zero.

If a user- s pec i fi ed alternative program is used to write

system output, as requested by the second positional parameter on the DD statement (<7>), the contents of the SMF Type 6 record

obviously depend on what that program does to the work area

containing the Type 6 record image. The OS SMF manual (<2>)

states that an incomplete Type 6 record is written for each

38
output class, but not for form changes within an output class.

It further states that the numbers of logical records, I/O status

indicators, and form number fields are not provided.

c. Other data-collection code

The Type 10, or Allocation Recovery, record is built by the

I/O device allocation recovery routine, module lEFXJIMP, whose

main purpose is to inform the operator of the recovery options

available and give control to the appropriate routine to process

his response.

The Type 12, or End-of-Day, record is built by the HALT

command processor, module IEE1403D; its format is identical,

apart from record type, with the Wait Time (Type 1) record. In

response to a "HALT EOD" or "SWITCH SMF" command from the

console, the HALT commmand processor issues SVC 78 to create a Type 19 record, and later builds the Type 12 record and issues

SVC 83 to have it moved to the SMF buffer.

The Type 17, or Scratch Data Set Status, record is built by

the Format 4 DSCB updater (module IGG0290D of the SVC 29 routine)

as part of the processing of a SCRATCH request for a user data

set

The Type 19, or Direct Access Volume, record is built by the

second load (module IGC0107H) of the LSPACE (SVC 78) routine if

the contents of register 1 at the time SVC 78 was issued indicate

a request for SMF information. This SVC is also issued as part

of the processing of the "DISPLAY SPACE" console command; in

this case, the data gathered by the LSPACE routine is used in

constructing the reply to the operator, and no SMF record is

created. The SMF version of SVC 78 is issued by the SMF

initialization program, by the HALT command processor and by the

disposition and unallocation message routine of the terminator

(lEFZHMSG)

There is SMF-related code in the Attach routine (IGC042) to

copy the TCT address from the attacher's TCB to the created TCB.

This ensures that all subtasks of a job step task will share its

TCT and its TCTIOT, and hence all I/O and main storage requests

they make will be charged to the job step.

There is also SMF-related code in the Wait routine (IGCOOl)

which performs a minor but necessary part of the job step timing

function. If SMF is in the system, this routine places the wait

time limit taken from the TCT (originally derived from the JWT

parameter in SMFDEFLT), rather than the 30-minute default, into

the TQE for the iniitiator's STIMER.

6. The SMF initialization program

When the operator presses the LOAD button on the control

panel, the IPL (Initial Program Load) and NIP (Nucleus

Initialization Program) procedures respectively load into main

39
memory and initialize the core- resident portions of OS. NIP

passes control to the Master Scheduler, one function of which is

to initialize the SMF data collection and recording process. The

part of the Master Scheduler which performs this function is

called the SMF initialization program. It consists of four

modules: lEESMFIT, IEESMFI3, IEESMFI2 and lEESMFOI.

This program first scans the directory of the partitioned

data set SYS 1 . PA RML IB , looking for a member named SMFDEFLT. If

it fails to find this member, the SMF initialization program

writes a message to the operator requesting entry of the SMF

parameters from the console. If SMFDEFLT is present, it is read

into main memory and checked for validity. If any of the

parameters is invalid, or if SMFDEFLT specifies OPI=YES, the

operator is invited to redefine the parameters. On the basis of

parameters so determined, the SMF initialization program

constructs the System Management Control Area (SMCA) from which

many SMF modules will later extract information.

Provided that recording of SMF data has not been suppressed

by use of the MAN=NONE parameter, the initialization program next

checks the specification of the SMF data sets in the PRM and ALT

parameters. If PRM is omitted, or if ALT is omitted when the

primary data set is on d i rect- access storage, an error message is

written to the operator and recording of SMF data is suppressed.

This procedure is also followed if a specified I/O device is not

availabe, or if a data set specified on a direct-access device

has no space allocated for it. If none of these conditions

arise, the initialization program creates the SMF writer task and

activates its data set initialization functions. It, in turn,

issues SVC 83 with register 1 pointing to the SMCA, to request

opening of the SMF data set{s).

B. Interfaces between SMF and OS

The diagram on the foldout sheet at the back of this volume

illustrates the interfaces between SMF and OS components in a hierarchical fashion. The diagram represents the tree structure

of OS/MVT with all the branches having nothing to do with SMF

pruned away. The only exceptions to this are Catalog Management

and Access Methods, which are included primarily to emphasize

that their activities are not directly measured by SMF.

The tables used to collect SMF data and the construction of

SMF records are not shown on the diagram; they are illustrated

and described in section IV. C. The diagram on the foldout does

show double arrows leading from modules that write SMF records

(i.e., issue SVC 83) to the records that they write. Note that

these are not necessarily the same modules that construct the

records

.

40
C. Internal flow of data within SMF

SMF-related data is found in a wide variety of control

blocks and tables throughout OS. Some of these are well-known,

at least to systems programmers, and are described in detail in

the System Control Blocks manual (<26>); these include the TCB,

the DCS, the UCB, the DEB, the CVT, the JFCB, and the DSCB's that

comprise the VTOC. A few SMF data elements are derived from

fairly obscure corners of the system; these are grouped together

at the end of this section under the heading "Other SMF data

sources". The most important repositories of SMF data are the

six tables discussed in the next six subsections below. The

accompanying figures illustrate the flow of data through these

tables, while subsection 7 shows how they are linked to each

other and to standard OS/MVT control blocks by means of pointers.

For a more detailed attribution of data element sources, see

Appendix D.

41
1. Job Accounting Control Table

The Job ACT is created, partially filled in, and written out

to SYS 1 . S YSJOBQE by the JOB statement processing routine of the

Reader/ I nterpreter . It is read back in by the Initiator's Task

Delete routine at the end of each step, updated, and written back

to the Job Queue. It is also read in during initiation of the

first step for inspection by user exit routines and for use in

building the Type 20 record.

42
m a:

uu

Q. O

>- u

/

t— LU

UJ O

O1— UAT

to

UITIA FSM

NIW LU z LU Q£

LU

1—

<

COO

<

Z

<

O

o

a.

toO

-J

LU

U.o

z

Ui

UNO

1— u

u o. <

CD CO o O -1 —

E-« H

O

)^ sO

o

•H

+2O

O

o

o•-3

s,

•HP4

43
2. Step Accounting Control Table

The Step ACT is created, partially filled in, and written

out to SYSl . SYSJOBQE by the EXEC statement processing routine of

the Re ader/ I nterpreter . It is read back in by the Initiator's

Task Delete routine at the end of each step, updated, and written

back to the job queue.

41+
ot—<

z

to

LU DC

LU T

LOo1 LU

UCT o

< z

Ul

Q.

LUI—

UN CO O 1— yj => u a. <

o. a.

LU

h- LU

I—

to

OC. ETE UJ o 1 Z

1— LU

SD < 1 1—

u.

LU

:^ o

z AS

t—

o

<

EhHO

O

o

•H-PO

o

o

<<

(1) -pCO

CM

g)

45
3. System Management Control Area

The SMCA is created in the System Queue Area of main memory

by the SMF Initialization Routine of the Master Scheduler, and

remains there until the system is reloaded. It is specific to

SMF and does not exist in systems without SMF. Its address can

be found in location CVTSMCA of the Communication Vector Table;

this pointer is zero in systems without SMF.

46
LLi GOo

n

00 z

o

SVC

t— o z>

GC RO

0^

FLK ATO Z

LULU

LU

oe. LU

h- u.

CO

u. UJ

LU LO

LIH o

SOR 1

LO

Q£

LU

NIW ERVI

f.

1— o.

\— 3

LO

LU

LU

CO Ll_ LU

LU CO

47
4. Job Management Record

The JMR is created, partially filled in, and written to the

OS work queue data set by the JOB statement processing routine of

the Re ader/ I nterpreter . In systems with SMF, it is read back in

and completed by the User Exit Initialization Routine of the

Initiator at the start of the first job step; from then on, it

is maintained in main memory and updated at the start of each

subsequent step.

48
A

00 a

oe.

YPE ECO

O

COO

O

CO

AME TINE O

O

UJZ ^O O Of

> 2H o

o LU\LU o hO OLL. o

u

Z

a. o

>-

t— LU < >

X u o

u.

UJ O

_i

uLU <

O

O

-Ps

•-3

0)

•H

49
5. Timing Control Table

The TCT is created in main memory by the Initiator's User

Exit Initialization Routine at the start of the first step of

each job, and updated by that routine and by the TCTIOT

Construction Routine at the start of each subsequent step. It is

specific to systems with SKF.

The TCT is pointed to by a field in the Task Control Block

(TCB) for the job step task. Any subtasks of the job step task

contain pointers to the same TCT in their TCB's; thus all main

storage used within the region allocated to the job step is

accounted for in the same place.

50
51
6. Timing Control Task Input/Output Table

The TCTIOT is created in main memory by the TCTIOT

Construction Routine of the Initiator at the beginning of each

step, following device allocation and just before the problem

program is loaded. Like the TCT, it is SMF-spec i f i c ; in fact,

the routines that use it pick up its address from the TCT. Its

principal purpose is to maintain EXCP counts by data set and

device, but its structure introduces inefficiencies into the SMF

EXCP-counti ng function.

Each DD statement in the JCL for the job step gives rise to

a DD entry in the TCTIOT as well as an entry in the Task

Input/Output Table (TIOT). The Data Control Block (DCB) for the

data set contains a halfword offset giving the location of the

corresponding TIOT entry relative to the beginning of the TIOT.

Near the start of the TCTIOT is an associative lookup section

consisting of pairs of halfword offsets, the first of each pair

being the same TIOT offset found in the DCS, and the second being

the offset to the corresponding DD entry within the TCTIOT

itself. Each DD entry contains as many eight-byte subentries as there are devices allocated to the data set, plus one more

eight-byte field controlling output limits for Sysout data sets.

This output limit field is present even for non-Sysout data sets,

but contains a limit of zero in that case.

It should be noted that EXCP counts are maintained In the

TCTIOT on a dev Ice-wi thi n-data- set basis, and no overall EXCP

count for the entire data set is present. Thus testing whether

the Sysout limit has been exceeded requires summing the EXCP

counts for all devices allocated to the data set, every time an EXCP is issued. It should also be noted that the TCTIOT Is

designed to be searched assoc i at 1 v el y on the basis of the TIOT

offset in the DCB to locate the DD entry; the length of this

search will depend on the number of DD statements preceding the

one for the data set currently requesting I/O.

52
\1

00 uLU

0£

oe. O»—

LL. <

z

(/> ULU

LUt—

2H 1

Ao; o LU

cs \LU o to O o u.

oto X

LU >

LL. LU

O. to< to

LU o

tor>O

LUz

XT NO UTI LU O »— X

< u t—

LU z

>- X

to LU <

t—3

o SO X

LU

>-

to

»—

LL. LU Oi

LU

to _i

3

0£ X o LU to

U.

WS O >

— LU < Q. LU 3

to

Q.O

LU

to

LUz

CM to < t— o O LU 3

O < _l

LU O O a Of

ne|

»—< O 3 U- < TIO ROI to

U-

»— u

LU z

t— O

BUI

CD ^^ 200 id ^ o

- z 3? — >-to

EH

-p

-pIM

cd H

O

U

-goo

•H

53
7. Table Interconnections During Job Step Execution

The accompanying diagram shows the interconnections betv/een

the TCT, the TCTIOT, and related control blocks and routines

during execution of a problem program. Since the user time limit

and Sysout limit exit routines run under the TGB for the current

task within the job step, the pointer relationships illustrated

hold true during execution of those routines also. By exploiting

these relationships, a problem program (or one of the two exit

routines mentioned) can gain access to the data collected by SMF

at any point in its processing. The TCT and TCTIOT contain the

region high and low water marks and the EXCP counts,

respecti vel y

.

It should be noted that the accompanying diagram is not

valid for other SMF exits, since they run as subroutines of

system tasks (readers or initiators).

54
o

I—u

I X CO t— \—

INTE o

oe: LU LU

1

on; OF BLE ONE LUz M 00 _2 o < _i

o U- < LU LU —

CTIO u

O\ LU o

CO

LU

1—

Q.—}

lABLI WOl CO

SITER lABL I—X

ROI

t—

U- U1 CD D

BYT O < LU O

Of COUl < LU < LU o

LU O

LU

TA O1 > RK ZE >

•FUTL f.

Zj

N N o < O LU

CO

LO CO o Z)

I o 00 + + + +

t

CDU

I/) COO

t—O

CDU

flO u

O 1 O O i

CQ 1 < OC O

t— CO

=> —> Z>

y— H-u u U

t— 1— 1— o 00 CN

CM CM CM CO + + +

55
8. Other SMF data sources

The major repositories of SMF data are the tables used by

the Job Scheduler and the Master Scheduler; these are documented

in detail in the Job Ma n agement Program Logic Manual (<5>). They

include the Linkage Control Ta b 1 e ( LC T) , Job Control Table (JCT),

Step Control Table (SCT), and the Master Scheduler resident data

ar ea

.

The LCT, built in core by the initiator initialization

routine, serves as a communications area among components of the

initiator. From it, SMF extracts the job and step completion

codes and the job class.

The JCT contains parameters from the JOB statement and other

job status information. It is created and written to the system

work queue by the JOB statement processing routine of the

Reader/ I nterpreter , and read back into main storage by the

initiator's Job Selection and Job Delete routines. From it, SMF

extracts the step initiation date and time, job initiation date

and time, job priority, the Sysout classes and message class

indicator, and the job termination indicator byte.

The SCT (one per job step) is created and written to the OS

work queue data set by the EXEC statement processor of the

Reader/ I nterpreter . The initiator's Job Selection routine reads

the first SCT back into main memory before the start of the first

step. From the SCT, SMF extracts the step name, the program

name, and the number of card images in "DD DATA" or "DD *" data

sets.

The Master Scheduler resident data area is located in the

nucleus, and contains control information common to all

initiators and command processors. It is pointed to by the

CVTMSER and CVTMSLT fields of the Communication Vector Table. It

is of interest as the ultimate source of the storage protection

key extracted by SMF from the initiator's TCB.

One further source of SMF data is the Volume Statistics

Table, located in the nucleus, which holds error statistics and

other information pertaining to magnetic tape volumes. It

contains one entry for each 2400 series magnetic tape device on the system. The error statistics in this table are maintained by

the I/O Supervisor's error recovery routines for magnetic tape,

and are formatted as part of the Type 21 record by the SVC 91

(VOLSTAT) routine.

56
V. SMF and Performance Measurement

A. General

The resources of interest to the management of an installation running OS/360 are quite diverse. In addition to

the commonly recognized ones such as CPU time, main storage,

auxiliary storage, print lines, and I/O devices, there are other

resources whose usage has a strong influence on performance or the turnaround of a particular job through a particular system at

a particular time of day. These include operator interventions,

channel loading, and several items that can be lumped together

under the general heading of software resources.

A thorough approach to resource measurement and management

must include identification of all resources in the system and

the collection of data on their use. The subsequent paragraphs

of this section define those resources that should be measured

and evaluated to determine system performance and resource

utilization. They also indicate the specific resources measured

by SMF, the measures used, SMF sources of the usage measures, and

possible views of the usage.

In general, all resource measurements can be categorized as applying to either the quantity of usage or the productivity of

usage. The first category refers to the amount of the resource

made unavailable to other contenders for that resource, and is

usually expressed as a numerical quantity, possibly related to a time base. Thus we say a job used 30 seconds of CPU time or that

a CPU is in use an average of 48 seconds per minute or 80% of

capacity. The objectives of quantitative measurement of

resources are to allocate costs of resources to jobs, determine

resources that are under- or over-used, and to tune a system by

balancing loads among various resources.

While quantitative measures define how much a resource is

used, they do not say anything about how well a resource is used.

For example, if a program being tested goes into a one-instruction loop and runs for an hour of CPU time, from the

standpoint of quantitative measures the CPU is 100% in use, but

from the standpoint of productive work, usage is 0% after the

loop begins. The objective of productivity measures is to

produce the most work from the available resources. SMF provides

mainly quantitative measures of resources, but in the discussion

that follows, both types will be covered where applicable.

Another goal of the subsequent sections is to describe, for

each resource, how its use can be charged back to individual jobs

or job steps. Such allocation of system usage to jobs is, in

fact, the primary objective of the design of SMF; consequently,

many of its usage measures sacrifice precision in order to

provide better repeatability from run to run of the same job.

Some resources are ignored altogether since they cannot be

directly linked to a specific job. Part of the following

discussion is based on material previously published in (<27>).

57
Job step and data set records carry a job log number,

composed of the job name and reader time and date stamp, that can

be used to associate all the records with a specific job. Each

record bears a time stamp that makes it possible to organize the

records into the sequence in which they were originally written.

This last procedure is necessary in order to associate the data

set records with their respective steps, since the data set,

allocation recovery, scratch, and rename records do not contain

step number or name. The normal order of records for a job is:

* job initiation record;

* allocation recovery records - step 1 (from initiator);

* rename records - step 1 (from utilities);

* scratch records - step 1 (from utilities);

* data set records - step 1;

* step termination record - step 1 (from terminator);

* allocation recovery, sc rate h/ rename , and data

set records - step 2;

* step termination record - step 2;

* allocation recovery, sc rate h/ rename , and data

set records - last step;

* step termination record - last step;

* job termination record;

* Sysout record;

* Sysout record.

Although the record time stamp provides a convenient means

of sequencing records for a job, it is prone to serious

difficulty if the system time is changed during execution of a job. (In fact, the SMF records can indicate that a job finished

before it began if the time is reset while a job is executing.)

An improvement on this method can be had by using the step initiation exit (lEFUSI) to set the step number in the user-i.d.

field which is part of all job and data set records.

Usage of some resources cannot be directly allocated to jobs

by means of SMF data; but for many resources, an approximation

of the relative load placed upon the resource can be determined

from the SMF data. The following discussion draws on a variety

58
of algorithms presented in the literature or in common practice

to assign resource usage to jobs. Where possible, the assignment

of resources is at the step level, v^fhere the programmer has the

greatest control of resource allocation.

B. Human resources

Although the operator may not be the most expensive item in

the machine room, his time is often a scarce resource. In

OS/360, it is easy to multiply the number of operator

interventions significantly through carelessness or ignorance in

setting up JCL. Such commonplace utility operatiohs as copying a series of data sets from disk to tape or scratching a few dozen

unwanted members from an ex pi ry-date- protected library contain

the potential for enormous waste of the operator's time by

requiring repeated remounts of the same tape or replying to

multitudinous console messages. Being human, an operator

subjected to such harassment is liable to suffer a loss of

effectiveness in performing his regular duties. It is desirable

both to account for the operator interventions necessitated by

each job, and to measure ope rator- rel ated delays so that

installation management can recognize when operator time is the

limiting factor in system throughput.

The direct measures of operator actions provided by SMF

are:

* IPL's--from the IPL record can be obtained the frequency

of IPL's and the duration between IPL's. While this will usually

show the frequency of system problems rather than operator

performance, many IPL's will impact operator performance.

* Allocation Rec over i e s- -from the Allocation Recovery record

can be obtained the frequency of allocation recoveries and the

type of device for which they occurred. The frequency of

allocation recoveries gives a measure of the demand upon the

system operator for this type of decision making. An excessively

high number of allocation recoveries may indicate either poor

system planning or poor system operation.

* Vary Onl ine/Of f 1 i ne--the Vary records provide another

indication of decision-making on the part of the operator, as well as a measure of device availability. The Vary records, in

conjunction with the IPL record, provide measures of device

up-time, and frequency of Vary commands initiated by operators.

Since Vary Online commands may be issued to simulate the

device-ready interrupt for device mounting, those Vary Online

records that do not reflect a change in device status must be

discarded. The Vary records, combined with the I/O Configuration

record, can provide the frequency of changes in device status.

59
Among the measures of operator actions not provided by SMF

are:

* Volume Mounts- -al though SMF does not provide a record or a count of volume mounts, an approximation of the number of mounts

can be obtained by careful examination of the CLOSE/EOV records.

Such considerations as the presence or absence of Automatic

Volume Recognition (AVR) in the system, resident and reserved

volumes, presence of the RETAIN or PASS parameter, multi-volume

data sets, temporary data set allocation, and device class will

affect the number of volume mounts. SMF does not record the time

taken to perform a volume mount.

* Operator Action Delay--SMF under MVT provides no measure

of time spent awaiting operator action. There is a major

improvement to SMF in the VS versions of OS where the device

allocation end time has been added to the step termination

records. This time does not give a precise measure of operator

action times, since device allocation may be held up for a wide

variety of causes. Neither version of OS records time spent by

the operator responding to program or system messages requiring a console reply, nor the number of such actions.

Accounting for operator activity on the basis of SMF data is

difficult enough to discourage any attempt to distribute the

costs of such activity over individual jobs or job steps.

However, by analyzing the data set records, a count of external

actions can be developed that reflects the relative load a job

places on the operator, rather than specific mount commands,

which may be affected by pre-mounti ng , device conflicts with

other jobs, and changes in configurations or operator practices.

The next two paragraphs review the reasoning behind tape and disk

mount charge assignment.

1. Tape mounts

Generally, every tape EOV implies an operator action to

mount the tape at the start of the step and demount it when it is no longer needed, unless the tape is used in multiple steps,

RETAIN or PASS was specified in an earlier step, and the volume

sequence count is less than the number of devices allocated. A

mount should be charged for each tape device allocated to steps

that abend, since there may be no Close/EOV records. The

Close/EOV records for the same data set/DD statement can be

associated by using the TIOEJFCB field of the data set records.

The presence of the PASS or RETAIN parameter on the DD statement

can be inferred from the SMFTIOE field in the Close/EOV record.

2. Disk mounts

In most systems, very few allocations to DASD involve

operator interventions. Two approaches can provide measures of

operator actions, depending upon installation practice:

60
1) If specific devices are reserved for removable packs,

then the first allocation to one of those devices in a job and any change in volume serial for one of those

devices can be charged a mount.

2) If specific volumes are normally resident, then the

first request for a non-resident volume causes a mount charge to the job.

While both of these methods generally accumulate more mount

counts than actually occur, they have the advantage of fairly

high repeatability, the second method more so than the first.

C. Hardware Resources

1 . CPU time

This is the time used fetching and executing instructions;

in those 360's with integrated channels, it may also include

channel command execution and main storage access time. In any

360, the CPU may have to wait for access to main storage which is

being used by a channel; such delays are considered "CPU time"

since they occur during instruction fetch or execution cycles.

On a system-wide basis, i.e., total time spent executing

instructions, SMF does not measure CPU time. It does collect the

inverse of CPU time--wait time. Subject to certain imprecisions

and irregularities in the collection and reallocation of the wait

time values, wait time can be used to determine the total load on the CPU. In order for this value to be useful for tuning of a system, it would have to be further broken down by protect key

and system state--this information is not presently available to

any system function. Since the data collection interval is so long (ten minutes minimum) and may be broken if there is a system

failure, the data on CPU usage must be accompanied by an estimate

of its reliability.

On a job step basis CPU time is collected from the time a program begins execution until it terminates.

Initiator/Terminator CPU time is not collected. This CPU time

figure, however, may contain a substantial amount of time that is

not actually related to the execution of the program, primarily

I/O interrupt overhead for other tasks including time spent in

appendages. There are many tasks for which no CPU time is

recorded--system tasks and never-ending job steps such as HASP.

Such tasks tet^minate only when the system crashes, so no SMF

records are ever written for them.

In MVT systems, from 85% to 90% of the CPU time used by

problem programs is reported in the step termination records.

Since the CPU time that is not separately accumulated and not

lost (e.g., I/O interrupt servicing time) is distributed over the

tasks in execution in proportion to how much CPU time was used by

each one, the reported CPU time in the step termination records

is a relative measure of the CPU time used by a step. If the job

61
mix varies widely from run to run, there may be variations as large as 36% in the CPU time allocated to a job step for the

execution of the same instructions.

2. Main storage

Main storage space, or "core" as it is usually called, is

both a fixed and a dynamic resource. Allocation of main storage

is controlled by the Main Storage Supervisor ( GE TMA I N/FREEMA I N

)

rout i nes

.

Main storage has three primary characteristics: speed,

address, and protect key. The operating system provides for

control of two speeds of core: high-speed or processor core, and

slower Large Core Storage or LCS; the control of two types of

main storage is an operating system feature called hierarchy

support. Address is a characteristic of main storage that is

significant for performance analysis, since the requirement for

contiguous real storage addresses is the major difference between

MVT and later versions of the operating system. This requirement

for contiguous address intervals or "regions" is of concern when

evaluating core allocation and usage. Storage protect keys are

the hardware feature used by MVT to protect one task from

another. The hardware restriction of 16 possible keys limits

this resource and consequently the number of protected tasks in

the system. Since the 360 architecture provides only one protect

key for every 2048 bytes of core, the 2K block becomes the

smallest unit that the Main Storage Supervisor can use in

allocating regions. In fact, the structure and schema of the

Main Storage Supervisor are based on 2K units.

The method of allocating regions is also the major

difference between MVT and MET. In MPT, partitions are allocated

by a routine (GETPART) at initialization time and whenever a DEFINE command is processed. In MVT, the GETPART routine is

invoked dynamically by the initiators: consequently, the problem

program area of main storage can be used more flexibly.

Usage of each type of main storage can be measured in terms

of quantity (bytes or K), frequency of reference, duration of

occupancy, and whether the usage is fixed or dynamic.

Fixed main storage consists of (1) the Nucleus which

contains resident routines, tables, and control areas; and (2)

the Link Pack Area which contains optionally resident routines

and may be distributed across processor storage and in LCS. The

only measure of fixed main storage provided by SMF is the maximum

hardware size at IPL time in the Type 0 record. The sizes of the

nucleus and link pack area are not available from SMF.

Dynamic main storage consists of a System Queue Area which

is used for control blocks for system functions and job steps and

the contents of which may be modified by the Supervisor only, and

a Dynamic Area which is used for region space for executing job

steps. SMF provides no measure of the amount of System Queue

52
Area used by a particular step. Various algorithms have been

developed to infer the nature of usage of the dynamic main

storage area from an analysis of the Type 4 records. However,

since no Type 4 records are written for system tasks such as mount and start commands and no measures of any kind are provided

for dynamic System Queue Area, all such algorithms have a high

degree of error.

By analyzing the Type 4 records (region size, protect key,

execution start and stop times), the amount of region space in use for job processing can be approximated. This measure

provides an indication of the amount of dynamic area in use for

productive work. The difficulty with this measure is that it is

unclear whether the remaining space was free, fragmented, or in use by tasks not accounted for.

On a step-by-step basis, the usage of the region requested

for a step can be analyzed by comparing the values of core

requested versus core used. While the core used figure may be

imprecise for many jobs, those jobs that request significantly

more region size than they need can be isolated using these

values. Any differences greater than 20% between core used and

core requested generally indicate wasted region space. Because

programs such as Sort/Merge and certain compilers adjust their

core requirements to use whatever space is available to them, job

steps executing them will always show 100% region utilization.

Region sizes for such steps can be chosen to improve storage

utilization of non-self- ad justing steps in the same job. Since

MVT tends to perform better if region sizes on the successive

steps of a job decrease rather than an increase, the

region-requested value can be analyzed to locate jobs that may be

contributing to poor core utilization.

The IBM 360 and 370 hardware does not provide any measure of

frequency-of- reference usage of core and hence no working set or

productivity measures of core on either a system or job step

basis are available from SMF.

The core-allocated values for each main storage hierarchy

are present in the step termination record. These values are

only the amounts of core and LCS in the region and do not include

System Queue Area. The measure of the main storage resource must

include a time-in-use quantity to be meaningful. Two approaches

are possible using the SMF data, as discussed in the next two

sub secti ons

.

a. Job step duration

Using the start time from the step or job initiation record

and the termination time from the job termination record, the job

duration can be computed. This value accurately reflects the

time the job resided in core, but since, in a mult i -programming

environment, there is high variability in job durations due to

the interference of other jobs, this value does not accurately

reflect the demand placed on this resource by the job.

63
b. Effective duration

Based on the idea that, when a task is ready to compute or

do I/O but cannot because another task has control of the CPU or

channels, that task's core is not effectively "in use", a number

of algorithms have been developed to compute an effective

duration, and hence a more repeatable core usage value. The idea

is to add to the measured CPU time an "effective I/O time" based

on I/O usage. How to arrive at an effective I/O time is

explained below under "I/O devices".

Whether actual or effective duration is used to measure

occupancy time, the main storage usage charged to a job step is

normally taken to be the product of core allocated and residency

time, expressed in such units as k i 1 obyt e- mi n ut e s

.

3. Direct-access storage

Direct-access storage is storage on any of the variety of

magnetic disk or drum devices available to IBM 360-370's.

Devices can be classified by transfer rate, capacity, track size,

and performance characteristics. Devices with similar

characteristics have the same "device type" assigned to them for

identification by the Operating System. In any configuration,

there is a finite quantity of DASD storage. Some jobs may have

to await the freeing of DASD space before they can execute if the

resource is saturated; many will terminate abnormally if the

resource isexhausted.

DASD storage may be subdivided into spool space, work space,

online storage, and offline storage; it may be further

classified by device type and device performance. Space may also

be valued more highly if it is on a dedicated or resident volume,

becoming in effect a part of the operating system. SMF provides

very few measures of DASD space usage, and some of the measures

are better provided by other OS functions.

a. Space available

While the space available record reports the available space

on a DASD volume and various volume characteristics, its

usefulness for space management or analysis is limited. Multiple

volumes with the same serial number or the actions of utilities

can radically change the values reported by SMF. The Type 19

record is only written at IPL, HALT, SWITCH, or volume removal

time. Thus, in a stable OS system, the Type 19 information may

be very stale. An lEHLIST of the volume provides the same

information as the Type 19 record. Additionally, the lEHLIST

utility can show data set allocation by data set name so that

maintenance action can be taken.

There is no way permanent or sem i - pe rmanent DASD space can

be allocated to a single job. This is more appropriately handled

by a DASD space management system that can allocate track days to

specific users.

64
b. Space used

The data set records (Types 14 and 15) provide a partial

measure of the amount of temporary disk space used by each step.

This includes time in use, tracks allocated and used, volume

serial number, device type, and primary device address. This

data does not include data sets allocated but not opened, data

sets allocated in one step and passed around the step being

measured, or work data sets allocated but not classified as temporary by the system. A more precise picture of work space

can be obtained by combining the data set records with the

scratch records. This information, combined and graphed over

time, can provide a map of the usage of PUBLIC and STORAGE

volumes for work data sets.

DASD work space for temporary data sets can be determined

for a job by combining the data set records and the scratch

records. By making the assumption that a data set is allocated

in the first step that uses it, the high water mark for each step

can be determined and then, using either effective duration or actual duration, the work space use can be expressed in

track-seconds or track-minutes.

c. Productive use of DASD space

Productivity measures of DASD space are generally confined

to analyzing the density of data within a data set. SMF provides

two measures of density: the first is the tracks used

versus allocated figure from the data set records--thi s can

provide an analysis highlighting the worst cases. The second

measure uses the device type, access method, and logical record

length, also from the data set records, to determine the best

block size and compare it with the actual block size--this can

show where space is being wasted by poor choice of blocking

factors

.

4. Channel

s

When none of the tasks in a multiprogramming system is

highly computational in nature, overall performance depends

heavily on channel loading and interference among users of

direct-access storage devices.

Channels are in use for a task from the time the I/O is

started until the channel-end interrupt has been serviced and the

I/O operation is posted complete. This may be a simple operation

like a card read that performs a single buffer transfer; a more

complex operation like a disk write involving command chaining

and branching in the channel program; or a sophisticated

operation like a teleprocessing poll that relies on intricate

channel programs and appendage routines. While a channel (or

multiplexor sub-channel) is in use, a number of other tasks may

be waiting for the resource. The operating system provides

channel queues to pend these requests until the channel is

avai 1 abl e.

65
Channel utilization can be measured from a variety of

viewpoints: channel busy time, depth of channel queues, channel

data transfer, and channel storage access. Separate measures are

required for each channel, channel type, or sub-channel in the

configuration.

SMF does not measure channel usage. A large number of

channel transfers go unrecorded, e.g., system tasks, errors, and

actions by appendages; and the units counted (EXCP's) do not

reflect the usage of the channel for an I/O operation or even the

specific channel involved (in the case of a multi-channel

device). The analysis of EXCP counts from Type 4 or Type 14/15

records can provide an overall measure of job-related I/O

activity in the system, but the usefulness of such a measure for

analyzing system performance is limited. Only in systems with

single channel paths, a stable configuration and mounting

characteristics, as well as a similar workload from day to day,

can the SMF EXCP counts by channel give some indications of

channel balance, but no determination of total channel load can

be made.

Although channel usage cannot be precisely determined from

SMF data, it is possible, by assigning standard values to

variable device characteristics such as tape start time,

rotational delay and buffer transfer time, to approximate the

relative load placed on the channels by particular jobs. In

addition to these standard values that can be determined from

device class alone, if the block size value from the data set

records is used, the average data transfer time can be computed

and added to device latency. Since the characteristics of

channel usage vary significantly by access method, the data set

organization and access type (sequential or direct, input or

output) from the data set record can be used to estimate

rotational delay and arm movement latency values. Since the EXCP

access method does not provide block size values, transfer time

averages have to be used for this access type. Channel time for

HASP p seud 0- dev i ces can be assigned as a fraction of the implied

real disk I/O.

Channel utilization can be categorized by selector or block-multiplexor time and byte-multiplexor time based on the

high-order four bits of the device address.

5. I/O devices

I/O devices fall into two categories, (1) serially usable,

e.g., tapes and printers, and (2) sharable, e.g. disks and

drums

.

Serially usable devices are in use by a task or the system

on an exclusive basis from the time they are allocated until the

time they are deallocated. Such a device is completely

unavailable to other users during the time it is allocated, even

if there is no data transferred to or from it. For example, a tape drive may be allocated in a daily run to a file that is only

66
created once a month. Serially usable device utilization can be

measured by the time devices are allocated to tasks. Some

devices which are sharable may be used in a serial fashion; for

instance, very large d'isk data sets may require wholly dedicated

drives.

Sharable devices are only in use by tasks while they are

actually performing I/O operations on those devices. A single

I/O operation on a sharable device cannot be considered alone.

Each such operation has an associated overhead that affects all

other tasks using that device, since increased arm movement or

rotational delay causes more I/O wait time and consequently

greater core residency time. When considering the usage of

sharable devices, it is best to subdivide the devices based on utilization. Hence, classes of such devices can be created for:

(1) system residence volumes;

(2) resident private data sets or library volumes;

(3) public work space.

In many cases, devices are dedicated to a specific function

by the operations management group. Devices might be dedicated

for security reasons, to provide fast job turnaround or for the

ease of the operators. Such dedication must be considered when

discussing resource usage, even though it may not be reflected in

any quantitative measurement.

SMF provides a relatively good measure of the usage of

serial devices. Since such devices are in use from the time they

are allocated until they are deallocated, the step termination

record can provide a measure of device usage. The device address

combined with step start and end times gives the time each device

was allocated. Comparing this time with the time online derived

from an analysis of the I/O configuration. Vary Online, and Vary

Offline records gives a measure of the usage of available time.

A com pari son of time online to time available gives a measure of

usable time. When considering usage of serial devices, such

devices as unit record devices allocated to HASP, and HASP

pseudo-devices should be excluded from the analysis. For a serial device that is switchable from one CPU to another, the

usage figure must include contributions from all CPU's having

access to it.

An analysis of the productive use of serial devices can be

made using the step termination record and the data set records.

The step termination record gives the time the device was

allocated while the data set records give the number of EXCP's

and (for standard sequential data sets) the amount of data

transferred. Such an analysis can lead to the reconfiguration of

a step's devices for better resource utilization.

The analysis of the usage of sharable devices is more

difficult than that for serial devices. The usage of a sharable

device is primarily the activity level of the volume on that

67
device. That is, given a number of devices of the same type, the

most heavily used device will be the one on which the most

heavily used volume is presently located. Heavy concentration of

device usage does not necessarily mean poor performance; the

opposite may be the case. Since analysis of channel utilization

has the objective of improving throughput by spreading the I/O

load among the channels, device usage analysis can be confined to

those elements concerned with devices alone. Such elements as arm movement and rotational delay affect device usage.

The data set records give the EXCP count for each volume

serial and device type, as well as the access method, block size,

and data set name. A period of usage is the step duration from

the appropriate step termination record. This data can be used

to identify the high-usage volumes, determine the relative usage

levels of the devices, reveal possible conflicting usages of

different data sets on the same volume, and locate high-volume

data sets with poor block sizes for the device. Because of the

imprecision of the data, care must be taken that sufficiently

high levels are identified, and further research may be called

for in order to improve performance. Many data sets that are

used by the system in a shared fashion are not recorded by SMF so that even moderate usage levels on those devices may be cause for

concern

.

Since SMF does not record the length of time from I/O start

to I/O completion, it is necessary to develop an effective I/O

time. This time is channel time, computed as above, plus

dev ic e- dependent waiting times such as tape stop time, disk head

seeks and forms or card movement. Most costing algorithms view

all I/O time as additive, but in the opinion of the authors, if

teleprocessing devices are excluded, selector and

block-multiplexor channel devices should be considered additive,

but byte-multiplexor devices should be considered limiting. That

is, the I/O time ought to be taken as the sum of the I/O time

from selector and block-multiplexor devices or the longest time

of byte-multiplexor devices, whichever is longer. This more

accurately reflects the fact that a card-to-tape job usually runs

at the speed of the far slower card reader, but a tape-to-tape

job takes the full time to read and write both files.

Development of an effective I/O time ignores the benefits

derived by some jobs due to the overlapping of I/O activity, but

in heavily loaded systems, such overlap more often accrues to the

system (by increasing the multiprogramming level) than to a specific task. On the other hand, such a treatment has a high

degree of repeatability, and with proper calibration can be madr

very precise using sampling and monitoring. For purposes of

accounting for usage of I/O devices by job steps, serial devices

must be treated differently from sharabl e devices.

Since serial devices such as tapes, card readers, mountable

DASD and the like are in exclusive use the whole time they are

allocated to a step, the actual measure of usage is, like main

storage, the duration of the step. As noted above, this value is

68
quite variable,

duration.

so that a better measure is again effective

For shared devices, the most appropriate usage measure is

simply the I/O time on those devices. This takes into account

access method, access type, device latency such as rotational

delay and arm movement, and data transfer time.

Some installations have divided d i rect- access devices by

address, defining some as shared (PUBLIC or STORAGE) and others

as serial (PRIVATE). Others have assigned these characteristics

on the basis of volume serial number and, in at least one

installation, by the temporary flag in the data set records.

6. Media

This class comprises printed lines, punched cards, paper

tape, microfilm, magnetic ink and all other non-reusable

recording media. Each physical medium may be further classified

by usage. For example, the user may group his printed output

into different Sysout classes according to content, or the

installation may want to assign higher costs for printing during

prime shift, at high priority, or on special forms.

Other than cards punched and lines printed, SMF provides

very little direct information about non-reusable media

resources. Specific devices such as a MICR printer or paper tape

punch could be isolated and media usage calculated from the EXCP

counts. With punched cards, the usage measure is good as long as the Sysout writer is used, since counts in the Type 6 record

include the form number and one output record is one card. For

printed output, the measure is not quite so precise, since a line

count rather than a page and line count is provided. But the

counts for printing are provided by form number so that proper

conversions to page counts could be applied to develop media

usage. If output devices are directly allocated to steps rather

than producing output through Sysout, the computation becomes

more complex, since the EXCP counts must be accumulated and then

form numbers externally assigned.

Since the Sysout records contain line or punched-card

counts, it is possible to allocate media to specific jobs in

terms of lines printed or cards punched. The form-number field

in the Type 6 record allows media usage to be categorized by type

of form or card stock. In non-HASP systems, Sysout usage can

only be allocated on a job basis; it cannot be further broken

down to job steps using only the SMF data.

7 . Vo 1 ume s

The term "volumes" is used to describe physical devices

within or upon which data is recorded and which are viewed by OS as limited in capacity. Each volume (disk pack, drum, tape reel,

etc.) is identified by a serial number that must be unique within

69
OS at any one point in time. Volumes are a finite resource for

each device class, in that each volume contains only a limited

amount of data. Even within device classes, there may be

variations in capacity, e.g., 2400, 1200, and 600-foot tape

reel s

.

Space within a disk volume is controlled by Direct Access

Device Space Management, DADSM (see "Di rect- access storage"

above), but control of volumes themselves is mainly left to the

system operator or the user through JCL. OS uses the volume

serial number to ensure t.hat volumes requiring serial devices

(e.g., tapes) are allocated to jobs one at a time. The

allocation of non-specific references to volumes is primarily

controlled by assignment of a volume state (public, private, or

storage) by the system operator (via the MOUNT command) or by the

user (via the V0LUME = PR IVATE parameter on the DD statement). The

availability of a volume is also controlled by the assignment of

a mount attribute to the volume at the time the volume is

presented to the system, either by the operator when it is

mounted or by the operating system if the volume is already

mounted at IPL time.

The management of volumes in OS has a major impact on such

resources as initiators (device allocation), operators (volume

mounting), DASD space, and others. Volume usage can be measured

in terms of frequency of reference, amount of capacity in use,

duration of usage, and amount of time spent waiting for volumes.

By matching data set records with the corresponding step

termination records, the duration of volume usage by each job

step can be determined. Volume serial numbers, EXCP counts, and

channel and unit addresses are available directly from the data

set records. Thus the measures of volume usage practically

available from SMF data are frequency of reference and duration

of usage. These measures can be used to isolate tape volumes

with small data sets more appropriately allocated to disk or

stacked on tape, disk volumes seldom used but inappropriately

made resident, or disk volumes heavily used but mountable. By

combining volume use data with DASD volume space analysis data,

reorganization of data sets to reduce volume mounting can be

accompl i shed .

8. Shared DASD

Shared DASD support is a feature of MVT that provides for

sharing of d i rect- access storage devices between two or more

CPU's. Shared DASD does not refer to those devices that are

switchable from one CPU to another but rather to concurrent usage

by two CPU's. The hardware that supports this feature is

supplemented by routines in operating system components to use the feature.

Shared DASD should be considered a separate resource, since

the use of a shared device by jobs running in one CPU can affect

the operation of the other CPU. In this case, then, the usage of

a resource cannot be viewed from the standpoint of the single

70
system, but must be viewed by considering the composite system.

Shared DASD provides many benefits, since data that is used

by jobs that must run on different CPU's can be shared and

thereby reduce disk space requirements and volume mounting.

Likewise, work space can be shared and provide higher utilization

of disk space and decrease total space requirements.

Since DASD volumes that are shared between systems must be

mounted resident or reserved on the sharable devices while they

are in concurrent use, they provide a unique operational problem.

Likewise, because of the necessity to combine usage from two or more systems and the possibility that sharable devices may not

always be used in a shared manner, shared DASD has unique

measurement requirements. Shared DASD must be measured in the

same units as DASD space and sharable I/O devices.

Like ordinary sharable devices, shared DASD usage can be

measured by the activity level of the device. If the volumes

contain such system data sets as catalogs, program libraries, and

SMF or error recording data sets, a significant number of EXCP's

to the devices will go unrecorded. For other data sets, the EXCP

counts, block size, data set name, and access method are

available from the data set records, and the usage period is

available from the corresponding step termination.

For shared devices, it is necessary to combine the SMF data

from both systems and establish an equivalence of device

addresses. If shared DASD space is used for work space, then it

will be necessary to combine data set, step termination, and

scratch records for both systems in order to measure work space

usage on each system.

D. Software Resources

1 . Dev ice all ocat i on Device allocation and deallocation is strictly a sequential

process. Although several initiators may be active in the system

at a time, only one of these may currently be allocating or deallocating I/O devices. Any other initiator(s) needing to do

so must wait until the active one is finished. Thus delays in

device allocation for one job prevent other jobs (eventually, all

jobs) in the system from being initiated or terminated.

The measures of device allocation as a resource are simply

the time (CPU, channel, wait time) spent allocating and

deallocating devices and the time spent waiting to allocate or

deallocate devices. This resource is so critical to system

performance that software products which replace the MVT device

allocation algorithm with a better one are now being marketed,

and IBM itself uses an improved algorithm in OS/VS.

71
The only measure of device allocation available from SMF is

the duration in device allocation and region allocation provided

by the difference between the step start time and the problem

program load time on the step termination record. By plotting

this time against the number of initiators in use (derived from

job durations and protect keys), a performance analyst could spot

device allocation interlocks caused by too many initiators or bad

cl ass asi gnments

.

2. Data set names

Another software resource for which contention may develop

is data set names. If two concurrently executing jobs wish to use the same data set, and at least one of them requests

exclusive control through its JCL, then whichever job is

initiated first will force the other to wait for the data set

until the first job terminates. (The operator has the option of

cancelling the second job.) Since high usage of a data set does

not necessarily develop contention, measures of exclusive use,

shared use, initiator time waiting for shared use, and initiator

time waiting for exclusive use must be provided to analyze this

resource. SMF provides no straightforward method of analyzing

queues of data set names, although this bottleneck can be most

difficult for operations to control.

3. Transient areas

A potential system bottleneck is I/O error recovery. All

I/O errors cause some form of recovery to be attempted under the

control of the System Error Task. This task is performed by

several modules which are loaded into a single transient area in

the Supervisor (low memory addresses). Particularly on

teleprocessing systems with hundreds of terminals it is possible

for bursts of nearly simultaneous errors on numerous devices to

keep the System Error Task busy for seconds at a time;

meanwhile, nothing else will be happening in the system, not even

operator console communication, since the System Error Task has

higher priority than the Communications Task.

Portions of the operating system that are infrequently used

may be stored on disk in SVCLIB and retrieved into core and

executed only when required. These routines execute from fixed"

1024-byte transient areas in the nucleus. Optionally, some of

the more heavily-used routines may be made resident in the Link

Pack area as resident SVC's. Each transient area can be in use

by only one transient module at a time and all tasks must share

the available transient areas, although higher priority routines

can steal transient areas. The SVC transient areas and routines

are a high-demand resource that is further limited by access to

the SVCLIB data set, arm movement, and channel access to the

Sysres device (upon which SVCLIB must reside). In a heavily

loaded system, one of the major tuning functions is the balancing

of the number of transient areas, placement of data sets on the

Sysres volume, and the control of the Link Pack Area--an

affected by transient SVC usage. Measures of this resource can

72
be expressed in terms of frequency of reference to each transient

routine, time in use of each transient area, and length of time

tasks were enqueued on transient areas and routines. The

measures of the usage of the I/O error transient area are:

length of time transient area was in use, length of time each

transient routine was in use, and length of time tasks were

enqueued for the use of the error transients. This information

would, if readily available, make it easy to decide which

routines should be made resident. As SMF provides no data for

the analysis and management of transient area usage, alternative

measurement techniques (special-purpose software monitors or

hardware monitors) must be used.

4. System catalog

Another important resource on which SMF provides no information is the utilization of the OS catalog. The structure

of the OS catalog is such that the overhead of searching for a data set name in the catalog depends far more on the distribution

of index levels and control volumes than it does on the total

number of data sets catalogued on the system. The usage of the

catalog can vary radically from job to job, and the number of

accesses may vary significantly from data set to data set or even

from day to day for the same data set. The measure of usage of

the catalog should be separated for system catalog and user

catalogs and for the number of entries searched at each level.

An overall measure of catalog usage could be derived from

initiator time spent waiting on catalog searches and Sysres usage

for catalog access.

5. Work queue

The system work queue ( S YS 1 . SYS JOBQE and, in HASP systems,

the HASP input queue) is a twofold resource. It is a finite

repository for jobs awaiting execution and a serially reusable

source of control blocks for steps in allocation, execution, or

deallocation. Since a system can remain loaded only if

executable jobs are enqueued, it is important that the input

queue be large enough to contain a sufficient number of jobs

awaiting execution. Inadequate queue size is indicated by an operator message and requires no special analysis.

Overal 1 ocation of the input queue and consequent underut i 1 i zation

of disk space could be analyzed by a measure of the high water

mark of queue records in use.

The serial use of the system work queue data set may result

in wait time for many tasks in the system. The measures of this

aspect of the resource are time spent waiting for Job Queue

access and accesses by component.

Generally, SMF provides very little information for

measurement or analysis of the work queue. It is possible, by

using the time stamps on the job termination and step termination

records to determine how long jobs spend in the queue. The

average number of steps and DD statements per job can be

73
determined from the step termination records. These figures are

very poor measures of queue utilization, but may be useful for

estimating job queue parameters.

6 . Initiators

KVT provides for a maximum of fifteen i ni ti ators--one for

each non-zero protect key. One initiator is dedicated to a job

for the life of that job; hence, a maximum of fifteen jobs can

run in the system at any one time. Each initiator proceeds

through a defined set of functions allocating and deallocating

resources to each step of the job. Many of these functions can

only be done by one initiator at a time, so each one enqueues on

a class of resources prior to allocating from that class. Other

functions require demand allocation of resources on a first-come,

first-served basis.

Since time spent with the initiator is nonproductive time

for job processing, the initiators have higher priority than any

processing task to speed their functions. Even with this

priority, initiators frequently spend relatively long periods

waiting for such resources as main core, system queue, catalog,

device allocation, operator action, and volume verification. To

the same degree that initiators are interlocked, system

throughput is affected. In many cases, the nature of available

resources is such that fewer rather than more initiators will

improve system throughput and overall performance. To determine

the proper system balance, measures of initiator usage must be

combined for analysis. Measures of initiator usage include:

length of time each initiator has a job selected, length of time

spent waiting for each resource, number of initiators in use and

the status of each one, job classes assigned to each initiator,

and the amounts of CPU time, core, and System Queue Area and the

number of EXCP's used by each initiator.

SMF provides no measure of initiator CPU time, EXCP's, or

System Queue Area usage. However, by using the job select time,

step select time, step end time, job end time, protect key, and

job class from the step records and job records, the number of

initiators in use, job classes in use, and duration of time each

initiator has a job selected can be determined.

7. Spool/HASP

The spooling of output destined for recording on external

media is indispensable for flexible job scheduling. However,

relieving the pressure on hardware resources (printers, punches,

etc.) creates a software resource whose allocation affects

throughput and job turnaround; consequently, measures of spool

utilization are of interest to installation management.

The spool resource is composed of two elements, namely,

space to hold spooled output (usually on DASD) and space to hold

control information identifying spooled data sets. In OS/MVT

without HASP, system output (Sysout) data sets may be spooled

74
onto DASD or tape; since spooling to tape is extremely rare,

spool space is effectively a subset of direct-access space.

Likewise, control information for Sysout data sets is contained

in special records (Data Set Blocks or DSB's) in the OS Job Queue

and thus can be considered a subset of the work queue resource.

Because of its special function in the system and special

treatment in the job control language, spool space is

nevertheless worth isolating as a distinct resource. It can be

controlled and accounted for separately from DASD in general.

In systems with HASP, the existence of a separate spool

resource is much more obvious, since HASP'S spool space is

pre- al 1 ocated and pre- f o rmatted , usually on one or more dedicated

volumes, and is thus physically as well as logically distinct

from other DASD space. This is, in fact, one of HASP'S

advantages, since the percentage utilization of spool space can

always be calculated and displayed on the console in response to

an operator inquiry. HASP is similar to OS in that jobs awaiting

print (or punch) are controlled by records in the Job Qupue

(hasp's queue, not the OS queue), making it possible for heavy

use of this element of the spool resource to prevent acceptance

of further jobs into the system. Job entry may have to wait for

reduction of the backlog of spooled output. There is a significant difference in that HASP requires one job-queue record

per job awaiting print or punch, whereas OS requires one DSB per

Sysout data set, so the second element of the spool resource has

much more predictable utilization in a HASP system.

Allocation of space to Sysout data sets is done dynamically

on a record basis under HASP, but statically on a data set basis

in OS. This means that, under HASP, available spool space is

used for Sysout records as they are created, and the number of

records created by each job is kept track of; when this number

exceeds the estimate provided on the JOB card, the operator is

informed and the job may be cancelled or allowed to continue.

Under OS/MVT, the programmer must estimate the space for each

Sysout data set in advance, and the job will be abnormally

terminated if it attempts to write output in excess of the

maximum space allocation. An OUTLIK parameter is also provided

to allow limitation of output per data set on the basis of number

of records written.

Measurement of spool utilization thus will differ, at least

in its interpretation, between HASP and non-HASP systems. The

first element, spool space, is readily quantified under HASP as number of DASD tracks available and used for spooling, and the

percentage utilization is immediately available. Under OS, the

total space available on public and storage DASD volumes could be

subdivided into free space, space allocated to Sysout data sets

(and to spooled input data sets), and space allocated to other

data sets; then spool space as a percentage of the sum of spool

space and free space would serve as a measure of relative spool

space utilization comparable to HASP'S percentage utilization

figure.

75
Similarly, in either system, the number of Job Queue entries

being used to control spooled data could be expressed as a percentage of the maximum number of entries less the number

currently in use for other purposes. This would give a measure

of the relative utilization of the second element of the spool

resource, namely, spool control space.

Because HASP is not integrated into SMF in the MVT version

of OS, many installations using HASP have added the capability to

HASP to write SMF records for system output. This is essential

if any measure of HASP output is to be provided using SMF.

The spool usage data provided by SMF consists of line (or

card) counts from the Type 6 records and DASD space and EXCP

counts from the Type 14/15 records. These records provide time

relations to show print (or punch) volumes and backlog by hour.

The data set records can be used to determine the amount of I/O

activity to the spool devices, space allocated and used, and

effectiveness of block sizes.

As mentioned earlier, many HASP systems have been modified

to write Sysout records, and some write Sysin counts as well. In

systems without HASP, the Sysin record count is available in the

step termination record. These counts and the Sysout records

provide the ability to allocate usage of Sysin devices on a step-by-step basis and that of Sysout devices on a job basis.

In HASP systems, the EXCP count for the pseudo-devices from

the step termination records can be used to allocate the usage of

HASP itself to jobs. This value is preferable to the

Sysin/Sysout counts since the EXCP count is unaffected by

multiple copy parameters.

8. Communications task

The (operator) communications task is responsible for

communication between the system operators and OS components.

The communications task receives messages from operating system

components or user programs and queues them for display at the

appropriate operator's console(s). In the other direction, the

communications task receives commands from the system operators

and routes them to command processors or user programs.

The two-way flow of messages through the communications task

is determined by the type of console devices supported, the

message buffers allocated, the availability of transient areas,

and the availability of command processing tasks.

76
In order to measure the usage of the communications task, it

is necessary to measure the usage of the message buffers, with

such measures as: duration each buffer is in use, total time

tasks are waiting for buffers to become available, and average

number of messages queued for each console. Additionally, the

I/O usage of consoles could be considered by examining the

frequency and length of console I/O's. However, none of these

measurements is supplied by SMF.

9. The SMF writer

The SMF Writer task (see section IV. A. 3 above) is a serially

used resource whose efficiency is determined by the size of the

SMF buffer, the recording media for SMF data, and the

availability of the SMFWTM (SVC 83) routine and the TCLOSE (SVC

23) routines.

Measures of the usage of the SMF Writer include the number

of records written by time interval, the average size of the

records, the I/O load on the SMF device (channel and speed of the

device as reflected by I/O duration of the SMF writer), and the

time spent by tasks awaiting completion of SMF writes or enqueued

on the SMF buffer.

The SMF data itself provides a number of measures of the SMF

writer: frequency of records written, the amount of segmentation

of records, and the modal time between records. These measures

can be used to evaluate the overall usage of the SMF writer and

the possible impact of changes in the SMF parameters.

77

VI. Summary and Recommendations

The first five sections of this report have described how

SMF works, how to install and operate it, and the uses to which

it is customarily put in system performance evaluation. This

final section deals with three important questions that should be

asked about any measurement tool: How accurate is it? How

expensive is it to use? How may it be adj isted to improve its

usefulness? These questions were investigated with some rigor in

the course of this study^ and the results are summarized below.

For purposes of this study, the "accuracy" of SMF was

considered in two respects: absolute and relative. Absolute

accuracy was understood to mean the degree to which SMF

measurements of some system characteristic approximated

measurements of that same characteristic by another technique

accepted as accurate (a hardware monitor, in this instance).

Relative accuracy, or variability, was understood to mean the

extent to which a fixed set of problem programs would produce

consistent SMF measurements after repeated execution of the same

set. Absolute accuracy is of particular interest in performance

tuning, where the actual consequences of variations in the system

environment may be critical. Relative accuracy tends to be more

important in chargeback, where inconsistent user charges are apt

to produce more complaints than poor service.

To test the absolute accuracy of SMF, one specific SMF data

item (system wait time) was compared with carefully calibrated,

external measurements of the same event. The job stream used for

this controlled experiment contained 15 types of jobs, including

several "synthetic" jobs designed to have closely controlled

patterns of resource usage, and "natural" jobs chosen to be

representative of typical batch workloads. Most of the "natural"

jobs used IBM-supplied programs such as compilers, utilities and

the linkage editor. These jobs were run repeatedly as a single

fixed job stream on a dedicated machine under simultaneous

monitoring by SMF and a commercial hardware monitor. The main

conclusion from these tests was that SMF system wait time

measurements agreed closely enough with hardware monitor

measurement to be useful for system tuning. The CPU-busy value

obtained by computing the difference between system wait time and

elapsed wall-clock time were only 0.7% lower than comparable

values obtained by hardware monitoring.

Note that these conclusions apply only to a total job

stream. If precise CPU timings must be obtained for a single job

using only SMF as a measurement tool, the authors recommend that

the following procedure be employed:

79
* run a single-threaded test consisting of one

dummy job and the job to be measured;

* switch and dump SMF data sets;

* switch SMF data sets again, and run another

si ngl e- t hread test containing only the dummy job;

* switch SMF data sets once more, discard the one

consisting of records written in the interlude

between tests, and dump the one for the second test;

* use cumulative SMF wait time and elapsed time to derive

CPU-busy time for each test; and

* take the difference of these figures as the true CPU

cost of running the job in question.

In the above procedure or any application of SMF system wait time

the elapsed time should be taken as the difference between the

time stamp on the Type 12 record and the time stamp on the

previous Type 12 or Type 0 record. If this latter time is

unavailable, it can be approximated by inspection of the

operator's console log.

It should be noted that this procedure differs from the SMF

manual, which recommends that the measurement interval for wait

time "can be obtained by calculating the difference between the

time stamp on the first type 1 record and the time stamp on the

type 12 record ."( <3 > ) This method ignores the time between the

start of SMF wait time collection and the writing of the first

Type 1 record. SMF wait time collection begins with an IPL and

starts afresh every time a Z EOD (Halt End-of-Day) or I SMF

(Switch SMF) command is processed. Thus the time stamp on the

Type 0 record or the time stamp on the previous Type 12 record

(which would usually be found on the other SM data set) should be

taken as the beginning of the measurement interval. If the

interval begins with an IPL, the amount of wait time reported in

the Type 0 record should not be included in the total derived

from the Type 1 and Type 12 records, as this wait time accrued

before the time stamp on the Type 0. Ignoring the wait time in

the first Type 1 record in a similar way would not salvage the

method of <3> because only the upper level of the two-level

buffer used by SMF to accumulate the wait time is emptied when

the Type 1 record is written. The writing of a Type 0 or Type 12

record, on the other hand, empties both levels. Since each SMF

recording interval in the validation experiment began and ended

with a Switch SMF command, and only one SMF data set was dumped

to tape for each test run, the Type 12 record for the first

Switch command was not available for elapsed time calculation (or

for any other purpose). Therefore, the elapsed time was taken

from the console log instead. The next major objective of this

phase of the study was to determine the relative accuracy, or

variability, of two critical SMF measurements: CPU time and EXCP

counts. The test job stream consisted of three jobs which were

80
run repeatedly in a production environment over a period of

several weeks, during which pertinent SMF data was collected and

tabulated. Then these same jobs were run si ngl e- threaded , i.e.,

with only one initiator active, and the figures derived from

these runs were used as base values for a statistical analysis of

the fluctuations observed in the production runs. The major

results of this experiment showed (1) that CPU time recorded by

SMF for individual job steps exhibited a random variability

ranging up to 25% for typical batch jobs, (2) that SMF EXCP

counts are generally accurate and repeatable as long as chained

scheduling is not used, (Chained scheduling can introduce more

than 80% variability into EXCP counts.), (3) that the use of

chained scheduling increases the variability of SMF-reported step

CPU times, (The coefficient of variation went from less than 5%

to more than 7.5% in the validation experiment when chained

scheduling was used.}, and (4) a significant percentage (in our

observation, 12%) of overall CPU-busy time is lost by SMF when

allocating CPU time to jobs. (This time is inaccurately

classified by SMF as "O.S. overhead".)

Because of its obvious impact on SMF measurements, a word

about chained scheduling might be in order. Chained scheduling

of sequential I/O is an OS option which causes the channel

program to be modified dynamically in an attempt to keep the

channel and device busy continuously. The CPU activity involved

in this attempt is synchronized with the I/O by means of

program- control 1 ed interruptions (PCI's), a 360 hardware feature.

This form of I/O involves unpredictable amounts of CPU overhead

for supervisor routines modifying and restarting channel

programs. Moreover, chained scheduling is highly

timing-dependent, and hence extremely sensitive to environmental

fl uctuations.

EXCP counting is also quite unpredictable under chained

scheduling. The median value of EXCP's under chained scheduling

was lower than the standalone base value because on a loaded

system the CPU is less likely to have another block ready to be

written at the time a PCI occurs; in this situation the channel

program is allowed to terminate, so the processing resembles that

for ordinary sequential output. It is paradoxical but true that

SMF always records more EXCP's for chained scheduling than

without, even though fewer I/O operations are actually started at

the hardwa re 1 evel

.

As an aside, the variability experiment also showed that the

predictability of CPU time on the basis of published instruction

timings for the IBM System/360 Model 65 depends on the class of

instructions being executed. Times measured for the types of

instructions executed in fixed binary arithmetic (RR and RX)

agree cosely with values predicted in advance. Timings for

storage- to- storage moves and floating-point arithmetic were found

to be much less predictable.

81
On the basis of code analysis, all of the above conclusions

can be applied qualitatively to OS/MFT systems as well as to

OS/MVT. These quantitative figures should be expected to vary

from one OS installation to another dependng on hardware

configuration, system generation options and workload

characteristics. The claim that OS overhead is not accurately » measured by SMF is also based on code analysis, which indicates

that I/O interrupt processing time is charged to the interrupted

task rather than to the task issuing the I/O, or is not charged

to any task at all if the system is in the wait state when

interrupted.

The analysis of the SMF EXCP counting algorithm earlier in

this report revealed a bias against steps having a large number

of statements, a situation that is found with many teleprocessing

systems. This finding was confirmed by the experimental results

on SMF data collection overhead. Code analysis of the MVS system

has indicated that the use of chained scheduling for most

sequential I/O will cause major irregularities in the EXCP counts

recorded by SMF. This analysis further predicts that the EXCP

counts for MVS chained scheduling will always be less than the

counts for the nonchained scheduling, which in turn are always

less than the counts for chained scheduling under OS (MFT or

MVT). In any attempt to perceive reality it is important to know

how much of what is observed is the observer's own shadow. To

gather data on resource utilization in OS/360 itself requires

resources, which may either be external to the system (e.g., a hardware monitor or sensor-driven minicomputer) or internalized

in the form of additional overhead. Any software i n st r umenat i o

n

installed in the operating system for performance analysis

purposes should include some means of measuring both OS overhead

and that fraction of it caused by the instrumentation itself.

Although SMF generally fails to account for the resources

used by OS, the overhead incurred by SMF itself can be deduced

from SMF records. There are two components of SMF overhead,

namely, that which can be allocated to individual jobs (and in

fact is included in j ob/ step-rel ated usage measures) and that

which is pure OS overhead. For example, a job step which

repeatedly opens and closes a file causes many SMF Type 14/15

records to be produced, and the CPU time required to construct

the records and move them to the SMF buffer is charged to the

step in the Type 4 record. The actual writing of the Type 14/15

records to the SMF data set is performed by the SMF writer, a system task, and thus is not charged to any job step nor

explicitly recorded by SMF in any other way. However, the

resources consumed in writing the Type 14/15 records can be

estimated from the size and number of the record themselves.

Note that the "overhead" cost of SMF was considered in the

rather restricted sense of the additional load, over and above

user program execution, that is imposed upon a computer system by

SMF data collection and recording, and is expressed in units of

online resource consumption (system time, CPU time, supervisor

time and I/O load). No consideration was given to the benefits

82
that prudent use of SMF can bring to an EDP installation. No

estimate was made, either, of the development costs for producinq

SMF data reduction and report generation software, the personnel

costs of installing and operating the SMF subsystem, or the media

and storage costs for collecting and retaining historical SMF

data. Clearly, these questions must be taken into consideration

before a true cost/benefit assessment of the tool can be made.

The basic method used to measure SMF overhead was to run a test multiprogramming job stream under various operating system

conditions. In effect, two versions of the operating system, one

with SMF and one without, were used to isolate SMF data

collection overhead. In the version with SMF, four levels of

implementation were benchmarked: (1) SMF recording suppressed,

(2) only system SMF records, (3) only system and job records, and

(4) system, job step and data set records. Other variations in

the test environment made it possible to assess the effects of

varying SMF buffer size from the minimum allowed by OS to

full-track blocking (i.e., SMF buffer size equal to twice the

track capacity of the 2314 disk, since the SMF buffer is really a double buffer); and the effect on data collection overhead of

adding a teleprocessing job to the test stream.

The results of these tests showed that SMF data collection

overhead (i.e., SMF without data recording) was in the range of

6-8% of OS supervisor state CPU time. Almost two-thirds of this

was incurred in EXCP counting alone. Overhead is substantially

greater (by approximately 25%), both relatively and absolutely,

in systems with teleprocessing than without it. SMF data

recording overhead added less CPU overhead to the system than

EXCP counting, and its cost in system I/O overhead is trivial

except at sites that dedicate a tape drive to this function.

It is recommended, therefore, that any attempt to reduce SMF

overhead should begin with optimization of the code in the I/O

supervisor that maintains EXCP counts in the TCTIOT's for

nonsystem tasks. This could result in overall CPU time savings

of one or two percent, depending on the nature of the workload.

The all-around usefulness of SMF could be improved most

markedly by having the I/O Interruption Supervisor determine

which task is responsible for each I/O interruption as soon as possible after it occurs, and charge that task for the bulk of

the time required to process the interrupt. Another major

improvement would be to add code to the PUT routine or appendage

routine for chained scheduling to keep a count of the number of

successful joins, and add this to the EXCP count to arrive at a number of I/O operations which would at least be repeatable from

one run to the next of the same job. Ideally, of course, all

access method routines should provide data to SMF on the amount,

rate and type of I/O activity they perform; this would permit

analysis of the load on the I/O system in a way that EXCP counts

will never provide.

83
With regard to EXCP counts, it is strongly recommended that

DD statements for job steps that do any significant amount of I/O

be arranged in decreasing order of I/O activity in order to

minimize EXCP-counti ng overhead. If an MVS installation decides

that the fluctuations due to chained scheduling make EXCP counts

worthless for its purposes, it should modify the EXCP counting

routine to return control immediately to its caller, leaving the

EXCP count at zero, and completely eliminating the largest single

source of SMF overhead.

84
Appendix A: Summary of Job Management

A . Ma ster Sc hedul er

1. Console Interrupt Routine . Provides the Supervisor with

the information necessary to give control to the proper routine

following an attention interrupt.

2. Master Command EXCP Routine . Processes the CANCEL,

DISPLAY, MOUNT, REQ, START, STOP, UNLOAD, and LOAD commands.

3. Master Comma nd Routine . Analyzes command verbs and

gives control to the proper command executors.

4. Wr ite-to-operator Routine . Processes messages to the

operator and operator replies.

5 . External Interrupt Routine . Handles switch to the

alternate console when external interruptions occur.

B. Reader/ I nterpreter

1. Co ntrol Routi ne . Reads and interprets control

statements, passing control to the proper statement processing

rout i ne

.

2. Job Routine . Analyzes JOB statements and builds Job

Control Tables from their contents.

3. Execute Routine . Analyzes EXEC statements and builds

Step Co ntrol Tabl es from their contents.

4. Data De f i ni t i on Routine . Analyzes DD statements and

constructs Job File Co ntrol BLock s and Step I/O Tables from their

contents.

S5
Appendix A: Summary of Job Management (continued)

C. Initiator/Terminator

1. System Co ntrol Routine . Performs housekeeping

requirements as the first stage in initiating a job.

2. Execute St atement Condition Code Rout i ne . Processes

condition codes specified in the EXEC statement.

3. JFCB Housekeeping Co ntrol Routine . Determines the

proper JFCB processing routine and directs control to it.

4. A1 1 oc at ion Control Rout i ne . Performs

Initiator/Terminator housekeeping for allocation and setup.

5. Demand Allocation Routine . Constructs the Allocate Work

Table and the Volume Table, and begins device allocation to data

sets that are assigned specific devices.

6. Automatic Vo 1 ume Recogni ti on Ro ut i ne . Performs

allocation of devices on which volumes are mounted.

7. Decision Allocation Routine . Assigns devices to data

sets not already allocated.

8. TIOT Construction Routine . Obtains space for and builds

the TIOT for the processing program.

9. External Action Routine . Issues mounting instructions,

verifies correctly mounted volumes, and unloads incorrectly

mounted ones.

10. Space Reg uest Rout i ne . Processes requests for space on direct-access volumes.

11. Al 1 oc at ion Error Routine . Processes error conditions

occurring during allocation and setup.

12. Step Initiation Rout i ne . Performs all initiation

operations requ i red before control is passed to the processing

program

.

13. St ep Te rmi nat i on Routine . Performs general task

termination procedures in addition to passing control to the

appropriate routines for disposition and deallocation of data

sets and processing condition codes.

14. Job Term i nat i on Routine . Performs general job

termination procedures in addition to passing control to the

appropriate routine to release Job Queue, performing disposition

and deallocation, and user accounting.

86
Appendix B: Summary of Task Management

A. Interrupt Handlers

When an interruption (Supervisor call, program check,

external interrupt, I/O interrupt, or machine check) occurs, the

old PSW is stored in low memory and the CPU loads the

corresponding new PSW, also from a fixed low memory location.

This new PSW causes entry to the appropriate First-Level

Interruption Handler (FLIH), which analyzes the interruption and

routes control to the appropriate routine. In some cases, a Second-Level Interruption Handler is invoked to perform further

analysis. There are three options (SERO, SERl, and M'^iH) for the

Machine Check FLIH, depending on the model of 360 CPU being used.

1. SVC FLIH

2. SVC SLIH

3. Program Check FLIH

4. External FLIH

5. Timer SLIH

6. Console Switch Ro ut i ne

7. I/O FLIH

8. SERO

9. SERl

10. Machine Check Handler (MCH)

87
Ap pend i X B

:

Summary of Task Management (continued)

B. Type-1 SVC Routines

These routines receive control directly from the SVC FLIH;

they are resident in the nucleus, run disabled for all

interruptions except machine checks, and issue no SVC's of their

own. Consequently, they need less housekeeping than other SVC

routines. In what follows, SVC routines are denoted by the OS

Supervisor mac ro- i nst rue t i o n s which invoke them.

1. CHAP (SVC 44)

2. EXIT (SVC 3)

3. EXTRACT (SVC 40)

4. FREEMAIN (SVC 5)

5. GETMAIN (SVC 4)

6. POST (SVC 2)

7. TIME (SVC 11)

8. TTIMER (SVC 46)

9. WAIT (SVC 1)

88
Appendix B: Summary of Task Management (continued)

C. Type-2 SVC Routines

These routines are resident in the nucleus, but may issue

SVC's and/or enable interrupts. In particular, they may perform

I/O. They run under the control of an SVRB (Supervisor Request

Block) provided by the SVC SLIH.

1

2. DELETE (SVC 9)

3. DEQ (SVC 48)

4. DETACH (SVC 62)

5. ENQ (SVC 56)

6. Exit Effector, Stage 1 (SVC 43)

7. IDENTIFY (SVC 41)

8. LINK (SVC 6), XCTL (SVC

SYNCH (SVC 12)

7). LOAD (SVC 8) , and

9. SEGLD or SEGWT (SVC 37)

(SVC 45)

a nd Overlay Supervisor

10. SPIE (SVC 14)

11. STIMER (SVC 47)

89
Appendix B: Summary of Task Management (continued)

D. Non-resident SVC Routines

These routines reside in SYSl.SVCLIB and execute out of a transient area in the nucleus, unless they were preloaded into

the Link Pack Area at IPL time. The transient area handler

section of the SVC SLIH schedules the loading of non-resident SVC

routines by the Transient Area Fetch routine as required.

1. ABDUMP and SNAP (SVC 51)

2. ABEND (SVC 13)

3. CHKPT (SVC 63)

4. Communications Task Router (SVC 72)

5. Log and WRITELOG Post (SVC 34)

6. RESTART (SVC 52)

7. STAE (SVC 60)

90
Appendix B: Summary of Task Management (continued)

E. Non-SVC Service Routines

These nucleus-resident routines are used by the Supervisor

itself to perform various task management functions.

1. ABTERM

2. ABTERM Prologue

3. DAR (Damage Assessment Routines)

4. Di spat Cher

5. EOT (End-of-Task) Routine

6. Exit Effector, Stage 2

7. Exit Effector, Stage 3

8. Program Fetch

9. Task Switch Routine

10. Transient Area Fetch

11. Transient Area Refresh

12. Type-1 Exit Routine

91
Appendix B: Summary of Task Management (continued)

F. Communications Task Routines

These routines, in conjunction with the Console Switch and

SVC 72 routines, provide special Supervisor support for the

Communications Task, which handles all traffic to and from the

operator's console(s). This system task, established at IPL

time, requires close co-ordination of Job Management (Master

Scheduler), Data Management (lOS and access methods) and Task

Management functions.

1. Console Support Routines

2. Dev i ce- I ndependent Display Operator Console

Support (DIDOCS)

3. External Processor

4. Initialization Routine

5. Miscellaneous Lookup Services

6. Multiple Console Support (MCS)

7. Reply Processor

8. Wait Routine

92
Appendix C: Summary of Data Management

A. Input/Output Supervisor

1. EXCP Supervisor . Tests channels for activity, handles

queuing and dequeuing, starts I/O operations, and performs EXCP

validity checking.

2 . I /O Interrupt Su perv i sor . Performs I/O interruption

analysis, UCB lookup, error recovery, channel channel search and

restart, I/O purge, and recording of error statistics.

3 . Error St ati st i c s by Vo 1 ume Routine ( SVC 91

)

. Summarizes

tape error statistics as an SMF Type 21 record.

B. Open/Cl ose/EOV

1. OPEN Routine . Performs volume verification and label

checking, fills in DCB's, builds needed DEB's, and determines and

loads the required access method modules.

2. RDJF CB Routine . Reads into main memory the JFCB's

associated with the DCB's in the parameter list.

3. CLOSE Routine . Performs labelling operations, purges

queued and active I/O requests associated associated with data

sets that are being operated on at the EXCP level, and keeps

track of the access method modul es necessary to restore each DCB

to its status prior to OPEN.

4. EOV Routine . Processes end-of- vol ume and end-of-data

set conditions for data sets having sequential organization.

93
Appendix C: Summary of Data Management (continued)

C. Direct-Access Device Space Management

1. A1 1 ocate Rout i ne (SVC 32

)

, Allocates initial space to

data sets.

2. Extend Routine . Allocates additional space to a data

set at end of existing extents.

3. Scratch Routine (SVC 29) . Deletes data sets by deleting

their respective data set control blocks.

4. Re 1 ease Rout i ne . Returns unused space to available

storage when a data set is closed.

5. Rename Rout i ne (SVC 30

)

. Changes the name of a referenced data set.

6. Obtain Rout i ne (SVC 27

)

. Provides direct access to any

block -in the VTOC.

7. LSPACE Routine (SVC 78) . Summarizes the available space

on a volume.

8. Protect Rout i ne (SVC 98

)

. Maintains the password data

set and marks status of protected data sets.

94
Appendix C: Summary of Data Management (continued)

D. Catalog Management

1. Catal og Rout i ne . Finds entries in the catalog;

inserts, d el etes , or replaces data set pointer entries, volume

control block pointer entries, and volume control blocks; enters

into and deletes from the catalog the indexes, generation index

pointer entries, control volume pointer entries, and alias

entr i es

.

2. CVOL Routine . Provides services to the Catalog Routine

by opening catalog data sets for processing and by writing format

blocks in new catalog data sets.

E. Access Methods

1. READ and WRITE Rout i nes . Construct device-specific

channel programs based on generalized user requests, and issue

EXCP to schedule them for execution.

2. CHECK Routine . Waits for I/O completion, then performs

error analysis and detects end-of-file or end-of- vol ume

conditions for sequential data sets.

3. GET and PUT Routi nes . Combine functions of READ or

WRITE and CHECK routines, plus buffer management and blocking and

deblocking of records.

4. NOTE/POINT Routine . Records current location within a sequential file, or repositions the file to a previously noted

1 ocat i on

.

5. FIND and BLDL Routines . Locate the starting position of

one or several member ( si of a partitioned data set.

6. Mi seel 1 aneous Rou t i nes . Perform device-dependent

control functions such as stacker selection on a card punch or conditioning of telecommunication lines.

95
nw o s J M w «< >- H 6-1 CQ o

PdN

OH

H oi: Hum J C3 O ^ H

et

UH

(H

O »« tM

9E »J

H CO o n PS o o U o U 03 u

pi

H

C o e 1-1 O o pa

(n

u

KH

•J

OS E3

(U

Q

tn tn

«i

u E in

«>:

U E 10

ec

w

t» o

paw

•J

CS

D

El

M

CO d:

<<

u S (0M « B H O

enH

to rc X V E 10

bi: u: • 1 K o t 03 U 1 1 O o 1 o O ) «« H t E-« >-) 1 E" 1 H

e< 95U t< ) <<

u 1 tH t M 1 •<

U 1 ts

H

K PS •J 1 « >J 1 iJ 1 09 1 03 •< W 13 1^ 1 M a Cm 1 1^ 1 A b. 1 M c ! to O U 1 Oi C M 1 N 1 EC H • a C 1 B o M 10 o 1 o e-i O 1 o 1 e> Q 1 o 1 (U (>< 1 »1 1 e »< H c 1 to a E 1 E t < E t to (C 1 03

ft to 1 o O to 1 to 1 n to 1 c O 1 E^ H

CM t >• Q 1 l» £1 1 Eh 1 E^ Q 1 fa Q D 1 H (B 1 o< 1 to H 1 E H

atM E m ( o t O ) PB to 1 Eh E-i o M «0 o 1 o o 1 O 1 O O 1 o O u 1 hi 1 1^ 1 • lb X M E 1 E E 1 E 1 E E 1 E

PS to • to to 1 to • (0 to 1 to

OiM

03 S

(U »

to CC

•«

u E to

03M

)-) CS B

p] o f H

CO E

•«

U E to

m as CD 1-4

e-t

O

B > o

to eeW

1-9 03 B

03

O

E-< PJ

to 00

«0 tj B to

asn SB «o H U D f O

to

K <Vas

to»

pel t

•J iJ 1 lo: aC

•Cl II II z as

m fr,

EhK E OS tc

to

OO ^ i> » PdX T- CM

CI II II II II

H

H Eh Eh Eh ^ t» E X to to pj

CO o o moo PS O

pa (0

Eh o U «

pa o

•i^ t o

>A EH »] O It K o o n M 04 u

03

H Eh

Eh •< o to 03

(J

PQO CO •« o pa u

Eh Eh S6 EH <C U H u «a O O M EH Z to

as o as

M

to CO < ijH

a |H « o o H o as Eh

B3 >^ »o toO

B •«

H (D

N

UO o o

ill

O

O pa

B

u

K » r 1^ m o u >• H < H EH ) 03 N % O 03 pa « B K fH to pa O 03 10 H p] pa CO E H O >H

SB EH (H EH lOI e to

a «

•< CO to

H Eh 1-1 BBS p] >H >H X <« O X H E CO CO w o > B Eh «B e o

00 9 O

O 00 Sf fS ^

fM »- o O

O

O

96
,.J E Jj CO 1 E .! O 1 E E 1 :! fr- 1 O 1 E ! L> ' O 1 E 1 Eh : to 1 t3 ; fi« E Eh I O 1 Q j CO 1 I E 1 o J fiH 1 Eh ! E aE 1 o E E I a E 1 E O

h3

D 1 O 1 Ml E 1 tc 1 B O 1 to 1 ^ M 1 E 1 Eh I H K

E-^ 1 E <4 1 O 1 E

cu i M 1 IE •* E E 1 '"^ Q M 1 E M 1 §H

E^ 1 OS 1 E 1 E H 1 O 1 Cu O 1 M 1 E

(0 1 PC E 1 N 1 E 1 E E Eh I Eh E Q 1 Em 1/) 1 lO E

<< >*

H 1 to 1 CO E-i 1 M !

E>4 1 i< 1 E 1 SB Oh I a" ^ Q O 1 IH ^ 1 u E E

*4 • ;* M he' • O 1 E M C m 1 o Q E 1 to M s2 H 1 pq < ^ 1 C3 ^ H H M E^ 03 1 E E h E 1 H H 1 B P4 Ml E ^ *4 1 H E \ W D E 1 Eh CO SB

pq ^ J

Q 1 M 1I E O M 1 E ^ ^ 1 E 1 u

M < ^ 1 rn PS E D rn E M H CQ 1 CO w 00 H H O CD H

M h4 E-* 1 Eh 1 Eh Eh E Eh

(S E H 1 O

D 1 UD CO E O

D

H P3 E 1 > O ^ O 0]U > O

Eh

U

M 1 (0 E 1 CO E B to CO E E * ! O • 1 E E £ O E (U 1 1 E E E U C-* 1 1^

(D BS «• Eh

OH 1 1 E D E D

W E E 1-3H E 1 1 E O E O

6^ t<

O E E 1 1 H E E4 E ^ C5 CJ O 1 Cu 1 to E CO s 1 *< H M E M 1 «« U fol U 1 V & 6S W ! 1 E CO E CO 1 p5 (S cv ^ !1 hJ ( HOE 1 O E O 1 E fr^ O 1 1 M] * D E h4 I 1 u O O 0 1 1 E B

10

U 1 1 CO 1 1 SB

ME 1T 1 E J E (J 1 fta cj 1 o o 1 o o

E-i ^ 1 ^ ^ E (J 1 )< U 1 Eh 1 fMI U EE 1 E 1 1 E O 1 E O 1 E 1 E O

E**

O t ft*

O 1 E 1 ftt

O

M CO I O E-< 1 o i O

H 1 E 1 tf

CO E 1 \ 1 (0 E 1 o o 1 ^ 1 ^ 1 o o H ! Q 1 pq 1 O 1 H 1 E

h3M 1 Eh 1 tv 1 B

W

H E 1 O ! ^ 1 (0 1 &H o H <« 1 u E 1 1 E 1 E 1 E M n 1 E 1 B 1 B n to 1 CO 1 CO 1 CO

97
ow c » J w w «e >• H H (U c E E o Q IE bJ CU N e M

eu ij E • u « >.

t= OS

HM CD

a E

<<

M

to 2 c M

to • •• 00 X f- • • OQ X •J

O

CO S !• o te lu W E B U f-i H e-i tH en o « J H ts ^ iJ KI III M H b; O CO as O 05 w u o

CQ »

•J WOK U PS U WHO e z O o cn

to o< w B u

0) OS w c

e- o X to

(aaM E H < eo

>-cc

as

QS«

(B

B

E-iH

to SB < U E to SB

a:

OS (J o o « U m ac o e-i

03

U o o

<«

u

03U

O

04

O

O

H

to OS o o

98
Q

cn•<

OSco

ns

Pi

P<r • e E

•«

k CO K

CO

.t 00

II «a X

ca

K II pa a:

H t< fri J ti (9 H H as mmH

04e«ouM

OH o as m •« H t> CQ

(i* asH Q M

•J |J H Ml »H H H » O te M

p!

w

t< o << >t

SB iJ 03 C 03 « U (J « O m: O OS u

Bs e O B as )J O O CQ

in

u

•c pa s U

OS OS

03 Cs e< o X 10

U3 E

0<ccoIo©

as

OSm

Hi

HO

H

M

tn as < u E in « u o o

cn OS o o

OS

U o o

<< o

OS

03O

M OS O O
. I 1 1 ; j 1 1 1 1 1 f 1 P 1 . . 1 Z 1 1 1 1 m: I 1 1 O-f 1 . 0 1 03 1 1 . 1 U 1 1 1 0 1 M 1 ! , >M 1 > 1 1 . >4 1 03 1 CO . . 1 0 1 1 . 0 1 1 1 03 1 m 1 1 1 t EC 1 H Oh 1 0^ 1 Eh I E-i 1 1 E" 1 fr< •0] i E 1 U 1 03 1 E ^ 1 to SB 1 M 1 to 1 CO 1 OS 1 ft^ 1 tn 1 1 E-* 1 0 1 0 1 1 ^ Oh CO «C 1 1 0^ 1 Oh I U 1 1 E-* 1 to E-< ' E-' 1 C 1 H

6-* CO 1 P^> 1 03 1 ^ 1 0 1 IJ 1 0 1 1 itf 1 0:: C 1 0 f 1 03 1 tD 1 1 Eh I 0 1 E 1 1 1) 1 U M 1 0 cc 1 (0 1 D C3 1 Q H 1 to 1 id v-' 1 ts (J se 1 1 (0 1 H

Ch I D 1 ^ 1 mC I «< 03 1 M 1 n 1 E^ 1 0 1 E-i ' a: 1 K

Q_ I H 03 1 1 to 1 H ''3 1 M 1 E-^ 1 » CJ 0 H 1 1 ^ 1 M 0^ t 0. 1 U

03 1 U i to ^ 1 Cj I 0 » 1 IJ

05 1 c to 1 0 1 0 03 to 03 * X 1 W '~- 1 •a

0^

H 1 1-3 I i< 0 1 1 tC 1 0 1 U 1 E-i 1 ¥A 1 «r h4 C 1 El.

tec OS 1 M 1 U OS 1 0- £H 1 tn 1 E-* K W z 1 0 03

H 1 CO ffi 1 {U 1 03 0» 03 Cu M 1 to U 1 ^ 1 «r 1 u 1 z (J 1 E- 1 •£ 1 z 0 C3 1 M 1 Z 03 M 03 03 1 Z OS 1 0:1 0 1 (U 7 1 > •c z > Z Eh 1 D E^ 1 0 1 E X 1 1 0: ffi 0 1 0 << E-i 1 0

tU 1 1 0 tJ 1 (J

Q (0 1 ^3 0 Ci 11 11 1 ij a:: 1 •< 1 0- 0 z E-< 1 1 C 1 w 0 0 w 1 1 OS 1 en U K Eh 1 3" CM i» 1 a- <N 1 OC

H Qbt 0 1 Cj 0:^ >- {=3 >-• »-3 1 t-S •J 1 •< Q:; PQ fJI CO t cc CD CD Oh 1 ffi 0 1 CC

(t4 to tP Pa 1 1

{L,

H • . W . . 1 H IU O 0 1 »-] (N Eh or. 1 OS 1 >< ST 1 0; E- OS W c «- 1 0 1 09 U ) c E 0

1*9

H E-t CO 1 ^ Q4 Co t O4 !S

h 1 E-< Eh 10

13

O C-"

H < >• CO to 1 <c

M

H 1 K

H z: 1 »c to to

Q

C (0

H Eh GO

M 1 M z Z 1 (O (0 1 H

O •<uu 1 E-< \ \ 1 ^ z: t 1 Eh

u 0 C (U H (t4 0 1 M 1-4 »-4 •a: 1 to 03 t< 1 M u 0

03 m;X ps 1 K Oj Oi \ 1 0 H

W

H 1 XK

Q 1 H ^ M z tS ^ 1 M

P3

C gH 1 ^ O <QI ^ w 1 < H 1 1 ^ n tu 1 1 ^ M iJ E-* 0^ 1 OS 1 OS E-< cc

H 1 K E-< e E CO OQ Q W w: 0 1 0 M 1 0 0 * 1 1 E 0

OS 4 *-4 1-9 Eh CO 1 Eh Pi ^ 1 (H Oh E-i fk< 1 C t/1 to M H (z] •< >4 to to H 1 «<a E Z3 1 ^ to to to M H 03 M t M z Z E 1 H C^ t-< fn 1 to pa ta

tf < tui Eh

u

u 1 £h \ \ to 1 Eh Ou E-<

h 1 0 u

>-) ^ w 0 1 M ^ O4 1 M 09

H (i^ 1 oa 0 N 0

«• fC !M OS 1 Ss Oi 03 1 &c

H SsH 1 0 OSX OS >* U Od 1 ^ 1 ^ M ^ 1 03 3SM EC

Eh t->K 1 1 OS (a

1-4

H

U

M I 1 M

H

H 9S E-t 1 OS 1 03 CS

K 1 t-t Eh

[3 O:: iu 0 « w

M 1 0 1 0 < 0 H t 1 H

CQ EX 1-4 OS 0 E-* \ 03 1 E-* 1 E-* ^ Ikw 1 V OS

Eh 0 «C CP 04 • *c Z 1 «e E «£ E 1 1 03

95 ^ m (C fU OS 1 M 03 03 i H toH to 1 M OS

m OS 0 03 0= 0 &3 1 ts t Eh 0« |H b 1 0 u

«i: EH 1 M to to Oi i M 03

MH 1 Eh

U SB 1 >4H 1 Z M Be

H 1 Ph Z

OS

M 1 H CO to Z 1 ^ M *^ 1 OS

H

*^

9S 1 ! Q 1 M MOM 1 1 E-< U OS U . 1 0

<4 OS £h 0 I 1 H Of

9B

Q ^Jm ^ 1 Eh CD 1 03 ^ 1 Eh E-' 1 0- Eh

H 0 0 ffi E-»

U 1 0 0 1 ^ 0 1 E Eh 0

to <tf 1 E-*

D

u 1 E-HH 1 to "tf 05M

Eh 1 PS

U 1 OS 1 OS 1 0 0 j 1 Eh 1 ^ 1 03 03 1 Eh »J Eh Eh pa U 1 1 u E 1 E 1 0

(A OS OS 1 1 0 E u 1 ac 1 1-4 E MB E mC I w 0 • E

1-1 0 1 ^ 1 03 pS 5 1 03 X CO 1 U E-t 1 E-* t? 1 E-* t5 E-t E-* u 1 Q 1 to 0 1 to 0 •< 1 03 «< 03 i« X EH 1 0 1 >-i K 1 >« OS \ to ps 1 \ C H X Eh 1 CO 1 Eh to fl* 1 CO Cb 1 0 0 1 Z ^ . to Pt3 CO 1 E-* 1 0^ 1 \ a 1 u {-I 1 0 • H I 6h 1 < 1 > 1 09 t u (0 1 PH

1-9

w 1 u 1 CO 1 cs • H ( tH ) X 0 1 CD t K tu c 1 < j #c 1 u 1 Q 1 Q • H (C 1 Z 0 M rt 1 9 t ^ 1 1 5» 1 ^ 1 a a 1 ft 1 1 1 Oh 1 0^ 1 0^ t In 1 0. 1 E ( £ 1 E 1 E 1 E 1 c E ) E 9 (0 1 to » 10 1 »0 1 to 1 to to 1 to to

100
11 11 11 1 ^ ( 11 11 1 1 1 o CO 1 1 1 1 1 1 lU % 1 1 1 1 1 1 EC a 1 1 1 1 1 t O w 1 ) 1 1 1 1 II 1 1 1 1 1 1 It. > 1 1 1 1 1 \ tr< 1 1 1 1 1 1 1/1 a. 1 1 1 1 H & 1 1 a I J 1 O O 1 1 (U o

•a f 1 1 Eh OJ 1 1 1 1 El » 1 ft- 1 10 lU 1 OS 1 1 1 in C 1 d 1 ta to 1 11 11 1 A 1 iJ HE CS 1 B 1 o- 11 1 — 1 1 S 1 < 1 m o 1 c 1 c 1 1 t/5 1 >- 1 o:: 1 1 o 1 m 1 « \ c to 1 K 1 E 1 CX Oj I o 1 to 1 S: M 1 * 1 H 1 t E- 1 1 M 1 E-< 1 CI. 4- 1 Eh 1 u c 1 O t/; 1 z- 1 ! Ed •a 1 c o 1 w 1 u 1 C I EH A 1 E 1 '"^ 1 1 W

t-i ts 1 1 « 1 W ct 1 CO 1 o

•c 1 E 1 o 1 « 1 o 1 ' 1 1 o

E-i E C/1 1 1-4 1 xa 1 be

M 1 o M E- 1 IE 1 1 u V£> 1 1 t—

CL 1 o 1 E 1 w 1 ^ 1 1 z o in 1 A 1 m Cd 1 B 1 W 1 c M cr 1 ^ 1 C 1 » e 1 Eh 1 H ^ ' 1 E 1 M

aC xd 1 lu 1 w •C 1 H 1 E- tc U E- 1 E 1 o 1 E- ''^^ • o 1 lu " 1 Eh 1 b: •c 1 «C 1 » 1 << ; 1 N 1 1 U B- O 1 Z 1 (Li 1 1 W >- 1 CL C 1 1 X ^-^ 1 tc 1 (O CC 1 E

CO « 1 E 1 E 1 Eh CB 1 EH 1 EH 1 C 1 t 1 IL' 1 W O 1 1 2 Z 1 u M (kl o 1 ffi 1 1 K E 1 U 1 C K

CO o 1 U 1 CQ I O 1 M 1 E 1 O 1 O 1 M EH 1 oa 1 U CC 1 lu C 05 1 IS 1 OS 1 OJ O 1 o 1 W O t E- z o 1 Oj 1 a 1 CX, Z 1 n 1 t£ IT) 1 m c ^

oa a- 00

a 1 3 1 fM 1 a 1 fN 1 0 St o >j 1 ij 1 t-J 1 1-3 1 ^ 1 1-3 1 >J

b- CQ 0:1 1 CO 1 a 1 CQ 1 IS 1 a 1 m

U

(B lUW

(U Z 1 1 OS Eh

M Eh

H Eh CC 1 c 1 05 1 05 1 e: Cd

O z K Eh ^ E O 1 to 1 0 1 0 1 0 I-) 1 iJ H 05 CB C5 Eh to H 1 M 1 EH 1 Eh 1 EH Cd u »- H <« >H Oi S 1 to to (h 1 > 1 t 1 Id 1 •< z 0 1 H Eh CCk a fi > K E 1 « 1 H 1 H 1 M 1 t-t (0 z M o h U U t/! 1 H 1 H 1 M 1 Eh »c: EH (n H Eh O N M O 1 eu 1 tH 1 « 1 H 1 •< 1 H to B C4 •c

•< z a

H P5 ta 1 B 1 z 1 \ 1 Z 1 \ 1 Z •t 0 t-H \ ZI H to ^ H a, 1 to 1 H 1 Z 1 M 1 z 1 l-l E- 05 z QHN

fS

M

W «! >- H M CO

fM EH 1 05 Eh 05 1 Eh oa 1 0 to E 0 1 E 0 IB 1 to 1 ^ 1 if: 1 M

Eh to 1 Eh (O

H 1 H 1 1^ 1 f* 1 ts

to to 1 to to 1 > 1 03 1 ft^ 1 e 1 1^ 1 05w 1 (kM 1 M E 1 05 1 03 1 E 1 N 1 E 1 Cd N 1 S

(J

U 1 UU to 1 H 1 0 1 to 1 0 1 to 1 P 1 to

(U 0 1 0 Oh 1 Oi 1 •<: 1 lu 1 a; 1 Eh 1 •* c 1 X OS 1 X 05 W 1 D 1 w 1 (M 1 IH 1 M 1 EH 1 ^ M Ou 1 H Cu H 1 to 1 K 1 H 1 05 1 M 1 K 1 M

IE 1 OS 1 IE 05 CB 1 05 1 (S> v> 1 03 1 M w < • M 1 tLl 4 C3 1 Eh 1 EH 05 1 EH Eh ci; c>3 03 Eh t Eh 0 be Cd 1 1 m 0 t-l 1 0 1 H (K M 0 H Z 1 09

CB tj Eh I \cs 1 VCB Eh bi 1 EH 1 \05 V05

V CC Eh 1-3 EH VIE 1 N 03

EH 0 < >H 1 05 Ol 1 05 Cu < E « 1 05 Oi OS

a 05 «: xc CE

K Ai 1 05 z >-9 H oa 1 H 05 1 » 05 H to 1 H 1 M IK IM IE 03 IE H M H OS 1 03 05 0 03 05 1 1 0 » Eh Pb 1 Eh t c w 0 IH a 03 Eh EH Z Q 03 1 Q 03 0 U 1 «e EH 1 -C Eh H H 1 H 1 < EH <* E- «: 6h hH H 0 -C tH 1 «0 EH H Z 1 b3 Z Z H Z 1 H Z M Z 03 Z Z Z H 03 Z 1 03 Z

05 t-l 1 05

MH

M 1 IE

M OS

H 05

M

HH Eh 05M 1 OSM

03

O »<S

O 03 (J

03 EO B Z iJ EH 1 Eh CO CQ 05 Eh 05 Eh 1 03 Eh 1 CC 0 0 03 u 1 0 u 0 0 1 E u E U 1 Eh (J 1 E

to 0 to 1 (O Eh -> EH <n E- 0 1-3 1 to «e 1 '^

i<5 be

OS

U OSU

U 05 0 E 05

J E 0 0 0 0 03 0 0 ts to << 03 •< 1 El Eh kJ EH Eh 1 X Eh Eh »:) 04 > Z U 03 1 z «< 0 Z 1 t U 03 Z < U 05 1 EH

05

K CS 1 03 OS o; 05 03 CC E 03 1 >-3 03 B Eh 1 E 03 0 E 1 03 0 CC E Q 03 1 04

Eh 0 (O 1 03 0. 0 03 1 CU 0 0 03

C

JB 1 03

M to 1 0 Eh 0 HU EH 1 0 H EH 0 EH

m to 1 0

03 CQ 1 M «t Cd t 1 COd 0 1 t 1 CM 0 1 X EH to 03 X EH 1 to CC 0 Eh to CC OS 05 I \ 1 E 1 03 to e 0 03 to 0 0 1-3 to 0 0 (5- 0 1 z 1 to 1 z H 1 E M 1 E in Eh to a Eh u 1 Eh 1 Q ^ 03 u t 15 p< BS C3 to CO (J 1 03 1 M

03 E z 1 cu OS 05 05 to 1 to 1 to H < 1 sr It 3- a 3- 1 3 1 3

IM Z It, 1 Oh Ph ru (M (h Cb 1 1 c 1 c E E E B E E 1 E 1 E 1 to 1 m to to to CO to CO t C/3 1 to

101
1 1 1 I E^ 1 i 1 E 1 1 ma 1 1 63 1 i: 1 1 6^ 1 E 1 t 64 < 1 0 1 6^ 1 ffi I E-i 1 1 to ! 1 1 Eh 1 in

mo; 1 1 B 1 1 g: 1 1 1 c 1 M 1 1 Eh 1 Eh 1 1 B 1 •C

to 1 1 1 C 1 X 1 a g . 1 1 0 1 1 Eh Ee 1 1 c 1 1 t 63 1 0 1 63 1 >c 1 I > 1 tj 1 L)

SB 1 H 1 Cki 1 0 1 ta 1 H 1 >• 1 1 E 1 H t > O i 1 K 1 «b 1 K 1 6^ 1 1 CO ^ 1 i; Eh 1 1 itf 1 » 1 }H 1 z •C 1 1 IS 0 1 E

Eh I E-^ 1 o 1 H 1 pa 1 M 1 0 Eh 1 0< & 1 1 E> a: 1 1 E 1 •C 1 c 1 u 0 I 1 0 1 U 1 N M 1 1 K M 1 1 U H 1 E 1 E-i tH 1 1 63 1 hi 1 0 K 1 1 O 0; 1 E 1 E H 1 1 63 Sh 1 U 1 1 & Eh 1 K ffi 1 SB E 1 69 M 1 E E ) 63 1 63 1 Cu

in 1 e 1 lu SB 1 t S ) B 1 0 1 »H 1 f£ H 1 ^ 9E 1 at M Eh P5 1 1 «<

eu 1 E o< 1 Oi

a 1 M e Eh

O 1 k: 1 O 1 m 63 1 E 1 Ck] 1 M

E-i 1 (> Eh 1 Eh Eh 1 M in 1 E

to 1 to tn 1 to to 1 Eh 0 1 B 1 Eh 1 1 1 ffi (/} to 1 1 ^ 1 1 ED W C 1 •« 1 1 a o K 05 B 1 1 H k 1 K 1 1 OS 1 s» 1 «- 1 tt 1 CC 1 £t 00 O 1 J t iJ »H E" to >j t ^ iJ 1 1-3 »9 1 oc • CE p:: h Eh H 1 U m 1 OQ ffi 1 (0 tH K 1 ^ (D at 1 1 O 1 11, 111 111 M 1 1 E 1 Eh E E 1 Eh

O 9B 1 o 1 O 1 z: 0 1 H J M 1 |H 1 VO Eh 1 E- in Eh H

M Oi

lUA >- 1 •a •< 1 m in < I M E H

»-l

H CQ 1 i-t • Q

M 1 w

HH E S 1 e- 1 (0 Eh 1 0 (J EH E V H 1 M 1 ^ M 1 w 0 M 1 63 B >J

«< 1 as t H SS 1 X E as 1 \ tn 0

s; 1 M 1 H

M

H 1 9&

B E H

O 1 11 as 1 1I W 1 1 in

fr4 1 03 1 EN

G E 1 Eh E 1 te

O

M 1 o 1 O tH IC c 1 E 0 1 HK

•J >J 1 1 Eh iJ lU •- 1 Eh 1 Eh in 1 E 1 9 Ou U < ^< 1 i<t 1 «£ •« as o mt 1 in tn E 63 1 E M M H OC 1 M I M H in 1 M 1 u 1 63 t3 g B H ffi E

pL, ^ 1 1 (.4 (H 64 1 U 0 1 0 1 CO >V H 1 1 M H & U 1 -O i< 0 • fit* <a 0 B 1 as t 2 IE 0 H as 1 X E 63 Eh 1 fiO 69 (H M 1 1.4 1 M M E 1 63 E 1 E

ffi 1 1 E 1 E 1 E 1 E u 1 U 1 69 1 63 I 63

•J

O 1 E-> 1 Eh 1 Eh 1 Eh 1 Eh

O

M 1 U 1 1 M 1 u 1 63 1 69 (E u e 1 E 1 H E 1 \E 1 \B V E O « Sh 1 Oy 1 B 2 1 o< 1 E a< 1 E a 1 E Oa E

g: ij Id (D 1 K t 0 H 1 E 1 H E 1 H E 63 S 63 one: 1 U 1 •« E^ 1 w 1 0 63 • a 63 0 69 (9 O O 1 {H 1 E" B Eh 1 << Eh •C fH 1 i< < Eh m 1 EH 0 as 1 63 as 1 63 S 69 E >« M 1 •< ffi 1 E M 1 E M 1 ss E H en 1 1 1 1• fr] O ^ 1 1 U^ • J (J (c U 1 1 0 E t Eh O 1 1 Eh } D S 1 1 CO M 1 Eh ) Eh 1 E ( "C E ffi C O BQ 1 1 (J as 1 u 1 0 1 E 1 S, w u 1 1 Eh h 1 1 in 1 1^ 1 95

be 1 1 b£ I t l£

cc (J 1 1 E 0 1 1 E 0

»-4 1 O

O 1 1 0 0 1 1 0 0 M E e H 1 tH 1 K 1 Eh <J t Eh 1 Eh »^ 63

gs

U 1 << 1 63 Eh 1 m:

u 1 as 1 •<

U X* 1 as E 1 E 1 63 1 E E R » S 1 C4 O 1 E S M •« 1 u 0 1 s 1 63 Q E iC

6-

C 1 d. o 1 63 0 Q 1 a 0 1 63 1 a 0 aC

a 63 E O E- 1 H H •-< •< 1 0 E- 1 0 Eh 1 M 1 0 EH EH E Eh « M 1 f tn IE t/} EH 1 63 aC 1 B in in 0

(/> OS 1 « U

M 4 1 m E 1 M Eh 1 0 1 ME E Eh

H E o o • z: E 0 1 0 0 1 63 in 1 as 1 0 0 H in in Pa 11 1 Q 1B as ! Cu

Q t 1 u: • M 1 E 1 SB 1 63 PH >" H 1 M 1 a< 1 H 1 e t Eh 1 E H Eh H 13 1 tn 1 V) 1 in 1 CO 1 to 1 Eh B B ti •< 1 1 9 1 ;» 1 9 1 9 1 9- 3- 3-

as 1 Ih 1 h 1 b. 1 6« 1 6h 1 6« 6< Bk S • a: 1 B 1 E 1 E 1 E E E

tn 1 in 1 to 1 in t in 1 tn

W 10

102
111 I11 111 Eh 111 1 1 1 «cr 1 IT. 1 1 1 E 1 B 1 1 t OS 1 Z 1 1 1 0 1 0 1 o 1 1 b 1 tJ 1 o 1 1 03 1 1 1 1-3 I 0". I 1 to I 1 •< 1 X 1 G 1 1 E 1 b-i 1 o 1 Z 1 1 M 1 0 1 o 1 C 1 1 tJ 1 1 O 1 1 03 1 to 1 1 b3 1 1 B 1 c 1

14-1 1 to 1 1 1 (n E »—' 1 1 B 1 0 1 o OS 1 Oj I 1 03 1 0 1 ij c OS 1 C 1 1 1 03 o 1 1 0 1 as 1 M 1 to 1 t 1 z

ft. 1 E 1 1 Cl< t M

C 1 •c

u 1 Eh I O E 1 IH 1 O 1 t ^ 1 H 1 X H 1 03 C 1 t 03 1 03 O as 1 B 1 Eh 1 E

t-J 1 03

M 1 C 1 «C 1 H

as 1 D Z 1 1 B 1 E-< I ss M 1 to o B o 1 Z m 1 B 1 Z H 1 u 03 1 M 1 C •a 1 C 1 0 1 o ks 1 tri 1 M K •J 1 H 1 l-H CB 1 «c U 1 E-i E ) u 1 Eh 1 Eh < 1 as 1 03 H 1 1 *e 1 t O 1 ft. Ou H 1 Eh I Eh 1 H 1 M o 1 (a E 1 o< B 1 Eh 1 Eh

Vi 1 1 E 03 1 E B 1 1 H 1 H

OS

M 1 as 1 03 1 O CLi 1 z 1 Z t Z M 1 1 Z 1 V O 1 M 1 H 1 M

03

Q 1 E H ) CD CQ 1 m cn 1 CQ 1 CQ 1 CQ B << 1 c O 1 O O 1 0 1 0 1 0 1 Z c 1 »-3 1^ s 1^ 1 1 11 {-< 1 ^ 111 11 • 1 1 1 1 E 1 1 1 1 • be 05 1 1 00 1 CN 1 ^ 1 -3' O 1 J 1 i-^ (J 1 l-l ) iJ 1 cc o. t o CD 1 cc CD u t O4 1 IC » m:

(L, (A 1 1 1 1 C Bu

1/1W 1 1 1 b4 f-l • 1 03 1 1 H ««. O 1 1 V 05 1 (H ^ 1 1 M M o M 1 OS 1 OS 1 OS O 05 03 sr 1 1 OS 1 OS ft r» O K 1 c 1 o 1 C tr< 1 1 O 1-3 1 0 1 0 w r> 1-4 M 1 E (0 1 t> 1 Eh <* 1 E- 03 W 1 1 E- 1 Eh J Q 03 « »H 1 (0 1 < 1 << B 1 «£ O Z B 1 1 < B O H tl B3 1 1 H 1 t-H M t 1 H 1 H to 1 1 H 1 M

Oct/) ^ 2 1 1 I E-^ E Eh ^ E^ O4 1 Eh 1 Eh O "^"al M 1 CQ O t H 1 H 05 1 «t H to B 03 1 M 1 M E W •< 1 O K \ 1 as 1 Z 03 1 \ 1 Z < 0 H \ 1 Z 1 Z E 1 (V as 1 M 1 M E-i 1 s M E-l 05 z 1 M 1 H o

OS

H

H

O ••! •< 1 1 1 O 1 1 1 1 •o: M H 1 1 1 1 SS M)^ N 1 OS 1 OS 1 OS 1 to 1 OS 1 OS M 03 1-1 e H 1 O M 1 H O 1 t< O 1 X 1 0 M 1 0 1 0 c n BO iJ I E CO » 1 E (0 1 E (O 1 <•» 1 OS 1 Eh 1 Eh

OS ti

H «« >< 1 1 E-i to 1 E-> (0 1 fc* 1 05 03 1 t 1 <«

M

HH

H CD 1 E 1 to 03 1 to 03 1 E 1 03N E 1 H 1 H

E-> OS 0.< 1 u to 1 U 1 {J 1 to 1 B to 1 Eh 1 Eh

l-t 1 03

O 0< 1 00 o 1 CQ

O 1 ^ ft 0 Ch 1 H 1 M

»^ > a: 1 O 0= 1 03 1 O 03 t O OS 1 03 03 Eh 03 1 as 1 Z

oaH 1 M 1 cn 1 ^ 1 H 1 05 ^ H 1 H 1 t-l >*

oe 2M o: 1 OS 1 OS 1 1 as 1 OS Z 1 OS t 03

E-i E-< 1 07 1 03 1 W 1 03 1 1 03 1 03

1-9

u >^O 1 El 1 E-< 1 E-i 1 OSN I Eh OS t3 1 Eh 1 Eh

H

H as

O

KW 1 1 03 i 03 1 O

H 1 fo 0 M • 03 1 03

BB

H IE

u ei • V OS 1 VD5 • OS 1 E-i h3 03 1 V 05 Eh 1.3 03 1 OS 1 (C

<c ac -) e-i o •« >< 1 OS Cki 1 OS OU 1 Cu 1 <£ i« Z 1 05 Oi i< •< Ss 1 O. t O' Z h) H A 1 03 CC 1 03 « 1 OS 1 M l-l IH 1 03 OS H H M 1 El 1 03 Q CD OS j Q 03 1 O 03 1 03 1 E-i E- E-' 1 B 03 Eh Eh Eh • 03 1 03 V U 1 <« e 1 0> t « e- t H 1 HI H B 1 «l H H M B t EH • EH 03 as 1 H 1 03 Z 1 Z 1 Z z c ) 03 as z as 0 1 z 1 Z 11 OS H 1 SS 1 OS M 1 M 1 M M 05 1 OS M H H CS f M 1 H

as 1 IJ 1 1 1 Eh as Eh ^1 11 o H C bi: 1 o 1 1 tJ H 0 1 1 M U o: u 1 1 1 << 1 1 ps E-i O 1 i «< B as 1 CD 1 H 1 09 1 E-^ 1 H 1 BD CM 03 1 ^ 1 Eh

as

O

O CQ 1 o 1 > 1 E 1 U 1 (J 1 0 E IC 1 u 1 U

tH (/)

U 1 1 O 1 f3 1 1 l-i 1 "I 0 Eh 1 1 <->

OSK 1 1 K 1 1 i<S 1 H 1 1 OS u 1 E OS 1 CO V 1 OS

U

•J 1 1 o o 1 C3 to 1 0 0 1 0 0 n •« H 1 1 h< ^ 1 Oi > 1 Eh 1 Eh o K (J 1 1 u 1 B 1 OS 0 1 •« tj 1 <* U

(B OS • OS 1 OS 1 OS 1 E 03 05 t OS 1 OS U B 1 1 03 a 1 « 1 03 Oi •4 1 03 B I 03

a

O 1 o t AiO 1 O 1 >J

B

u 1 O4 0 1 cu 0 X (/I 1 1 O H 1 03 1 CQ to 1 0 Eh 1 0 Eh H 1 CO 1 B 1 Z 1 O 1 " n o 1 V) OS 1 O 1 Q 1 OS CB 1 \ 0 1 CO 05 1 CO 05 1 1 o o 1 1 Z 1 CLi O ) S 1 0 0 1 0 0 H 1 &.X 1 1 1 1 H a^ I M 1 1 B 1 1 Q 1 1 03 1 Z 1 g-i 1 u 1 Cu c 1 B 1 Eh O M 1 u 1 1 to 1 CQ 1 u 1 u M 1 H 1 H

OSH E 1 < 1 B t 1 1 1 <-) 1 1 o M < 1 in 1 in 1 m 1 ir> 1 u-i 1 m m 1 in 1 m o fri Z 1 tu 1 (L| t hi 1 h 1 hi t Oh (b 1 u, 1 H E 1 E 1 E 1 E * E 1 E E 1 E 1 E « 10 • to ( to 1 to I to 1 to to 1 (0 1 CO

103
-• Cs 1 1 j PC 1 W O 1 • CD • E-* 1 • £-> 1 A 1 B 1 O 1 0^ 1 J O 1 C 1 J 1 IT ^ 1 J ^ 1 j •4 { CO B I H 1 j CQ 1 O 1 B o O 1 CO P O 1 d Vt 1 w ^ I B O 1 O 1 CD O O O tB

O 1 E 1 B 1 c o ^ >H o

£h I ^ B o & CO Cj 1 CO cc o O 2 1 to oa o H 1 O B B

(t, c

Cu 1 1 CO 1 «S

B «<WO 1 IB p3 B CO Eh E E M 1 _ (U 1 m E- B EE Ct ^ tfl ! M Eh P o ^ Ml 1 Eh P B B pa B P ,W 1

Pt3 p^ (Li 1 P3 Ik!] ^ B

B P SB lU

Eh

O 1 E 0^

B P B

B • H m; B Eh Eh B B o K Eh pa CC 1 B B & B U OS e V 1 p, Vi W DQ 1 pa K B X B << N B

ta CD 1 U P Om

O E O 1 ec m B B 1 o iC CO B B D 1 pa P3 O H B B J S5 1 CL oa B H rr. ^

Eh I «C 1 s: t O

0^ ( CM a- & a- O 1 u 1-:) 1 i-a iJ

frj 1 OQ CD CD 1 Oi

B ED 1

ff-\ 1 fC paB

O

V 1 E^

O o MO ^ M i a: to B (0 Eh 1 F< P3 H >« 1 Eh m Eh cn h •< 1 CO B B pa pa

B

B OS IH Ft flQ 1 CO w 10 P4 B H 1 • O l-t g H B H

(k. BS 1 u CO

H 1 pa

C Eh

a P P H 1 PQ Q CD O M B 0 O 0^ «C «;

(< 1 O B« o pa

m CO o o M

B

BB

m

r 1 ^ &i

M

O pa 03 oa

B

B OS

d 1 m 1 (4 1 pa Pa OH 1 Eh O O o Eh O 1 B to 1 B CO •pa B CO M •< ^ 1 Eh (/3 Eh CO 03 PS Eh CO oc OS

BB 0B

H

H

A 1 cn

W CO Pi3MM &3 1 CO lU

MB

MH

H 1 1 O O P Q

QQ

O (Q

Q < O ^ ^ 1 O PC 1 O P5 M £h B B

B ^ 11 ^ 0< pa 05 OS B PS 03 1 pr 1 Oa 1 PC pa Gfi 03 PS B B OS 1 1 V 1 P3 pq 03 B B ^ Q 1 Eh 1 Eh I Eh Eh |h Eh O ^ H 1 M 1 1 P3 Ui & B B 03

OS

U 1 pa 1 \oa ( VPS VPG PS \w VB \B NB VOS e O •« 1 04 1 PS a« 1 OA Oi pa & Pu OS B 04 B Oi OS fit PS H CD 1 PC t M OS 1 H as H pa PS M OS B OS B B H B O cc pa 1 M 1 O H 1 e Pi Q P3 H Q M p B P B P B a ta

Eh 1 MO ^ 1 m: Eh *< (H Eh «< Eh (C Eh 1 pq p5 ^ £ 53 5 a? 2 j

II , ij. I 1 P5

H 1 paH PSw Oh rH 05

M

K rH 1 »J 1 1 M O l>S 1 1 o u e u 1 1 << •<

CB

O 1 D K (-4 1 Eh 1 CD 1 pa PS 03 PS ft£

BB 00 o O W 1 1 o 1 B B O E E

VI

O 1 — 1 1 1 ^ ^5 1 B

B ^ B 1 B U B U B t) OS o

¥A 1 t B oa f—v o w

wOO o o U 1 1 ' ^

Eh h4

X

U 1 1 o 1 M IS

B MB

Bsm 1 « 1 ce 1 09 PS

B 1 B oa

B OS » D 1 1 ^ 4 ^ #c B << H P H P B P pa o |H O 1 U ) o 1 CO 1 p} U B pa 1 a< o 1 CLi O &4 O o M V> 1 Eh O o ^ O Eh O Eh O K W 1 0) 1 1 CD 1 B CQ Q 1 o 1 o 1 Q O Sm ^ CO 03 m iH 1 52 £ 1 \ ^ 1 ^ B W w O w 11 1 ^ B _ »^ _ O 1 1 •< \ H i Eh O P Eh Eh >4 M 1 1 c/) 1 o 1 CO pa P CO CO (A V) H B 1 • *^ 1 s 1 B & PS B B oa OS H 1 i in i in m cn m m in m b4 » • 1 ^ 1 P4 ^4 Ph P4 04 K 1 B [ 1 B B B B B B (/) 1 10 1 CO 1 CO CO CO CO (0 in M

104
1 15 1 E 1 H o t ! 04 1 O C 1 to 1 »-) 1 H XC 1 1 e- tK 1 o 1 «: Z 1 c i-<

(«: 1 U •a: 1 H CI 1 Eh

O. 1 Ou 1 OS I PC O 1 H 1 H K 1 tJ 1 e- m 1 to 1 Oh CC 1 £-1 K tn o OS 1 M 1 M 1 W aC 1 OS EH

CJ 1 o 1 SS 1 es 1 H U W 1 u

cn 1 wC 1 o 1 or E c EC 1 tm 1 W B 1 «£ 1 C Eh O 1 K H 1 K O 1 tn M 1 o E 1 >H Eh M 1 to 1

to Eh I 1 Eh ^ 1 K to to

e-i 1 D Ik:

O

•C 1 z O o; OS E 1 H ftj 1 K

es 1 ^— r- 1 N

a 00

O 1 •J 03 1 J >- to 1 OQ U IT CD p] hi Eh

H o: 1 be w M OS H? CQ «: 1 O 1 H 1 Eh

Q SS 1 o H

l-tH 1 X

W

H < X 1 OS r- H t< A • n O

H ^ S: 1 Q to 05 Eh H 1 «: «c 0C «e W P

<< 1 (Um 1 V 1 to o E 1 (B B OS Q 1 W 1 • — to M 1 BS N O X

O

H • H

H CM «5

M

•J |4 1 Eh

JW «- 1 IB

N •c

W «< >-. 1 CC •e << es o 1 fc. IE 03 ^J M H » 1 (U c E H H H to 1 E M U 03

Eh I Q to to EH Eh Eh 1 10 EH

O

tH 1 (tl

HH

B

W 1 P4

O « o

as 1 w SB

KO t-l 1 w o W Eh

M 11 es

M

H

MH 03 1 H « OS 1 o: o: OS OS 1 W H

1-4

O 1 t-i |H Eh o pa t M M pa OS O fri 1 \ OS Vos OS K vas

e-i o « >H 1 oa a< ISa & PC tu

SE

H

n t ta Bs OS OS

U

H 03 OS o n P3 1 O H Q M «S Eh O 03 O U 1 <* s- <* Eh tS 1 aC < e

Eh

O 1 OS H tC H M Mi OS 1 z OS

H 1 f) 1 lU O Ik: I tt4 • U 05 U 1 O OB PS O 1 Eh B as i4 1 OS eo H 1 OS O O ffi 1 E u O SB 1 \ E

(0

U 1 Eh

M 1 s ^^ 1 ^ as 1 OS U o 1 OS E 1 o o M

•«

H t u >a OS •« 1 Eh h» Eh

B

U I E 1 H 09 Eh

W t « U < «

CC 09 1 E 1 1-4 1 OS t-4 as OS 1 OS «J OS H e 1 E < 1 04 1 t< 03 B H •« 1 M O 1-3 •< H O 1 1 H 1 V) H o O • Ou O < O K M 1 H tS • o Eh Cd M oC 1 O fH W 1 tn o 1 1 03 to E to Eh to fC 1 E 1 o 9 tj H •<; 1 to 03 Z Eh

(/) cu

r rj E to « O 1 o o H to 1 ~ H

e> 1 Eh 1 a 1 u hs 1 P4 H t 1 H 1 E fu 1 E M H R 1 OS 1 tn 1 in to 1 ^ D H « i in 1 ifl 1 m in 1 m U1

Cb e 1 1 Pb 1 If PM • 0< E 1 E 1 E s • n s M 1 v> • tn to 1 to to

04

0^ 03 > H M tH

»^ to tJ to c B B •e Ou 0- 0. 03 H 03 03 K Z M M M H o

Eh EH Eh EH Eu

Eh

M »-l

H

H to

03M

X H! <

to 03 (U 03 03 03

•-3 X. Eh Eh EH fH

03 « •c EH

•«

ts o OO

p

03 03 03 03 z

I-) 1-3 1-3 1-3M

CBn >J >-3 1-3B

H 03 03 03 03 03 03O 03

as to

OUUu to

B to

<c Z Z Z z B 03

B

POI Z *t

a •a t B

n Z u U U u B "S B

ooooooa-r>4«-

031

105
IT

OCoo • tn ^ ^ 9< MfHCo m in OHo—c

Kir

1.40 ooSB in B WM 03 w

V)Off!H

lU

H

HPS H»

PS

B<e HOO

OC te

»-> 00 BE HH

H

bit- ts H M SB D as M ow

»4

H

•« ^ M i-i CCi ft. SEow O M

•J IJ M « >« M M CD

1-4O

O »>: » K U M H O « > X 1.) M CO O n

mom:

(J

K (J

0=

H

O S S iJ O O «B

in

uJ

S5

O

OS 03 H O QH «

«>< PS

JJ ' j ! j ft: 1 ! fLS 1 1 ^-t 1 E-< 1 • Cl 1 H 1 J £ 1 1 £

•S 1 1 ^ 1 u 1 1 1 ro 1 X 1 c E" 1 1 m 1 j E** 1 C3 to i P= 1 0 1 0^ M { 0 1 tK 1 to tC 1 P' 1 1 K 1 cr 1 1 0 1 b3 1 0^ 1 in 1 p. 1 ^ 1 1 u 0^ 1 0 Cl

CO 1 c 0 1 p^ Ci f ^ 1 0^ 0- 1 0 CS ^ 1 u >^ 1 K3 1 i Oh 1 ^ 1 \ Oh 1 CO 01 flCi 1 OS in 0 1 E-4 E-H 0 1 in 0 1 ^ 1 1 pa M 1^ 1 m; 1 1 CO OS 1 < c 1 9 0 1 (J ^, 1 0 1 t< K 1 H PS 1 K 1 0 1 E-< Ch ar 1 15 PS Eh

pr 1 Ml & 1 PS «c 1 c5 ' pi 1 M 1 0 O4 i iJ EH 1 I P3 1 OJ 1 tl 1 CL 1 n I fSS 1 C3 CCi 1 P. pa E 1 0 1 0 C C 1 0 Bt K 1 K 1 e I OS 1 c Eh 1 K 1 0:^ 1 «t Qz K tc. p: SE K 1 K U C 1 H n PS 1 tu E 1 0 EH EI 1 PS p. 1 1 B 1 C 1 B> s: 0: 1 E E-< PS 1 ^ 1 0 1 V 1 C & >H 0 1 e B 0 1 0 * *

P- 1 H 1 r: ffi Ct4 1 SB e 11 St 0 1 f" 1 00 a 1 n3 ^ 1 h4 1^ 1 0- D 1 CD \ 03 a<

fr 1 M

w ^ PS j 1 PS I K E-< 0 or PS 0 1 1^ 03 0 1 H 03 04 ^ PS 0 PS I fi^ 1 M 0 1 « CO 03 K Ci i« E" (E C) 0< •a: K 1 0 H (0 1 Eh H to 0 e M in PS M

Pd 1 O4 1 •<

U E^ 04 S 0< Eh pHH EH 1 ^ |a 03 C3 P4 E-4 ^ D 03 «c H H P3 Eh 1 \^ 35 0 0 M •tt! M 0 ^ E^ tD P^ H B5 1 K M PS *^ 0 C OS *^ in 0 !P H ! CC1^ PS

E-* O4 (H 1 M IT PS 1 w ce 00 B CO CD 00 PS 1 Be; 0" G-( CO c> &< PS 1 CD H P= 0 to M 0 PS PS 1 ^ in in m PS 1 0 D 1^ P4 p4 p. 1 > 0 SB H PS as PS 1 CO 0i M OB 1 i PS PS I M PS PS 1 L( |H I-I Eh

to 03 PS PS VPS VPS vec

OS PS Ou ; M OS cq OS PS «B PS p; 0 03 0 PS 0 PS 1 cu 1 •< <« <« 1- < E-< «« E- • H 1 W K V H 3: V PS B P) B • K 1

OS

H 03H as as PSH « H }• M P3 ps 1 H 03 IS 0 PS 1 ^ 1 CO E 1 \j 1 0 BB 1 K 1 PS U ps D i 0 0 0 0 1 f-* »4 1 |H Eh *A • C> 1 PB a 1 OS 1 M OS PS t Kl 0 1 a K «>fl 0 E PI 0 1 ft< 0 1 p 1 0 fr* 1 M 1 PS PS H 0 ° 1 OQ 1 PS m •< 1 in PS 1 ^ ' 0 0 ) 0 0 ! l« ai _ 1 CO SB . ® in 0 0 • W 1 as H 05 1 in p) 0 1 |-< • E 1 0 A 1 0 iJ V l/S 1 0 1 »4 1 H •0 1 K as 0 M < >o 1 VO 1 <o VO 1 «fi ve ve « 1 Px t fr^ 1 P^ O4 1 p< p< P. 1 SO • n m E 1 E H B • in • CO 1 in CO • in in in in

106
1 Oj * 1 { w [ 1 I t 1 • 1 • & 1 1 j 1 1 1 • [ [ [ 1 1 1 J J { 1 C D 1 1 o ! ! •• pj * • * O 1 1 0 M 1 * _ , 1 ^ 1 1 P4 1 tj p 1 E 1 ^

ft) «c 1 H f c 1 E-^ 1 pH 1 cj ' ' M

OS 1 0:^ t W H *• 1 rt 1 <J 1 1 C 1 E-" 1 pi H to ! ^ 1 ! ' 1 E M P^ Iff! 1 H 1 w 1 K 1 w Cc: E-^ 1 EH 1 O 1 CD 1 lO PJ 1 H 1 O 1 w to PS 1 OS 1 to Eh & CS 1 CK 1 • 1 ^ 1 E 1 * • 0^ 1 ^ ~ a" 1 ^ 1 •* O 1 •-4 1 ^ 1 ltl 1 CD u Qj 1 tr. 1 o ' 1 1 • c *

to

O ^ 1 O

H 1 • *J M 1 W 1 p4 » i 1 lO H fr^ IE 1 H M H

EH PS E- 1 ! M 1 H W » rt 1 rt 1 lU \, to o 1 V. 1 9C & PS 1 ^ 1 J 1 to

pa

C 1 O W 1 pH N 1 K rt

C3

H 1 SB IP 1 w" 1 U

h4 1-4 1 w GO 1 00 1 M

rn £

OS iJ

O 1 O 1 w u m I w Oj P-t CD rH W CQ a 1 C3 1 Ss EH Q to 1 to 1 H W H 1 *3 U D »«a: O Ct^ 1 (b ( V)

9^ 1 W >^

O ^ o WW 1 U 1 OS

H 1 cc CO OS to PS OS

H 1 H 1 O 1 1 PS

w

S5 EC

PS ' 1 1 PS ( 1 W S r*! S

(U 1 ) V.K ^ ~ *!, . I OS J 1 w

t"*O ^ ^ 1 OS &j [ J BS

p>» ^3 (C 1 W

K Oi

M

W PSw rt

O cn

w 1 O

H EH tu , 1 PC

H

UU 1 -C CH 1 CO

X «d •«e £-< 1 rt 1 E-< E [ N. U B H 1 \ ( j p;^ M S CO PS H !S 1 K 1 * M ' ' CO

H 1 ) 1 2 f'i ' Qb \J 1 • J

M

ps Ch o 1 " 15 ^ ^ 1 CJ 03 t rt 1 O O 6C 1 E E 1 \ • w

to

U 1 S 1 ? ' ' »J

rt

SB ac 1 bC 1 >

OS

U OS t^ o PS

O 1 PS

U 1 o o o O O H O O 1 O O 1 PC ^ W 1 1 Eh 1 W

&&

U 1 1 t^^ rt

U 1 rt

O 1 t£ 03

PS p£ 1 OS OS •J PS OS 1 OS 1 rt ? 5 ' W Q W O I wo 1 CO

E-*

O 1 Oh

O 1 W P4 o O 1 04O 1 p

X to 1 O

H 1 o O

H E-t S=

O

H 1 O |H 1 w i Vi 03 1 E to PS to OS 1 to ffi 1 o o 1 to o o M to o c 1 O O 1 HI 1 (01 m ^ rt

CH 1 f-i h4 W I to E H to 1 to 1 M C 1 0^ 1 to Eh 1 ESB 1 H -C 1 \o 1 'i£> 1^ 1 vO 1 O K 1 lb 1 ft. 1 f!M t SB 1 E E E E 1 E 1 to 1 CO to to to 1 to (

•JO

Oi ft6- B < O » «M O o o E—'« o n D SC » o » o o (s U o: w w c o p e M H N H M O fr< 10 VI W OT Ci D p B CS O 0< ^ 95 8! K VS! p e p B (-1 H o

COo

inM

tx

(0

BEo o s

OS o

OSK

H IB B

B<B

M Ok B SE O H

ooooooa<N»- ooa-iN^ooco

107
E"* 1 , OS

(f 1 1 03

to 1 1 p-< 1 1 Oh 1 1 1 t 1 0:

O 1 j 1 Eh d 1 I ^ 1 E 1 1 0^ ^ 1 . J Eh 1 1 C) ^ 1 . 1 c

CI 1 1 1 1 c

E-4 1 , 1 1 to 1 to 1 O 1 , ^ 1 to 1 to 1 PJ

P-< 1 ! 1 C 1 C 1 > k 1 1 ^ 1 ^ 1 •J 1 ^ 1 . , ic _ to ) E 1 «f 1 ! E 1 d 1 O 1 Eh I tH 1 (0

f~i 1 ff 1 M 1 fC 1 1 < O 1 Q 1 E-* 1 O 1 Ci tB ^ 1 M 1 5j 1 1 O 1 W 1 ^ 1 0^ 1 CJ _ : PS 1 H 1 O 1 1 C5 1 1 P-i 0 . . j1 fU 1 6- 1 M 1 Eh Eh c 1 E^ OS OS 03 1 IJ 1 to «c ^ OS 1 1 ^ E^ E-i C 1 1 O to to o 1 H w

Vi 1 P. Oh

m 1 E o Ck fW 1 P2 1 p: CD 1 ^ w p: 03

Ci 1 E- 9 CO E^ E E 1 >- f-( ^ 1 to C E-t Eh

E-' 1 j < 1 r 1 OC 1 1 ^ a C 1 »-3 1 fk^ 1 & CD 1 ^_> ;

Cu CD * .: O 1 : O 96 1 Eh 1 Eh Eh M • 1 » :k

(0m fce 1 1 P^ p^ H CC 1 E . E K 1 to 1 to to M 1 1 OP

pj p^ E 1 1 E M ^ I ^

»> P 1 .

(s3 1 1 OH 1 E-< 1 E-4 Eh

•-3 |p4 I P3 1 K IB 03

M pL] >» 1 1 f*^ Be Oi P-t ro E H M 1 CD H 1 00 M E E 00 M

U-t E-t 1 E^ to 1 E~* to to Eh 1 O D 03 03 ^ O 1 ^ o 1 0^ > 0 M 1 to p:: 1 CO 05 1 H 1 to OS E

V< • 1 • • GO

>•* (N 1-4

O 1 1 PS 1 PS 1 04 1 PS f * O K 1 1 M 1 M 1 M 03

BB

U £^ • 1 ^ 1 1-9 1 1-3 1 »J

CD SE E>4 o ac >H 1 \ PS o 1 p-, I7i 1 05 P 1 0^C » ac tB »d GC 1 1 pj C) 1 03 O 1 P3 Q 1 03 0 ^ E-^ 1^ o P^ 1 1 G-* P^ 1 E^ P-J 1 E^ P3 1 t-i 03 U U 1 1 to E 1 to E 1 «c I !2 U 1 «c O 1 rt 0 1 ^ ^ H 1 E to 1 E CO 1 E to 1 E to 1 E n SB M I ^ 1 1

|U

O

M 1 I! O p^ u i PS E^ O 1 *< 1 •< 1 * C> 9s 1 1 U 1 ^ 1 (J 1 O C CCl 1 1 E 1 E 1 E 1 E 1 \^

to I 1 CO 1 (0 1 to I to 1 E o 1 ^ 1 IMS 1 ^

03

U j 1 OS tJ i OS 0 ^ I O O 1 0 0 1 0 0 1 0 0

<4

H 1 E^ ^ J 1 ^ ri 1 t** ^ 1 Eh ^ K O 1 <* O 1 ps OS 1 OS 1 ^ I w ^ ! S ^ K tD 1 iq P 1 1 pq Q 1 03 0 1 03 Q

E**O 1 P, ^ 1 0^

X 1 O E-* 1 tP 1 o 1 0 ^ I ^ ^ 1 0 ^ fU 1 1 0^

CO PS 1 o 1 to OS 1 to PS to OS o o 1 s& 1 (O 1 0 0 1 0 0 1 0 0 *J

O 1 fu 1 o 1 o 1 0 } E 1 03

Q

W 1 Eh 1 OS 1 H 1 H 1 H 1 E

pi E 1 O 1 E 1 to 1 to » to 1 O M itf 1 1 » !^ 1 r*- 1 O K 1 Ph 1 ^ 1 b 1 1 t O4

fU 1 E 1 E 1 E 1 E 1 E

pa to 1 to I to • to 1 to 1 to

108
03

p:( B

O] Ci 2 o M I/: E- c on to B

>- ft

a

<J » B o H b; Q

B o > tlj O O W «t Ci E' o

•' E-^ • K tn c M K (t. U z z B

asC « B

H

^^ to Ct o P w p:^ tr z E O != o «c c »< << z

OS

H 3 o to J M M O >J H

V 1 (J «<

W f-<

C

B tW ft: b: Z #c:

H

O . Q IC (J

B (J o

C- «:

M («

M

K > m o

kl

W

w

w

u

M

u

HUa t-i

Q t< cu MM p:i ^ O Z EC

•e > e t£ z P3 M IS t- a 1 Z O Z

e-i . o «« P3

M

M b3

M— tn e B Z. » tc

B fSJ fr, >"

M

O

M 0:: E M M C O W b- W

«: ^1 ^ C p:: K

W Z E to E E IT M n Z C B M

ui

b ca

C c u z to E-I

m s c e M B z« J w

S= »J E-" o B a «c w o + E

tr; o oc

K ft tJ

a

U E C (JC ij

to & o

OSH

H

K

<« CQ tn <

•t

MO

CK lU • • m£ Q Z

>• > J

H • • CQ W >H H E-i CQ

cc as • M «s t< \ \

e« o z z z H H S5 O PS w

(0 1-^

Q

tc

OM rvj

M

w

Hw

w

H >-t rr.

B bn

m z m z • M M D3 OC M 00 M 00 M

E-i 10

M

U » u

U

B

U

B

K BE > O > O > O O M M lO D= CO K H

Eh

•<K& >-4

O 03

O

M bl

M p: (J

H

h C-*

O >" z p:;B

es Z »4 pCI OQ

M b1O o C ffi K t^ (-t W u U O to to X M i« U \ p to E to Z

s.H

>-)

M

O t<:

O

K

O

u

K

O a;

H e z iJ en 03

U «c > o o »n > O E v t/] u u B to z H be: 1 b£ a: V (t u H ij O C p; 1 o o

••^ a:

H E-i

J (4 E-i •J Z U E Eh •* O

O <C PS Oh E iJ OS H B m o E as b) 03

B

O 1 bl OS

K o

COX to

O f" c tsBO Eh

to

O {Li

</5

K >^

K E to OS

t«

O

O to to o o

Ou

»H

|H > a 1 Q

B

w

n to enOM E

OS

Q to Eh o H •* OC cc 00 1 CO u CH SB b. Ph 1 PH c E E E

tn 1 (0 to 1 to

109
•• •1 OS 1 1 ^ 1 1 1 1 0-> 1 1 s> 6^ 1 • 1 03 C 1 k 1 a 1 J 1 1 Eh O 1 Ul 1 1 c

>- 1 Z O 1 1 ^

>> 1 Z Eh I 1 E' O 1 1 1 D O 1 E O 1 1 O U w 1 C 1 1 o • 1 • p 1 » E-1 E t «: 1 (E 1 d 1 1 o C 1 O X 1 t

0-">

(t. 1 O 1 1 >- e t ti: 0^ g 1 o

1-J 1 O 1 1 E O 1 «S 1 Z E 1 &^ t5 1 c 1 CO

t-i 1 M 1 H 1 (tf U 1 05 05 1 Eh t CK

E-i 1 k: I O

C Z 1 1 O t fc. Eh O 1 U 1 o b 1 tr. ^-t 1 H 1 OS O 1 Eh I 1 c • pl3 ) P^i Cr *C 1 1 o

fa£ 1 05 o o: 1 E" 1 Ck3 es 1 U 1 3! & 1 Z 1 OC «c t W O 1 w • CJ 1 e~ 1 W tJ H 1 o 1 Z

EhM ft, 1 M 1 03

lA

r Z 1 ^ ^ 5 ' M 1 CC IZ4 C 1 W 1 1 O CJ 1 • H FtJ i 05 1 E- 1 03

iJ

O 1 Eh I r3 O' ^ 1 1 E K S o \ a: 1 >H 1 H* • C C 1 6-. t-1 E- 1 1 E- 1 — »- » ^ " ~ ~ " * on. w> — a- m n 1 O H E 1 m c: £- 1 • * Pv3 ; * • B3 > z: f a- 1 K 1 ^ 1 1-4 1 1 ^ H Ui O 1 ) O 1 1 1^

t- 1 O 1 u t fS

M

K 1 1 >J K 1 • e e » W » * B ^ Q M 1 I 1 1 E H O 1 1 1 W 1 1 1 O S 4 1 • ffi o >J H ) • O W *C >• 1 tn ea M E- (O 1 1 1 en H 1 1 H 1 «C 1 1 1 < U S \ 1 N 1 \ 1 N, O C5 E 1 Z 1 Z 1 z 1 Z

PS z ( 1 ^ WW » H " TM * • TM — V a* — « + «-

—

— ^ • 1 1 O IX Q 1 1 1 B M 1 1 1 •« OC 1 1 * B r- a M 1 O ) 1 •J fi 1 m e M 1 03 o • &3 ao: >x 1 z O 1 Z 1 rn Z

(J pa

H

M l-l IB 1 OO

H 1 1 00 »-" t 00

M

x: >J b4 Eh I Eh I (N 1 E- 1 E-

>< fC CO

M 1 u s 1 ^ 1 (J c 1 UB

o: tn oc • > o H 1 > O 1 > O

«e

M

M 1 (n OS 1 M 1 10K 1 CO (C > ec 1 1 i» s» > 1 1 so 03 t 1 >- 1 03 1 <n z •• O ^ N { to 1 03 K EE Ei U E" 1 tU 1 J j H £-< Eh O "S >< 1 Z (J t OS C3 Eh U ;z k3 lU (Q 1 03 H ^ 1 iU o H M 8= O (C 05 1 « > 1 H W

C3 as Kl o o (0

M iJ 1 CO E 1 <<

(Q S >JM

O Z 1 «« o 1 >v Z V, ^ O 18 E in 1 z TM J — TM +e J 1 ^ o ^ U 1 • U> 0= U M ^ 1 K fH O 1 t> >• 1 S Z >-S 1 E^ en u >-) 1 u 1 •< O o ec I > (J O Z 1 E 1 V H to u o O —'O 1 to 1 z 1 SS » —. — —1. o be: f 1 ^

OSu 1 1 03

O

>» •J c o 1 1 o o

OS t-1

a 1 E- iJ t as o ra: u M t H 1 •« U > CC 03 K 05 1 iJ 1 03 H O •2 1 1 03 O

EH

O 0. o B 1 03 1 th

O

IX CO

O

H => 1 PI 1 O

H

a 1 »•

«« 1 E 1 CO OS

*• o o c: 1 to 1 o o 1 »- O 1 Q 1 03 Q Eh > 1 H 1 E

IB

m E Q

O 1 (0 t Eh o M «; <T> Ov 1 9- 1 C^ u b z Cl. In 1 Cu 1 (X w E E 1 E 1 E

pa (rt 1 1 (O

no
1 XXX

p.

X

X

in C'

C Z E** >^ X

pa ,^ to CC B C^^ c u * c I c

p:]

M ^ 1 U > 1 o M M z: 1 X

>•

C CJ 1 PJ X 1 X O CO o c 1 Cl X X X 1 Ci o

EEXM <a: 1 c X

tJ ««: - 1 ^ to c a: 1 X

X

B B:; . E-* o to C P^ Hi M z

03 (J CC. to 1 gH O H X •<

ItX

D

«• ^ . 1—1 X

iJQ 1 X

X

X

O

CD P^JX

X 1 Eh I M ^

gg^

X CD

M CO ^ 1 i«f f**

X

X

pT, id! cn CO tJ 1 Ci z X

M

M* 1 X EX (J (U M » X X 1 >-< 5? Z

«C

X Cl

X 1 X

X

X

X

ax: t/; &H > Oj

CX E 1 Eh ffi

X «a;

X •< 1 z p5 DeM t ^ ^ E X X X

a XX E-^

X EhXX

Ci

X

OO

HX 1 X

X to

X

n

C

X & «a:

O 1 o >H to

X

X

X 1 to E »

TC>

SS < . M a

o< aX 1 £}

X o Li ^ 1 lj o o O X O 1 X X (J tJ PS 1 >. |U

cr

m x: 1 c , c p^ X 1 X

X

C 1 H • ^ M £-1 1 Eh Eh X

X

O:: pj fo: >4 •<

X z M GQ H 1 ^

5C ^ E-i 1 Eh Eh

X Eh

O po:

H 1 tH

HX t3

H < X

X 1 X

X \ CO

O

M 1 H

H z 5E

X

X

«C • pa U » f-3 O E CD ! 1-3 «c <c iJ to M . to •< K

««

O

H & X 1 Eh O I Xz ^ iJ X E to 1 X X

P3 i« rr

X Eh to 1 X

X z X tJ

>-

M

H ffi 00

M to

X \ XW CD

H ccH

X

X

X Eh \J 1 Cj E^

ft:X

M P«

U

XX o 1 f< «:

O

X

O

X rt] o

Ch in as

X > o o X 1 X

X > o > o X EH

C2

H to

X ^ X 1 X to

X toX ffi

H

W » D (t H 1. ^

CD :s ,J

X 1 X

X cc.

X 1 X

X

X

iA ^ E-I 1 E-" EhX Eh

O ^ Cx3

X t X

X

X

X

OS

U

H

X » \ X

V

X

V

X

(h

O XX 1 XX

X

X

X

X

X

X 2 n3 P3 CC X X X 1 X X X X X o X X • C *c c X X 1 O X Q X Eh X O X U U to X •< E-' 1 •a: E-^ Eh to X A* a Eh

IH

X

X 1 W

XX z -<

uX

X

OS to SE

X

M 1 X

H

X

M c to

X

M >o _ 1 uH (U O K 1 03 O ffi o

PS £h

O : K C BB nJ X X 1 X

X •4

X

OO

O OQ E 1 JC

M V5

U (J to Z M ! U

X o X U X U X U X U o

ij

X o o o o c o o o

IJ

X j Eh gH ^ E-* »J Eh

ttf 25 (J rt:

U

p 1 t_J •*

u Eh <tf

O

OS OS

X

X • XX

X h9X

pa ^ X oCXX 1 XQ

X

D

XXX o E-< O X X X o CJ 1 X O X X o O X CO E-t o

to o O

X 1 O

O

H

X

O

H Z

to ^ X to X O 1 CO X to X to X Z H

(0X o o o o o o to o o M to

M

a*

T >- > X X 1 Q

Q

X

X

X 6-t

X 1 to toH c I-* o 1-3 &^ Q Q *^ 1 X X to Eh X H S3 o O O 1 o o o O o o M rt T- r- u &L4 Z Ch X X t X X X X X H 1 X E 1 c E E E

OS 1 CO to to 1 to to to to (O

111
05W

b-B

CQ 11 (-

b-l 1 o B

P. 1 >•

a

SB

O 1 >-l (H

ac

H 1 o B

B= > 1 o o U O 1 C 1 o « ta 1 E- e CE 1 E

C' 1 05 o U »< 1 o O 1 0^ >

BC CQ 1 O u e 1 E o •C 6) C 1 Z W IS M 1 E o to H <«t t^ 1 H t-l s: 05 « 1 (J e-i t- 1 c o 05 1 •c

fc. t<B 1 O o o

Og 1 tn ts 1 H o: «t H 1 o 0. c

tH 1 M o: Bl,M

D • 05 O Z 1 be Si

05 •s

O 1 o z 05 M o H u b< Z

E-<

H

W 1 M to ^- > E z

•^ ffi

M E-' E :* 1 O 1 to

^< 05

C OJ • o BOO 1 to E o V 05 1 < 1 X H o o b- M Sl, to t- o H m

(Nu > tri 63 1 H C

E-<K -I 1 9 SI O O •J •J •J

iJ b< o a

U ta

C

C oo» O O o as

cn >xJ

M

ir.

w PO «l

X

Ol

H t<

B 1 U z: 6h as o B M 1 m: •e •a £ 1 \ V. E z z z • a a- 2 +

•< to

C

n 6} E N o • O M o U M H m 1 w

M

M < >• o m z 1 m Z r> Z

>- irt » HM CD

d OCM OO

H 00 tH

es CO < fM E- 1 »-

M

M

H

w

U

B t O

B

OO > K > o 1 > O > o a H H to OS 10 05 to OC X >

••

m <n z 1 a.

e- e< c to 1 Vi

M eu esuH

M 1 M W JH O « >- Z U 1 OS

B

B (C

U SS iJ (U 03

W

M 1 (U

O » l» »J O 00 ts > > ) E-< 6) u o to W iJ 0. 1 to E

>< Cl z H t « o V to — O Z 1 E to z

to • H O be u w u a U M

_ BS « H O > fH 1 tt H ts as i-a 03 U iJ ( u •t O O 03 (J O Z > 1 E V h to u B — O u 1 to z O

k:

X a: LI OS

U

es •J

O

O o o

tH >A E-i 1-1 > X u •a (J 1 H •c u H OS OS 03 1 *i OS K o t W O 1 Ik' t< o at 04 C 1 M & o M (0 a O H ) O O C-I w 05 1 lO OS 1 E to o o 1 to o o > 1 O H Q 1 N 1 H 1 H E o 1.4 H ! a o i to Eh as M E 1 o H * r- u Gli K b< 1 Ut Bu H 1 E 1 E 1 E E 1 to 1 to 1 to to

112
11 f1 OS 1 1 b-' 1 1 1 O • b. 1 « B 1 6- o i m ( ca 1 o ( E- 1 1 B 1 1 b. 1 0- 1 E" 1 IT o • B 1 o 1 C 1 to 1 1 B: 1 O 1 • Eh 1 Eh 1 c 1 ^ 1 1 1 Ci 1 o 03 1 b: 1 o 1 > K 1 as 1 O 1 •J o ^ 1 E O 1 •c 1 X a: ^ 1 1 E 1 o 1 in H 1 H 1 tH 1 101 1 o 1 ) »

E- 1 » 1 1 1 o 1 u W -r-i t o a 1 1 H E 1 OS 1 o 1 H I O W 1 1 M Eh « 1 L) 1 1 Eh 1 o: 1 o 1 S EH ^ 1 OS

•a 1 H

U 1 a 1 O t. 1 z 1 H 1 IU

tn 1 as 1 » M 1 E E 1 at

p-i 1 1 H

W 1 1 1 E4 Eh 1 H

O 1 E- 1 (O to 1 E 1 « t X >- 1 M 1 o 1 W I/l 1 h'

_ 1

rr. 1 1 o 1 1 a- E- 1 1 •C 1 1 K E 1 1 M C t s» 1 3 1 a H O 1 >J 1 >-< 1 ij tM 1 0. 1 (J cn 1 n M 1 1 »J 1 1 ISO 1 1 o 1 1 o J 1 n 1 1 a as 1 1 « >J M 1 1 O («•*>< 1 in H t4 03 1 1 H H 1 •« 1 << 1 t U < 1 \ 1 X 1 \ o E 1 z. 1 es z 1 z

«s 1 fi. o 1 O 1 11 as PJ 1 1 « to 1 1 K O M 1 o K H • 63 1 H f« 1 H o • H «< ^ 1 1 m K o 1 z M H CD 1 CO H 1 CO H 1 CO M ^ f-i 1 t< • t< 1 E- H 1 u o 1 U C3 1 U B

»4M as 1 > o 1 > o 1 > o

<<

H 1 10 as • M OS t-l 1 to OS

a •

#• (M < (M 1 1 1 1 >J O 1 1 OS PS 1 n » O 1 • H 1 « U t< 1 1 1-^ -) n f El O < >• 1 • OS D OS C ! w o H H as O B 03 1 1 EH M Eh IU e> (E H (J U 1 e- 1 (0 tB (0 tc 1 x

PO » iJ

H 1 «i:u M!

U 1 V j1 Z 1 E in 1 z 1 IJ 1 11 CO • «J 05 O 1 j OS E-i 1 1 « < Eh M H < 1 >- e> X 1 E- 1 U O H E > U 1 «c •c C O CQ 1 > 1 E E I H •< OS 1 V o cn u 1 ) \n tn » Eh w < « z 1 1 1 o 1 KS 1 1- 1 ec o 1 OS

U 6 1 o o t O O

•< b2 I E-I |J 1 Eh

M*^ *:

y 1 < u 1 EH 1 *t

U

OS 03 1 a: 1 IJ 1 OS M B 1 M Q 1 1 M

O

tM C-<

O 1 AiO 1 H 1 OuO

X V> 1 O P 1 P 1 O EH H 1 • Ph •c 1 M B 1 E 1 (0 OS

tff 1 O

O 1 CO as t O o 1 e. 1 1 1 m t Q 1 u Q 1 E- 1 M 1 E o M 1 1 M w 1 Eh OS H B 1 <N 1 <S 1 (N o H "C 1 1 ^ ^ 1 r- u h X t 1 ^ 1 U* n E 1 E E 1 E

OS CO 1 M

W 1 (0

113
Z 1 11111111 •c 1 11 Z

to 1 z t 0 H I l-H 1 z 1 H X M 1 E-< Eh I ^ 1 to 1 to 1 p 1 to >- 1 to K 1 a- ^ C3 1 (- C S5 U 1 0 1 X c l>- 03 Z 1 Z ^ 1 CtH O X C 1 Z 1 p: tj iJ 0 c 1 E- 1 1 lu 1 Q P3 z 0 to 1 cr C 1 E-^ to 1 03 t Z 1 0: 0 &3 E P3 1 OS

to l-l 1 PJ 1 IH OS « 1 c W 1 c ** C 1 PH P- E to c C fH •< 1 a- 1 P3 1 b- ^ 0 •* p. M CJ 1 E-i E- 1 u >-] 1 z c 1 OS C 1 to 0 1 1 H ^ 1 O 6-. 1 >J 1 CP (-1 1 z 1 to

ft- 1 ^ H

M t c e-, z »:< 1 (t «r c O E- z to Cj I 03 1 w 0 1 ffi 1 PJ PS H 1 A

M 1 CW Z ij 1 01 E •« CD OS EH 1 EJ K Ob ^ ci: 1 c E E E A P. 1 t • 0^ 1 ec tr 1 o Eh H ( E c «: Z 03 C 0 1 C) z to "I' «e z lo: 1 ^ O 1 lU w (J ^ fH 1 tM E-< 1 lO tt, 1 » a: 1 ts o to 1 U 1 a- OS > 1 P3 C (J 0 (J 1 OS M be: W u tJ w to or. k3 PI E- 1 0 C 1 ^ r: ts cc p c E Z PJ z c. Z E 1 C3 C 1 (E tc > CD P3 tr. w I K

HI o o U

U

U tJu

w

U > ua CJ 1 (J

O > c o 0 ij 0 c c:3

a 0 1 C3

14 11 n: E^ 1 1 (V 1 o 1 f\J (B 1 n- fsl t— 1 (N c O 1 J .J iJ ij 1 1-3 c • cc n CCi 03 cn CQ 00 CD t OQ M <N 1 0,

10 (V to to to t/: to 1 to to to to to 1 J H b: |U 03 p:' P3 1 B 5/1 L) tJ u 1 o < o u t_) u u 1 O Ik3 >J H <. E E E E Ml «c E E 1 E E

(l] •< >^

QQ

U PJ < Q 0 Ki «<: 1 P3 « M (D » O % o »J PS f) 03 • 0 » 0 » 0 l-J P3 ) 1-3 OS

U~ Si Z X Z X 05 ts IDU Z X Z X Z X cc cs 1 ID CS > KS M M E-i V> E- O O c 0 H E-> p: E-i W E- 0 0 1 0 0 O ^ iC &i ^ 03 03 03 03 P4 P3 Pi pi P. H OS 03 1 Ct3 OS O E O c O4 Pi U' & 0 E 0 E 0 E Pi p- 1 Pi Pi N,H US

(/) GQ I o to •* O 0:; cc cc 1 •J H b-> H PS PI 1 U (u ^a OS iJ o: iJ OS |J OS »J OS >J 1 • • at O M Ik: H f M M H P5 H P3 H 1 >< > >-1 da tJ Oi E E E E >J Pj •J Pj 1-4 P< E E 1 E E

!•

m ta »t > m c O E tU ft

M «c CD E CD E 03 E 1 M •< 1 P} loa

H

H CD x: o E O *-3 OS >J OS E 0 E 0 E 0 1-3 OS * >-3 03 (0 2 Ph Eh W t_) EC CS 03 15 M (J P3 (J W CJ 1 03 C9 1 CC cs H to to 0 0 0 0 to to to 1 0 0 1 0 c

t-i (4 E-< 3; (n Ch to OS OS OS 03 OS to OS CO 03 (/) OS 03 OS 1 OS OS H «e O < o Ou p< Cu A 0 «K 0 i< 0 Oh P< 1 fri Pi tH H GB C> pli M

(B IB I

iJ o I1 O K w 1 (B U Eh E c: E C E E E E E S E E E E E E 1 E E

E->O «c >H O: •«

M «<M «t P3

A P? «C p] «<U *< t P3 <

:b «j

H (Q (J OS 1 1-9 OS •-9 P3 03 •J P3 •3) OS >J OS 1-3 03 1 03 one CD U 1 (Q U 03 U 1 n IS 1 C V> IE U CD t5 1 CO C5 1 CD (9 o tj O O 1 o o 0 0 1 0 0 0 c 0 0 t 0 0

t" Eh

K p:< 1 o: OS OB 03 OS 03 (c OS OS ct; OS OS 03 03 1 03 OS

C:

R O* CL 0<

b 04 a< Ou 1 Pi Pi Pi P4 Pj Pi 1 P< Pi • Pi P<

(Xi • K fH a M C3 »- 1 o ,j 1 PC M O ^ 1 O (3C tj PS U 1 (u O OS Eh O 1 ei B ij IE 1 CD IS IS 1 CD EQ ID CD 1 03 > o o » 1 u tj U (J (J CJ 1 (J 1 CJ o > o to O 5 1 o 0 1 0 c 1 C3 1 0 W C El S.W W \ iJ 1 ^ 1 (0 W d 1 Z 1 o w o «J 1 OS P3 1 •-9 o •< H 0 E t CI iJ Eh K (J as 35 1 P3

03 03 E E 1 E E P3 P3 1 E E Eh 1 EE

w

M

X 1 lU «< Cl E Q E 1 P3 rt; <tf t P3 Eh O 1 I.J OS 0 |U 0 PS ( OS Eh 1 1-3 OS X to 1 n u 1 03 C5 to 1 03 CS 1 >a 1 •< 1 0 0 0 0 1 0 0 t 0 0 1 V 1 V OS OS 1 OS OS 1 \ Eh 03 pS Q 1 OS 03 t<H on 1 z 1 z Ou P< Pj tu 1 Z to to 1 Pi Oh Q 1 Oh Pi H CU

»H Eh to 1 iH H 1 »J 1 1 •« 1 pH 1 iJ 0 OS 1 P< 1 OS Q Z a • 03 1 b< 1 E 1 K ) z Z z 1 0 1 0 O B (U • n 1 CQ 1 CQ 1 m 1 03 OD 03 1 CO 1 n

(BOH

M e t (J 1 u 1 0 1 u

u CJ 1 (J

O

O tB

H •* « o ) o • 0 I H ) » 0 PI 1 H • 0 o w o ft* X t h ) k ) Ph 1 Ph p. Ph 1 Ph t fri H (C U • n 1 E 1 E 1 E 1 E E S 1 E • E t to 1 to 1 to 1 to ( to to to 1 to 1 to
••••* !1 ^ 2^ ^ J • ^ 1 O 1 »J S5 1 O 1 Iku O to

ft E~i j 1 wc lU E U-: 1 ^

** 1 1 CO

CO j 1 V _ J

M 1 1 1 1 w [ 1 M Eh E^ 1 C Cj j ! K tf J tr £ w O 1 ! ? »r ! 1 ^ lU

CJ o t_^ rH i s_ ft- ' m • 1 ^ ft

XT CJ EC ft ft • , ^ «C Eh to H o 04

O f H 1 o 1 I*- r-i H w o 1 C *c 1 O 1 IH ft _

It* 1 ft >"

O 1 ' o ^ O

Q 1 ft E-4 ?* ft E ft

pj 1 ft 1 W \~' *^ ft £^ ^ ft o E ft O iij ft 9s H • cj E <a! CD IC E ft E M E *C ft o »-a 02 w ^ S- & CO o 1 w

CJ 1 M o w ^ E to j j Cu

c/: 1 1 tr> o ft

O CO C5 pq E CO EH 1 CO i.a 1 ft 1^ ft K ft p W o E-1 iC

w E

ft. 1 ft ft ft o ft c c SC E E WC > a 1 (C CD CD V ID mC CO Eh <t Eh 00 CO ft C^ pa X CJ c • O 0^ P w P W O ft

e- 1 [ 1 C 1 ! 5 ! *~ 1 fNJ C 1 kJ 1 M

(Q ''^ j

CD

m CO Sq ft 1 Vi Ui i CO CO

O 1 1 M 1 1 o U ^ H 1 1 < «<

pa < >4 1 1 a o CO o CO P CO P CO P 2 M t4 CO 1 1 »o CO o CO o CO o CO O P H ^ Ss 1 a: tc H rc pa a: fr3 m E E-i W 1 &J t-t Cj E"

52

CJ Eh

U £h

W ^ *J 1 1 Ou M pu K CJ w o CJ ft* o w

O ^ o 1 O O E *C E w * E E *1 ft w

«l! B 1 j ft M 1 1 N 1 1 ft ft

O

M 1 ( WW

WM

W ^ I 1 -) fiu H « frM 1 M «r 1 CO E CO E M M (D 1 1 E O m (9 1 to u H U W CJ B£ ft E E H 1 o o 1 CO CO CO K M PQ pa ^ ' pi ps ' ^ 5

CO ft CO ft

H 1 1 ^ o

"4-

— ^

*<

w o o o o o O j O ^ H J 1 « U E-< 1 E E 1 E E E E E E o F O •« »H 1 M •« 1 w P4 •C pa « pa

ft »J (U OQ 1 i-a « 1 1.9 ft tJ ft ft \ O O 0e; 1 fft V 1 m c CO c CQ O K E E E E o o 1 o o c o o o W W 5? W W ? j ' ? ?

ft ft ft ft ft ft • Om fr* o o o o O 1 O OS O 1 I OS frH O 1 D K ^J 1 CO 1 CO lO n CQ ~ o o CO 1 o 1 u PQ w w 1 Q fa O P p • SBM

«^ b3 1 ft

n C""

w

9C 1 * O

M 1 SB CM CM Csl Eh P « oa 1 EE PJ E E pa H D • 1 H a E E-t E-- pa MC CO P

t»O 1 0:^ e 1 < 1 < 1 << ft < to t CO u u cn 1 E Vi 1 E CD E CO E 03 E CD m u << W 1 2 ? 5 —. 1 ft o ' ' ? ft ft o ft O o o |h ft 1 ft fCi M C9 ! ? 55 1 O CO ? S3 o CO 4 p • PJ M M ] 1 w o 1 s CO PH P lt( p ft f*i P 33

I** 11 CM I (•IM o p* ft

Q 1 ft 1 ft 1 ft 1 ft B:K 25 o

»JW 1 1 «c 1 cu 1 03 1 CQ CD CQ P p ft

UK 1 u 1 U 1 u 1 o 1 pa

MM

M pa

H •* 1 o 1 a 1 o 1 p 1 P P 1 P P p P

Cu Z 1 1 ^ 1 ^ 1 Pui 1 1^ Pu ft E 1 E 1 E 1 E 1 E E 1 E E E E

tn 1 (O 1 CO 1 to 1 CO » CO CO CO CO CO

115
1 n a; 1 1 6; 1 CP cs 1 •£ << 1 11 >j 1 C ^ 1 1 Z > >H 1 1 1 H O f- 1 M ^ 1 o ft" W 1 O-i ^ 1 1 E^ Eh z O 1 ^ 1 ^ I 1^ w ' 1 Z Z 6; z M 1 (e W fU 1 c ft3 0 1 E- 1 O p IK 1 o 0 1 ^ 1 z M 1 1 Z z 1 ft: o CC 1 ft] 1 ft: E 1 ) b: ttl to 65 •o: 1 ft] 1 e 1 1 d' a ft-- to E 1 CC 1 p

1.: 1 1 M

K E 1 E- to 1 E 1 P O E 1 ^ 1 C O K 1 ft^ ^ E- >- ft: D 1 > & 1 1 z z K 1 to >^ ft: iJ tl < Z to 1 1 1 l-H H (J to z •• •< 1 H ^ 1 I O 1 •c Z o to a. 1 •J X

a: > ) 1 z Z z Eh

C •£ C=

C 1 •< 1 Eh

O 1 1 1 H (-: •c Eh ft^ E-' Eh I H 1 CCi M 1 1 P ft] •t & xC to 1 es 1 ft<

t-' 1 E 1 1 to to to

a P •* Eh

V ft] 1 O

«X 1 M 1 K » ft'

J «i E-< to

U 1 to

E-i 1 B t< 1 Eh 1 W

w

H 1 «t EhH tc 1 P p P «S U ft] iJ ft] Eh

0. 1 iJ 1 1 Z z Z >-<

V

U

H E CC 1 E 1 (S

«E ir. 1 H

H

H to

H (H Eh e e O 1 z M 1 « iJ Eh ts ftl I-] Cu 1 k] ft] E^ 1 >^ IM tc ft; c z O V o •]

(ti 1 K 1 K 1 O tj Oli z J t5 e> ft] >^

VI 1 M EO 1 » 1 E B- E H C 1 O 1 o c O E- E O. ) CQ > H

10 i w 1 o w

O 1 *-] cn K u 1 oc K ft. to 1 to BC Eh K O z

«u I lU 1 KW ft. ^ ft. ft: to ft. h]

•£ (C 1 CQ CQ CC bi 2 ft]

R ft] ft] 1 ft]

Q 1 o o 1 E E E E- » EH E Eh P Eh

C

«e & I » C

K

O <S » K Z CC

M e z 6.1 r) 1 Z Z Z to U to Z to <e to Et-' 1 !

•a: 1 vc

w: 1 r- K 1 VD 1 (M (N (N PM *

vc

O 1 J >J ij 1 *-) tJ I-]

J •J ^

U-i 1 o CD

X 1 CC 1

ec cr CC CC CC P e 11 1 ft: ^ E U <^ O c- CC ; > > O C Eh o o o o o u ct* z Eh O Eh

w «« >> E H ft] 1 Oi E A P <e

HI E-i ffi V} 1 •V Eh > H Z M

«c z z Z P ft] Eh ftH Eh

H CO

w aC •a •a: ft: ft] e z ft]

H ft]

M

«c a.

O

H \ 1 V \ Oi ft. 1 O <<M Z M Z E o 1 z z z O o E E ^ M — H O 1 ^ 1 ^3 ft:: e> H o >< 1 M M M C J ft. Sh ^ 1 IN (N D. eh 111 H W «t >- M OS E 1 O o o 1-4 M 1 M M ae M H (Q M W 1 1 t^ CM Z Z 1 Z Z H \ E-I 1 o c \ \ \ Eh M W «s 1 u 1 U 15 1-3 1 >-] H

SE » H \ 1 b< 1 Cm O. Qu Z H M H z 1 H 1 H M M 1 H 1 H M M

Cc . W 1 •J Q EH (B O ^ lU o «c M I O

02

U ft* E-I

E-I

O OS >- •a E P< I Z z Z Z A

a e4M

M tn 01 ft: ft] 1 ft] ft]

H

O ec e: E-I

M 1 Z 1 Z Z u 1 IS 15 Eh o u w H W Eh 1 |U 1 u 1 to to 1 to to H Z t-l Z 1 CLi 1 X 1 X X Z

I/)n

—

K 1 o 1 o o IT; CO 1 to toM

U

O bC £-1 } o » u O 1 CB O M fil 1 D e J m Eh 1 u 1 cn

m CC CO CC o C O CO u (J b 1 m tJ u 1 <J (J H

to o Eh (-5 ( Q I P p o E-I 1 1.]

ft]

1-1 I-) 1 t p CO 1 H Eh •J 1 ft] 1 E P EH «E s u W Z ! u w S 2 1 O K I-] M ft] ft] L) ftS ft] t <=> E j Eh (a CO >-] 1 O E ft] tH O 1 P M ft] tH ft] E X to t r- 1 Eh 1 o 1 o U z ft] »— Z P EH w t- (X < • 1 o t o t o t£ 1 Eh CE B Z •< 1.) 1 •« C 1 Eh 1 E- 1 Eh 1 Eh < t «G P O *< E^ O \ Q EC • Z 1 to 1 > 1 1 > 1 > E Eh p aa E E to > z O t1 to 1 •-) •J tu o to > a 1 2 0- 1 CO 1 ( >H 1 ft4 1 ft] ft] ft] 1 ft] • </l 1 o t u 1 5- 1 u 1 (J EH Eh Eh Eh I o M C 1 (/> 1 X 1 (b 1 u 1 o • O. Si (B CC B- 1 H H rt 1 O 1 ra 1 1-5 1 Z 1 z z to CO CO CO 1 Eh 1 Cu 1 1 1 bH t (in 1 Cb ftH ft< ftl ft. 1 ft< 1 E 1 E 1 E 1 E 1 E 1 E E E E K 1 E 1 W 1 VI 1 to 1 to 1 to 1 to to CO to to 1 CO

116
1111t ••• • 1(1*• 1•111* 1*11 P- 1 1 o 1 • • 1 * 1 p 1 *^ 1 1 1 p

(J in 1 1 1 to 1 * • OC A 1 to e * 5 C- • «c ^ 1 to E- •a: • 1 o 1 m >- ^ • • 1 0^ CC4 p: Ph • • w ^ to • 1 Q 1 1 c to E-" CT) 1 to H • 1 E • •tf H W M oC 1 i*C & E- 1 OS * O to • 1 E- «c • 1 O t << ( be: «: > • 1 tu ^ 1 > «< • 1 (J H o to • • 1 o K Eh • t ^ to pi to 1 *-J O 1 • 1 p: I • 1 «c 1 » E-* SC P^ p^' 1 O-' 1 ^ 1 E H 1 ^ • O to D 1 p^ 1 to 1 H • c to 1 1 w H O C: 1 0^ 1 to 1 CJ

E-' 1 H 1 t>- 1 t> «£ 1 >- 1 w 1 P^ 1 to 1 w: ) H «: (J 1 E" 1 PS 1 P

0^ 1 •a: 1 «c 1 E- •-4 I 1 d 1 • 1 ^ t O E- ft: 1 P'' 1 p 1 M 1 «c >-< C 1 »-] •a 1 (J 1 W 1 Eh E-" t: C 10 1 d 1 PJ ^ kJ 1 H 1 1 h£

C:i 1 to E" t C 1 CO «a: o 1 > 1 E- 1 U • *^ ^ 1 U ^ 01 1 P^ 1 H 1 • 1 Ph w 1 O 1 ^ 1 • i* Eh W 1 s:^ 1 OQ ^3 O to 1 1 P

OT 1 fWU E- t& 1 t L) E-i 1 to to t< to 1 Q t pj Eh VI 1 0- 1 M ^ 1 to ^ |J 1 O 1 n 3= to a: 1 >^ 1 lU u p4 EiJ 1 K 1 P^ E^ P'^ «: 1 F-> 1 P 1 P3 O 1 o o o o O 1 o 1 O o a 1 cc 1 1 E- H P:. H W M 1 *H 1 M P^ U 1 u 1 U 1 < ••

E-' D- E-* 0:: E-^ 1 E-t 1 EhC * C" '* t P 1 1 P H 1 i i i * •

•a: 1 ! ! E 1 CC 1 1 A 1 ^ o t i-J ^ 1 »-j fr^ 11•

CD t (J 1 (C 1 OQ 1 CO 1 pj •• 1 pj • • t •• • O 1 • • Pm 1 K 1 PS 02 • 1 C K 1 o o Eh 1 o 1 c c J

1-3H 1 E-i 1 Eh • Eh EH 1 ( 0-

p:] ici: Em

g 1 < 1 «c MC 1 H 1 H

M E-* GQ 1 MM o 1 H 1 H

H 1 1 K j C & ! EH 1 E^ 1 EH tH 1 \ 1 \ H 1 H M O 1 H 1 H to 1 M 1 < 1 to 1 PS t as EE o 1 1 a* » N. C 1• H H Eh 1 M 1 *H M 1 W • 1 ^ • 1 as 1 C 1 1• •i • > W 1 * * 1 P' 1 1 PS Ori • C! H 1 O O o 1 O 1 o O

iJ |J 1 Eh 6-* 1 E-* 1 Eh Eh & 1 0^ 1 P4 W d »H 1 •< <« itf 1 «e 1 < M 1 M 1 H 1 » M M n 1 H H H 1 M t H M 1 1 2 1 00 H

(k 1 e-* Eh 1 Eh 1 Eh Eh 1 \ 1 V 1 H H 1 H H H 1 H 1 H H 1 1-3 1 1-J 1 U P Z 1 S5 a: 1 &3 1 s ss 1 Oi 1 04 1 > O H 1• M M w 1 H I 1 H H H 1 M 1 H 1 (0 OS • Q I PS 11 OS 11 PS PS • •1 O H 1 O o O 1 O 1 O O • 1 05 O 1 Eh E-" Eh 1 Eh 1 Eh Eh H O < >- 1 < «« << t < 1 *i£ < K 1 ^ 1 2 2 H ffi 1 H M 1 H 1 H H PJ 1 P^ 1 p:^ 1 O CD 1 Eh EH 1 Eh 1 EH E-< 1 U 1 tP O O 1 H H M • H » w M to 1 to 1 to 1 Ou 1 SB <s as 1 2 1 as ^ >< 1 >* 1 >* t H • H H M 1 H 1 1 H 1 M to 1 to • to 1 1 S 1 • 1 • 1 • U C ^ 1 1 I 1 ! 1 U 05 O 1 WHO 1 E-^ EH Eh » E- 1 Eh ! I 1 C3 &S ^ f O O O 1 O 1 O O en 1 CD 1 H O O CQ 1 H H 1 w 1 M H u 1 U 1 o 1 t» 1

E-i E^ Eh 1 Eh 1 1 Eh 1 1 P 1 1 p 1 t U I 1 1 1 ( 1 1 ^ 1 1 1 1 t 1-4 1 1 1 P3 a; 1 0^ t PS t o o

<<

W 1 E^ E-' 1 E-^ 1 Dw 1 p^ 1 w 1 (H iJ

K

U 1 ? 1 2 1 P? 1 s: 1 E 1 •<u

K PS 1 (U 1 P^ 1 D 1 c 1 E 1 OS W D 1 Q B 1 o s 1 Q s: 1 c o s: «« 1 E < 1 u

a

E-*

O 1 1 O 1 O

M t P3 P:i Ct. 1 P=:K 1 M OS 1 0* o ^ W 1 H 1 Eh 1 Eh 1 E" NS 1 Eh « 1 Eh U 1 o t- ^ t «a 1 «(C 1 1 to PS < 01 O 1 to O 1 to o 1 C-" tn » Eh 1 >* o >* OS 1 0= 1 5w p; 1 (/) 0> 11 to to 1 to 1 t to 3 • to i I/) 1 1 to Ai 1 1 o o 1 11 1 m 11 m 11 vo X 11 » 11 < 11 O 1 u 1 w 1 M 1 p^ u 1 Eh 1 P 1 H

t-1

W 1 o Q 1 o i Q CQ 1 CQ 1 ffi

M S 1 H 1 H

M 1 M 1 H

H o 1 u 1 CJ 1 a

Ht ** 1 6^ 1 E-t £- 1 Eh 1 tH EH

p 1 p 1 P Z 1 a b 1 P< 1 Ph Ph p^ 1 p^ 1 Ph 1 1 c 1 E 1 c z: 1 E 1 E 1 x:

to 1 to to 1 to 1 to to to » to 1 to t to

117
1 z 1 E- 1 B 11 ftj C£. b. 1 ( to Eh I O 1 1 •J E-' p t 1 63 O 1 1 B E- >- 1 1 E 1 V 1 >H 1 1 VI I E •x C 1 1 a 1 to (~ 1 O 1 to 1 1 1 c •C 1 O 1 1 C 1 •a: to E 1 • Z 1 1 o <* B • • O 1 1 t" 1 O 1 Eh 1,1 1 1 ca 1 Z b U e b3 1 CD li; 1 Eh E CO 1 1 C 1 O > z O B 1 a 1 1 C H B Z O 1 b4 tn 1 E- 1 C5 EH b- C ^ 1 •e: 1 < 1 t/5 w E- 1 m 1 U C t/1 1 b: C to Z C ( J 1 C 1 KI c o E- 1 to K E bl ^i.. U3 1 » Eh Z 1 Eh E CO K 1 B 1 J 1 w tft bJ 1 V O (5 b3 « 1 B S O E 1 ft. o b: EH

f- 9 t/1 1 tr 1 H

U 1 tn

B

e- 1 Eh I in to Eh b3 1 B CD

04 t Z 1 Z 1 tn: t£

B V) 1 e CC 1 1 |M 1 U ) U (J H b: bl H S H 1 S-" 1 EH ( •s «I > m 1 fH E o r) 1 H 1 X 1 B 1 e B Z U ( u H V 1 1 1 E- 1 Eh E- O O ( M o Eh CD 1 U O o •• U 1 Ct ( 1 6- tu b. 1 z >H O fH C 1 O 1 c c c o O 1 H B B z m 1 Eh tH b4 iC

AC

B I B 1 BB

B Ci

B 1 Z K

C Eh

U 1 1 1 K

U ^ U 1 B b3 b3 tn

OD 1 C 1 CC CDC CD ID 1 c b] Z o 1 E 1 E 1 E E E U E 1 CD m K O 1 O C 1 D 1 C C ~ O t 1 c o M O 11 •D Z 1 Z 1 Z e Z Z 1 B n to E 1 fC i OD CM 3- a O 1 •J J >J 1 1-3 >j J 1 >-l 1-9 91t u ffi CC 1 m CC CD 1 CC IC a^ 11 C ( W 1 00 1 B B

O ^ 1 Qj 1 a t o O

•J »H * M

W o 1 1 Eh

H

1^

W E- CP 1 « H o •«

w o to

O 1 H

H

C tu e- o t' c 1 Eh

IH 1 ad ^ D

O > 1 > I-)

B t£

U E- •C •a: 1 M

H •c

KSl t W fci

O

M

C 1 o W

O

W o w \ 1 V 1 Z B *v

£: 11 B

B

B Ik: 1 w

BB «; E z z 1 H

M z 1 C 1 W 1 b3 1 B V> B to > O M 1 o o c o o BC IB

1-1 1 EB EHB b! (N CN

U «CC ^4 1 B <: <«N

v

O 1 B

B

O

H

H CD 1 lU

H

NMN b3 (N 1 H

W CN

Cm E-> I O E-i z z EH z O I O c o M 1 a: w O 1 w H O bl O (9 1 «e •c o 2 1 (t Z E-« & 1 Z Eh a< •-3 bH 1 b] N ft4 M 11 B H — O 1 o M o (J M 1 B B H 1 B 1 B B 1 M 1/1 1 b^ bQ J O 1 EH B H B EH E- 1 Eh

&:

C ><:

w 1 U

O «< > > O V) z 1 K

u BOH 1 V 05 e- B c c EH E E r> w 1 ^ BM >VB Z iJ M IC 1 (d CS l-< 01 N. N M to I-] B M O 1 bl B H B O CQ C 1 E-i fe. Z 1 z Eh CD U B B< 1 <2 b> U U 1 (H W U 1 M U O O i< E 1 H «e E- *a 1 Z M 0. Z M B B \ > o 1 U Z M » 1i B l-< tH —

o o (H 04 Ck z u 1 B H B H z 1 u O 1 E- Eh U B u t 1 O o

o: El

O 1 H

H

W bl

B z 1 B t EH CO cr tH CD z n

u BB 1 « es z C O ec 1 E O b; u (J O O b< u 1 E c

V)

u 11

E-i

Qa EH s z o rj

B 1 ^3 z 1 1 x: 1 1 1 B (J B U

1-3 1 1 CD CC 1 o o o o M 1 1 e B D B i EH i-a Eh >4

O b3

K

U 1 o 1 tn

M to C4 1 « o * o PD

O

B

B 1 B 1 E-< Eh to to 1 B

J

O [ C P3 1 W Q CD (J

e- o 1 1 M E u E 1 OV 1 04O 0>O E X W 1 g cn •as (J U to •£ E CO u 1 H B 1 o fH O Eh bJ o U 1 0 I >J B o c B B tj z 1 B C to EH 1 O t B as EH E- B •e o to o 1 «: O 1 to B to B to z 1 •-1 1 £ a > > E IX b. O z 1 > to 1 o o o o 4 M 11 Z 1 B X Ml B o u z 1 o Eh o O 1 CO 1 &3 w Eh Eh &H 1 w 1 to 1/1 iJ H 1 rj 1 z z z Z 1 z z 1 B 1 B B CO U E 1 It 1 3 a- a- a' 1 9 H «S 1 1 r- ^

Cb Z ) 1 Eu

b bH b. 1 b< 1 b< b4 b< E 1 E E E E 1 E E 1 E 1 E B c

to 1 t/) 1 (/) tn to to I CO 1 1/1 CO CO

118
o

|U o a: W >H H E-i ID h as

£4 <C tM H H B o ^ H B O ^

Eh

O •* >•

as iJ iu CO O OQ cs U O

(J

HO P 8! o o

10

u

as

u

PS 03

t< c X V) woJ M M E H <«

as 1•{ Ow 11 1 1 1 B 1 1 GD 1 11 Eh 11 1 B 1 1 0- 1 1 Eh 1 1 C 1 1 1 1 M 1 I 2 0 1 1 H Eh 1 1 C 1 t i: 1 1 K OJ 1 1 (0 Eh > 1 1 1 K 1 1 as 1 H E 1 « c X 1 E 1 • M in 1 (S CO 1 (0 1 1 tn lu H c E ) 1 as Eh tH 1 10 Eh » 0 1 1 pa >H •c 1 »H M • 1 Eh IC CJ 1 to OQ a Eh 1 1 *< M K < 1 1 K « 1 B a 0 1 1 CM M «J M 1 1 C tH 1 E 1 03 0. 1 1 «« as V OS H 1 1 CO 1 •< 1 EH ( 1 >-> ^ C IB z as 1 1 K 11 H 1 • Ut < ct, !< E 0 t 1 C IH E 0 |H H 1 1 (/} 1 P3 «0 1 b3 as 1 Eh R ES H 03 1 1 »a 0 OT N 0 E K 1 1 H U »i M U to 1 1 en —' tn Eh B 1 • c * * ^ " T to 1 1 B 1 1 E 1 1 C 11 ^ sr ^ a 1 eo 1 >- 1 (J •J 1 J 1 cc u ca oc 0 1 0303 1 1 H

Eh 1 1 E 1 1 . W 11 1 Eh 1 to 1 H 1 M 1 t»! H 1 1 lU E 1 1 H ) E M 1 E Eh 1 H to 1 «c < « 03 B • 03 tS 1 \ 1 \ \ to 0 1 E 1 as as as E B 03 1 M fti E C « 1 1 to 03 i ^ 1 "^E 1 to 1 1 bC 1 0 U 1 M E SB 1 »4 E 1 n H (N M •< ) 03 H 1 0 rr B n E oe >-a 1 1 Oi 00 H (N 00 H 0) 03 1 Oh 0 1 0 E-i 0 {H 0 1 • 0 U B U (J B a 0 1 to 1 »4 > 0 > 0 H Eh 1 01 0 t H (0 03 H CO b: CE 1 0 O4

EH< 03 f aa 1 U E 1 0) 1 M e 1 03 Eh 1 0 1 K H 1 E 03 1 1 NO! 1 W > 1 K B 03 CU 1 •c 1 03 03 1 0 s 0 03 1 OS 1 ! 1 V) tc *t •C £h 1 0 03 ( V \ 03 E t (J EH 1 as E (0 BS E 03 M t 03 »H 03 ID 1 1 03 Eh 1 1 ts to 1 1 H 03 1 1 H 1 H 03 hi 0< 1 as 1 u E 03 1 0 1 0 1 e 1 c v. E • 03 1 as M £ E f-) t 03 m 1 EH H

>• 1 E t n E 1 OS U 0 1 H 1 0 0 H 1 0 1 C M 0 03 Eh Eh 1 E to 1 H 0 Eh 1 M 0 t U <t 0 1 0 t3 ) iJ 0 1 iJ •-3 0 03 J 03 1 U •< i ffi 0 1 1 (Q U H (3 iJ < 1 03 ,J 1 E 1 H 1 E Ou C 1 < 0 1 to 0. 1 u 0 1 0 M 0 0 t-* Eh E 1 1 to fH 1 b< 1 (O fH to aC 1 03 03 1 tn as 1 E 1 10 E to ee E Eh 1 E B t •« M 1 U1 0 0 1 M to t1 EH Eh t E< 0 H 0 1 1 a- 1 M 1 H 1 B E M 1 1 (0 1 1 (0 tH B 1 03 1 9 1 a- 1 a 9 a 1 Eh 1 »~ T— ^ 1 ^ 1 1 0. Oh 0< 1 E 1 E ) E ) B E E ) 1 tn 1 10 1 (0 to to 1

03

Oli >H

Eh

to

to

03 >H V te, O «e

«c et O

EH O. U E

03 03 E EH

O

03

•<

03u e o o

ii^03 03

CO

B E

L> Eh Eh

C3 E E

03

H

O E

Eh

B

r

10 to E H W

1-1 II

M

ts 15 : 03 E

«:

CO e to to HBO u e : O

to 1-3 »3 O ee •« S H H

"^8H EH E E

to 03 03

10B

B

03

O

O

U 03 03 0 to to •a1 Q O

03 03

U

X

x

03 03 03 K C3 O

•H E E O tH H o o 10 to to to

03ou

03

Q 03

03

to to B H E B B EH

(O

t-H Eh Eh Eh t4

03 03 03 03

03 to (O to to

O

L> 03 M i« A •« og to > EH EH Eh Eh B

03 •« aC m: iC E O O O O B B

21I XIwi

Hi

ni

OOOOCCafN»— 00tfC4r-OOOC>

119
.J 1 11 Hi J Ci J p^ I 1 d ! Ikj 1 1 ^ CQ O 1 H 1 P M 1 1 E-H Cr j ^ 1 O ' 1 c I >' 1 CO 1 C- 1 |U 1 t O 1 E~ 1 to 1 C 1 0^ 1 : to 1 1 E" o ! 1 < Eh E 1 E ! p= 1 1 CC 1 O 1 1 C 1 ^ j pJ 1 CC' 1 1 p-l >

St 1 E 1 C

t-A 1 & 1 mc 1 p w:

C 1 1 1 t 9e E p5 1 ^ 1 O v> M 1 1 U 1 l-H (J to 1 *c 1 E- o 1 P3 H 1 1 Cl^ 1 a:

Ci 0- 1 1 tJ o _ 1 . ^ 1 H 1 CO 1 1 M pi S ^ c (J 1 F- E 1 M M

bdm o 1 nC 1 Eh

u E 1 >> 1 P E-* t a

M & i 1 P^ Eh

Pi, p. 1 1 P gc sr. C 1 o t ft: or. 1 H (U cu

CO 1 > 1 E 1 e-^ E- o

EC 1 H p:; 1 asK 1 E » 1 x: 1 H 1 1 (t: P^ 1 W

«C 1 to 1 CD • H

O 1 Z 1 p. 1 CO E 1 CC P3 1 to E ! to 1 a; H 1 o C5 i o c 1 H O 1 d 1 to ^ [

«: 1 j1 E 1 St 1 1 1 1 3- OD ^ 1 <=J 1 3 a OC C 1 ¥A 1 ,j ,j 1 t-i 1 1-^ ij

6-> 1 0^ (J (C 1 D- 1 O 0 u 1 . 1 11 O 11 OS o PS P:i Eh

O 9S 1 o o O 1 o o H

t-?

H 1 O 1 ^ E^

K

U as: >H 1 < o 1 <*c H CQ 1 H ^ H 1 H

M

H

E-< 1 E-i (B (-<

M 1 •<

H 1 M

H 1 ««c c o \ Z H 1 as 1 \ V. C/3

O s 1 z M "^-^ H 1 H H 1 SE 3; D a o ^ 1 .1 &^ f< 1 Vi 9S ^ t CB 1 M iJ O M 1 E-* O o 1 t-3 1^ 1 o P3 Ou E 10 . 1 P^ H a;

CD t-i P4 >" 1 ro & E-« to ^ (E 1 !C fO BE OS I-) M H OQ 1 fM CD H CO lU 1 CP pq 1 00 M 00 H H CC ^ Pu ^ 1 o \ O 1 P P 1 Eh £m Q H 1 CQ O 1 «c 1 U C5 U O < o

<7^ PQ &3 BEl 1 > O Cu

O 05 1 fti P3 1 > o ^ c P4 Eh

C

H 1 M CO ffi

H ^ Cu

M p2 1 CO OS CO flC OS *^ 1 ^ u to I 4 > H 1 P3 1 K (C

CO ft:: I P3 t CO (U

*« t-J P 1 C» 1 t-l E-i 1 OS Eh

>H > O bc 1 <N

m 1 ^ fU 1 « CD K U H 1 V P5 1 \ 0- ft- 1 ^. O «* tM 1 PS U p:: fri ft; U f PS ps a. 1 PS P « CLi SC h4 » 00 t H > (U PC w > 1 U 0^ PS OS 1 pa p U K W X O 03 1 C5 to G W D to i o m p w 1 Eh U Q m ^ ^ E-t U U 1 to to a: e-4 1 1 to E •< H

1-^ t-"

C to fr<H (U 95 to P-1 1 pi z w as IH H 95 1 M O to Ph h H O 1 P3 HI

ft^M 1 E CO PC

H

£3 PS

M

OQ S 1 - 1 EC tc J O ^ 1 U • o • J U PS O 1 E-< j (B E-> O 1 *< H «C kC & 9S I p:: PC CO CO K 03 Oj CO 1 03 OS OS O O CD 1 O *tf M E O **c ^ 1 E E 1 E

to

U • to t-J 1 to fti 1 ^ 1 CO 1 I b£ #< 1 P3 U 1 ft; tJ OS O pa

O ^ 1 O O E^ E"* 1 O O o o O O

u (C 1 E E £^ ^ CO SB U 1 n E-< F< o O E " H 1 u < u 1 H <* O Mi o

PS CB 1 tr to 10 p:; 1 o to to 1 PS PS 1 « OS w o tu 1 o O 1 pJ 1-4 O Cu O E 1 o ^ o 1 W £ o K to 1 Ai PS Q 1 pj P5 O 1 O E*" O E^ 1 P O E^ ^ 35 U 1 CD H CO 1 go ^ b4 IE K CO es O f«l O 1 b3 as PC 1 to ps to P3 1 E K Eh 11 WOO o o > h3 1 o o 1 o o o o O o M V)

iw 1 1 >• 4 * 11 9S 1-3 as 1 1-4 ( P EH 1 Q

H

a

Q 1 to > n 1 > 1 to to 1 H

DH

Q 1-4 » 1 o i K 1 K PS • V) 1 B

CC

H ac 1 r- j 1 f- r» r» o H 1 r- 1 ^ r- U ^ as R 1 (k4 1 b P^ 1 ^ b. M E E S E 1 n 1 E E ) E 1 c

Pd CO to (0 to 1 CO ) CO to ) tn 1 OT 1 w •

120
11 Ct i11• • 1 I ( 1 1 • 1 1 [<] 1 ^. 1 1 M 1 Cj 1 P-< 1 • 1 a I C 1 t H ( 1 O 1 O 1 H t 1 U 1 1 >- 1 p 1 1 1 03 1 1 >' 1 t O 1 1 1 1 C' t 1 >• 1 1 CO • C 1 c b, 1 ' 1 C' 1 1 CO • 1 ' 03 1 ( OS 1 1 V> 1 1 K 1 Eh i ^ 1 1 tc 1 ' 1 E 1 E 1 or- 03 1 1 D 1 c 0^ 1 1 a: 1 t O 1 b< (Ti 1 1 1 1 Eu d 1 1 1-3 • • ' t 1 i 1 O ' o 2 1 1 M • 1 P^ 1 1 1 OS • 1 be: K H 1 ( K 1 tj (J \ 1 CO 1 *c

t- • 1 O OS < 1 0^ K 1 t E 1 • * Q 10 1 1 t3 1 (U 0^ H 1 iJ 1 E U 1 1 o 1 1 mC H

or. (J 1 E 1 1 > 1 1 Ci

*r: S 1 1 1 H

0^J 1 E 1 ^ 1 c 1 >- O 1 «: 1 o 1 << OS

<fl S: > 1 C 1 tE 1 ^ E-" H «- 1 CO 1 OU t CO 1 tz> t^ 1 2 1 1 w 1 o 1 ^

lU tn 1 1 Q e- OS 1 BQ » 1 E 1 Ci 1 PC H 1 C 1 w 1 t> 1 I-) 1 o o

b- 1 ri 1 5- 1 K • 1 c *^

f-- 1 ; 1 «*C a 1 1 A I (s: VP 1 1 ^ 1 ^ 1 ^ O »-3 1 1 l-J 1 1-3 »J U 1 u 1 cc • 1 u • 1 Orf ••

CQ • •• 1 o • 1 o C • 1 OS o OS • • 1 0^ O^ O SB C C> 1 o 1 • t o O

IP iJ *H E-i

O 1 i-i 1 1 H

ISw «< >- «tC 1 < 1 1 1 1 *< *x.

H tH CDH » 1 H 1 • 1 H

M

E- I E-i 1 1 1 E-" E-< ^ • H M bJ H 1 ^ 1 ^ 1 H N a: H 1 1 \ 1 \ 1 BS

as

M ^ H as 1 SE 1 fis • H

O ^ E 1 • ^ E-i Q 1 • V) M 1 OS • • 1 O H E-< O • H J >-5 E CO o 1 o t o 1 W * >^ M H CO o 1 o t o 1 P'j OS D E-" H W CQ CD H BS CO W rn 1 1 ^ f P3 03 O «£ s. O o 1 o 1 o 1 D H 1-3 1 m o cs 1 o 1 o 1 • SB > o CU O OS cs 1 If 1 o 1 W 03 O M |U M W 05 M rj Bu M 1 kH 1 f-4 1 o:: 03 • o to * OS • 1 03 P3 > w pa 1 M 1 03

CO PS •-9

O E- o 1 o 1 o O ^ M m i ro 1 I1 £03 03 It O V OS 1 1 1 V OS V. 05 (H O « SB OS Bu OS u 1 ft^ U 1 u 1 OS Q4 03 CU

>* 2 1.^

H CO It] OSu > 1 ^ 1 H > 1 03

a 03 03

flD as •«

O (n CR

uO pi]

D 10 t D CO 1 tD t/) 1 O 03

Q 03

m tc

uu CU 1 tn •e Eh CO 1 V) t CO 1 <« t» 1 •« E- £h 1-1 H 1 m K CO b< 1 to Pu 1 to EtH 1 03 ^ 03 as

t-3 E-i tS as (0 OSH

H

O 1 MO 1 HO 1 OS

H OS

M

M

H as 1 1 c can

PC 9 i-J • • • U O H • 1 u • 1 O °3 O E E 1 E 3C 1 K E 1 05 EH O aC << E' 1 •< P 1 «4 «: E-i 1 C3 P! kI e- CO o: as OS CO 1 K *4 (0 i 9s pc: to 1 OS OS oca >• 1 u E W < H 1 K O H 1 pQ «m: H 1 E B • V] tJ u 1 OS Ou 1-^ 1 OS > 1 OS CM »-4 1 TJ 1 1 t • • 1 bitf he i< OS L) 1 • 1 CC fj 1 OS U 1 O O 1 < 1 o o 1 o o

B3 1 E-< 1-4

B ^ t E-i 1 E-1 * o 1 « U Q E as 1 E ac 1 C BS 1 < o 1 « y

PS 09 OS 03 (9 1-3

M 1 O 1^ fU 1 Ci)M ) 0: 1 OS

H

DMO 1 u i«

O

O E 1 O

O El 1 o o c 1 0^

O 03

Q

eo (H

O 1 o< c • B )-3 (-> OS OS 03 1 oi t oa OS

M ) o 1 CU

C 4 W O t-i 1 tS H Cu (H Eh 1 CU H Cm 1 CU H Eh 1 O E-i O EH K 1 1-3 m P3 E ^ ^ 1 CQ SB •>! 1 IC SC M I M 03 1 o <« O (U o E-i 1 W O &-I 1 w o 1 CO OS CO OS o o 1 > >-3 3 M O CO 1 HI U 10 1 H L) to 1 o o o o w

Cu 1 1 1 1 M 1 1-3 CO 1 t-a 1 CO 1 o Eh 1 ^ 1 Q o 1 Q 1 h 1 K 1 o 1 03 OS OS M C • <e I 00 00 00 1 00 1 00 1 oo oo o H i »~ ^ 1 t~ 1 ^ u h as 1 ^ 1 Cu 1 1 fri 1 Pri Ph 1 E i E E B 1 E 1 E 1 B E 1 W 1 tn CO CO 1 (0 1 10 1 CO CO

121
1 c 1 ^ 11 p- 1 CT 1 £~ 1 ^ 1 Q 1 o t E~ 1 ^ 11S C 1 c C \ O 1 tr. H { j ^

fl! 1 a 1 o ^ 1 j tj 1 1 1 M 1 ft

Cu. 1 c ^ H 1 M 1 c-< 1 1 fil Ct 1 1 : lu 1 ^ C 1 C' 1 e; 1 2 H 1 Cl~ 1 Eiq

I/) ( e: 1 s 1 Ki 1 bJ

fri 1 w 1 0:i

C 1 1 W 1 !^ j ^ ! 1 <^ 1 E 1 1 00 O 1 1 2 1 tA ^ 1 1 u

O 11 1 E- 1 M 1 X P»J

U >-4 1 1 &= H £-« (Ij 1 I H Elk 2: 1 H ! £^ 1 1 <; 1 MJ D 0^ 1 1 >^ 1 (0 c 1 ^ 1 C 0:^

C3 1 K 1 1 to"

t<3 1 ( a M 1 1 t •a: M MC >4 1 rr ^, H M OQ ( CO M 1 or M ' ^ H 1 1 t"" \ d H 1 r 1 U & 1 «; c 2 1 1 ^ o 1 (U E-^ H 1 m fit 1 to t 03 ^ 1 " o-W »4 O 1 OS 1 o » ru 1 m t M P5 U t-* 1 1-3 1 V03 e O «c 1 1 Oh Om 1 W o: O OQ 1 1 O M O XJ 1 "J 1 ««e E-< ? rn 1 b3 SB 1 0^ H

1-4 1 O ^ 1 U 0^ D 1 CCi o 1 C 5= iJ 1 O O CO 1 W U 1 —

H o I o o •< CU 1 CH k4 EH

05 o 1 «:

U < ca 03 PS 1 »^ 03 M C3 1 U G H O 1 (U o b< to 1 Q O P"* (U 1 to

55 o o M to

O 1 N 1 O { O 1 M 1 E 1 H 1 ^ P4 1 CO 1 EH 1 S • M C 1 00 1 00 OC 1 M i< 1 1 ^ 1 1 1 )t< 1 C f C 1 K3 1 to 1 to 1 (/) 1

122
11111 w 11 1 f I 1 1 1 1 1 tj E 1 { 1 c C5 1 1 1 §- Cu h3 ^ 1 f. > 0 tr 0 1 1 e E- > 1 1 D (I >- 1 1 tr tr Z (k- to 1 1 c 1 1 w 0 Eh V 1 i E 9. 0- to mr. 1 ft' 1 i t<: z ft 1 c 1 to 1 (C u 0 E-' t t Eh 1 E E 1 pi 1 Z 1 U OS fc W 1 a- 1 ftJ t V. itt c e E- Z E- 1 p EH 1 cr. - CU w •£ t to 1 z 1 t/i « to w ft £- Z 1 «c 1 W >J fc- z >« 03 1 ft' 1 0 1 OS to w £ H lo: |u ft' 1 E ^ ft 1 c E 03 Eh 1 0 1 ftl M 1 0 H to 0 1 t C Eh 1 •t C f>- U 03 (>' •< 1 E-i C

Eh I 0: (U E- 1 > U 1 E-i Sh (l. C C «c c. 1 to 0 d ) H •t C z u ft: 1 - K •J 1 E c t-l 0 to 1 CC 3: J H 1 e K t- (W lj IJ 1 U Eh «c 1 C Z be ij z 1 to z e 1 0 U M 0 <« 1 0 ft. e 1 c •c z 1 C u 1 t" P. C 1 ft4 ft,- 1 C «: c c 1 C fcl 0 m 1 5-- c 1 K 1 M E 0: 10 03 1 03 H 03 • w 1 (U K ft-~ 1 ftl to b; 1 6: p (E e 1 CC er 0 1 i< > E E- to E 03 E 1 E Ul E B 1 CC la t •s & rt » 1 S EC f e 1 {J 0 z c & Ci Z iJ Z 1 Z z o e 1 1 O E 1 1 u u 1 1 15 W e- 1 1 l-l •< 1 1 E 1 1 ta 111 K 1 <N ^ fvj CN a (N 1 (N <M C 1 •J J iJ iJ kJ 1 iJ J

t= in It, 1 n

m CC p.m ea EC 1 CC CC

a -e 1 1 C c 1 1 E—« 1 1 o 1 1 K 0 1 1 (E OS fci 1 1 H O 0 B 1 1 J H 1 i Si t. PJ «S >- 1 1 o e H E-l <tJ I E E E 1 E

e;

M Cti Z 1 \r. to to 1 to E H 1 «c a ft 1 Q < 1 V \ •t \ V lo: 1 <C \ H K C 1 e 0 z z 0 1 ft z

Ut' 1 1 < \O4 IXi 1 1 OT C C 1 1 J S-i N I 1 M 1 1 H 0 1 1 00 E-< 1-3 1 w M 1 ft' W << !m I 00 a (D Z z CO Z 1 00 z

as

H

M in 1 1^

H

H 00

M tM IH

H 1 HH 0 H \^ 6- 1 E-I Q EH E- ft 1 ft Eh > H 1 U =- u c to U t= u 0 m to 1 to U » K 1 t» 0 t. 0 tt > 0 > 0 0C 1 << > c • • a M 1 t/1 o: m a a to e to 03 0 0 1 ft to CC

>- VO 1 1 1 1 BJ s; I. 1 1 K EC 1 e-1 E- 0 ><: t iJ f-< 0 03 CJ E-i 1 j H H » e 0 «s s« t as as = B= W B 1-3 lU CO 1 lu M H H H 1 H E

CQ tK >-) 0 CDB 1 15

U 0 ft 1 ft to

UU 1 tn

W to b. to to 1 to c 1 >- KS 1 V c «£ 1 *^ 11 10 Q z e D C) 1 ft 1 0 1 ITi a 1 a ir • •J 1 t E- S" U K U 1 1 < E pi H C 1 E 03 w E tn E tCI 1 E Bj E m C E: J 1 ec E- 1 z K U 03 U 1 (B U 03 0 com 1 (J u 0 to > 0 0 to c to 1 0 to c to

(0

U 1 Pk

Q 0 z fc. 0 ft^ ft 1 bH ft ft- ft 1 1 • 1 1 0 1 1 1 n 1 >J 1 tc 0 c 1 n 1 • •C K 1 (d M EH h3 1 n 1 as 0 1 E E "t U 1 N 1 K K 1 C E OS 1 K 03 1 W C5 1 E < E <t u 0 1 0 < 1 H 0 1 H p:; (u (i: 1 P- 0 1 » 1 M tn 1 H U> H C5 U 0 EH 1 s 0 U u 1 U u M 1 in 0 to 0 0 1 03 0 0 1 0 0 1 >- » 6" (C E- to 03 1 n «s hi EH 1 EH EH 1 tn cb t> 0 0 a: > s> 1 > >

0< 1 1 e- 1 > K M C5 X Eh 1 to pq 0 1 to E- z 1 ft 0 1-3 H 1 Q 1 H 1-3 Z 1 z z

03H & 1 01 Ol <^ 0\ ON <r 1 (y H •« 1 1— b Z 1 Cu (L, tt. Cl, 1 ft. Pu E 1 E E E E E E 1 E E

as

Mr in to to to to to 1 to to

123
1] 1[ C 1 t1 11 1 1 It 1 1 1 1 1 • 1 1 1 t ^ 1 • 1 1 1 C 1 1 1 1 < OC 1 1 1 1 1 V, 1 • 1 1 1 CC t e-< • 1 1 1 &: 1 1 1 1 1 C 1 a 1 I • 1 1 :z 1 E-i 1 1 1 H 1 C 1 • • 1 1 >J 1 o • 1 1 t 1 1 1 O 1 o t 1 10 1 1 E- 1 1 ^ t 1 1 c 1 • /-^ 1 C 1 1 E-* 1 E- 1 li; 1 • 1 1 1 •t K 1 > 1 c_> tE 1 1 U E 1 c • 1 ^ 1 1 O C 1 s: 1 o C 1 1 Z (J 1 1 1 9£ 1 e 1 o J C 1 tr. • 1 H H 1 c 1 t- « > 1 w • • 1 6- se: 1 IB OQ • 1 ?

E-^ I 1 xar

C

W 1 1 1 c

•X 1 O IE 1 o 1 1 H

0^ 1 O 1 K ft< e- 1 K 1 1 6- 1 M 1 U' O 1 o 1 *^ H 1 1^ 1 M s: 1 {J >J 1 f ^ t M 1 E- •e 1 in 1 M

or. 11 1 7 1^' 1 CK

H 1 W 1 K 1 CQ (n 1 ps 1 1 *^

U 1 1 c z: k: 1 P:: 1 Ch 1 t- D U 1 H to 1 O 1 K

tr. t 2 « 1 1 Ci 1 C 1 r K at 1 «c 1 c t fit 1 iJ e- 1 ST 1 e- a: IK » u 1 o a 1 1 v\ t-i O E J » c 1 o 1 1 >- O K H o 1 \r* 1 E-* 11 o 11 Eh « e-i 1 > 1 1 > 1 ! ; ! < 1 r- 1 c

CC 1 1 ^ vc 1 ir 1 C 1 >J 1 t-3 J 1 (-H 1 tL> 111 o 1 O 11 C o 1 1 CO ( 11 C 1 111 I11 111 CC 1 c ;c 1 1 ^ tH 1 W «C 1 H £h OC 1 M H 1 M 1 c

b- ^ 1 1 O 1 O 1 H 1 to t «c to 1 to 1 o

•a: 1 «c 1 \ \ \ •a: 1 1. 1 <

r: tt o 1 2 1 z cn 1 c:j 1 1 o 1 1 O 1 1* 1• 11 &3 1 1 1 N 1 O H 1 *~i 1 1 W U j 1

f») *< >« 1 1 CD ^!^

n z M M CO 1 l-l 1 CC M r- M 00 M

M 1 H 1 l-l

fr- E-- 1 a 1 f- 1 E-<

O 1 O 1 a

M 1 w 1 u c 1 UD

UD to 1 [0 1 to

K 1 k: 1 > o 1 > C > O aC 1 <: 1 H 11 o 1 t/> c 1 1 tn K CO CC O 1 o 1 1 o 1 11 »-i a 1 111 B 11 11 o ^ (W 1 1 U I 1 OS U 1 1 >J

6h o -I >- 1 1 (S

D I 1 K cc 1 t-H 1 W Q 1 c H 1 M 1 H O cc cr; t Ci 1 E- U 1 in Q 1 O 1 Q U U 1 1/1 1 I/; X 1 o to 1 1 (O 1 «: 1 « o 1 aC \ « 1 «c 1 xc 11 c. 1 n xn \ 1 O z 1 O 1 1 Cl 1 * * ~ 1 IT T - 1 a- J 1 » O bii 1 1 1 {H 1 E-i U 06 (J 1 1 1 •< = (J 1 S 1 •«

a: fH

O 1 » (a 1 •< 1 s CO » w 1 SD

W 1 c CO

E5 S! (J 1 iJ CO 1 u 1 K

U < ») CO 1 CD 1 B

U

O

O CC 1 c «< ( ^ 1 o O rt 1 o <: 1 O to

W

U 11 > >J 1 I/l 1 1 Cl. o z > >J \ > t-? 1 1 b

n 1 1 1 1 1 1 ic 1 05 U 1^ 1 ^ 1 iJ 1 u 1 O O u 1 u 1 rt tn 1 t Eh J 1 ES U 1 1 «s U a; J K 1 1 f-i ' ^ a D 1 1 b K O

tO 1 •J 1 M 1 O j M 1 (U 1 O 1 (J O ^1 w 0 u 1 u M 1 cu 1 1^ 1 o CQ 1 CO t o t 1 e; ( E-i to K •< 1 t E- 1 J t (/) 1 1 > o o »-3 1 ij 1 1 t> 1 t ' ^ 1 o t-J t1 o 11 w Q I H 1 H 1 O 1 1 Eh •J M 1 O 1 V) 1 10 > 1 > 1 >

CU s: 1 1 O' 1 CT> 1 1 o\ H «« 1 b Z 1 1 (>4 t H- 1 1 Ct. 1 E 1 c E 1 c 1 E 1 W 1 in 1 to W 1 w 1 CO

124
11 B 1 ^ b 1 b

•J b- 1 (S 1 •£ b- C 0 1 H O O 1 or o >- tt o t-- 1 > > c a 1 ^ E- 1 c 1 c C 1 o • » 1 E-: t: t* «c ^ 1 H E r 1 bi o c^ B C3 1 o iJ c b' 1 b. f b. >

S-. 1 S: 0

b.O E O 1 E- b; Z E >-J be: 0 to H 1 t H Z b^ (J >- z o O (-1 H Eh ts c

E-i 1 O E- b.

B hH o C z u 0 Ea 1 •« bT B «e: O c E bl b. c t^ H 1 E-< w tJ <e E- E M t-f tJ Z o.' H Eh b3 b- 1 b-' O •S 1 D Eh Z B H C •£ B b! Eh O t bi clj b- >H !>H z Z

E- o E Cr. ft.

h

B bl V> 1 •s 2 E E E- E- tr C B «£ z Z E » H

b: 1 tow

B bl

w

K

M CD EwB

Ci 1 CC Eh E C CC Oi to E bl 1 o << c B c c >- H to 11 »^ O Z CL to E- 11 Eh I «S 1 E 1 O K t a- oc (N a CC C 1 u >-) 1-3 •-) (-1 t-i ^ 1 o ex. O 0- t,' o. pa (J o: U

KM 1 ft. 1 (r. 1 h • O 1 K 1 C3

B

B

B

B

B EM IT o e 1 O E ° Eh O c 0 M H 1 Eh E to E- Eh X bJ W «S > 1 Eh to « Eh to Eh to < rt W Z

hi

H Eh

m 1 toM toM to

U »-

H

H P CI 2 1 (J EH \J U Eh Eh ft Eh O •« ,M 1 CQ O V-i o: c 03 O bl C O EM m: I O 0:. z C B O B z Z 1 \ \ to 0 C 1-3 C 1 M r: a M Z z & B

Eh

a. t 1 C C 1 tH • H 1 «C (d M 1 O: 03

B ft bc

H E a

M 1 Eh

O EO Eh

O EHO z

Eh •< CQ I-) 1^ 1 E to ftj E to E to E to

W bl >e

l-J 10

K 1 Eh to r~, S! fH to Eh to Eh to

BB

m z no Z B iJ Z M H H OQ 1 to W 00 H to b? to bJ to W Kl 1 oc M OC' H W CD M K Eh I U E-' u U U O n 1 Eh Eh 0 • • as IH 1 m c U D « C CQ O CQ O •s «s 1 0 r3 U C •* c

!h > 2 1 O 03 > o O 03

O

B

O

B

w

w 1 0 > 0 o: Eh CQ H 1 1-3 to |£ r} a CU B B 1 to B to B B

PQ 2 .. 1 03 03

B

BB

B

B

Eh Eh t- 1 bi bJ bl b"!K

iJ Eh

U

Q 1 Eh tH Eh Eh £h EHB Eh

H

H Z O x: bJ 1 b5 b:W bJ 1 U

w

B e UB (J E-< 1 \ 03

V PC \ B \ BV

B \B 1 X

B

(C EE Eh

O *C 1 03 0>4B

B

BBB CI4

B CL

BpB

B 2 tJ U CC 1 b] 03 u ce b: B bl B U B W B 1 w 0 W B OOP: 1 O bJ p bi C M O W 0 bl ea K 1 Eh b3 0 bl U V 1 «e Eh a «« Eh I EH «: Eh << Eh •S EH 1 to tr •a. •S Eh

b^ ssHW Z B> z W Z bl Z t t U \ bl Z 11 PC K 03 M 1 B t- O' H B M B >-4 1 E to z B H * 1 •4 1 Eh

C3

H

O 1 H L) 03 U t i<

Eh

B Eh

O 1 •a < C Z I-) 1 CC Eh B Eh Eh B B 1 U «c

B

H

C

O cc 1 o > C 1 tJ

U E E 1 E s E

Eh 10

U 1 1-3 (J r> >c "-3 <-3 to z r-l

H

SiH t be »^ Z 1 p:. U B U B t-> B U

CO ij 1 O

O 0 C c 0 0 c H o < (i] 1 Eh >-] Eh iJ Eh >-] E-4 1-3 E- 1^ U I o •< U o o •I (J «c 0 Eh «e u «£ CI

0= 03 t 03 CC

B 1 BBB

B 1-3B k-3

B

KO 1 «C blO < M 0 M 0 Bw 0 •-1 >c o Eh O I u di o O o B C a. 0 1 lU B 0 1 t 0

(N *< to 1 O Eh 0 Eh 0 fH 1 c 0 fH fH Z H 1 ax HI 1 CQ m B 1 to »« 1 O to B o 1 C o to B to B 1 E to B Z Eh ( 1 >-3 O O »n 1 1^ >~> 0 0 0 0 1 to 0 0 M to I1 EH 1 Eh b4 z 1 b< E Eh Q b3 Q a ) U Eh n 1 •« O to to 1 IH E 1 M o 1-4 bi 1 < O >^ 1 Z tu B B 1 to Eh C3 OS H E 1 O O o 1 o O 0 0 1 O H •« 1 (N fN <N 1 fSI tN fN tV! 1 IN (N 1 (N O h 2 1 b- b. 1 b. bn b^ 1 B bl b. « E ic E 1 E E E E 1 E E E

Da to to to 1 to to to to 1 to to 1 to

125
1111111 111111 1111111 11 1 1 1 1 I 1 1 1 1 1 1 1111111 1111111 11111

|.1 1 1 1 1 1 O 1 1 9 t 1 1 1 1 I o • 1 1 1 1 1 1 1 1 o 1 1 1 1 1 1 1 1 X 1 1 1 1 1 1 1 1 I >- 1 1 1 1 1 1 1 1 1 O 1 1 1 I in 1 1 1 1 o 1 1 in 1 B 1 f 1 1 O 1 1 • « 1 O 1 1 1 1 Z U 1 1 1 o 1 B 1 1 1 1 cr «e J 1 1 1 B 1 B 1 1 1 CO 1 E 1 1 B 1 H 1 1 1 1 M « 1 a 1 1 1 K 1 1 1 1 tn 1 in E^ o 1 O 1 1 1 1 |U 1 1 V) 1 z 1 aC IH 1 b 1 1 t O 1 EH

K 1 1 <n t c ) ij 1 1 1 «: 1 M 1 tu 1 M 1 !• in CL. 1 J 1 in 1 w 1 B O 1 1 K 1 tH 1 o z a 1 •« t be 1 B 1 tB 1 o ) U 1 Z A << 1 E tn I o 1 1 »H 1 1 c 1 1 •a B 1 M a 1 o 1 Eh 1 Eu 1 1 1 EE-lb O 1 >c 1 tA 1 Z 1 z

E-i 1 1 1 B 1 E M 1 Ku • CO 1 tti 1 ft: 1 E- 1 u 1 C > 1 O 1 1 1 Z 1 z

0. 1 t l-> 1 z 1 O >- Z 1 K 1 H 1 « 1 « 1 z 1 1 E-> C i cn 1 in 1 E 1 E H 1 1 » 1 Cq 1 M )-> 1 «r t t-i 1 B • B 1 iJ 1 lU B (n k: B 1 O 1 H 1 M

or 1 1 c 1 U 1 inB 1 U 1 U 1 z • a 1 Ci' b] 1 s 1 1 P4 m 1 aC 1 1 1 O 1 1<I 1 1 1 W 6» 0^ 1 »H 1 t^ 1 ft4 M 1 o 1 o • z O 1 O t o 1 c

tn t 1 (J 1 C >-O 1 z 1 M 1 B 1 E E- U H

B 1 B 1 B 1 B

K 1 • 2 1 U 1 M 1 M 1 1 » 1 H u 1 2 1 CD 1 K! cn «c U CD 1 ec 1 CD 1 n O 1 o 1 •« 1 E 1 CL z ^< 1 El E 1 E 1 E 1 E

I-] 1 CC 1 C 1 «!M as «< 1 s I B 1 B 11 CG 1 O 1 Z 1 1 E- O C (2 z 1 z 1 1 Z 1 1 Z 1 11 E- 1 111 111 111 1t1 111 111 1 t 1 1 1 1 1 E 1 K 1 fN 1 cs 1 (N 1 9 1 r- 1 ^ 1 »— o C 1 iJ 1 tJ 1 tJ 1 •J 1 iJ 1 iJ 1 ^ o 1 ec 1 (C 1 CC 1 CO 0. CO 1 OC 1 OQ 1 CD o 1 1 1 1 1 1 o 1 1 1 1 1 1 1 C9•H 1 1 1 1 1 1 11 na 1 O 1 11 11 11 11 11 1 J U 1 1 1 1 1 1 1 B (a X 1 1 1 1 • 1 C f) M 1 1 &• 1 1 1 1 1 o lU •< >' 1 1 M 1 1 1 1 1 M E-< n 1 ) 1 1 1 1 1 h K 1 X. 1 s 1 1 1 1 1 M 1 1 1 w 1 < •< in 1 cn 1 CO 1 in

•S 1 a. 1 a 1 c 1 \ o 1 o 1 o 1 c » C 1 o t H ) H 1 z z »H 1 i-t 1 tH 1 H H 1 1 1 1 1 t<B 1 1 1 1 1 1 1 O a 1 1 1 1 1 1 1 K M 1 1 1 1 t 1 1 to 1 1 1 1 1 1 O M 1 1 «e

•4 1-} 1 E E 1 1 & 1 ^ lU Cu 1 o< 1 1 «; « >-i 1 1 )-• 1 M 1 o pn z H 1 H • H 1 M

|4

H t-l (Q 1 >^ a. 1 z 1 Z 1 o oc

H Z 1 Z • Z 1 Z

V) E-i I CDU 1 v 1 \ 1 o E-i \ 1 s. 1 V 1 N, 4 H 1 o o 1 fi I |J 1 u o o J 1 (J 1 i-i ) i-J O 2 1 or cc 1 a 1 a 1 « > o a 1 e< 1 0' 1 Ou > M 1 O. Oi 1 H 1 M 1 H cn B 1 H 1 M • M • n 1 1 1 1 1 1 1 C< E 1 1 1 1 1 1 1 •< •-I Q 1 1 1 1 1 1 1 U (T, C U 1 1 1 1 1 1 1 > (c U H 1 E E 1 1 1 1 1 1 {1 O «e >• 1 u m: 1 z 1 z 1 z 1 B 1 z • Z • • oc K lU O) 1 •J e 1 K 1 1 1 C4 1 iu 1 H

K< aO cc ce CO t; 1 U 1 u 1 z w • (9 1 ts ) C£

.1 CD

U

U 1 OC 1 (A 1 tn 1 Ka tn 1 cn 1 cn 1 cn

><

BK 1 >-i 1 >- 1 Ou

M >< • >• 1 X 1 >< cQ as t> 1 1 to 1 tn 1 O Z cn 1 cn 1 cn 1 tn w s 1 H H e-< J H U 1 1 z 1 z 1 z 1 z 1 z M M 3S ^ 1 1 c ! o 1 o • O I o C CK w to O tti t j 1 M M 1 H 1 H 1 M

(Q S >-)

U

B

u 1 1 1 CC tn 1 n in 1 n in 1 CO cn • m cn

OS

H

O 1 1 1 (J z 1 U z 1 U SB 1 (J z 1 u z 2 iJ 1 D 1 CD 1 S (U 1 III Eh a s M 1 B W 1 B u o o c 1 u 1 u 1 E-i 1 K) 9h 1 E- 1 H 1 V> U 1 Q 1 D 1 x 1 o M 1 X 1 X % X 1 CO 1 u 1 tn • tn 1 1 1 E-< . 1 1 1 E Z •-) 1 1 1 z B U I 1 1 ij 1 U U K 1 o: 1 1 B U c o 1 1 1 «C P) ) a< E CQ 1 u 1 1 O E Eh (J 1 1 1 K sc. U 1 1 E 1 1 W << O 1 I 1 B K 1 E H 1-4 1 E 1 1 £ E E-< B 1 ! 1 U s 1 1 E < 1 1 U <C ac Ck4 Q 1 ; 1 »— E-- O 1 •J H in 1 U (E 1 1 iJ B E^ O: O 1 1 (N X cn 1 O U) Q 1 H U 1 1 CD u CO O Eh 1 1 (d 1 o » tn o 1 « 1 O O < 1 t • 1 << 1 <K O K 1 >< a 1 \ 1 B B B to B 1 \ 1 s. 1 V a« 1 Cu o o 1 cn Cu 1 z 1 Ou O O O z 1 z 1 z 1 z M 1 a.X ) 1 1 1 1 f 1 t< tn 1 z 1 Z M 15 O 1 1 < 1 ij 1 (U B 1 O) 1 B 1 CC o iJ U I CD 1 CJ 1 o 1 a D lU 1 z t c< 1 0. « M C 1 ^ T— o M t 1 CN 1 (N 1 CN 1 (N CN <N 1 fN 1 CM 1 (N u »u Z 1 tt. 1 b 1 b 1 (L, h b. • tu 1 b< 1 Pu E 1 E 1 E 1 E E E • E 1 E 1 E

OB U5 1 in 1 in 1 cn CO to • tn 1 cn • cn

126
1 01 1 1 [ [ 1 & 1 • 1 1 &- ) t &- 1 • 1 tT' 1 1 CC 1 • * • * ' 1 1 * • 1 S 1 1 * 1 O- 1 1 * 1 f" 1 I 1 Z> 1 1 Wl • 1 C ( to 1 0:^ • 0^ 1 C * * 1 O 1 1 ft' I J* 1 wW • 1 * ^? 1 cl 1 I j 1

ft- * w 1 to

ij

It' 1 ^ ! &T I I *'? 1 C^

r- 1 Jr' o 1 r^ * ^ ! 1 e-' I ^ 1 ffi *^ 1 tj 1 E * 1 &

&t 1 c- 1 D 1 1 ! m 1 Q W 1 1 U ' *- ^ 1 M 1 CO I 1 ^

on 1 to 1 K 1 * eH * • M * 1 frJ 1 (C \J 1 5^ * 1 W t C 1 to wJ 1 1 K 1 1 >• 1 Cft 1 1 ^ 1 1 Ui 1 1 frJ 1 a t c 1 c O 1 VI 1 1 K 1 1 C 1 CC 1 1-3 1 M 1 • o 1 o 1 O ^ 1 ^ 1 ! ^ • I ^ 1 ^ 1 1 ] jI 1 [

«< 1 ; 1 ! 1 E 11 1 ^ 1 1 ^ 1 ^ 1 \c C 1 M M 1 M 1 M 1 *-3 t M

b. 1 o CD 1 tC 1 • ' 1 oa j 1 CC • 1 U J

O f * — 4' •j J 1 ' ! M I ' j J 1 PS c O 7 i • • 1 o o 1 o*

<< 1 • 1 H 1 0C Ct

H ^ PQ 1 j 1 1 z 1 H 3K

PS 1 1 \ 1 E- M 1 •EC to 1 < i to 1 to 1 M 1 M

W

v.. c i \ o 1 C' 1 ft*

C 1 M 1 Z 1 I ^ • ! *^ 1 u

w 1J

C 1 * ^ •J * *

lU 1 J ' MM 1 w CL 1 W CU 1 1 < tM 1 M 1 m z M 1 M 1 M 1 M

tHH CC 1 CCH 1 <r

M B: 1 z 1 Z t Z

t" 1 Ch \ 1 \ 1 \ 1 \ 1 "v. M 1 o => M 1 U = 1 M t M 1 M 1 M 2 1 > o & 1 > o CM 1 CL 1 1 Oi M 1 to 05 w 1 to CC M 1 M t H 1 M • j •[ IJJ £*^ ?! ^ 1 J ] \J r~ 1 M ^ O -c >- 1 1 1 Z 1 Z 1 Z M CO 1 w o u O ffi OS 1 ti pa 1 t2 1 fS) 1 U 1 o

L)O 1 1 ^ ! «^ 1 \ 1 >* • to 1 K to t to 1 to 1 to J • * *J 1 c 1 o * [ m3 O 9C 1 U fis U f 1 CQ to CC to 1 CQ to J « t- O 1 1 o z 1 U z » 1 Z M 1 1 c ^ 1 ID K 1 c w t CO t CQ O C ff; 1 1 t \ 1 E^ 1 U 1 U

in ' Sit ' fij ^ ! ^ 1 W M * 1 03 L>

M 1 1 O

O 1 03 < ^ 1 1 f-* M 1 w 2 C 1 1 *I U 1 C 1 03 OS 1 M 1 ^ n C3 1 1 N O I 1 z << 1 H

Eh

O I W 1 Oi

O 1 fr^ ft 1 e;

M

X to 1 O 1 O

H 1 fH o 1 o w

M 1 1 < «c 1 ft 1 (o o 1 (-3 CO 1 \ 1 to 0^ V. 1 Jn £ 1 o ^

to 1 Z 1 o o z ^ ~ 1 o I tn 1 J 1 OS 1 tv 1 \J • o M W 1 to 1 CO 1 t-* 1 H 1 D 1 > H C 1 ir- 1 ^ 1 ^ H «e 1 rsi 1 CM I <N (N 1 CM 1 rj 1 rM

Cu 1 tM 1 fr' t ^ 1 1 1 b 1 1 s 1 x: 1 c 1 C 1 C 1 c

to 1 to • to 1 to 1 to 1 to 1 to

127
Notes on the Table of Symbolic Names in SMF

(a) Most of the data elements supplied by SMF are precisely

defined by the table in Appendix D. Some, however, require more

discussion.

In the Type 4 record, the SMF4PRTY field gives the

dispatching priority of the job step TCB at the time the step is

terminated. This is an unsigned, 8-bit binary number in the

range 0 to 255. It is not necessarily the same as the limit

priority, though it will never exceed this value. The limit

priority specified by the DPRTY parameter on the EXEC statement

is not available from the basic SMF records.

(b) The step number, SMF4STN, refers to the ordinal position

of the step currently being terminated within the sequence of

steps constituting the job. It includes steps cancelled during

allocation, steps bypassed because of condition codes and steps

not executed because a previous step terminated abnormally. Such

steps are tallied as they are processed in "flush mode" by the

I n i t i ator/ Te rmi nator ; they are characterized by having zero CPU

time. It should be noted, however, that if a job is restarted at

a step other than the first, by using the "RESTART=" parameter on the JOB statement, the numbering of steps begins at the one where

restart occurs, not at the first EXEC statement physically

present in the JCL for the job.

(c) The amount of main storage allocated (SMF4RSH0) is a two- byte binary number giving the size in kilobytes of that

portion of the region contained in high-speed memory. It is

immediately followed in the record by another two-byte field

giving the size in kilobytes of that portion of the region

contained in LCS (bulk core, or hierarchy- 1, storage). These

values will be those specified in the REGION parameter on the

EXEC or JOB card, unless they are less than the MINPART parameter

supplied by the system programmer; in that case, the MINPART

val ues are used

.

(d) Similarly, the four-byte field SMF4H0ST, which gives the

number of kilobytes of high-speed memory actually used, is

followed immediately by another four-byte field giving the number

of kilobytes of LCS actually used. Neither of the hierarchy-1

fields has a symbolic name supplied by the IFASMFR

mac ro instruct ion.

(e) The precise meaning of the SMF4H0ST field (and its

hierarchy-1 counterpart) is best explained in terms of its

derivation. Main storage within a region is allocated both from

the bottom up and the top down, depending on the type of request.

The Main Storage Supervisor maintains, in the Timing Control

Table, a low-water mark for the low end of the region (the

highest address currently allocated there) and a similar

high-water mark for the high end of the region. It also

maintains the minimum difference between the high- and low-water

marks. The value of SMF4H0ST is the difference between the

128
region size and this minimum unused storage amount at the end of

the job step. The entries in the TCT are updated only when a 2K

block of main storage is allocated or freed, so the SMF4H0ST

value has an inherent imprecision of two kilobytes. Where the

value of SMF4H0ST is lower than the region size, the job step

could generally have run successfully in the SMF4H0ST figure,

allowing about 10% more space for environmental variability.

There are, however, programs such as Sort/Merge and some

compilers that use GETMAIN to measure the region size and

consequently are recorded by SMF as using all available space.

Such programs will, in fact, run in smaller regions.

(f) The precise meaning of the SMF4SCC (step completion

code) field depends on a careful analysis of the CPU time

(SMF4SETM) fields for all steps in the job, together with the job

termination indicator byte (SMF5JBTI). Even then it may be

ambiguo us

.

(g) The OS SMF manual for release 21.7 (<2>) states that for

normal completion SMF4SCC contains the two low-order bytes of

register 15 at termination; for flushed steps, it contains

zeros; and for steps that are abnormally terminated, it has the

form 'xyyy' where 'yyy' is the ABEND code and 'x' is 0 or 8

depending on whether there was a system or user ABEND. The

difference between a flushed step and one that completed normally

with a return code of zero is that only the flushed step will

have SMF4SETM equal to zero. The SMF manual further states that

abnormal or normal termination can be determined from the job

termination indicator, but this is not always the case. For

example, in a multi-step job with at least two nonzero completion

codes, a value of 4 for SMF4SCC could mean either a system ABEND

code of 004 or normal completion with a return code of 4. This

possibility arises from the fact that abnormal termination of a job step does not necessarily preclude the execution of

subsequent steps.

(h) The system identification field which occurs in the

standard header portion of each record (symbolic names SMFOSID,

SMFISID, SMF2SID, etc.) is made up of the SID and MDL parameters

taken from member SMFDEFLT of SYSl . PA RML IB , possibly overridden

by operator intervention at IPL time. These two two-byte

parameters are concatenated to form one four-byte field, e.g.,

SID=SF and MDL=65 would result in an SMFOSID value of 'SF65'.

(i) System wait time appears in two SMF data elements:

SMFISWT and SMF12SWT. Basically, the time during which the CPU

is in the wait state is accumulated and added into a total figure

every ten minutes. Whenever a job step terminates and the total

wait time is nonzero, a Type 1 record containing that total as its SMFISWT field is written and the total is reset to zero.

Note that the ten-minute accumulator is not reset until the

current, interval expires; then it is added into the (zeroed)

total. Thus SMFISWT normally contains the amount of CPU wait

time accumulated during one or more ten-minute intervals.

129
(j) In the first Type 1 record written after an IPL (i.e.

the first Type 1 immediately following a Type 0 record), the

value of SMFISWT is the amount of CPU wait time accumulated

during the IPL process. More precisely, this is the wait time

accrued between the time the dispatcher becomes usable, i.e.

when the nucleus has been initialized, and the time the SMF

initialization routine is run. Before the dispatcher is usable,

the CPU will not enter the wait state, because the IPL and NIP

r out i ne s . c hec k for completion of I/O operations by repeatedly

testing rather than by waiting for an interruption. Thus the

first SMFISWT value following IPL reflects the wait time

accumulated during Master Scheduler initialization.

(k) When a HALT or SWITCH command is issued by the operator,

the wait accumulated during the current ten-minute interval is

added into the total since the last Type 1 record, and the

resulting value is placed in the SMF12SWT field of the Type 12

record

.

(1) The SMFDSSNO field in the Type 14 or 15 record depends

on the medium used for the data set described by the record. For

tape data sets, it is the volume serial number of the first reel

on which the data set resides. For data sets on DASD, it

consists of a six-byte segment of the UCB, which includes a one-byte RESERVE count for shared DASD, a device reservation

indicator byte, the two-byte address of the RQE for AVR volume

serial number verification, a byte of volume serial number

verification flags, and the high-order byte of the address of the

DEB for the first user on the queue for the device.

(m) The SMFTI0E2 field in the Type 14/15 record is useful in

analyzing tape mounts. In this one-byte field, bit 6 (X'02') is

set to indicate that the current volume of a tape data set is to

be rewound and unloaded when end-of- vol ume occurs or the data set

is closed. If this bit is off, the volume will still be unloaded

whenever the number of volumes exceeds the number of units

allocated to the data set. Otherwise, the tape remains mounted

and any data set on it can be opened without operator

intervention.

130
• « « • » « *

* * c

T u * ec

5- < ( * o

* ^ v; Z </l I/O 1 • u

T C Ui X * UJ • X _l ^ UJ < o « ec UJ < I a ^ *

# to ^- >- o -1 O u. -J Ol

u. Z Z « i/> *

* UJ UJ ec C o o «

* irt • _i

u. UJ c z o V> UJ « o

* T -1 n UJ >- «

VI U- u. * UJ o K D «/> a. < I <r u. UJ * >-

• <o z U- u. X « K ? a 00 D *

• o z c o * D

* u UJ u. c ^ u. « K K z _l < o « o

* «/) ^ 3 Z O

* >- c O « UJ

1/1 z o X O z • ec * o UJ UI »/l UJ c *

>- i: o. -J Ci « ec « < Z Q- X «J K c. •n <y < X « u. * K O U.' o

* c «t U' Z I c • t- * a ct • c UJ _i * <

D UJ C a. IS * z

« (J> a u. a. z UJ * ec « UJ O X D < > * c

« Of C « IL * O UJ « « > z u ^ > < * UJ * z UJ a: I c -1 • z

* ec a. 13 t- ec UI ¥- X O & o a. a *

• c u. < a * Vt « -J z » UJ UI • _J >- T I * z

• o -1 O < ^ t z « u. z ac a «/) • u. Ul * o u. o o o * UJ r • UJ o >- t- Z oc * Q

UJ * I o c z z < o

UJ u. UJ u * o

< * I z a; z z UJ UJ UJ • 1 — K o. UJ UJ o ec «/) UJ

l/l * u -1 z z * u 1/1 * z UI z UJ UJ UJ UJ UJ * o

Ui * o o z -i a I * u * z < a. UJ ^ « \A (/I a • UI Uj t~ a. U. o

3 « < et a l/> < 3 UJ z * UJ z

C < < O 1/1 ce ec 1- * «

*

u.z

I/) 4' IT <0 eo o tx M m IT

<t rv tvj > rr >- m u o Of -I- Of z ffl <

uco z z z t/1 o

UJ V-

* e X CD Ul of UJ z c >- C5 h- > l/> Of ^ UJ >- oc > UJ < Of X cc 'V >- z Ul > O

X -)z CD o

or< to I<1 D UJ CD z z

a z z — to C to a >- </) -> cc < < o z Of <_> o o C Ul z U. « o

Z _J

UJ o ^~

Of D

cz

lO 0^ • c

>- u. _j u. » CD t_> UJ r> I) U. Of a z <r :3 ec UJ CD IT UJ o D X • o

<r z _i — ^ _l -H a. Of _J K X X e 1/1 -I o as (E z o > Uj Z C K o I U 0^ n Z UJ t- z u Of UJ UJ o o C: o Z t- V < < c 19 1/1 t- ec Of O -1 ec UJ U t- < u Z <i U- a

u o IVI (C < Of Of u O Of u. z ^- «I z — c O c o Of ec c v~ 15 < u. «/) c in II Ul t- o

O UJ < o UJ K O. ts z l>sl 1/) 1— iA X a. K X < </) Ci UJ UJ UJ z — « UJ

h- >• oc a. u. M 15 < t- C5 UJ CO IA _J o

_1 z z oc <r o c « UI >- < *~ to f- z > lO O < ^ UJ u u. Z z t/l Of UJ <r C Z ^ »/i 1 -i Uj

=: z IS 1/5 15 U: z O O cJ IL, S UJ < o UJ Z

U. CO UJ <T a 15 u. I— of t- >- t- o z o < Sf UJ Ul UJ o _l >- z UJ a UJ u' cc (T O T) V) Z of U. Z D 1/1 _l U- K u. »- U- C m UJ u C < o 3 D > o

l« < U. _) to -5 O => < l_) X 1 O (- K

ec o z oc o z> O z < r> < z -> o o — of l/l lO Vt Z UJ a. UJ UJ ec UJ X ec 3 o Ui >- < c Of O 3 > o c c z o c Of UJ UJ < o o Ul • »- < o < (_) o I/O CD U. Of 1- z z lO u. > cc o < X u. I «/l -i Ul UJ UJ Ul a. o V C z a. UJ UJ 1/! Z Of o <t UJ ^- z K UJ < X Of I/) I oe V> to > o

(/) l« K < Uj K J MP

CD Of 3

to O YT > >- X < O Ul UJ O UJ z CD o c/» to UJ D > Of f- II H- X o > K o IT o o c c o 1 1 1 1 1 1 1 1 O Z 3 pn o o o c c o

o — o * irv «

V.

lO z CL Z

1—4 •J <» _J _1 -J _J —

1

>- K t- K h- o z

u. -J _J -1 -1 ec -J U ffi (D as -1 CC z o « m CQ (C CD * o. * «t CO (C CD ffi CD A 00 m

FOR UJo

< TH( ta:u.

>- a 15 X

«/) O (/) (/) u U u o o o U O <J < Z t- O Ul o o o O o o o o o o c Q X t/) Uj <

-1 Of O Z 15 O >- U. Ul

Ci UJ Ui -J »- Z K U -J </> Ul CC K C

Of O O O O O O

U. U. U. Ul U. u. u. z z z z z z z

O K U. t- K

X X 3 CO Ol

«/) -1 ff> > C O O O O O

U-U.UiU.U- ~ z z z z

« (<OOOV)l/lt/)t/ltO«V)</)tO<jOl/)*»ww^^,>w.i^^^^. » « » «

+ * + + + + + + + * + + + + * + *

-.r-ooO'0»-"fMtn*in,o^-ooo"0»^p>l<'>«ttfi<or«-coo>Oi-iPNjf<i>»-ir

o

o

oo

o

«/> <

CO

coo

w

c

-J

oo

c

oo

o

o u o o O O o

o o o o o o

o o o o o o

o o o o o o

o o o o o o o

e? o o e o o

o o o o o o o o o o

o o o o o o o o o

o O CO J- in « < UJ f\J ^0 < UJ u. o o o o o o o o ^

o o o o o o o o o o o o O

o o o o o o o o o o o o O

o o o o o o o o o o o o o

o o o o o o o o o o o o o

131
O _J

-> <

UJ UJ

D O

2

> n

ec <

UJ UJ K I

UJ

>- U-o

• cc

^ >- CD >. ^ O

X O c

OC 3" < c

a: < ^ 3:

I- o

T UJ c c

u. e —

UJ s»

»- ^ o

< o ~

5: < Lo

et: Q.

o c e o

-JO o

X UJ q:

«/> o

UI u

U K UJ

(Z T> ec I- UJ I a: r

k- •— o o

UJ <

OC 3

O UJ

(JZ UJK U.

r! o —

a a »-

»- •-< >- -J Z I CE CE -1 ^ UJ (_> S- O 1/1 O UJ

U- 15 5- UJ < CL u- UJ o _; >- O </) _) U. I- t- tq; o z a o

z UJ K u. UJ a: o o c s; o o

< o o < o _l UJ UJ UJ UJ UJ «t I a 1/5 I OC

- - - - O o O O O O - c M rg J

u. -J -I _J _i cri _j 0# COCCAcCi^Q^

r UJ <

-J Z UJ Ui

1-1 o y

a: Z »

=)•-»- K O V.

U- ^ O I < D trt Z

z

D u

»- <

i_) > :t

UJ or o

O z o

<

-J *) o

1/1 K UJ Z =) K — O

I I I/) UJ UJ UJ O O 19

«I «I «I a a

< < <

»- K K

o o o

ffi cc cc. CD c z

OC o

o 1-

Uj <

a. z OUJOCOOOO

QC I Ui

rHZOO>UJU, CiUJUj_JKZ^ _x o-J</)u.aci-o oe-.^-i«^„ _,XJ

>-t- U-U.U.U.U.U.U- U.U.

oooDeocoooeDoooooDo^O'0>oO'0'0>o<

o o

a z

X

UJ u

>- a

I-H pH

U. u.

z: £

+

00 o0* a

1_> o

o o

O OC o o

CL a

u. u. Z zr CO (/) 4i ^ O ^

o o

o

o

o

o

o

o o >t o O O o o o O ^ O O O o

O ^ o o o o o o o O O O O o

O O <NJ ^ >CI < o O O O O O O o O O O O O o o o o o o o o o o o o o o o O O O o o o o

UJO p-i o o o o

o o o o

o o o o o o o o

O O O o

o o o o

o o o o

O O o o

o o o o

o o o o

4 < Uj rsi >H ,-4 pg o o o o

o o o o

O O O o o o o o
_i 4- > mo z rr\ ^ a. O c. o X z cV

X

t-< C •• of y o a < < o

a: S- IL oo >- U 1 cc s: <

a. <

r.

— s:>- > z o S U, D D O z

-J CD orUC O OC UJ Z 1- a D D 1- UJ

1-< o

C5 <

•-< tJ

a

y «r C/l I—

oc o- U- :3 _j z I a ec pj o <I o _J UJ K o U- z 3 a- ts c UJ l/O Z

u. u. o z u. < Q. »- UJ

uj UJ r' _J >- Z UJ CI

1/)

C 1/1 _l u. t- <-' ^-

</i <

Uai • oc e z or O 3 O — s: X Z UJ ex U. UJ o: Uj

UJ o c c s: o o K

«/) <I o o < (_)

C V/5 >- _l UJ UJ UJ UJ UJ o >- CD TA < I Qc; i/i I a: K l/l <

UJ c O

>- - o K 0. o o

z: o o o O - o a 3 3 O PM PJ -J •-• _J •1- -J UJ z U- ^ _l _l -1 a> —1 o

to UJ </5 < o CD CO CQ c£i & a. U- s:

u. Uj u. D »- Q c

«t a.

X k- c o VI

O t/^ I/) o o o o o

»- (/) o z C3 UJQCCO c c c

UJ 3 UJ C£ zz CM Z O

O >- UJ UJ c

l/>

a ir>

O UJ UJ -J

K s: f- o U _J 1/1 u. oc 1- o </l 3 C X UJ CM rv) pvj Pvj Psl PJ PJ C m u. u. u. u. u. U. U- u. > s: z: z; z £ £ s: £ < « * </) «/) t/) I/; 1/1 1/) l/> _J •4- •f + + + + + + + * + +

»H «!• in >o oo c^O

O fSI PM <NJ csj <M c\j fvj rg Pv, fTi rr, ac K c »/> o

UJK PJ o

C£ o

UC o o o < o u

eta < o

CO <

UJ

UJ

X oo o o o (-> o z o O

UJ t- o O o

a.

u o O

0. UJ o O e < -) o O m O o o n o o o o o •4- o O PJ IT < UJ o o o o o o o o O o o o o o o o o o

-J o o o o o o o o o o o o o o o o o o o o o o o o
t > J 2 I oc 00 -I U) »- o

n I o t/i o u.

u. o 2 uj <r Q.

tju UJ C -I V O t/: _j u. H- K t- a o z Of o Z uj a. Lu uj a

<J5 C O S. C D I- < u O <t o _J lu u.' u.' uj u.' < I a I/) I ec

> o

m

•-H U. o

o _i

• o X

z o

>• CD >

v o

X o

o .. <^ z u a < o

z u.

Uj _|

s- <

st- o

X. UJ c o z

oc o

U. O IUJ K

i: <

< O (J

s: < >-

ct a. u. o —

U. Z t- •- z

15 UJ Z UJ O

2 UJ

O

• - • • • - o o o o o o - o •

rsi <\l w ^ U. -J-J-l_Jffi_Jo

o a O T

UJ 3

a: c

(/I <

X U. * #

+ + +

«»> •4- in

ir m in

</>o«ii/>ooooo OUJOOCOOOC

•'IZOOVUJU.O ouju._j^2:)_M

u^(/ou.a KOvo occimmmrnfTifo

U,U.u.u.U.U-U.U-

+ •• + + ••••• + inininin<o*>oo^

o

oo

o

o

o u o

O O >!• o o o

o o «t O O o

o o c o o o o o o o o * o o«M^invo<ij. O OOOOOOO O

O OOOOOOO OOOOOOO OOOOOOO OOOOOOO
* > ^^ o o

CDo *^ —J z # ^ 5^ t *jo o

z O U Cr » u z c o >- z

(C o III c ir> t-> * oc X ^ oc at c Ul z o o oc * z </) K O U- c w <_) < « o z c

r|* oc O u UJ t- a oc Ul 1/1 cc u o l/> I O «I 1/1 Cl I— c^

<r < t- o Ul o

z Irt o o e oc Ul UJ UJ

>- z X C Ul o Ul t/1 ot 3 oc UJ oc K ^ ^ c </) l/l o 1 oc z

tf < z o o c o < 3 UJ _l c C U. LU c u o -J z <• z « 1 oc < l- -J >- c z »- Ul »- a I Ul <3 a oc => -J o. (/> oc l_l > 1- z Ul o z o Z "J z u t/> UJ ~- -> > oc UJ o

CO o z o UJ UJ Ul UJ K 1 _l a c n z> <r oc v >—

oc z z t- ts O in cc c >- z u. u. u u.

1^

t/J to K

€t C oc u. o O < «I o trv Ul Ul Ul u< u

J~

U- of a C UJ u t- o z O I <VJ h- iC z C »- UJ 1- o z t- ~ <-> II oc z o UJ •< a < < z z Z >- c y- t- K t- "I h tJ t^ tS tJ

h- — >- z o h- o coo O I K z > (_; ^ »»< 1—

t

-" 1- *^ < o a. ^zxocic>t'ecuj » oc I-. X UJ »- X X X X Ul oc jc oc -J o

QC _J U) »- o O St ^ U. t- f- < K oc Ul o K < u Ul Ul Ul J o tj o o o O UJ X C r>xou?uuju.u z oc oc « « CJ Ul K- O Z Ul UJ O 2 a UJ D c •— l- or uu. cj> z UJ « a < Ul < K Ul «- -< _J <I l-H « ISl to oc — K K 1- z X _l ot C oo oo UJ UJ O -1 V IS o. t- 1- z m t- u. a. oc Z Ul »- n Q- Z <r o to Cl z O U

• C C/5 _J u. »- z Ul </) i/n UJZ""H-O>-Z>-0- z </i o e oc o =) o O c

z UJ >- z T C S Z Z UJ C 1- r < Uj Ul UJ UJ Ul o o c c —

1

UJ z Ul II II tf «J a c z oc o z < oc oc ~ Z «-<•-• oc CO O M -J < z z > 12 > IS K o UJ UJ UJ UJ O ^ u > Ul Uj y- I

c Z Ul oc Ui UJ oc 1^ Z UJ UJ UJ oc < o: «s oc < UJ _l ~l -1 -1 Ul < _J u, z O C O X c o Ul K* o Q oc a a a. cc « Q. O => o a UJ oc Ul oc a > _l -1 _J -J > z z a UJ oc •> < U <I o o i/) CD < <I Ul Uj Ul Ul Z »- UJ K OUjO</>0</>CU. oc Ul UJ UJ UJ oc oc UJ UJ to > u z

oc _J UJ Ul UJ UJ UJ o < > c Ul UJ (/- t- 1- 3 < K oc O oc >- Uj UJ t- UJ »- ^- Ul o U Ul c CC? t- UJ Uj QC IIUJ Ul cc U. U' < X a t<^ I oc 1- o -) oc a. n to CO m z o to a < a to oc oc 00 oc 01 01 00 z Z Z Z 00 Z t/) oc & oc QC C

> Ul < < < « UJ II It II oc o (_> u U QC C >—

1

o o o

- o - o - - o • 1 1 1 1 1 1 1 1 o o o o - o o o o - - - o coo o o o c o o o o o X O O O O - o • o • o • o • • o o <M fTl sS- IT * • • -

1/1 oe f-l •-I -H K K t- (M (VI ^ ^ _l <« ^ -1 >^ -J ^ _l —l CO CO -i ^ -1 w -1 -1 _l -1 _l LU ? z U. _l ^ -J _J ffi -1 o CD -J O _J cc _l (D 00 -J _J _l CD CD CO CD CD 00 cc CO CD CD ffi CD ee CD cc CD (O IE UJ UJ O # ffi (O (C CD >t a CO a CO m >t Ou •4' O U CM (M (M >fi •-4 ^ CM CM CM CM

U. r _l

u.o o

oc a

X o c c/) C >/) 1/1 <-> O u o o <J o o o o u o o o u u u u u o o u o o o o o o

</) oUJ o O Ul o c o o o o o o o c c o o o o o o o o o o o o c o o o o o

UJ oc Uja c >- z z o y- K Z o • •* z o cs > UJ Ul o Z t- 00 U. Z — U K Z Z X 00 s<: l/i z o z

v> oc a O U. Ul _J H- Z K (Q \A o 1- ^ K W u oc O K (/) o 1/5 ^ Ul t

UJ u —1 wi u. oc l- o -5 cc DC 3 «/) «J1 i/> Z (/) o. a oc I oo 00 oc oc _l w o oc <t * «» * <»• •* <a- ^ ^ «t ^ ^ >* <t «4 * -i- U. u. U. U. u u u. u. u u. U- U U. U. U. U. U. u u. u U- U. U- u. U- u u u > Z Z Z X r z z z z z z z z z z z z z Z Z 2 z Z Z z z z z z

# » « l/> l/> CO Irt t/^ to 1/1 1/1 </)«/)(/> t/1 « (/) I/O * to on 00 00 </i « « « » « * * • « t/) lo t/1 * oo oo

4- -f -f A + 4' 4- 4- 4. 4- 4. 4^ 4- 4- 4- 4- 4- 4^ 4^ 4^ 4. 4- 4- 4. 4- 4- 4- 4^ 4 4- 4- 4- 4^ + + + + + + 4- *

h- oo 0> O M * lf\ <0 eo ffi O (M tt\ -0 r~ 00 o- o <M fi in 00 ff* o «^ CM X CO CO CO 00 OD CD O O C' o> c a (7- O O O O O o o o o o — ^ ^ CM (M (M CM CM fyl CM CM CM CM 1*1 m fO d

k- CM (M CM »M (M <M CM CM CM CM CM (M CM OJ CM CM CM CM CM M CM CM CM CM Co

V)

oe «M o

o

u. c o

X o o

< o

OLo

« o

< o o c o

J-o o o

^ «f U) o o e o •4- ^ o

o o o o o

o "i- •* <» o c u o o o o c o o o o o o o o o o o

z o o •4- o o ^ o o o * >*• o o o o

Ul t- o o o o o o o o o o o o o o es o

Q. u o o o o •J- o o o «t o o o o

tu o o o o o o o o o o o o o o o o o o o o o o o o

< -> O 6 * o o C5 O O o * •* o o o o o o o o o o o

CD o o o o o o o o o o o o o o o O o o o o o o o o o r> o o c o

c o o o o <«• •* o o •* o o o o o o «» * o o o o o o o o o o o o o

o o CM ^ ir\ •o < Uj PsI < Ul <M < cc U. rO < CM < U UJ o CO < UI (M >o CO < o o o o o o o o o r-l CM CM <M (M O m * >fl lA IT Ul IPI in o a « o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o O O O C3 O o o o o o o o o o o o o o o o o o

o o o o o o o o o o o o o o o o o o o o o o o o O O o o o o o o o O O C3 O O o o o o o o o o o o o o o o o o o o o O O o o o o o o o

135
>-CD Uj

—J

tri *~ —» CD

l/> ^ UJ z o »— u CD ^ Of ^ C. < V > »- o >

11/

UJc

(_) UJ

u- i/^

1/1 c a: UJ UJ I • I u_ X K K »-

h- a

(_1 C 1/1 U. o o c »- c « -J _J CD Uj on U- UJ Z w.

UJ C

O Z .- ^

Z U. K < CL UJ < — 7' o - < O (/- O UJ z c C " a sr "-1 u t- <J " K (_) I < \~ t- z < i_) y «/i U. D < a z • o z c tu. O => o. o o z U- o I «- t_l u. o «/i e X

« z UU. «» Z U u. 1- a «- o a. U- 1- UJ U.' C « UJ 3 >• _J O _J X t- z c UJ (/) UJ Of 1/1 U -1 Z t- ^ UJ

•-' _j z z < < O. CD

«rt C > < 3 >- I C <

»- UJ I UJ

(/) U. U. Z o K X < c 3 O o C t- Z UJ

> V5

UJ Z

Q —

>

T < O X

o z

U. Uj

- - >

• • O O Uj O O .

-I _i ee IS m ffi <M >^

o o u o

O O O O

^ . ^ .

U. -' -J -I

3" -I CO _l o i/> ff) (*\ (c e o

a O O O </^ O Q C O C

» «

'tf' ir\ <o f\ »rt fsl rg (M

o a > >- UJ K

u. u. z z:

i/i 1/) ^. CO

o a. < o

— X U UJ

X X

D « z o

T «

. u- c o

Z IJ

u. cr -1 r- o

u. tc <

I U- o

c o

</) _j z Z U. ^

Z uj O

C T Z

-1 en «

15 C O

Z _J UJ

>- _J I- r z

Z u- UJ

Z.' Vi C UJ

i_> q:

«_> > a

< UJ < <x z z

< 1-1 </l eo

oc » O U. Q

U. »- _J

>- UJ

>- cn —

I/)

c/l K Z 3 — O

I I UJ UJ o o

< <r a a

UJ Uj CO ffi Z £

Z 2

o o o

UJ • •

(/> >4 rUJ CO CD Z w Q ^ .4- o

c O K

I _l O UJ 1— < — I

UJ u. o

z z

+ M fsi <\i

Z u^ < u

-J <jO Z <

<!• * >t *

u. u. u u. z z z z

» t«fj/1</1#«»««

+ •* + • + + + +

'NJfs*r^<Ntfsjrgf\j(\jrgrsj(M

UJ Ifl 1/1 a C p

z t- o o

a. a

u- u. z z

1/1 (/> • * +

<vj m >t in ir ir fM pg «M O

o

oo

o

o

o

o

o

o o

o c o o o o O O O c> U O UJ o

<e « « K

o o o o

o o o o o o o o

o o o o

oo

oo

O O oO

J- (J O O ^- <0 <0 ^- r- O O O O o o o o o o o o o o o

o o o o o

o o

o o

o o

o o
o

o

o

u

o

C

4t to fSJ **1 c

J Z c*^ Ci >o UJ UJ

• > o o «/> O *^ z ^^ X

cc c o fSJ * c Z VI o z CE. c o to "5 « -J CO <

z

C zc

u.

• < X z

X

zX Ul

U.cz

*3 • z v>

U. t-

</) «

a:c (— CJUJ o

UJ _l

CD X z

U. z U- <I VI o oc « V— o ^ Ui/i ef T r

zcCj V) o TO

ec C9z

• z 3 — u (_3 < Q X UJ < UJ o

c U- o Uj z C !^ u > —J to o o O _l o LJ c • oc Q < l_) z o <3 o V) V) UJ o

O C z V) u. to to a. car z o a c X z < >- — I c > cc z UI u ^ s: > (_) t- VI z z -1 VI O c o UJ to o

y > c — UJ c c. c =1 «I v> l_J V) to V)

eeUJ

a:<

UJ o

z

Q

CD fr cc o

O -1

UJ cc to

a: u.UJ

u. U.

UJ

Uu. VI<UJ

oc Ul

V) O U- —

J

z

to o QCo

»- ON

t- Cj c T UJ

—JUj

-) z < u.

CDoto o

C K z

c

-Ju z It VI Ul o

to z

< U-to <

UJ a -5 < t- 1— 1- t- o o D I U. to z U- o

< C Z a z oc u u. I — O t- in to »- c to m O r- c c < Uj oc rf to X X X X uu z o ta z t_) UJ o

o: u. U. Q. z UJ UJ UJ O O Q UJ u: UJ UJ _l V5 >- VI o Z -9 X z O C oc u z z <I c u u. z O- c UJ o Uj to to o V— z oc O • < UJ UJ z o K t- z z <I oi UJ o «J C K UJ t- o c; z t- 1- O UL! UJ < < «I < c < -J UJ U- z z Z O UJ >- X

<t < Uj < V) 1 z K z o CL V5 K ^ u. =) < *^ CD z c u. t- c 0. z Z Z to < c c o o e VI > V5 CJ ^- o z o It o

^ z X ac CD oc — *^ ui o c oc C H C to c UJ Ul Uj UJ O -J O U. UJ < UJ z o t- o z D _J UJ K (_> O Q »- 1- t- u. »- "-H <I to >. >- Uj ^ ^ _l —

1

u. < O UJ V) o ^ t— UJ X VI Uj o z UJ UJ 3 s: IS irt o u: U. UJ z a: (£ V) t- ^ ^_ Q. a < > -1 _J -J > z Z > V) to o c o Z < U. z ^

U. 19 Z Uj « Q. V UJ < <r 1- < <r UJ to o o Z oc UJ UJ UJ Ul oc oc UJ oc < > oc o CSC z o

UJ U.' O _l 15 O C z U. — u. V^ _i oc (- h- to UJ o o o o LU C cc UJ _J u> z y- o- z UJ (- u. UJ 1- _l <

cur -J U. k- z « — UI I/) 1/1 UJ c t- 1- c »- Q. C VI Vi Z V) z z z z V) z <t V) o o o o Of O UJ z z _J K K t- — a. z o UJ Z to Oi UJ < < < < Ul II II Uj Ul a. UJ UJ OI Ul _J z < o >

c oc c z a: o ui Z < oc Oi oc z z cc V5 c oc o: QC UJ a OOUO0cOto0CK>Ct oc z o > VI > < a. oc K c u. CO z Z UJ oc oi UJ oc 3 • UJ Z UJ UJ UJ to UJ O 0- UJ UJ 1- 1 1 1 1 1 1 1 1 3 OC Ul UJ to < oc => oc _l ac u UJ v> u

U O C £ O c UJ 1- o o a: CO CO < o o o to CNJ in <o OI o o QC UJ U. < 19 (D o o

• < o c < u O *- m < < UJ Z CE cc z m m < < CO t- V) V) < •« CC O V) V) V> 1- o CD Z (O < > Ul »- It -1 Ul UJ Ul u. u. a «i >- C UJ u. (/> rs o c < C O UJ UJ C >- Ul UJ Ul o ^ UJ U.' u. O D O oc \~ 4 -J < I a I oc t- O 1/1 -5 oc oc Z -1 -5 z c -3 ") oc oc -> co VI oc QC oc -5 V5 oc QC a. K o. -3 Z -5 z < z

< z u. z < VI o o o o oc cc OI - o - - . o o c o oc K < o o o o - o o o o - o o - o - O o o - o U. UJ a. > o o o o - o • . . o o • c • o - o o o o o - o to o h- Uj

>- oc » 1/5 rvi rvj -J -1 -1 -1 -J -^ _) _l —1 —• _J «« to QC CD

u. ^ _l -J -J cc _] O O CO _J o -J IT CO as ^ cc -J _l CO _J -i _1 -1 CO ca o CD _l c CO -> o (A

lO O « cc CO CD CQ Q. ^ oo * a CO CO ^ a. fSJ CO ^ CL CO CO en O to CO 00 CO m CO o z » X UJ

>- o c

o u I _l -1

oc Z o UJ u; C a. u O O o o o o o o o u o u u o o O O o O o u O VI < U -J OujOCISOOOOOCiCO o O O o c o c c o o o c o c o o o o o o c o c o Ul u. u.

QC O

OC <A O

to «J X UJ

V- oc

; o o

e-o -J v? u.

QC IT in ir< u. u, u. u. z z z z

v> V) v) VI + + + +

00 O to

. . f~ OD eo fM(Sl(N(Mr\J(M(M<M

« » «

+ + +

•t m •«

>- U. Ul o

t- Z to

QC K e VI

in if\ m m

u. u. u. u. z z z z

V5 V) VI VI » + »

CM fi <*• m

00 GO on 00

(NJ <M f\J PU

Z I- OQ V)

-5 OC m irs

oo 00

(SI CM

C u. »- IV5 to V5 to

ec Z>z->

in m m IT

u. u. u. u. z z z z

V) V5 V) V> + + + +

CO o to

CO 00 o* (M rsi »\i r>j

O to

to o

V5 V) + +

to _J>_J ZZtJU-U. o ot-osc: c u.oa.K<

z crjtoa. to ^Dcwov)

VI OCOC-3V5 o >-a.-5<-> m ininmin m mininmin

u U.U-U.U. u. U.U.U.U.U. z zzzz z zzzzz oo V)V>V1V> VI V)V)V)V1V>«*««

. . . •rT-r-rT-rfT-ri.T+* + ++ + + + +* + 4. + + * + + + >^u^>o^-oo^Oto(^Jro>^m^^-eDo^Oto(MfPl^ln«o^-oot^Oto(^lm^ln>e

0^O»CT>0^ C> (7^ O OOOOOOOOOtotototototototototof\J0\jr\jrgtMf\)(M

f^lC»4<^Jf^ir\if^^^^f<^f^(^f<1f^>r^f<^f'^l^^<l(*^f'^fom^c^f<^(r^(<^p^^Tl*f^f'^ml<»f^^fO

>- C to O t- I- »- u a. v; V) aj -5 -3 oc oc -) m in in in m

u. u. u. u. u. zzzzz * Vi V5 V) V) c») «

+ -f + « « « « * « «

+ + + +

OD < o o o o o

* o o o o o o >* <«• o

UJ o o o

Ml «r << ^ o

X C o o o o o

o o >*• o o o O <J O O O l_) o o o o o o o o o o z o o «t -t o o * o o o o o o ^ o <»• lU >- o o o o o o o o o o a o o o o o o o

a o o o «*•* o o >t o o o o o o o o * o

a. UJ O O O O o o o o o o o o o o o o o o -5 o o -J- * o o >* o o o o o o o o o o

CD o O O O O o o o o o o o o o o o o o o o o o C3 o o o o o o o o O o O O O .I- O O «» o o o o o o o o o o o o o •* o o >! o o >»• o o

o o CM ^ in <o < UJ M < UJ (SJ < m u. rn r- 0^ < U) CM 00 o> < CO <_) Q o 00 o in 00 O- u o o o o O O O O to to to CVJ rvi fo f'^ >!• •4- <*• •t <r in in <} <o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o

_l o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o

/ o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o

o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o

137
ou

> en

»- O IT z 1*) 1^

u. o |0

*^ 0. y

• a X X

C) z c or 3

>

ec >

It; K

V

_j O

(/^ z UJ » o DC o I

*- C "

Jec T IL >

a. X & UJ s

< O t- or

1 ^ Z U. CC

u. or 6 o o

> UU _l c o -> Ul

a. I c o u. u «/) to < — s- c >- «/) c > «/i 1/ o 1/1 Ul Z U > O «/: z • o

3 X Ul o oc < Ul — n 3f C O O z o c -1 oc 1/) oc

(C Of 1_) o >- a. u. O u. c </) e oc u.' 2 fc- «/ oc ec UJ 1/1 C X « O >- It o < lU «/) UJ UJ oc z ^ s (J C »- w «

o

— u UJ ^ «UJK_iO.CCZ O U. c o *^ X a. »- < 1/) •-• z < -I y < < UJ ec 1/1 -1 1

1

K > oc Q. u. ^ o o — o (_> oc < > oc c ec -J Z I oc or « c < *- >- •-Ujooc2cocO<uj

(/) ^ UJ h- O U. Z »- C oc I- c a> UJ O ec oc ec »- X

»: o UJ — «n Z KOC^UJb-OCCZ C I/) <_> QC U' Of < UJ

UJ S U. O Z a; < O. O a. U.' «<U-*-ej'<_i~2ijji/ia Ul c~ UJ Ul o —' > Z UJ c «»-—•— «t K 2 oc « o ^ D </> —1 U. — u. H- l/l u. oc K </) IL o K ri u. o

K X K- < UJ </> S O Z ec rr\ a r; o u. z a.

e. o OC o z Of o = o — z z a c oc oc c 1 O O. 3 Ul z Ul ac u- UJ ee u ^OCUIB-h-OCUiKOoCO^Z 3 2 oc a Z 1/1 o o o z c o » »- z Ul C 3 Ui h- UJ u. oc C - u UJ < u u < o c (/) c. < oc & K ^ e Ul 1/1 ffi X

X c _l Uj Ul UJ UJ U' c >- ec<UJUj^>-aczoc 1 1 t 1 z oc 1/1 X u. « X or 1/1 X ec »- </iQuject/)r)ocx::ujC 3 OC O u.' -> oc r C 3 z o. m -o z X u. a Z 111 Ul X o o o

*~ ¥- - o • o • o -

¥- . . . . o o CO" • o o o — Z o o o o • o • o , » o

«

o O

cc ai X X f\j <M ^ — _J ^ u -1 _l ^ 00 _J -J ^ -1 Z 3 U. ^ _l -J -J OS -J o o n _J _l to —1 c -1 -J O O >/> ©•tooasDoEvta. ^ 00 ^ a. u u Q. 00 <e •* 00 — o

z

»- o <

« oc • c « i/)Otn(/>(jO«JO u u u u o u u o o u u o o

</) oo OuiOOCC OO o o o o o c o c c o o o c

UJ

U.' o < O Z O O > Ul Ul c z »- o u> o K c ec Ul </) Z c

a C UJ UJ J K Z « </></>•• X »/5 </) _J c c z «- — ec u _( u. ec »- c I/I oc oc 3 O 3 3 Z z u o

o xc oc « « « « « « <c <o ^ ^ ^ ^ ^ ^ ^ •o <c « « 1/5 u. u. u. u. u u. u. z z z z z z z

u.zu.zu u. u. u u. u. u. z z z z z z zU.z

u.z

u. u. Z Z

• » lOt/lt/l«/>V^«0«/># «/> «/l V^I/)l/)(/1</)l/1(/)* » • »>/)# 1/1 «/) * * • + • * * •t- + * *

^- 00 0- O IVJ It ir\ « r- 00 z>- CO m »» ff\ tt^ tf\ ff\ tf\ 1*1 m

o u

o o

o o

o o o o

o o o o o o

o o o o

o o o o o o o

o o o o o o o

o o o o o o o o o o o o o o

o o o •* * <t o o o

.t' <» *

o o o •* <t o o o 4- -*• o o O O o o <_) c o o sr o o <»• o o o

o o o o o o o o o o

* o o * o o o

o o o o o o o o tt,

•» O O <d' o o o * •* o o O O O o o o o o o o o

«t o o <*'<*' o o o o o •«

UJ fM < u. ^ < ee u. *^ 00 o> e O — IN <M fM f\j ro (*> m (*> O O o o o o o o o o o o o

O O o o o o o o o o o o o

o o o o o o o o o o o o o o o o o o o e o o o o o o

138
UJ z

cn 111 u. X

u. UJ O 1-< I

bO

UJu «/> o: K3 C C l/l ><

-J

1-

C z

oco l/i u

u.

a: CM

u.

Q z O

I/) < o

oc

«/) oo

<& <

tf UJX

UJ o• a>

ec >- X o O •

o: 5"

<• c o ts

1^

y OK

_) U- o X i>o or

•o

a

<r o K «>0 Uj < O Of c za oc zoo O ai uQEi I/: U. UJ

u- -J

O

D to

UJ c

1/1 ofO < o

t' UJ < Of o • < t- I o z o 1- r 1- »- •_ »- z in

UJ UJ Z CJ Z >

CD 1/5

T UJC UJ < X IS

O o c z a. z

»- < CD oc o tf, c •—

UJ u.

O o z X Ct in < C or UJ z e: ^ 3 » oc Q OC o K O < O I c < c K UJ < O o t- o

U. 3 O. »-T < UJ z UJ <I u. < 5" — >• OC o. u. oc ~ t/1 oc o l/l -1 z I ec cc o < UJ —1

UJ U- Z U. UJ < oc

U. Z IS t/lO UJ z z z >- < D

s: < u. o Z UJ <r

u Uj I/; u.

m UJ u.

O _J >- Z Uj c K o e

u.

C oo -1 u. >- u. U- oc

O UJ z o K </) < c o c o z -1 < a: c z o: o 3 C3 z z Z o CD

>- Z UJ oc u> UJ oc UJ cc Ul < z O Q o s: o o K U/ t- X a: OC UJ < o ts < o o 1/1 to DC u < I _J UJ UJ Ul UJ UJ D z < >H u. < 3 < I oc I/) X oc «/) Z5 1- X z </) >

CD z t/i 3 «« < Z <

UJ -1

O o - O o < o o o o o > o o o o • o o

IX < X z M <N| -J -< _l * _J -1 -J ^

=) u. ^ _l _l -J CD _l

U CD CD _l

1/1 o « CD

A tf: CD Q. •J- <M -*

a

UJX o

a:o o «0 o tfl o u o o O

O

O o o Z Q UJ o o c o O C ceo o

UJ

<x. c z o o >- Ul u. o o z o

l« ^ c UJ UJ _l

H Z K oc ^ >-

H-a _J I-) -j u. oc (- o »/) Z 1/1 i/y I o a. t~ r~ f>. r- ^- r»

1- u. u. U. u. U. U. U. u.

u u. u. U.

at z: z £ ac z z z z z z « It « ;/)(/) 1/1 i/i (/) i/i 10 to «

4- + + + + + + + + + + + + + +

CO

a if\ «

00 c^ o •-I fsj fO

01 0- o O o o o o o O

O -J

•* * * * •4- c o o o o o o z o o 4- O o

UJ t- o o o o o a u o o o o

CL UJ o o o o o o < -> o o -too o

CD o o o o o o o o o o o o o •4- O O o o O (M <t IT >JS ••I UJ Pvt CO o o o o o o o o O •H 1-4 o o o o o o o o o o o o

-J o o o o o o o o o o o o o o o o o o o o o o o o o o o o o O O o o
Z UK C J

h- <

iu

o. <

r > o

t- c

K BE. •-< o

a u

oe

</) I— • o o z

CL < o z

I-I s: UJ o

oc u

I/) UJ r «

• « •

+ +

^- 00

fo m

*

o u. m X O ta.<

o

z

o

CQo

c

-J Z I

•J Ol K E O

U- O 2

111 UJ O WO _J K a o Z Ui o c c ~ < o -I U. UJ < I QC

s cc

o c

oc >- o > < c

i: o

UJ— <

c

u. — >

OC GC CO o

«/) O UJ

u. < a. C _j V Z oc o

UJ UJ C£ o o O < u

UJ UJ UJ

1/5 I oc

^

^^ O U- D

OC • >-

u. o >- UJ <

H O U <r >-> i: o u. _

oc UJ u u. O ^ t- ^ I U- <_) H U. < U-' I o a c u- z « o i •- ^

1^ •- X

=1 UJ

<

O I- «/l , o < >.

t- O

I UJ H Z o —

o

• o • • •OOOO" • - - o o o o - • -J-J-i-leCJOCD

UJ < o s: u oc > o

UJ u. o o

X 2

UJ O

>

UJo

Xu

>«

U.

oco

u.

UJ

oc<

UJ

>-cc 1/1

oc u. n m oc 00 O 1/0 c <<0 u. <r Cj uu

_i U. < a UJ u e. o

> >- _J o

oc UJ u^ <r

UJ u z I/) 1— t- z t- UJ > <

a. UJ Z X z Ci

1 3 <J 3

o

1 1

V10</11/10000UOOO«/1 ou^ooooooociSo

>

co

OOZCO>-UJUJC|P oujuj_jKs:(_Sai

t->_J(/lU. 0CI-Ol«_,

ocoo^ooqooooooooo

o

o

o

o

o

o o o o o ^

o o o

o o ^ O O O O o o >»• o c o o O O o o o o o ^ o SO

O

Sli'i!£;'*<iAj<\j OOOOOOO^

o OOOOOOOO gooooooo

gO OOOOOOOO OOOOOOOO

O

o

o
> o

2- O

t X < X

• oc u> 2 rj >- in ^ o a

1/) OD LL U- z o 3 Z u^ c c o

ee: c c o UJ

o. K

>-CO z o >~< > o a c a. UJ UJ =1 z 1 s: .• X c ^ c _ s: i_ u.

a-z n O D < in c c zr u. z 00

(C o o U'

OC • >-i c o ec 1/) UJ c a u. o _/ UJ on O oo z a c u) «t u.' o UJ O UJ o -UJ (-ou'-<o > oc u. «i ec

1 3 a K < u- < ec UJ a Cr z t- >- S" o U. < I > -J Q

o _JZia(COecu."-ujoz>- Ul tu <r -JOlh-O CStt-IZ o z

> =>SOV>tSUjU.OZ»-"" CD O >- Z K

u. c ^ u. <r CL <uj UJ > ...<•-. aiujC_ivoa.ou.cQ u. Q UJ Z X z

> Oi/)_J U-l-Z —o o ~ U 3

K t- Z l/> CD 1 1 1 1 -< ecozocciAi — s-iu. < o — f\j pn zujocujujaz) ujHu o .. Z OCCZOO UJKOi-i ec z t- UJ

UJ 1 «-i<oO<OCiKi/)Z> < «- < t- X UJ _IUJUJUJUJU.O<>-UJU. > UJ z

3 -J <XOC</>IOCh-Cil«-JC CD OC CQ CO o

z < UJ U. UJ •-• o u

»- ec . o - - o

K < - - . - o o o > 2

i-> > oooo- o»

•

UJ M

to O 3

1- X </) o

UJ z U. _l-J_J_J(S_IOffio I _1 in ai 00 OACCCDCQCD-^-a^lNJO u ^

u. z 1 I <I o

u. UJ U.' u. o o o

< ec z n OC UJ I O UJ C I K U _l CU.COOOOOOOO U. h- X UJ

UJ

ec Q z o

ct OvZOC>>-UJUjQZ<

</) a: «/". o auju.-i>-zt-~u.> ^ >- w u-j^u-ect-cu^^c

o X UJ o 1/) U.U.U.U-UU.U.U.II.U. < * • * « « » » »

-J + * + ••+ + + + + + + + + + * o in >o o z f^N-f^^-COGOOOOOOOOOeOOO<0000* ^ o (/) o

aia rj o

(t o

u. O o

z o o

«l o u

o

< o

(S <

lU

UJ X o

c

o u o u o

z o o «* UJ t- o o o

o. u o o

a. UJ oooo < o o <» o

CD o o o o o o

o o o o o * o O or>J<ttf\>o<ujfM<l- o ooooooo-*--

o ooooooooo o ooooooooo o ooooooooo o ooooooooo
> o

u>zoc D3

^- _j ^ I ^ K = S IS

U- o

ai uj

C 1/1 _/ a o Z UJ o c o ^ « u

IXJ ai <i I a:

»- UJ

Q. I- •- V o

af to -J o

KO

O UJ

Oi <i

a o -J >-

U- II-Z OC o

u. UJ b: ECO o < o

UJ UJu

CO

Xa 3 U.C 0 o

ec o u >- < >

ar

Do

UJ

s: •• >- S" K ao 1 u- z D O a • u. u t- lU <

IO (_) < «- r o u. QC UJ >- D :^ u- o z < U-r O Q. C Z " z

1/1

— s-UJ

UJ I- o K in O < >- >- Cs iTl

s: >- <. ^ « o

»- <r >-

o£

a (-

<i «? z K K UJ

UJ WO

Q

r «- < OC QC Z UI UJ

c> c am < < UJ O UJ Ui uo

-5 OC ot:

D

-J UJ

UJ

C<

U.UJ 13 I z X UJ C — z >

111 UJ

-J o

UJ

u

K

>- > m u. I CI

u^

OC to O 1/1 C UJ

UJ < OC a. Cj V _J o

UJ «t z

»- z ^- ~. « •-< Z I z Sod I I I «-l (SJ fl o . o • • . . . o o o o o o o o » o . o • • o o o . o • -

et

»- 3 <M (\i

—

— ^ -J -J _i ^ -J -J UJ Z U. -1 -1 _i <E -J o o m -I o CD

O

1/1 UJ I/O

O « 00 CC 03 CD o. on ^ a. 00 fvl

O

u. s:

U- UJ • o K Ci UJ < OC -1 I O CD I/O

O 1/1 1/1 o o o u o o o o o U 1/0 t- U < o u. OOCCOOOOOO o o o

L.'

—

X UJ QC o z o o > UJ UJ

O 2 Q u. > < UJ UJ _l K K NH CD () Z UJ

1/1 OC 1/1 > c -J lo u. OC

K

O irt -5 q;a ^ -J

Q

KD (_> o o o o o o o o o o o o o

Z> o X I/O OC -< f-l »^ »-( »-« o 1/) u. u. u. u. u. u. u. u. U. U. U. u. u. U-

>- s; 5- s: s: s: i: s: a; s: s: z s: s: < 1/0 1/0 1/) 1/1 1/1 1/) 1/1 1/1 to (/; i« 1/1 1/0 I/O + 4- + + •f + + + ••• + •• + + + K * f~ 00 a o f\H»1 * 00 cr c (M f1 o E ^ »-< r>j {\jcNjfsirsirvir\i«M(v<fri m m

QC >- ir\ irv Ml U1 ir\ in ir if\ l^^ in ir D IT) U

UJ

OC (\i o

OC o

U- o o Q o

i/1 < o u

OC

«/1

O < O

CD «I c o * * o o

>t <*• UJ o o

UJ >*

X o o o .t o u o o o o o o o >

UIoXo<

UJ+ •+ + + * IT <o ^- 00 (^

pn ri

m f<i

m fi

in ir\ if\ in ir\ in o o o o >t o o o o o o o OOOOOOOO oo**oo-*-o oooooooooo oooc**oo*o o 0<M>tiri<o<ai(M<uj(M<o O 0000000»^-Hr-ifs|f\J(M o ooooooooooooo ooo ooooooooooooo

142
• * > O 2

ro c O •- LU • -J t- X X <r UJ • a

I/) -> 15

«/) o z

Ul HJ

u.

O

u z <

oc c o X

a. c o o

CL o >•

1/1 (J > o ec « > t- z c z c >- o Ul

Ul z < < z o UJ s e T oc z: z a Ll > O !D o m

c>O z u. z c 1 ft o c Ul UJ « t c > z o ec U. <_> -J o

tc c Uj < UJ Z

-J

D t- UJ >- o u ^ UJ «/l U- a K < u. oc

u.

— >. z o u. o -J Z X o; oD oc UJ UJ

O Ul _l UJ K o CI ^ I z oc i/i >• 3 SET IS <r> O Ul U. l_) z K- ax UJ t/i or U. O Z u. < a <r Ul Ul X UJ < UJ U.' o _l >- IS a o U. DC »- </i oc i/i > C «rt _J u. t~ z c o Ul z </) < o Ul < a c Z oc C lyi z I u. c _i Ul <I a Z Ul a Ul Ul cc 3 Ul Ul o a. o o c o zoo UJ 1- o ~ > > _i o

UJ • « < (J o < u o l/l z > o Ul >- UJ T UJ ^ UJ UJ U. Ul Ul c < >- UJ Ul z o z 3 -1 «I I oc uo X oc l- c UJ (- z

CO a. > < z < Ul z I Z

Uj t-i o o c 3 O

1- ec c * z 1 1 1 1 K < o o D nj rri t" > o O O O o UJ

IT! o. cc UJ

t- <\J

M t-l * -1 _l

K

UJ

U _J -1 -J _l -J o cc o ai < >- in 111 </) o # cc CD ffi cc •t a J- nj o o z CD

u. •-IX oc > o c f- o o U.' u. < (X z c I o u- I/) o </> t/5 O O u o o O fl o

(/>

U -JO UJ o a oc o o o o o X z

OI

u

a. o « z o o >- U) UJ o > < X

or F-l UJ U. _J t- z Z UJ Ul c

1/5

O

O -1 U. oc t- o Wl -1 c

•-

O QC c X UJ o c C </> I- ef u. u U. U. U- u. u. U. U. U- u. u.

>- s: z: s: £ z z z z z z < « « « 1/) «/) m to 1/1 1/1 l/l 1/1 « « » » « « + + + » + • * + + + + + 4

>~ a> o (M (> «t IT <o r- 00 o rj JO

m "O 00

C z ir< >o ^ vO <0 <A «oO ^0 o ^- h- r-

»- lo in ir\ IT iTi

m in if> in in in in in in IT in inm in

m in c 1/1 o

Oi <M o

oc o

u- c o

z: o o

i/i < o o f-4 oc

«/) o < c<

ai UJ X ao o o o o o o o m >- o o o

0.

u o o * a U.' o o o o < -5 o o

(B o o o o o o c o o o o o o o <M ^ in <0 < UJ u o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o

143
uc

a > a a

<r

1/1 c — z 0 o

«ss- o

£ a c c

(_) X

I 1 Z

-J _J UJ

•<1 u. o

UJ O </) X >-

t- Of z w zoo LLj ^ <

I _J u. 3 < X

> m

t- O

z m « u. o

• O xr o

— > n

(C > o

C li.- X O

D .. u. as- c

1-i a: < O «/) 2- U- X

O. I- •- > T OC ff

I- u

O 1/1 ID

UJ <

UJ O _l

O O

< o

s; <

r\j a a

-I O

u. z

w u

ft (J5 >• Z UJ

U. »- >-. K UCi z a

cc U.' U.I c sr Q

<_) o <

UJ u> u.

or 1/^ X

I/; <r D =; c

a.Co c

a. C

or K

c

z c

a z I o

o l_) — Z UJ Z >- ^ Of

«- (_) UJ U-' 1/1 "I r UJ ?

u. ~ Q. —

«r •- I- > I- Z K C - u_ •- I- z O < l/> U-' I <

ar a: u

U.' u. UJ UJ

I- t- U _)

</) I/) Z _J

>- >- - c I/! to I/) (_)

I-. c

I I (/> UJ Ol u. O O 15 < «I <

a a a. < < <

t- K (- c o c

o

- o

- - • - o o

o o o o • o

o o o o

-"-J-J-Jai-) oec cCcDeoeD

3C

>

c t/> o (/) (/) o o o o o o O o o o O O UJ C Q

U. o c c Q o c c c o o

O. IN Z O O >- u. UJ o 1- X c oc

1-1 Ui UJ -I 1- 1 t- 3 u. CD (J U lO C _J (/I u. o I/) to K a. a. a U <NJ INI (\J (Va (M rg <M fM I a -« -1 ^ »—

'

t- U. U. LL U u. u U. U- U. U. U. U- u. i S I r r z z: z z Z' £ z z » 1/) 1/1 1/! in 1/1 00 to to to to to + • + ••* * + + + + + + + + + C •-' (NJ n CO c^ o IT o a o o o o o O C o O -J ^ «^

\r- .o o -a o •C <j ^0

o

oo

o

oo

O O

o o

c o

o o

c o

r a o o o o

O O O O

O CNJ ^ ITv .O < o o o o o o

o o o o o o o o o o o o

o o o o o o

o o o o o o

o c

J- o

o oo

c o

o

o r>o

UJ PJ O f

o o o o

o o

O O

o o o o

o o c o O O O O

o o o o

o o o o o o o o

O O z-- o o o o o

^ < Uj rsj ^ ^ ^ r-j o o o o

o o o o

o o o o

o o o o
o

oo

z Z U. UJ o o

a. Ci 1/1 > • e c <

O > »- Z V u. >- o

^ >^ oe — V oc O K •I o CD O <_) t- t- CC o

«I => C Of o u >- z z o z

CD C z c. 3 c z Uj UJ u. <

c z =) o z u- —) O a,' o s > UJ I- ts o UJ

CD et a o z ts o UJ a.

1- 1- o C Ol O UJ 1/1 < C a ac « u. h- UJ f) >- o. a e£ Q o z UJ UJ 1/5 V UJ 1/1 z C

Z 1- C U- t- UJ u r >~ ec as (/) 1/1 ec o q: z

•- Z) 3 c y~ UJ UJ <t C CC Ij u. UJ t- c t- -« >- •t 5C O 1- o z UJ z n 1/1 z

ec -J Z X CL <E M >v < UJ < t/) «/l O U.' z UJ O a. -J lU K O t- e K < o s: I UJ (- s: u. c =1 a: o 1/1 IS U.' UJ UJ C CD O O ^- z Z IS

U- u. o z U^ « Q. t9 if < < o ^ O II II II O UJ < X UJ UJ UJ o UJ UJ O -J V Z O o z a »- > C </l UJ UJ z 1/1 Uu c C ^ u. »- — « UJ 1/1 1/1 C X > oc o IS 15 Q o o X < t- sr oj o o IS Z lu 1/1 a UJ UJ < « o; UJ u. CO u. u. UJ UJ IS V- O Z Z O 1- CC ae bJ Z Z K o —> ac < oc ec c Q > O O OC o O O > D O O o > 1/1 z l/l o u. 1/1 Ol o

C UJ Z ill ec UJ UJ ec • ULI Z UJ UJ Q£ ec oc O </1 »/l </l ct => ec ~1 1/1 _j O 1 i<n o 1/1 o a o o o £ O C » UJ >- O C ec o 111 O O Q. O O O u. UJ tu UJ UJ UJ UJ UJ UJ Ui UJ UJ CD V. o

o w < o o < O O (- */> <D «I < UJ u to U 1/1 £ CD CO O >/l isl • rvl M 1/1 O D o o c o o o O m m

-1 HI UJ UJ UJ UJ c < >- C UJ UJ (/) UJ UJ UJ < UJ o O U. UJ — c UJ U. u o U. K- < X K V) X ot O «/> 1 oc oc ec a o (- e O -5 DC 1/1 Z 1/1 1/1 aC !- >- t- »- -> o o

lu-i/iooi/iira

U-OClStJUJlSl-l/l (ij<u.Q.oeu.o.o d:i:coujoc>

(DCDCDCDl/lcDlCcC UOOUliJUJUJUJ OOOQOCCOO

O o

< o o o

< t- » » o o o < o o o o o o o o o in o o o o o o o o o o o o o o o o o o o o o

1/1 c ft- t- 1 1 (M fVJ eo <* 00 fV eo >H ^ t-l p-4 ^ •"i 00 m

tu z «* in u. -1 -1 -> _l _1 _l <Nj «t <M >e 1 _l _l -1 _J -1 _l -J -1 -J -J -J _l -1 -1 -1 -1 _J u _; -J _i -J

1/1 UJ o » <c m CQ CC «P Q. o o CC o. o CD -« « m -J eo CD ffi CD CO CD CD eo X # CD (C CC (C CD CD eD ffi CD

ecc

c<

< a. 3 :? 3 D o D X 3 >- > 1/1 O 1/1 1/1 1/11/11/11/1 1/1 1/1 1/1 1/1 1/1 </) o o o o o O O 1/1 i/> i/1 m l/l O l/l 1/1 1/1 1/1 1/1 l/> 1/1

1/1 t- O UJ o o c o o c O O Q O O O UJ UJ UJ UJ UJ UJ UJ CD O O Q o C uj O O c o o o o

UJ o oc z IS O >- UJ UJ o z t- o c. Z O > Q irt < 1/1 o w o — f\J in ^ in « o oc O UJ UJ -J »- Z 1- CD 1/1 lO »- > O «I o o in >-< C 3 3 UJ > I- UJ UJ UJ UJ UJ UJ UJ c X ~l Irt U- « K C 1/1 -> QC QC 3 OC QC UJ O K C l/l Z l/l l/l OC o o o o o o o C o ^ «t * «* ^ ^t ^ ^ ^ .I- .J- •l- * O UJ t- 1-

1/) U. U. u. U. u. U. U- U. U. U. U. U- U. U. U. U. U. U. U. U. U. U- U- u. U- u. u. u. u. u. u. u. u. z z z z z z z z z z z z z z z z z z z z z z z z z z z z z z z z z

» « 1/1 1/1 l/l 1/11/11/11/1 1/1 1/1 l/l 1/1 1/1 1/1 1/1 1/1 1/1 1/1 l/l I/) 1/) « 1/1 OO l/l l/l 1/1 l/l 1/1 l/l l/l 1/1 1/1 1/1 1/1 + ••• + + + + + + + + + + + + + ••• * + + + + + + 4' * + * + + 4- 00 o> o CM CI ^ U> •o CO o- o fvi ro if\ >o r- CO 0^ O IM 1*1 •f lt\ ^ CO w o ro Z irvirvininintnmir\m>OiO<o <o *C >C oD *0 •c »- o <c >o <o o >c ^ «o %o ^ ^ ^ ^ <o ^ >o >0 ^0 4 <o o « •0 ^ oO <c

Ot/ll/ll/ll/il/ll/ll/li/li/i UJOOOOOOOOC

O O O O 00 >}- rsj 00 <* f>J »J o o o

o o o o o o o o o o o o o o

o o o o o o o

CC Q O O ffi CD

u. u u -> o o

u. u. u. z z z

« t/1 « l/l l/l + + + + m -t \t> o r~

I** ^ «fl *o ^

o

o

o

et z u.

CD eD ffi o o o

o o c

u. u. u. z z z

1/1 l/l l/l + 4. 00 a> o

f- K 00 ^ «0 vO

a cj _i o > u.

OC QC K

U ^ UJ o — o

U. U. U. z z z

1/1 1/1 1/1 4' 4 4' CM CI

00 CO 00

<c ^

Q. -I o >

IX. CD

UJ u. o o

U. U. z z

1/1 1/) + 4- ^ m

00 CO

u

o

-4

O OrM-*-tr>0<UJ(S)<LU(M< O O O O O O O O — <M CM o oooooooooooo o oooooooooooo oo

OCUJU.O * in >o r» 00 o fO >*

fvj Ckj IN (M pn rr, tr\ tn tritn .t OOOOO ooooooo o ooooo o OOOOO o ooooo o

^•«i>»o><eDoouj

U.U.U.U.U.U.U.U.Ii. ooooooooo o.o ooooooo ooooooooo

1^5
FT c (/) < Ct c <r

u. UJ <

(Ci •< u. 0 _i Cs 0

or UJ 00 <

3- I C y >- II u. a: </> \~ <t >

u

1 <

Ofc z

UJ

FN 0

0:

Uj

Of c

ac D U. s: s: C < 1-

t- 0 c on < z

»- >-CQ CB UJ

1/3 UJ

!/, C

cc X

Uj

u.

Of UJc

t- C < z

</> 0 U-' IT z 0 H UJ < u. vo T n 0 u. Q. < 0 or y Lj 7 a. < UJ < U3 UJ 0

C u- 0 UJ _l UJ z z t- u. Z of z — (D u. _J UJ UJ UJ «I c u. a

t/l 5- Wl u. a 1- (- z C

T n t) er C Z X X UJ t5 z z z

UJ z v> u. 0 UJ Uj —J UJ UJ

V. t- _J I- on B. X _J u. on u- C «3 z Uj 1/1 on

u. < 0 (J UJ z </3 Z 0. on UJ z C

< < t- 0 K UJ < < on c Z -J -J

It a: cc « X Z t- K Q 0 >- >

UJ UJ »- »- UJ U. X UJ 0 0

0 00 z UJ UJ UJ < 00 z Z

u u. u. UJ X z X X Of u. u. u. 03 1- >- 0 c 0 0 c C3 UJ C D U.' »- 1- K m l- 0 <M c D

001:. U.' UJ 0 -1 < UJ a 0 UJ 0 X UJ > 0 0 CS UJ 0 UJ UJ UJ UJ on e ^ (/i > oc > UJ < C 0- t- oc > 0 < 1/3 on on on Of UJ > 0 UJ cjc UJ Of Of Of > UJ UJ UJ Of of

_i u. UJ U.1 (£ 00 T < > >• 10 UJ o£ t- UJ u. u. UJ UJ < _1 0 Of 0 c 0 cc a 0 -J UJ u. UJ (O < UJ 03 cc CD u. UJ t- UJ a; uj a cc UJ UJ 03 (C Lj sr z a z Of z a. UJ Z z z > cc cc a oc l/l ac 2: X 1/3 03 03 03 >- 03 s; Of) u u. < I/) m 03 OD O) (O 03 m (/> cc CC 03 w as: a: < 0 < UJ 3 —• -^ U. OC n u.' X OC QC cc a T3 on UJ 000 0 0 0 UJ ai UJ UJ 3

>- 0 0 (X z z z 3 I/O D on z a. UJ 0 00 on 0 Z Of Ci c 0 c 0 C c of 0 c % z z

on to

UL UJ X

UJ C X

UJ m0

c - z • Q. z 0 0 0 c c 0 0 0 0 0 0 000 c c 0 0 < 0 0 0 0 0 0 0 c 0 0 c 0 0 0 0 0 0

t- - * "O fM U. >t ^ — (*> <£> «t —1 IM (M rvj u. t- u. 4- IM rsi (NJ M CM

—1 -J -1 a: -J -1 -1 _l -1 -J _l -1 -1 -J -I 0 -1 _J X 0 -J s: _l _J -1 -J _l _J -J -1 _l -J _> _l « IS IC IS </) 03 OS 00 (C 00 CD 03 CT. tC 03 SI « IXJ 03 cc on UJ CC « on « CD CD (C (Q S) CD 03 CD CD ffi cs CQ o: CO CS

< IS z> 3 0 =3 I »- 0 on on on ec t/1 on on on 0 (/) on ononont/3»/3wnc?X on on Of X on 0 of 0 on 00 C/1 to t/3onon«/)t/3*/>i/>i/)ont/>i/3

on u. Q C C C C 0 c 0 UJ 0 C C C 0 CJ 0 u. t- 0 Q 0 C UJ 0 UJ 0 0 c 0 0 0 Q C C 00000

UJ X -J 0 IX. Of * CD X < > >- on X lf\ X u. 0 < UJ X < -J fn Of rj C -H ^- Ol 0 on _i _i 0 U. 03 Z > y~ UJ > 0 0 UJ UJ Uj > 0. UJ UJ UJ 0 z: > z: Z of Z Of z oc > z Z Z -J > >

1/3 cc: C CO >/> cc z Z z of 3 CC 00 t- Z Of u 0. 1- z < Of cc CC' CO cc 03 00 0: Of Oj CO 03 > 0 0

h- 0 0 on ^ <!• •1- * u u of u a •* >t X <r a Of on u u 0 l_> l_> 0 0 >^ ^ UJ UJ 0 0. C 0 0 C ^ on 3 on ^ -H UJ t- on on ^ f—

(

0 0 0 C3 Q 0 — C 0 c z z z

on u. u. u. u. u. u. U. U. u. u. u. u. u. u. U. U- u. u. u. u. u. u. u. u. U- u. u. U. U. U. U. U- u. U. U. u. u. u. > z: z s: s. s: e: X. z: T z s: s; s: s: s: z: z: z z z z: z z: X z z z; z z z 5: s: z: a: z z < l/l CO »/> on on on (/) on on on \rt i/i on */i i/i on on on on </> on 00 « 00 on 00 on on t/3 on on on V3 I/) on on on on I/) + + + + + + + 4- + 4 4 + + + + 4 + + + + + + + + ^ 4- 4 4 4 4 * + 4 4 4 4 + 44 0 N- 00 i/> 00 c 0 r>j d * u> 00 0 m -1- ir 00 C 0 -J fNj rr in .c r- 00 (T C CO CO on 03 0- a 0- ff CT- 0 o> 0> c 0000 0 0 0 0 0 <\J C\J CM <N CM

Of 1- <o 0 ^ <o •0 •0 •0 <0 ,0 -O <c <o 0 -D r- r- f- f- f- r- ?^ r- r- r- i>- r- p- r~ r~ f- r- po o o c

0 * < u 0 <t 00 o> 0 Q UJ .t CO o> «* 0 0 IM 0 u 0 0 000 0 0 0 0 0 0 — '-=-•-< IM fsi fv) IM IM 0 .-^ ^ .—

<-4 i-l ^ ^ i-i iiJ 0 0 000 0 0 0 000000 0 0 0 0 0

0 0 000 000 000000 0 0 0 0 0 0 0 000 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0

OUJU-O-*-0D<OUJU_O-'<M-*n0C0 000—t^'-''^'-'—<>-*IM(M'^lfM(MIM OOOOOOOOOOOOOOOO 0000000000000000 OOOOOOOOOOOOOOOO

U6
«

err oa

>- 1-

ce< c O a: Z Cj 3UO U.- CO ec e> ec

tc o D a ^ z X

-i UJ

K

ss. o

u.

O Z

U.' uu

O CO _i

tt o oao »• < u

-I UJ UJ < X ac

ero

>-

us o o <

Uj ui

«/>

X oo• c 2 >.>

Ol o XD T

ec ec o c

«i u.

z:

u

tU UJ

r- ar o

V.

»- e

UJ UJ a c5 V

>-

r o ci

K ^ « »«

toa

C 3 X

ee cuj O 'UJ I- u o H (/> UJ C < >-

acK

O v>

U-oeo>*ooo

UJo

tc<

UJ «/> a:< oc z UJo

a> < O UJ

z:3

ec > — ec

»- -J 7 O UI >

Ui ec

ec tnC

«: >

ec u. UJ OX o o

UJ

u

</> UJ

z> ec o

«M

UJ z U. ^

u:O » CD

u.r

u. UJ oX

O </)

(/>

O UJ o X UJ ec z u o UJ

l/> oc

X ^

f- 3 3 O O (0 u. u.

>• z z < in vt * * * O —< CM O z in in <r

ec

K ^ ^- ^- o (O uUJ

ec «M o

ec o

u. o o X o o < o o

eco < o«

UJ UI K oo o o z

UI »-u a UJ

->o oo • . o o

«D « O OD

U _) I- o ^ < o o u

UJ o UJ oi > z

UI > > > Ui z ec tc ec t- ^ < UI « C UI VI z >/> u. i/> ec

</) UI » UIM

O ec z UI ecu Z CM o > - N > - - ••>-»o-<ec o • o.o oc o o u

ao(M<#mfMZ<M<c</>u. .J^_i.Ji^ui^_j t z OeoucOA to X « l/l

19C>>>UlUJOZ»-OOZZt^ UI_JKZKMCDV)t/)MMl/>>

i/)u.acHOi/>->ocec3acOec ^.^.^.^-^•^>^-^>^^^-Kr> UU.U.U.U.U.U.U.U.UU.UU zzzzzzzzzzzzx

(«t ^ in •o ^.ec o> o rvi

m 4- in ininminininin4<o«<o<e>o ^ UI fM > z > > z 3 ec UL r» -J i«- ^ O ^ -4 u > u. u z z z + « r> OS 9-

«o ^ <o ^

^• ^• r-^ >

4' O -4

to

u o in o o o o o o O O <M 4' in 4 < UI (M « UJ (M « U <B CO U UI 4' o o o o o o o o rM N (M u> in mm <o O O O O O O O O O O O O O o o o oo o 8 0 o eo o o o o o o o o o o o oo o o e o o o o o e o o o o o o o oo o e o o o o o o o o o o o o o o o oo e

147
^-UJ z

</) UJ

u. z

u.o

<

X

t- «/)

UJ

I-) «/) a:

z> D o

C I/) <

-J

t- o z c (/) u

UJ

en fvj Of u. C

z o

1/1 < o

(/I o

< c

CD <

UJ

UJ X o

o o u

z

ai fa. o a. lU < -J

CQoo

o

-J

>- K

a< o

c a z o

3 O

O UJ C Of

tt O

O u. X

>- oo

• o

z >

O UJ >

UJ

UJ

Q- I- «- >- _J Z X OC ffi _< 1^ o

D S O </) O

U. O Z UJ «

UJ UJ p _J C 1/5 _) U.

OC C Z OC Z UJ 0^ UJ UJ O £2 c i: Q

< o o <

_j UJ UJ UJ Uj < I C I/O X

o o o

(VJ (VJ ^

U. _J _I -J O ^ A A 00

UJ UJ

CL O

>- z

o • o o

UJ O

< » OJ

t- Irt (O < V c C I/) "7

cc OC < «I

I- t-

</) 00

OC ac UJ UJ o o < <

U.' UJ

OC OC o

o

. . o . o o o

l-H ^ ,f 00

_I -J -J -J -I m 00 Q. o o

oo

- o

o o

•1- -t

oQ a

<u

O Uj UJ z y s:

>-. < <t z z

C O I/O «/) OC O O

OC c

UJ O O X

</> UJ «l u. o o; O Z

- -

00 fvj * •*

00 — _J a >- r

UJ OC «. >

uo t-Z OC u. -JO. Ui O

c

5> XO _l C « < Q O

UJ UJ U. >

> Ui >

QC I a OC K

UJ H C UJ 00

00 u. in cc U' UJ "H

cc Z UJ OC u. z

o

»-< Z <SJ >0 -I _J U-' -I _l

ffi CD c>

>

QC <NJ CO > ^ OC

U. CO

jr ->

00 u.

3 OC :3 O

l/)Oo01^00t/)tO(/lir>l/>l/ll/>t/Otrto^lrtt/)t/>UJ*/^</>OOC oujcooooooooaooooooi/ioouio

QC Z

e UJ X -i

CO 00

-< M (<1

ff*

00 u. CO <o

OO I/)

>-ujujazt»ocz

-ii-i-ieoi/ii/i*-"- 0CKO00-5eCQCDQC

COCDCOCOCOCOOOOOCO

I—l)-l^r^^r^«^^f-H

UU.U.U.U-U.U.U.U.

{^c^c^c^ooooo

^r^h-f^ooooooooco

t/7l/)»-<_)UJ«M_]> QC>>X>>Z OZOCZSOCU,^

oooDoooDjsoeooo

*—<»-»0—<—

U.U.U.U.>U.U.U. Z £ Z Z Z Z £

1/100</»00» CO (/) 00 a>vor-ooo-o-<rvim OOOOO-'-'---^

cooooooooooocoooco

CO 00 O CO o o

o o

o o

o 0(M>firt<o<ujrg<uj(M<oco^p- O OOOOOOO-^-*i-««NJ<\irs)l0C000 o oooooooooooooooo o6 o

o oooooooooooooooo oo o

o oooooooooooooooo

09 <

00 CO o o

o o
o

o

o o

< < K

UJ O

UJ U; <

i/i f >

-1 IT} c UJ > iC c

e- ec rH z y- < u. UJ z a: a C Ul V.

>- • U. z OD > o

>- K z o < t: ec c «/> =3 «- -J < Q SI o UJ z 1- Q. c a >- ^ • o l/l z

5- O X >- U -J V) U; U. V) ^ o o < >- < UJ > C (/) D U.' o o Z v; ec >- >-< u. CD a. eco

O

e z Z

a ec c oOf _j o

c ec ec < s: (- UJ UJ UJ < < e

a. C o z: oc < K K Of o < o u. u. O t; </) < < X 1- o

X a UJ u. « - Z O UJ to UJ > u. C Of O oe z o >- liJ -J z X CD • -J O UJ _J o D ~ X m

-J lU u t- u 1- VI K -J U.' a. <

r> SE ts V, O U. UJ z M U.' </l O _) < C t- o u. UJ

u. o y ai «I a. o c Uj of a. Ul < z z < Z _1 t5 >

UJ u. o -J > z c UJ V Of O -3 < o « 3 z c

-J u. iC O C K o « i/i t- e o o o a-

»- »- </1 a UJ O O - < UJ » </) _l UJ _i o »- o z OC O D ar > Uj UJ < c 00 s: 1/1 -1 > UJ Z < o

Z UJ Of UJ UJ oc UJ ec s: ec H- o ee 3 -1 -J «I z o z

c o c U: 1- UJ 3 UJ i-i o > (/> o z < >- z UJ z o

» < u o < u o lA (-0 _1 z > O •* O U. 3 t- O D V) < V) o >

-1 UJ UJ UJ UJ Ul c < >• Ui O X UJ 1- t/i O UJ I <I z <

< I ec </) X of o iy> ec > c o > O It »: » h- » oc o o

ou

o o o o o c o oooooooooooo V)

»- (\J «t (M < ^ m P.J (M CM CM rg <M IM

UJ Z u. -J -1 -J -1 -J —

1

.J -J -1 -1 -1 -1 -1 -1 _l -t _l -1 -J -1 -i <A Uj o « CD CD CD CD m a o IS o u ffi OD CD CD OD OC CQ (S OD ffi (S (D

U.

IL UJ O

< z> X CO O 1/) V) in to in lO VI VI to VI VI V> V> VI VI V) VI VI to VI VI

trt C UJ c o o o c O o o o o o o o o o o c o o o D Q

Ul Of z O O > UJ UJ o o > O V) oc O X UJ <N) D O o UJ UJ J »- X > o UJ K K O VI < a. Ul => > D z

Of I _J 1/1 u. of O t/i a. > c o > > z c z V) _/ z OC u »- s CT> a ^ 0^ ^ 0> o> o> 0^ Q< Qy 0^ (^ a> <r

Z3 cV. u. u. u. u. u u. U. u. u. u. u u. u. u. u u. u. u. u. u. u. u. u. > z: £ X z a: X X X X X X X X X X X X X X X X X £ < to 1/1 i/i »/) </i to m to VIVIVIVIVIVIVIVIVI V> V) VI to VI VI

•f + + * -f f + * + + + + + + •f + ^ + +

f- m «!• tn <Of- <D a o — <\l CO in CO o X f*1 fO l*> (*1 rfi ^ \r\ in If in in in ir. in

ec 00 00 CO OO OO 00 00 OO CO CO CD CO CO 00 oc 00 CO CO 00 oc 00 CO CO CO CO CO

ooo

o o (M ^ in <e < U; o o o o o o o o O o o o o o o o o O

_l o o o o o o o O

o o o o o o o O

o o o o o o o O OOOOOOOOOOOOOOOOOOOOOO OOOOOOOOOOOOOOOOOOOOOO

^ CO o UJ o CM

CO ro en m * O O o o o o

o O o o o o

O O o o o o

o o o o o o

149
o

? —

1

u. X u.

s: c

Uj o e

3' >- n

UJ >- UJ

a: _J o >

a: > a: o >- u.

(-> z u. »/i » o Ol c a: ec o • c O

>- -1 z > u. a — — >

«a o to e u

^ o UJ 00 u. X Q ~ e. ^

o > D £ </1 eo ^ a o o o _l o e < u. » UJ

a: a o s: >-< KTi o c 1- UJ o ec UJ U. O

a >- UJ u. c 5- -J Uj >• o sc o t- < O UJ

_i a; X oc ec <M "V < z z ~

-J o o K 1- u M U. SCO (/) O UJ Ol a cc to hu. o z UJ < Cl U V <r < o a. z o

u. uu D -J >- Z O C (- t- :r UJ 3 z

O _J U- <I U.1 </l I/) «- z: C

K 1- 1- </l Q. y z o

z c z a o 3 s: < Qt Q Q < o z

Z UJ 0^ U-' UJ of UJ Z UJ UJ « a oc < 3

i5s:cz:oc "u-'i- a o 0£ C O c O O O < (J O K 1/) ID < < u; o o » u -J UJ LU UJ UJ UJ o < >- C UJ UJ to UJ oc O o ^ v, a. </> X a K o I/) QC a Z> a. z <

a.UJ o o

O o o < - . . . . O " • • o

UJ o o o o o c o o o • c

1/1 M rg ^ -H ^ 00 ^ CD <M M

Ul z U. _J -J -1 -1 -1 _i -1 _i «J wj -1 _l -t -1 lA O * ID CD CD CD CC Q. O o !0 a o ec u CO «

u. s. LL UJ c V- Z> I LO O I/) i/i i/i to i/i </> 1/) lO to to to to or O UJ o Q O O O O C o o o COO O UJ

UJ a. z O U >- UJ a> o z c o z z U. 1- o O UJ UJ _i K z; h- ~ (C »/) </5 »- o < O

X -1 1/) u. a t- c (/•, £t a X o: a z < 3 o o o o o o o o o o o o o o o o o M tM CM (\J <N CM (M <M ru csi (N) PJ (M M fM CM O </> u. u. u. u. u. u. u. u. u. u. u. U. U. u. U. U. > z: z X s: r z: s: z: r z: z z z z z z < t/) i/) uo i/> wo i/> »/) </) to </) c/) to to + * 4 4- 4- ^ 4 + + + + + + + +

1- CO o> O -J <Nj in o r- eo O (M o :e CD QO CO 00 CO CO CD 00 00 00 <7* 0^ oc h- OD CO ep 00 00 GO CO 00 CO 00 CD 00 CO 00 CO 00 CO ou

ID

a. o

o

u. C o o 5: o o o <t o o

u

a.

I/) c

< o

<

LU

Ul X c

c o u

O 0»M-*ir*<UJ<M«UJfM<00 O O OOOOOO ^^.-l(\J(M(\i >! O OOOOOOOOOOOOOO OOOOOOOOOOOOOO

O OOOOOOOOOOOOOO
C IL CI

11! e

UJI 2

I- 3 I O I >- S

ec to ZCui

c z

a: lu o X o o

LU UJ

OC I/!

C3 U. <r Q. _J >-

a: C

UJ K D O < O

UJ UJ X a.

Z u.cQ

• e — >

CD C \ o

X z

c ac c

OC ot ^ u o t-

<r u. a

i: C o a.

u. u.

1 s: G I

I- o <

2 O C U. — < O

l/l Q. 3 5- T

» UJ I- • U, >- O

O K 1/) Z

O < >- UJ K O »/> _i

1/1 1/1 to QC 1/1 of a C a c O OC C a

a Of or OC

a: UJ QC UJ UJ UJ

a. c u. c V- ^ Q tI <: 1-. ». < -.

i/i

eco

_i O

UJ UJ

«/1 2

_J < D I > «_>

C Uj OC C 3

O OC >- V <

UJ QC OC

O. < < t/l >- QC QC »- ai UJ u. a a o

CD s: X O UJ UJ o

(- t- 2

O

OC l/l — V

O l/l LJ ^ UJ O O- <I to l«J Z _J •« z c

UJ o a UJ t/i UJ Z U- o >

< u.' UJ 2 ^ a: £ 1/1 I/) < UJ (_) UJ

OC "H < UJ a C t/i UJ C OC -J < -I UJ

Q. Z U. U )- (B OC

O — o o o O o o o o o

o o o o o o o o o o o o

>/) OC UJ »- ;» sr <M

U, z u. -J -1 -J _l _l -4 -J CD O CD m _i -1 -J _i _l CD m -i ffi CO

I/) UJ </) -1 o * CD CO CD CC CC Q. (-) IM •o CD a; (D IV IV CD fM pj

U. £ — o

u. >

D At o

a <

I o i/i O to 1/1 1/1 1/) (/! 1/1 t/) l/l l/l I/) 1/) l/l l/l to to CO l/l l/l lO 1/1 co O OC o UJ O o o c D O c o o o O O o o c o o Q O O Q

UJ UJ 3 UJ OC > OC 2 o o >- UJ UJ o X -J (C c O 2 2 lO O

U. O UJ UJ _J t- s: ts o <I u OC z OC CD OC _J UJ -J >

«/) OC tr. z X -1 to U. OC c l/l _i > o Z3 K </) o. a Z UJ t_) c CD OC t- w UJ C X X P>J PJ pj IV <M IV) rv f\J IVi IV M IV <v <v IV IN (V IV C to U. U. u. u. u. u. u. LL u. u. u. u. u. u. u. UL u. u. U. u. u.

>- a: a: s: £ s: s: T 3: z: £ £ £ £ £ £ £ £ £ £ £ £ £ £ < « * to l/> (/) IJO to (/) (/> (/I i/i l/l to lO I/) l/l lO l/l 1/1 1/1 t/) l/l 1/1 l/> in

-J + •• + + + f + + + 4- + + + + * + * 4. 4 4

>- ^ in 00 V o N- 05 c^ o M o CO O- O o s: p>j (NJ IV IN <M M IV fVi n m ffl m J- ec O' o- o> a (^ (7> 0^ 0- c^ o> On 0^ 0> 0^ C- 0> o>

o o f\j •* in <o < UJ M «t < u o J- 1/1 •o p» c^ OD o UJ o o o o o o o o o IV fV IN IN (V IV IV IV IV fM IV c o o o o o o o o o o o o o o o o o o o o o o o

mi o o o o o o c o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o

o o o o o o o o o o c o o o o o o o o o o o o

151
tr.

00

00

—t f—

'

to cr IT

J- ec r- 00 cr

lf> CM in in CO f-

•t m

00 e o >» cr

o- .t (V to pg

CI * » • to to c rvi to to «*• J- 00 CO in

ir> «* OC o

»t c: ^J u. Z u. o _l to • -3- _i vn cr z to _J 1— X u.

<C 0- u —

oc to c •t CO cr o ' <r -1 -0 o to f\l to C in cr >

J- c L- CC c to U. to U- f\J in u. r-

•t .t o J- o u. z U- z 0- p\< ^ • z OC

(\J IT cr o OO >- a. U- z oo z oo ^0 o Pvl 00 UJ pg X U- o OD a z 0-. oo » cr to CM in

h- s: oc ro UJ O •c oc UJ u. X 00 Ps- o pg o 00 z

u. oo u. C 1^ a o I— z u. >t o o •J- < .c m <0 00 gj in O PPI ^ oo

U.' »—

1

z: CD — « o u. c 1/1 1- a m in to » m 00 c r>- c»o cr in 00 to ^

c -4 u. c 00 <\J o »- in z fV.' J- to c •O PVJ - UJ <J to PVJ o • O 00 cr o r- o CO ^ CO • ^ CD * pn o u- X (_/ -1- t/0 U- u. m in >o CC • «t C -J- to » < UJ cr r- pg pr in 00 »

C\J CD z: ro o z z en <SJ in >0 o %o c C\J PV U- r-- to r- m oo ^ 00 pg • 00 • o fSJ <0 » I/O <i o- oo < m *" in UJ CM -J- PPI to m. c oc CSJ » pn to UJ <M O

u. o ITi CD 00 o m o to UJ • * OC 00 to < to to » O - » » PSI OH to —I c o CM -t o •c o t- * in o U. pg u. * (M ^ in to

2" 7- > U- r * o J- - to z o > L.' to y z to >.

(E —

.

ID z: <_) o c • C IT. .0 to to CSJ >t oo OC OO U- K oo oo >- I/O t- o

CD o <x UJ U- oo oc «• »j o- UJ I UJ c UJ in a to >r OO Z </> z c H- > t- oc c u » D CD C e U- >c o o K u. cr Z P c •a (o u. -s- > O oo > > QC UJ U- c Of UJ ec < cr to 1- pg

c- u. o u. U- 5- ec Ci OO Uj UJ UJ o O _l z Z to oc u. u. u. Z r~ t- to CO 00 D C Z 00 >

u. s: Q T. oo uo oo K O o <i o oc Z _J z Cl 1/) u. u, 1/1 u. z z _j to c 00 to (J. X a uu 0- (T

s: I/) u. 00 O f<0 UJ <3 U- u. _/ o 1- CS,' <\i to ,1- _J z oo OO to u. 00 u. U- >t to <r to z to to z

m CO z; ul z u. o to to to U, to •1- 00 u. u. U. to Z u. z Z 0^ u. to U- oo U. U. Uj Q a: >c oo r I/? 1- o u. to u. to u. u. Z U- to z z z U. OO u. z oo oo Z u. z Z Z _1

I_> o fCl I/; - oo c z U- z u. z z oo z U- oo l/> 00 z o z oo • oo Z 00 oo oo pg

00 a o O u. o oo o u. oo z 00 z oo I/) l/l z o p~ 00 r- oo CM v. u.

-J- IS) u. oc z: o oc a >- z oo o-. 00- J- o r- z o 00 « z: u 00 -J c oo oo r- — cr <c pg wo

CO 00 00 z: <NJ - cr cr u. > u. OO - in •o >e p\. to 00 to

J- oo <C ITS z o z 1^ r- O vO PvJ nj o CD O o o m pg CO •O fP> 1/) * < £> C o CM •D 1/1 u. oo u. o •o O p\j • m in <0 PM o CO 00 LD in m » ro >t

1/! u. u. o t>- >D z Z r- «e o « in CO to < >o O PVJ •£i in • <0 oc > UJ 00 ppi 00 < CO oo

t- O o u. -1 <0 oo 00 •o in <Ni in f~ o <0 « "C in - (M Uj r- < 00 • CO > to • • 00

UJ z z - u. ISI CO o UJ m <v Ifl » IT <o - >u o •> to Uj » to l_) CM 00 to 00 o • 00 » pg * pg

t/l \li UJ fVJ .0 CD K c • pn in * < PJ - o PVi 00 PM Uj o • in pg • to ^ a- po o

u_ a. a: in r~ irv •• c cr Uj «. U- to to ^ CSJ l_l to • * pg ^ u. - PSl »

u. UJ u- —J •> <SJ CM 1- in cr < to * l\j •a to O to CM PSI CD Z Pvl to ^

c u. u. _J O u. c >f >- o 00 u. U. •J- to to to z c >a- oo 00

UJ Uj u. Z u- cc £ z: u o o r * D U. < cr UJ Z to > 00 o O -J o ts I a. a m eo oc UJ UJ <T a * oo UJ 1- CD o o z J- QC o OC >t o u. _J Z OO pg z > I/O Z! O X to UJ -J

1 o O Oj c C 00 2 <NJ O O O UJ Cl o o Uj K > 00 to > -« D z u. Uj ec > Q CD z oc 3 _) u-' C oo O

00 Q c o u. u. u. u. u. l/> u. o OO CM O U. Ct to U. I/; 00 r- _J r~ oc -5 00 CD C> l_) U _J 0^ a > C5

4/) z U. U- c SI £ U. z •-J t- oc 00 & <NJ to UJ -0 z u. -J- u. z >t ^» 3 00 to to (J> cr a to cr _j C u. z: s: u. (/•. 00 s: oo IT oo O 00 L- u. oo o o o _H to nj u. •a- 00 z Z oo u. to u. to r~ u. U. 00 to to U. U. to uI/) cc UJ </) I/O 3; 00 c c o u. o s: s: K z c to u. to to U. Z to 00 u. oo u. z u. Z U, to U. z z u. U. U. Z z u. pg

t- c (/? o U- r- OO 00 a li. c. u. U. z u. li. z OO U- U- z z CM oo Z 00 z u. z oo 00 pg z Z Z 00 oo z u.

oc oc oc a C z o u. z z oo z z oo z z 00 oO oo 00 z 00 to OO 00 OO oo z O U-' U- U- u. 00 o t- a 00 z 00 00 oo oo 00 oo oo oo oo

00 u> 0^ z: z z: u. u. o oo

«I Zj r- CM CM oo oo i/i z: c o> z U- U- u. O to ly. Psj _J < »^ f~- o f- 00 r- CO rsj •0 I/O z z z n r- >c in r- PO « PS) O PPI <* > f>- 1^ r- 00 00 00 cr c to > * PO .0 • <£, cr in a- o in pg o O to (PI O in in in ^

Q « ,o o o >0 o -o o c (M IT. r. o .£) in cr - .I- UJ vO r- m r* o o cr 00 CO CD c >j- m CO 00 PPl to

ct I u. - <_> CM <\j » o l«". f<0 fvJ in o -0 •• ^ J- to c «0 < to <o > r~ in p- » » oo 00 oo • » CO f*l n 1- u. o -J- o CO o — -o r> m m m o <e to rg O to u < •• < r- oc UJ CO > » .u UJ »to o o U- (M or CO •o • o in < m m UJ o pg rv 00 c in tooofsi<JOf<opn<o »

tu z J- t\J \r -* o — . r~ CO < PvJ o » < PM to to » m <o . » pg • <

oc UJ —' (M >! 00 oo O (Si J' to » to PM >*• •* CM •a- pg pg PSI >t •• _l o o o o CM nj nj CSJ CO fpi <»• <t 00

LL UJ p<- CL -J O X < UJ o PvJ 00 X o UJ

s- o _J QC oc z Cl > fsj UJ m 3 IM Uj > X > PPl > D t- z oc Q <M UJ Z Ui pg Uj

1/) CE Z O CO cc l_! o Q. u. Uj CC rg U5 O z UJ UJ z z »- > OC IC c Z to UJ c oo 00 > Cl >- UJ 3 > Z U.

(_) OJ OD UJ X o • < o c z UJ U.' UJ oc t- 1- z J- oc oc J- OO r- CC oc > X o ec oc to n _i z oc K t-

-1 c O <-J o c OJ z o <*• o- <M 1- — 3 z > _i OO 00 —J PSi PvJ O 00 •t a- to J- -0 1^ oc CO Z 00 CO S 0^ c cr <^ o

o U- CL O u. u. U- U- c Cs U, 1- h- u. UJ D z o UJ o o <SJ to u. u. to u. u. r- to r~ r~ 00 to to oo to to to to to (M

(/I <E s: U- U. T. 5- z: i_) o z: u. U- z -1 UJ UJ c IX. u. U. to J- z z u. u. z u. to u- u. U. U. to U. u. u. U. U- u. < X ac </1 oo OO 00 o or ec u- oo s: z oo o 00 OO o u. u. z u. u. z z u. oo 00 z Z oo Z u. 00 U. Z u. u. z Uu z z u. z z z z z z

(E > I/) CO oc u. u. UJ oo 00 u. o z z 00 z z oo oo z U- 00 oo 00 z z oo z z l/> z oo 00 z oo oo oo I/) oo oo

I/) U. z; 5^ t- z u. u. a. 11. oo oo 00 oo oo z 00 oo oo 00 to oo

z: 00 00 ec oo z z z z 00

oo oo 00 oo 00 oo tu o O 00 U. CD (^ f<0 to in

CO a -< (\J CO (SJ z: o> cr CM <0 cr cr 00 CM to n o to -1- r- ^ ^ 00 CSJ to r~ X >o oo r— r- •o f/) *o ^ •C r- m to to J} •o <o 00 >c & f~ to gj in 00 pg o o r- J. m -a- <a- in -a- * >0 ^- » <o <l CO PsJ in o o >0 <0 in r- c - <o J- in N- in in 00 co 00 ^ CO 00 00 CO 00 CO o o CD -t Uj » cr c in m in > o in 03 o - o sO O K • f- 03 . • f>- o f~ < o (v; CO * c uo O ^ CD cr cr •4- CM PM » •o o c < CC o u pg » as < «i ^ • o fsi u. pg ^ O

UJ u. u. •O -> 1^ CNJ o m m to CO to U- to PM o m in UJ 00 CO pgaoof^^pgtocopg

Q. o o o <^ » in o

O. >t rvi -o rsj CO >o >- PO - p\j to to ^ to eg 'O pg po CSJ PsJ PSI pg ^ to <

o

rvj

-1 u. a M C o 00 « > rvj >o > z >- > > l5 OC t- < OC D t- pg sO 1- UJ z oc ^ > O —

1

> Z to UJ et Q 00 to U to

oc S D oc z z _i m CO CO Uj u. UJ 1— i- o (J > UJ UJ t- UJ 1- —1 O X O 00 UJ 1— OO > > UJ z oo o > > z to > z oo z O > a. ^

CD CO CQ cc CD I/-. >• r> c o t- C O (O UJ _i z -J oc o u. CL OO c; z z OC C£ ot OO 1- C X 2 00 U. _i oc oc K C to H oc 00 >

<_) u o o UJ I/) o o u in oc — u -1 oo u. cc o o to <N PSi ISJ ^ .* r- 00 CO CO OO CO a> a> w ^ 0* ^

O Q Q c c o z ac oc oc 00 K Z) O o

u. U. U. u. u. u. U. u. u. u. CO u. u. u. u. u. u. u. u. u. u. u. u. U. U. U. u. u. U. U. U- u. u. u. U. u. u. u. u. u. u. u. u. u. u. u. u. u. u. U. u. u.

z. z: z z: s: X. a: s: z: r z z z z z z z z z z z z Z z z z z z z z z z z z z z z z z z z Z X z z z z z a: z

</> 00 (/) 00 00 oo oo oo oo 00 oo oo oo 00 oo oo 00 00 00 00 I/) 00 00 00 oo 00 t/1 00 oo oo oo 00 t/5 00 l/> 00 oo 00 on oo 00 oo vo wo 1/) l/> 1/) 00 oo i/O 152
IT cr cr CJ" 00 pn Pvi cr in cr <f! ^- 00 CD a> O- oo 00 eo QD CM IT. CM 00

m

IT, IT PO CS' CO o p.- J- 00 >j- u. c PvJ CM fpl 0> c P" <t PO

00 o » p. CM CM p'^ IT ir oc oc o PO PO ir CM o PO c m .J- J- < (N tr\ <

PJ PO -< J- PO

UJ o z CM

S" on z u. UJ CM

t~a uo z ^ u. o >- Z _l c PO > o UJ _J UJ t- — ffi IT ^ f-. U- 1- <M r\j rvi _J of t/; O" >!• —> U- (/ z c 1- IL a. C2 o U. U. u. rr, U- J- J- U- IT. z in u. IE O c li >- cc c LL o z z z u. »- z u. u. z U. oo u. z 01 P" LL c u. m

1/1 uo t/1 z o 00 z z to z z 1/1 U- LL l/> 00 z > cr

u. 0^ l/l < oo Vi 00 00 LL z z LL 01 c u.

z: 00 cr f>- z 00 z oo LL z cr z

t/i CO u> PO

d ir t/5 Z u_ on

m z PO PO <M 00 OO z O UJ <0 IT o oo < c m m IM •c c^ rp\ C!

00 00 Psi ro o a PO UJ CM in >l- ^ pr PO o cc

a

CO 00

a cr o- >c IT. o ^ 00 oc PO 00 PO .J- in

«*• J- •t a. Cl CO CM CM CM >t u. CM cr •D pri >o 00 sl- o- o UJ o Pvl PO m <0 r~ o c«o o m pp| f- O oe

CO Ps) PJ «* PO u_ p- J3 -1- in PO PO o <i- PO £> (M J- rvj I- IT ^ < CD CC V, c y- _i PO PO PvJ PO in

oc z ts •J- lO ^ 1 tr\m o o _J _i O u. Q. UJ 11. o UJ -< PO <

u. CD UJ 3 c z z a. o z < e 1- IS z

-J U. wo Z </) h-—1

00 00 z «! _; 1- -5 oo oo UJ z c z: o (N ^ u. -0 •1- u. oc O 0. >t u. in -5 o o: l/> in o »- UJ ? >. fM rg U- U. f\J PvJ M U. z J' 00 oo u. in u. in m m in u. UJ X u. 00 >• z LU tU U. u. z z u. u. U. u. UJ u. z 00 u. z U- z u. u. u. u. z o o l/l S t- >- .J LU oc. < E z I/) 1/1 z z z z z PO z 00 z u. u. oo z 00 z z z z 00 >0 >0 oc p» 00 p- o- O 1/1 W1 v/1 1/) l/l oo 00 oo z z (/) 00 i/i t/l 00 u. u. LL p- u. u. O u.

Csl PI PO 00 oo U- z z Z LL z z z

LL u. z oo oo OO 2: 00 oo LL 00 c z * 00 oo z

I/) CO CO >e oo f-- IPN o O OO OO

(\4 pn <c o c (*) pn PO <» PO

a o CM o PO

CO < a rvj CM CM --1 CM CO

m <r CO pn

00 CO a- PO PO C" o PO PO PO fpl fm « IT) PO 00 < U o i-l PO < in O p» in PO CO

O IN) <M (M

M UJ o < •J- UJ p- o PO < <^ < < <0 ppi fO «-( J- vO Jfl PO PvJ o vO in CD en m o 4- PO

CO z 1-1 l-t cr fl PM PO * t-4 <£ UJ 1- PO «0 O < O UJ o U. o z UJ =) z z o UJ I o > 4 o z > 1- a. > z LL CD fSJ UJ o > t- o u. </> z 00 o o o 00 .J z

-) u. o r\i »-i —1 01.

m c o >!• o: * m ->

a a. r> 1- OC t- o z LU z

ILI

C z (N u. (M po u. c I u. u. -1- ^ 00 u. u. in -5

a in ocm z oc 00

O -i UJ z

PJ 1/1 U. z U. <M PvJ u. z u. J- z z u. u. .I- z z UL in

m u. in u. z z >0

X OC OO (O z LU

LL z in Z U. U. z oo oo z u. oo 00 z Z U. 00 00 Z u. u. z u. z u. <0 u. <o z p- u. »- .J

rj s: l/l 1/) z z 00 wo z oo oo Z 00 z z 1/1 z 00 u. z LL U- z CO

u. i/> CO (/) U- oo 00 oo oo 00 U- z oo z LL z oo LL U.

s: z z 1/1 oo Z 00 z z

</> </> 00 00 00 1/1 V' CO o> 00 f<> m PO o- o 00 o PO in 00

0^ CO o- Psl pj (^m *M PO Psj o> ^ in PO cr o CO PO PO o CO 9- PO c^ <N 0^ -4 cr PO (y cr PO CO f»1 in * tr. in 00 r\j (_> 0> a> >! u < PO CD PO PO PO •t p- <e >t 00 ^

if\ rvj < >e in UJ UJ «i » r- r- UJm (»i o 00 o o o tri fpi CE < m PO <

tu r>J PO 4- PI PO o UJ o > m UJ UJ -1 PO I z z u. oo PO PO

a: o 1- _i z > z o o »- z 1/5 tQ z 1- LJ c >- o e. cc m Cl UJ >- K > < —1 z cs c (/) »- o l_) 1- 00

a 1- > c T o o cc »^ o U. _J a ct a 00 00 < -0 oo oc oo o l/i 00 LL z o o z O (M CM M )—1

PJ PO UJ t_) >t J- ^ inm -0 z in inm _l o oc UJ o UJ

</) r\j u. U. U. U. PO PJ U. u. oo .I- U. u. u. u. u. u. U- u. u. in in u. u. u. U- z >0 _l LO OO _I <M UL z z Z z u. u. z z u. z z z z z z z z z u. u. z z z 03 ^ U- 03 p- CD CO cr

U. </) 1/1 to z z I/; oo a. z 00 00 00 oo oo 00 I/O oo 00 z z 00 oo 1/1 u. u. z LL u. LL U. LL LL

z: </) 00 00 z </) 00 00 z z 00 z z z z z z

lA oo oo oo oo 00 00 oo 00 00

PO 00

O 00 PO cr o m PO >0

C PJ CD cr t-4 p- (T PO cr 00 ir CP! CO * PO PO fo m o — ^ o PO 01 PVJ PO cr O PO p- 00 00 CO 00 0^ PO o PO PVJ PO PJ PO PO CM PO PO PO cr cr PO PO CO PvJ .0 <o vO •-4 CI

m p» PM 00 •• » a< o> PO PvJ PO •• in in PO in o vt <t 00 CO • o < PO CD • • PO o o < Qv <I Q LL 13 PO Ov < CO PO PO PO s^ <*• vt .I- pg PO o in PO < >C P- CO -t <0 PO >0 u. fO ro 4- » LU

PO PO » in in CM CO < o <o •t UJ ^ PO ^ LU

PO J- PO PvJ

13 LL >-C Z oc o CO o. z z O Z O

a >- <J _l < 00 UJ Q 3 — >- i- LJ z — l- I t- — > c o yU LU z C UJ CJ

O 15

O

O

O

LU u. z oc 3 OX Q. 00O t- 00

X UJ C3 QC 00 UJ CD

O

Q oo Z t- UJ 00 z -J .J U- _i 00 o o o O -1 •-4 ^ CL < LU -1 a. a. o: 00 oo -> -> z oc a. oo o a: (- LL oo LL oo IL 00

PO PO PO CM PO PO PO PO PO PO PO •i- >! >»• vf -4- in in inm in in vC vD o 03 P- CO CD cr cr

u. LL LL U. U. U. LL LL LL u. LL LL LL u. U. u. LL LL LL U. u. LL u. u. LL LL LL LL IL LL u. u. U. IL u. U. z Z Z X z z z z z z Z z Z z z z z z z Z z z z z z z z z z Z Z z Z z z z

00 1/1 l/> l/l t/1 1/1 oo 00 01 1/1 00 oo 01 00 lO 00 1/1 oo oo 00 oo 00 00 1/1 00 W1 oo oo oo 00 00 L/l 00 oo 00 153
Appendix F: Removing SMF from OS/KVT, Release 21.6

The following modules of OS/360 MVT, Release 21.6, were

altered using the IMASPZAP utility program ("Superzap") described

in <36> to remove SMF overhead from the system for the validation

ex per iments

.

1. Master Scheduler Initialization Routine

This routine (module lEEVIPL in S YS 1 . L I NKL I B ) is created

during the Sysgen process. Since the inclusion of SMF is a Sysgen option, the generated code includes an unconditional XCTL

to SMF initialization, which must be removed. The changes were

as f ol 1 ows

:

a. Instead of placing option flags in the

CVTSMCA field prior to SMF initialization,

the CVTSMCA pointer was zeroed out.

b. The XCTL was altered to transfer to

routine lEEVWAIT, signalling the end of

Master Scheduler initialization.

2. External and I/O FLIH's

These routines, in CSECT lEAQNUOO of the nucleus, are also

created during Sysgen and include unconditional BAL instructions

to invoke the SMF System Wait Time Collection Routine, lEAQWAIT.

The BAL's were changed to NOP's.

3. SVC 83 Routine

This routine (module IGC0008C in SYSl.SVCLIB) is never

entered during normal OS processing without SMF and hence

contains no check to ensure that SMF is in the system before

performing its functions. Since HASP had been altered to issue

SVC 83 also without checking, the SVC 83 routine was changed to

cause it to zero out register 15 and return via register 14

immediately upon entry. It was later decided to alter HASP as described below to prevent it from issuing SVC 83, but the change

to IGC0008C was left in to take care of any other components of

the system which might issue SVC 83 unexpectedly.

In addition to the Superzap changes noted above, a HASP

"REP" card was used to change the SVC 83 issued by HASP to a NOP.

This was done for all systems, not just those with SMF removed.

The point of the HASP change was to reduce SMF overhead to only

that generated by the OS record types, eliminating user-defined

types such as the HASP records.

154
Appendix G: Chained Scheduling and EXCP Counting

The purpose of this appendix is to explain the variability

of EXCP counts for c ha i ned- sc hedul ed I/O operations. This

discussion will cover both OS, where chained scheduling is a seldom-used option, and MVS (VS2 Release 2 and later releases)

where it is mandatory. Under MVS, chained scheduling is forced

for all sequential I/O that uses either the Virtual Storage

Access Method (VSAM) or the Queued Sequential Access Method

(QSAM). The following discussion assumes, for concreteness , that

the data set in question is opened for output using QSAM.

At OPEN time, access method routines construct one channel

program for each buffer. (For chained scheduling to be

applicable, the data set must have at least two buffers.) Each

channel program consists of a series of CCW's (channel command

words) chained together so that the channel will fetch and obey

them consecutively. The last CCW in each series is a no-operation (NO-OP), with chaining not specified; this causes

the channel to cease fetching CCW's and interrupt the CPU. As

part of the interruption, a CSW (channel status word) indicating

channel end and device end is stored in low core. In the address

field of the last NO-OP CCW is a pointer to the start of the

channel program for the next buffer.

The first time a buffer becomes full, the PUT routine

requests execution of the corresponding channel program by

issuing an EXCP. Each subsequent occurrence of a buffer filling

up causes the PUT routine to change the NO-OP CCW in the channel

program for the previous buffer to a TIC (transfer in channel).

This operation is referred to as "joining" the channel programs.

If the channel has not yet fetched the NO-OP CCW, the join will

be successful, and the processing by the channel will proceed

smoothly from one buffer to the next with no channel-end/device-end interruption. If the join is

unsuccessful, the PUT routine will detect this fact and issue

another EXCP for the channel program corresponding to the most

recently filled buffer.

Under OS, the first CCW in each channel program has a bit

set to make the channel interrupt the CPU as soon as the channel

fetches and decodes the CCW. The CSW stored as a result has a bit on that indicates the occurrence of a PCI (program-controlled

interruption). Unlike other I/O interruptions, PCI's are not

stacked by the hardware; the only result of a PCI which occurs

when the CPU is masked for interrupts is that the CSW stored for

the next interruption taken on that channel will have the PCI bit

on. The effect of the PCI at the beginning of each channel

program is to activate the PCI appendage routine. If the channel

program just starting is the first in a chain of joined channel

programs, this routine does nothing. If it is the second or subsequent, the appendage forces its last CCW to be a no-op,

thereby "parting" it from the one following. The same routine

I 155
also serves as the channel-end appendage; it posts ICB's

(interruption control blocks) and lOB's (I/O blocks) to keep the

PUT routine informed of which buffers are available for re-use

and which are scheduled to be written out. The

c ha i ned- sc hedul i ng appendage routine is cleverly designed to

handle the possible masking of PCI's which can cause them to

occur simultaneously with channel-end interrupts. The details of

this design are given in the description of module I6G019CU in

the Sequential Access Methods PLM (<41>); what is referred to

here as the PUT routine is discussed in <41> under the heading

"Chained Ch annel -Program Scheduling End-of-Block Routines."

From the foregoing description it can be seen that the two

extreme cases of chained scheduling are (1) all joins succeed,

and (2) all joins fail. In the first case, only one EXCP is

issued, and all blocks are written to the file in a continuous

spurt of activity by the channel. In the second case, each

channel program requires an EXCP after the PUT routine notices

that the join was unsuccessful. In both cases, each block

written causes a PCI. As explained in section IV.A.4.b, SMF

counts PCI's as EXCP's, so the number of EXCP's recorded by SMF

may range from one more than the block count to twice the block

count, depending on how many joins succeed. (For data sets on tape, two more EXCP's may be incurred for header and trailer

label processing.)

The likelihood of a successful join decreases as the speed

of the output device increases. In the limiting case of

instantaneous I/O - completion, the channel-end interruption

would occur long before the program had filled another buffer.

On the other hand, a very slow output device might never catch up

with the program, so that no join would ever fail. Note that in

this case all other I/O requests on the channel being used for

chained scheduling would be kept pending, and the tasks that

issued them would have to wait for the entire file to be

processed. Such monopolization of the channel may have a negative impact on the performance of the system as a whole,

although it reduces the residency time of the c ha i ned - sc hed ul i ng

job. The effect of contention for resources in a multiprogramming environment can be to either increase or

decrease the probability of a successful join, depending on whether the process that fills the buffers or the process that

empties them is interfered with more.

The operation of c ha i ned- sc hedul ed I/O under MVS is similar

to what has just been described, except that the first CCW in

each channel program no longer has the PCI bit on. Since no PCI's are issued, the appendage routine only gets control at

channel-end time, and consequently cannot notify the PUT routine

that buffers are available for re-use until the completion of the

channel program. It follows that the number of blocks that can

be written in one continuous burst by the channel is limited to

the number of buffers, regardless of the speed of the device. It

also follows that (apart from label processing) the minimum EXCP

count is the smallest integer not less than the ratio of the

156
block count to the number of buffers, v^hile the maximum EXCP

count is just the block count. Thus the max imum EXCP count for

MVS is less than the mi nimum EXCP count for OS when the same data

set is processed using cha i ned scheduling.

The hazard of channel monopolization has been removed under

MVS by eliminating PCI's, but the variability of EXCP counts can

still be expected to invalidate charging algorithms which rely on

them. Also, since unsuccessful joins entail more CPU processing

to restart the channel programs, another source of CPU-time

variability has been made mandatory under MVS. Of course, the

conclusions of this analysis could be invalidated by changes to

future releases of MVS, which may eventually rectify these

problems arising from making chained scheduling standard for

sequential I/O.

157
Appendix H: Glossary of Acronyms

ABEND - Abnormal End of a task or job step

ACT - Accounting Control Table (<5>)

APAR - Authorized Program Analysis Report (i.e. a known bug in

OS)

AVR - Automatic Volume Recognition (<5>, <7>)

BSAM - Basic Sequential Access Method (<1>)

BTAM - Basic Telecommunications Access Method (<31>)

CPU - Central Processing Unit

CSW - Channel Status Word (<21>, <17>)

CVT - Communication Vector Table (<26>)

DADSM - Direct Access Device Space Management (<1>, <10>)

DASD - Direct Access Storage Device

DCB - Data Control Block {<1>, <7>, <26>)

DDnames - Names on DD (data definition) statements in JCL

DEB - Data Extent Block (<26>)

DSB - Data Set Bl ock ( <5>

)

DSCB - Data Set Control Block (<1>, <10>, <26>)

DSN - Data Set Name (<1>, <7>)

ECB - Event Control Block (<1>, <26>)

EOV - End of Volume (<1>, <11>)

ESV - Error Statistics by Volume (<2>, <3>, <12>)

EXCP - Execute Channel Program (<1>, <12>)

GDG - Generation Data Group (<1>)

GTF - Generalized Trace Facility (<36>, <40>)

HASP - Houston Automatic Spooling Priority system

I/O - Input/Output

IBM - International Business Machines Corporation

ICB - Interruption Control Block (<26>)

lEBGENER - An IBM-supplied data set utility program (<6>)

lEHLIST - An IBM-supplied system utility program (<6>)

lOB - Input/Output Block (<26>)

lOS - Input /Output Supervisor (<12>)

IPL - Initial Program Loader (<13>)

IRB/IQE - Interruption Request Bl ock/ I nterrupt i on Queue Element,

used in scheduling asynchronous exit routines (<4>)

ISAM - Indexed Sequential Access Method (<1>)

JCL - Job Control Language (<7>)

JCT - Job Control Table (<5>)

JFCB - Job File Control Block (<26>)

JMR - Job Management Record (<5>)

JSCB - Job Step Control Block (<26>)

K - Ki 1 obyte (1024 bytes)

LCS - Large Core Storage

MICR - Magnetic Ink Character Recognition

MFT - Multiprogramming with a Fixed number of Tasks

MF/1 - Measurement Facility/1

MVT - Multiprogramming with Variable number of Tasks

NIP - Nucleus Initialization Program (<13>)

OS - Operating System; specifically, IBM System/360 Operating

System

PCI - Program-Controlled Interruption (<21>, <17>)

158
PDS - Partitioned Data Set, or Library (<1>)

PLM - Program Logic Manual

PSW - Program Status Word (<21>, <17>)

PTF - Product Temporary Fix (an IBM-supplied patch to OS) (<34>,

<36>)

QMPA - Queue Manager Parameter Area (<5>)

QSAM - Queued Sequential Access Method {<!>)

RPS - Rotational Position Sensing

SCT - Step Control Table {<5>)

SMCA - System Management Control Area {<5>, <26>)

SMF - System Management Facilities (<2>, <3>)

SMP - System Modification Program (<34>)

SQA - System Queue Area (<4>, <23>)

STAE - Specify Task Asynchronous Exit (<23>)

SVC - Supervisor Call (<4>, <17>, <21>)

Sysout - System Output (<1>, <23>)

TCB - Task Control Block (<26>)

TCT - Timing Control Table (<5>, <26>)

TCTIOT - Timing Control Task Input/Output Table (<5>, <26>)

TIOT - Task Input/Output Table (<26>)

TQE - Timer Queue Element (<4>)

TTR - Relative Track and Record (<1>)

UCB - Unit Control Block {<26>)

VTOC - Volume Table of Contents (<1>)

159
Appendix I: Bi bl iography

<1> OS Data Management Services Guide (GC26-3746).

<2> IBM System/360 Operati ng System : System Management

Facilities [6028-6712 )

.

<3> OS/VS System Management Facilities (SMF) (GC35-0004 )

.

<4> OS/360 MVT Supervisor Program Logic Manual (GY28-6659).

<5> OS/360 MVT Job Management Program Logic Manual

(GY28-6660) . <6> IBM System/360 Operating System: Uti 1 ities (GC28-6586).

<7> IBM System/360 Operati ng System : Job Co ntrol Language

Reference rGC28-6704 )

.

<8> Johnson, R.H. "SLAG Changes to the SMF Data Dumping

Mechanism of OS," SHARE Computer Me asurement and

Evaluation , Vol. II (197TyT

<9> OS System Generation (GC28-6554).

<10> OS DADSM Logic (6Y28-6607).

<11> OS Open/CI ose/EOV Logic (GY28-6609).

<12> IBM System/360 Operati ng Sy stem : I n put/Out put Superv i sor

Program Logic Manual (GY28-6616).

<13> IBM System/360 Operati ng System : In i ti a1 Program Loader

and Nuc 1 eus Initial ization Program (GY28-6661 )

.

<14> Betz, R.E. "Use of SMF Data for Performance Analysis and

Resource Accounting on IBM Large-Scale Computers." In

Computer Performance Evaluation, NBS Special Pub. 401

jY^ffy^

<15> Graves, J.M. "Using SMF and TFLOW for Performance

Enhancement." In Computer Performance Evaluation , NBS Special Pub. 401 (1974).

160

i
Leavitt, Don. "Three Users Find SMF Inadequate in

Measuring Performance." Com puterWo r1

d

, Vol. IX,

No. 39 (Sept. 24, 1975).

IBM System/370 Principles of Operation (GA22-7000).

SyncSort

:

A Ha rdwa re Mo n i tor Evaluation , Whitlow

Computer Systems, Inc., 222 S. Marginal Rd .

, Fort Lee,

NJ 07024 (1975).

Drummond, M.E. "A Perspective on System Performance

Evaluation." IBM Systems Journal 8 , No. 4

,

2 52-263 ( 1 969)":

Buchholz, W. "A Synthetic Job for Measuring System

Performance." IBM Systems Journal 8, No. 4, 309-318

(1969 ) .

IBM System/360 Principles of Operation (GA22-6821).

IBM System/360 Model 6 5 : Functional Ch aracter i sties

TM22-6864 )

.

IBM System/360 Operating System: MVT Guide (GC28-6720).

IBM System/360 Model 6 5 : Operating Procedures

TGA27-2728)

.

IBM System/360 Operati ng System : Model 65 Shared Ma i n Storage, Multfprocessing ,~Prel imi nary De sc ri pt i on (GC28-667TT:

<26> IBM System/360 Operati ng System : System Control Bl ocks

TGC2 8-662 8)

.

<27> Sy stem Ma nagement Re porti ng Sy stem , User Reference Ma nual , Tesseract Corp., 101 Howard St., San Francisco, CA 94120

(1972)

.

<28> SMF Se 1 ectabl e An alyzer , Field Developed Program

Number 5798-AAR (SB21-0047)

.

<29> Feller, William, An^ Introduction to Pr obab i

1 j ty Theory

and It s Appl icati ons , Vol . I (Second Ed i t i on) , Jo hn Wiley

and Sons , New York , 1957.

<30> IBM System/360 Operati ng System : PL/I ( F) Language

Reference (^028-8201 )

.

<16>

<17>

<18>

<19>

<20>

<21>

<22>

<23>

<24>

<25>

161
<31> IBM System/360 Operating Sy stem : Basic Tel ecommun i cat ions

Access Method ( GC 3 0-2 00477"^

<32> System U t i 1 i z a t i o n Monitor User' s Manual , Tesdata

Systems Corp,, Measurement Systems Division , 7900 Westpark

Dr. , McLean, VA 22101

.

<33> Sensor Po i nt Reference Manual , Tesdata Systems

Corporation, Measurement Systems Division,

7900 Westpark Dr., McLean, VA 22101.

<34> OS S ystem Modification Program (SMP) (GC28-6791).

<35> Currah, Brian, "Some Causes of Variability in CPU Time."

SHARE Computer Measurement and Evaluation , Vol . Ill

(December 197 3 - March 19757~pp. 389-392.

<36> IBM System/360 Operating Sy stem : Serv ice Aids

TGC28-6719)

,

<37> Currah, Brian, and Mario Morino. "What to Do With SMF

Data," SHARE Computer Measurement and Evaluation , Vol. II (November 1971 - December 1973) pp. 20-65.

<38> Chung, S.Y. "SMF Survey," SHARE Computer Measurement

and Evaluation , Vol, I, No. 12 (July 1971) pp. 87-91.

<39> Cogger, Alison, "TESTEXIT Critique," SHARE Computer

Measurement and Evaluation , Vol. I, No. 7 (July 1970)

pp, 7-8.

<40> Obergsfell, George. "Using GTF as a Performance

Improvement Tool," S HARE Computer Me asur ement and

Evaluation . Vol. Ill (December 1973 - March 19737

pp. 105 - 114.

<41> IBM System/360 Operating System : Sequential Access

Methods Program Logic Ma nua1 (GY28-6604 ).

162
NBS>114A (REV. n-77)

U.S. DEPT. OF COMM. 1. PUBLICATION OR REPORT NO. 2. Gov't Accession BIBLIOGRAPHIC DATA iqgS SP 500-40 No. SHEET

3. Recipient's Accession No.

4. TITLE AND SUBTITLE

COMPUTER SCIENCE & TECHNOLOGY

Guideline on Major Job Accounting Systems: The System

Management Facilities (SMF) for IBM Systems Under OS/mVT

5. Publication Date October 197 8

6. Performing Organization Code

7. AUTHOR(Sfedw^ary^uurDin,^xoag^^ingeg

Corporation

8. Performing Organ. Report No.

9. PERFORMING ORGANIZATION NAME AND ADDRESS

NATIONAL BUREAU OF STANDARDS

DEPARTMENT OF COMMERCE

WASHINGTON, D.C. 20234

10. Project/Task/Work Unit No.

11. Contract/Grant No.

12. Sponsoring Organization Name and Complete Address (Street, City, State, ZIP)

Institute for Computer Sciences and Technology,

National Bureau of Standards

13. Type of Report & Period Covered

14. Sponsoring Agency Code

15. SUPPLEMENTARY NOTES

Library of Congress Catalog Card Number 78-600113

16. ABSTRACT (A 200-word or less (actual summary of most sigpilicant information. If document includes a significant

bibliography or literature survey, mention it here.) This document reports the results of a study which was commissioned in response to the

need for a better understanding of how job accounting systems work, what they measure,

and how accurately they measure. The accounting system described is IBM's System

Management Facilities (SMF) for 360/370 environments operating under OS/MVT.

Considerable detail is provided on SMF's activity in collecting the data necessary

to account for resource utilization by the individual jobs in a multiprogramming

system and to provide some indicators of the performance of the system itself.

Included within the scope of this study was an investigation of the accuracy, both

absolute and relative, of SMF as a measurement tool and the costs entailed in the use

of SMF. The experimental methodology used to explore these questions is summarized

in the report, as are the conclusions reached. Performance analysts, system

programmers, and users interested in optimal use of their computer resources will find

much help here in the application of a valuable measurement tool.

17. KEY WORDS (six to twelve entries; alphabetical order; capitalize only the first letter of the first key word unless a proper name; separated by semicolons) CoHputer performance analysis; computer performance measurement;

CPU time; EXCP counts; job accounting systems; IBM OS/MVT; resource utilization

measurement; System Management Facilities; system wait time

18. AVAILABILITY [X] Unlimited

1 ! For Official Distribution. Do Not Release to NTIS

nCl Order From Sup. of Doc, U.S. Government Printing Office — Washington, D.C. 20402, SD Stock No. SN003-003-01989-5

1 1 Order From National Technical Information Service (NTIS)

Springfield, Virginia 22151

19. SECURITY CLASS

(THIS REPORT)

UNCLASSIFIED

21. NO. OF PAGES

170

20. SECURITY CLASS

(THIS PAGE)

UNCLASSIFIED

22. Price $4. 00

USCOMM-t3C 66038-P7E

ANNOUNCEMENT OF NEW PUBLICATIONS ON

COMPUTER SCIENCE & TECHNOLOGY

Superintendent of Documents,

Government Printing Office,

Washington, D. C. 20402

Dear Sir:

Please add my name to the announcement list of new publications to be issued in the series: National Bureau of Standards Special Publication 500-.

Name

Company

Address

City State Zip Code

(Notification key N-S03)

d U. S. GOVERNMENT PRDJTtNG OFFICE : 1978 O - 275-073


U.S. DEPARTMENT OF COMMERCE

National Bureau of Standards

Washington. D.C. 20234

OFFICIAL BUSINESS

Penalty for Private Use, $300

POSTAGE AND FEES PAID

U.S. DEPARTMENT OF COMMERCE

COM-2 1 5 V

SPECIAL FOURTH-CLASS RATE

BOOK