mainview batch optimizer data accelerator andy andrews · ar/ctl can help manage your batch •...

40
MAINVIEW Batch Optimizer Data Accelerator Andy Andrews

Upload: trinhque

Post on 27-Jun-2018

216 views

Category:

Documents


0 download

TRANSCRIPT

MAIN

VIEW

Bat

ch O

ptim

izer

Data

Acc

elera

tor

Andy

And

rews

Can

I pu

sh m

ore

wor

kloa

d th

roug

h m

y ex

istin

g ha

rdw

are

conf

igur

atio

n?

Bat

ch w

indo

w p

robl

ems

can

ofte

n be

redu

ced

dow

n to

two

basi

c pr

oble

ms:

!In

crea

sing

Bus

ines

s Vo

lum

e!

Less

tim

e to

pro

cess

bec

ause

of o

nlin

e co

mm

itmen

ts

Wha

t Are

You

r Opt

ions

?

How

do

you

incr

ease

thro

ughp

ut?

•R

educ

e/R

emov

e w

ait t

ime

•In

crea

se e

ffici

ency

•R

educ

e ov

erhe

ad

MAI

NVI

EW B

atch

Opt

imiz

er:

the

Easy

Alte

rnat

ive

Red

uces

bat

ch ru

n tim

es (e

laps

ed ti

me)

•N

o ap

plic

atio

n ch

ange

s

•N

o JC

L ch

ange

s

•B

ased

on

prov

en te

chno

logy

Bat

ch O

ptim

izer

Wha

t doe

s it

do?

Rem

oves

em

bedd

ed w

ait t

imes

from

bat

ch jo

bs

•I/O

wai

t•

Seria

lizat

ion

wai

t

Bat

ch O

ptim

izer

-H

ow d

oes

it do

it?

•S

hrin

ks B

atch

Win

dow

pro

cess

ing

with

hig

h pe

rform

ance

and

pre

dict

abilit

y

•En

hanc

ed I/

O p

erfo

rman

ce

•Pa

ralle

lize

batc

h pr

oces

ses

MVB

O D

ata

Opt

imiz

atio

nI/O

Wai

t

•Fo

r Bot

h VS

AM

and

non

-VS

AM

pro

cess

ing

•Ex

ploi

ts R

MO

DE(

31) b

uffe

ring

•D

ynam

ical

ly s

elec

ts o

ptim

um b

uffe

r val

ues

and

proc

essi

ng te

chni

ques

bas

ed o

n cu

rrent

sys

tem

reso

urce

av

aila

bilit

y

•Pa

ging

rate

, CPU

rate

, bel

ow-th

e-lin

e st

orag

e, e

tc.

•D

ynam

ical

ly a

djus

ts u

ser r

egio

n va

lues

to m

ake

any

requ

ired

addi

tions

to b

elow

-the-

line

stor

age

trans

pare

nt

to th

e ap

plic

atio

n

MVB

O D

ata

Opt

imiz

atio

n(I/

O W

ait)

•Fl

at F

iles

-(Q

SAM

/BS

AM

)•

Mov

es d

ata

buffe

rs a

bove

the

line

•R

epla

ces

low

-leve

l I/O

pro

cess

ing

prov

idin

g co

mpl

ete

cont

rol o

f buf

fer m

anag

emen

t and

phy

sica

l I/O

re

ques

ts•

All

I/O re

ques

ts s

atis

fied

by M

VB

O�s

inte

rnal

buf

fer

man

ager

•Fo

r seq

uent

ial p

roce

ssin

g re

ads

larg

e am

ount

of d

ata

and

over

laps

I/O

s to

max

imiz

e pe

rform

ance

rega

rdle

ss

of b

lock

ing

char

acte

ristic

s

MVB

O D

ata

Opt

imiz

atio

n(I/

O W

ait)

•V

SA

M P

roce

ssin

g•

Opt

imiz

es b

uffe

r val

ues

•Ac

tivat

es V

SAM

opt

ions

suc

h as

def

erre

d w

rite

whi

ch

incr

ease

s op

timiz

atio

n•

For r

ando

m a

cces

s bu

ilds

LSR

buf

fer p

ools

and

dyn

amic

ally

sw

itche

s to

LSR

pro

cess

ing

•W

hen

LSR

pro

cess

ing

with

seq

uent

ial a

cces

ses

perfo

rms

read

-ah

ead

for g

reat

er p

erfo

rman

ce b

enef

it•

For N

SR a

nd L

SR p

roce

ssin

g m

oves

buf

fers

and

con

trol

bloc

ks a

bove

the

line

to a

id v

irtua

l sto

rage

con

trol r

elie

f

MVB

O D

ata

Opt

imiz

atio

n(I/

O W

ait)

•C

entra

lly m

anag

ed th

roug

h in

tern

al ta

bles

cal

led

Pol

icie

s

•N

o JC

L ch

ange

s

•N

o ap

plic

atio

n ch

ange

s

MVB

O J

ob O

ptim

izat

ion

(Ser

ializ

atio

n W

ait)

•P

aral

lel E

xecu

tion

of J

ob S

teps

•Sp

lits

job

step

s fo

r pip

ing

and

conc

urre

nt e

xecu

tion

base

d on

his

tory

and

pol

icy

defin

ition

s•S

teps

with

no

data

dep

ende

ncie

s•D

epen

dent

ste

ps w

here

a d

ata

pipe

can

be

esta

blis

hed,

e.g

., re

ader

/writ

er p

air

•D

ata

is p

asse

d to

spl

it st

eps

via

Pipe

•E

ssen

tially

a d

ata

buffe

r sha

red

by tw

o pr

ogra

ms

MVB

O J

ob O

ptim

izat

ion

(Ser

ializ

atio

n W

ait)

•S

tep

to S

tep

Pip

ing

•2

data

-dep

ende

nt s

teps

exe

cutin

g in

par

alle

l•

Dat

a pi

pe fo

rms

betw

een

read

er s

tep

and

a w

riter

ste

p:

read

er c

an a

cces

s re

cord

as

soon

as

it is

writ

ten

•St

ep-to

-ste

p pi

ping

pas

ses

data

dire

ctly

into

the

read

ing

prog

ram

OS/

390

Imag

e A

OS/

390

Imag

e B

OS/

390

Imag

e C

Cou

plin

gFa

cilit

y

Time

�Typ

ical

�Bat

ch J

ob

Step

2

Rea

d

Step

1

Writ

e

Tem

p D

SN1

Step

6R

ead

Step

5R

ead

/W

rite

Tem

p D

SN2

Tem

p D

SN2

Step

5R

eads

VSA

M #

2W

rite

to F

ile2

Step

6Fi

nal S

tep

Step

2R

ead

Dat

a

Step

1W

rite

Dat

aTe

mp

DSN

1

VSA

MK

SDS

#2

Step

4R

ead

Dat

abas

e/ U

pdat

e VS

AM

Step

3U

pdat

e

VSA

M

KSD

S#1

Step

3U

pdat

e VS

AM

#1

VSA

M

KSD

S#1

Step

4R

ead

upda

ted

VSA

M #

1, u

pdat

e VS

AM

#2

VSA

MK

SDS

#2

MVB

O J

ob O

ptim

izat

ion

Tota

l Ela

psed

Tim

eSa

ved

I/O S

avin

gs

Step

2

Step

3

Step

4

Step

5

Step

6

Step

1

With

out

Job

Opt

imiz

atio

n

With

Jo

b O

ptim

izat

ion

3060

9012

015

018

00

Step

2

Step

3

Step

4

Step

5

Step

6

Step

1

Tim

e(in

min

utes

)

MVB

O P

ipin

g(S

eria

lizat

ion

Wai

t)

•P

assi

ng d

ata

to a

noth

er jo

b•

2 da

ta-d

epen

dent

jobs

exe

cutin

g in

par

alle

l

•D

ata

pipe

form

s be

twee

n w

riter

ste

p in

one

job

and

read

er s

tep

in a

noth

er jo

b

•D

irect

com

mun

icat

ion

with

CO

NTR

OL-

M

With

out M

VBO

Pip

ing

(Ser

ializ

atio

n W

ait)

•Jo

bs ru

n se

rially

Extr

act

QSA

M

RPT

2R

PT1

DB

2

IMS

RPT

3

MVB

O P

ipin

g(S

eria

lizat

ion

Wai

t)

•R

un th

em a

ll to

geth

er

Extr

act

QSA

MQ

SAM

RPT

2

RPT

1D

B2

DB

2

IMS

IMS

RPT

3

MVB

O C

andi

date

Util

ityH

ow m

uch

impr

ovem

ent c

an I

expe

ct?

•P

redi

cted

sav

ings

We

got a

pre

tty g

ood

bang

for o

ur b

uck

with

this

one

Dat

a A

ccel

erat

or C

ompr

essi

on

How

Can

Sof

twar

e B

ased

Com

pres

sion

H

elp?

•M

ajor

Ben

efits

•�F

ootp

rint�

redu

ctio

n of

dat

a•

Per

form

ance

adv

anta

ges

of c

ompr

esse

d da

ta

Har

dwar

e ba

sed

com

pres

sion

onl

y re

duce

s th

e �F

ootp

rint o

f the

dat

a�It

does

not

hing

for p

erfo

rman

ce

DA

TA A

CC

ELER

ATO

R C

ompr

essi

on

(DA

C)

•D

ata

Acc

eler

ator

has

a v

ery

good

com

pres

sion

eng

ine

•Th

e w

orst

com

pres

sion

per

cent

age

I hav

e se

en is

57%

on

IMS

LO

G d

ata

•Ty

pica

l com

pres

sion

sav

ings

are

gre

ater

than

66%

•I h

ad o

ne a

bsur

d ex

ampl

e w

here

I go

t 97

% c

ompr

essi

on

on s

ome

of m

y ge

nera

ted

test

dat

a•

A 80

0 cy

linde

r dat

aset

was

redu

ced

to 1

5 cy

linde

rs!!

Supp

orte

d D

ata

Set T

ypes

•N

on-V

SA

MB

SA

M, Q

SAM

, BP

AM

•V

SA

MK

SD

S, E

SD

S, V

RR

DS

DA

TA A

CC

ELE

RAT

OR

Com

pres

sion

•C

entra

lly a

dmin

iste

red

•C

andi

date

DSN

pat

tern

s ad

ded

via

ISPF

Inte

rface

•E

x.

Dat

aset

s th

at b

egin

with

CW

A.D

AC

.**•

Com

pres

sion

is a

utom

atic

with

the

next

load

of t

he fi

le•

Can

be

adm

inis

tere

d vi

a S

MS

Cla

ss•

Req

uire

s no

JC

L ch

ange

s•

Req

uire

s no

app

licat

ion

chan

ges

DA

TA A

CC

ELER

ATO

R C

ompr

essi

on

020406080100

120

Load

Clo

ckLo

adC

PUPr

oces

sC

lock

Proc

ess

CPU

Tota

lC

lock

Tota

l PU

DA

CR

VAPe

rcen

tageCom

pres

sion

(Hos

t vs.

DA

SD) B

ench

mar

k C

ompa

rison

Dat

a Ty

pes

Now

that

we

have

com

pres

sion

•R

emem

ber t

hat I

sai

d to

pay

atte

ntio

n to

the

wor

d �A

ccel

erat

or�i

n th

e pr

oduc

t titl

e?

•Le

t�s ta

lk a

bout

per

form

ance

Seei

ng is

bel

ievi

ng

•Le

t�s ta

ke a

look

at c

ompr

essi

on in

act

ion

DA

C

How

doe

s so

ftwar

e co

mpr

essi

on h

elp?

•If

you

com

pres

s a

file,

it ta

kes

few

er re

sour

ces

to p

roce

ss

the

file

•D

ata

rem

ains

com

pres

sed

as it

cro

sses

the

I/O c

hann

els

•D

ata

rem

ains

com

pres

sed

as it

resi

des

in th

e I/O

buf

fers

•Ph

ysic

al I/

O is

muc

h m

ore

effic

ient

usi

ng c

ompr

esse

d da

ta•

The

path

leng

th o

f one

EX

CP

is b

etw

een

25k

�50

k as

sem

bler

in

stru

ctio

ns !!

•In

add

ition

, you

r pro

gram

has

to w

ait f

or th

e ph

ysic

al d

ata

trans

fer!!

Whe

re d

oes

it he

lp?

•M

ost b

atch

pro

cess

ing

is s

eque

ntia

l in

natu

re•

Anyt

hing

that

mak

es a

seq

uent

ial p

ass

of a

com

pres

sed

file

will

ben

efit

•Ba

ckup

s•

Appl

icat

ion

swee

p pr

ogra

ms

•SO

RT

proc

essi

ng

•Be

st c

andi

date

s ar

e da

tase

ts th

at a

re re

-rea

d of

ten

•VS

AM fi

les

•M

aste

r file

s•

Extra

ct fi

les

•Ar

chiv

es

Wha

t kin

d of

ben

efit

are

we

talk

ing

abou

t?

•V

SA

M fi

le 8

,000

,000

fixe

d le

ngth

reco

rds

•C

ompr

essi

on %

= 8

1%

• •C

ompr

esse

dU

ncom

pres

sed

• •E

laps

ed 2

.22

min

utes

/ C

PU

30.

58 s

ecE

laps

ed 6

.65

min

utes

/ C

PU

30.

03 s

ec•

2.18

min

utes

/ C

PU

30.

71 s

ec5.

33 m

inut

es /

CP

U 2

9.93

sec

Even

bet

ter i

f we

avoi

d ex

pans

ion

over

head

•D

FDS

S b

acku

p w

ithou

t exp

ansi

on o

verh

ead

•75

% im

prov

emen

t �•

11,0

00 c

ylin

ders

of I

MS

log

data

ave

rage

62%

com

pres

sion

•V

SA

M B

acku

ps b

enef

it as

wel

l

Wha

t are

the

trad

e-of

fs?

•S

oftw

are

com

pres

sion

doe

s co

st C

PU

tim

e•

Mor

e ex

pens

ive

to c

ompr

ess

data

•Le

ss e

xpen

sive

to e

xpan

d da

ta•

Som

e C

PU

is o

ffset

by

mor

e ef

ficie

nt I/

O to

writ

e th

e co

mpr

esse

d bl

ocks

•E

laps

ed ti

me

is th

e bi

g sa

ving

s�Y

ou c

an a

lway

s ad

d m

ore

MIP

S to

you

r env

ironm

ent�

but

you

can�

t add

mor

e tim

e to

the

day.

Let�s

brin

g it

all t

oget

her

Wha

t hap

pens

whe

n yo

u bl

end

MVB

O w

ith D

AC

?•

8,00

0,00

0 V

SA

M re

cord

s•

Bat

ch p

roce

ss u

pdat

ed 8

00,0

00 re

cord

s (1

0% o

f the

file

)•

Nat

ive

proc

essi

ng ti

me

43 m

inut

es e

laps

ed �

CP

U (1

.30.

59 m

inut

es)

•B

atch

Opt

imiz

er o

nly

13

min

utes

ela

psed

�C

PU

(43.

30 s

econ

ds)

•M

VB

O &

DA

C

4 m

inut

es e

laps

ed �

CP

U (3

0.01

sec

onds

)

81%

com

pres

sion

ach

ieve

d

Wha

t is

a go

od s

trat

egy?

•Se

quen

tial p

roce

sses

yie

ld th

e be

st b

enef

it•

Look

for f

iles

with

favo

rabl

e R

ead/

Writ

e ra

tio 2

:1 o

r gre

ater

isbe

st•

Avoi

d te

mpo

rary

file

s -

&& ty

pe d

atas

ets

•VS

AM fi

les

tend

to b

e go

od c

andi

date

s•

Mig

ht n

eed

to e

mbe

d so

me

frees

pace

if re

cord

s gr

ow a

fter a

n up

date

Extra

ct fi

les

•H

isto

rical

dat

a•

Com

bina

tion

of V

SAM

rand

om p

roce

ssin

g an

d LS

R b

uffe

ring

•C

ompr

essi

on e

nhan

ces

the

effe

ct o

f buf

ferin

g•

Incr

ease

s pr

obab

ility

of b

uffe

r hit

& re

duce

s ph

ysic

al I/

O

Wha

t abo

ut IM

S an

d D

B2

jobs

?

•M

ost D

BM

S�s

requ

ire c

heck

poin

t/com

mit

proc

essi

ng•

Req

uire

d bu

t a n

eces

sary

evi

l•

Extre

mel

y ex

pens

ive

•10

0% o

verh

ead

•R

emov

ing

exce

ssiv

e ch

eckp

oint

act

ivity

can

pro

vide

si

gnifi

cant

run

time

impr

ovem

ents

AR

/CTL

C

AN H

ELP

MAN

AGE

YOU

R B

ATC

H

•A

R/C

TL is

par

t of a

fam

ily o

f pro

duct

s by

BM

C

Sof

twar

e th

at a

ddre

sses

the

need

s of

bat

ch D

B2,

IM

S, a

nd V

SA

M a

pplic

atio

ns•

AR

/CTL

is d

esig

ned

to p

rovi

de a

che

ckpo

int r

esta

rt ca

pabi

lity

for m

any

envi

ronm

ents

that

do

not c

urre

ntly

ha

ve th

is a

bilit

y.

Let�s

take

out

som

e of

the

over

head

App

licat

ion

Prog

ram

IMS

DB

2

PACING ROUTINESR

esta

rt is

fr

om

Act

ual

CH

KP

Wha

t is

the

bene

fit o

f che

ckpo

int

filte

ring?

•C

PU

Red

uctio

n•

Che

ckpo

ints

con

sum

e a

larg

e am

ount

of C

PU•

Ela

psed

tim

e R

educ

tion

•C

heck

poin

t/Com

mit

activ

ity in

crea

ses

thro

ughp

ut b

y re

duci

ng

run

time

Thre

e Te

chno

logi

es �

One

Foc

usTh

roug

hput

MAI

NVI

EW B

atch

Opt

imiz

er

•Si

gnifi

cant

ly re

duce

s th

e el

apse

d tim

efo

r bat

ch c

ycle

s

Dat

a A

ccel

erat

or C

ompr

essi

on

•So

ftwar

e ba

sed

com

pres

sion

mak

es I/

O m

ore

effic

ient

App

licat

ion

Res

tart

Con

trol

•R

emov

es e

xces

sive

che

ckpo

int a

ctiv

ity