10954 march 14 2012 sms dss best practices

8/13/2019 10954 March 14 2012 SMS DSS Best Practices

http://slidepdf.com/reader/full/10954-march-14-2012-sms-dss-best-practices 1/43

Making the Most of DFSMSdss and SMS:Hints, Tips, and Best Practices in your z/OS

n!iron"entSession # 10954

Steve Huber Jeff SuarezIBM Corporation IBM [email protected] .!o "[email protected] .!o



NOTICES AND DISCLAIMERS

Copyright © 2012 by International Business Machines Corporation.

No part of this document may be reproduced or transmitted in any form without written permission from IBM Corporation.

Product information and data has been reviewed for accuracy as of the date of initial publication. Product information and data is subject

to change without notice. This document could include technical inaccuracies or typographical errors. IBM may make improvementsand/or changes in the product(s) and/or programs(s) described herein at any time without notice.

References in this document to IBM products, programs, or services does not imply that IBM intends to make such products, programs orservices available in all countries in which IBM operates or does business. Consult your local IBM representative or IBM Business Partnerfor information about the product and services available in your area.

Any reference to an IBM Program Product in this document is not intended to state or imply that only that program product may be used.Any functionally equivalent program, that does not infringe IBM's intellectually property rights, may be used instead. It is the user'sresponsibility to evaluate and verify the operation of any non-IBM product, program or service.

THE INFORMATION PROVIDED IN THIS DOCUMENT IS DISTRIBUTED "AS IS" WITHOUT ANY WARRANTY, EITHER EXPRESS ORIMPLIED. IBM EXPRESSLY DISCLAIMS ANY WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE ORNON-INFRINGEMENT. IBM shall have no responsibility to update this information. IBM products are warranted according to the termsand conditions of the agreements (e.g., IBM Customer Agreement, Statement of Limited Warranty, International Program LicenseAgreement, etc.) under which they are provided. IBM is not responsible for the performance or interoperability of any non-IBM productsdiscussed herein.

#ega$ Disc$ai"er



$

Information concerning non-IBM products was obtained from the suppliers of those products, their published announcements or otherpublicly available sources. IBM has not necessarily tested those products in connection with this publication and cannot confirm theaccuracy of performance, compatibility or any other claims related to non-IBM products. Questions on the capabilities of non-IBM productsshould be addressed to the suppliers of those products.

The provision of the information contained herein is not intended to, and does not, grant any right or license under any IBM patents orcopyrights. Inquiries regarding patent or copyright licenses should be made, in writing, to:

IBM Director of LicensingIBM CorporationNorth Castle DriveArmonk, NY 10504-1785U.S.A.

#ega$ Disc$ai"er



4

Trade"arksThe fo$$o%ing are trade"arks of the &nternationa$ Business Machines 'orporation in the (nited States and/or other countries)

Inte% is a tra&e ar' of the Inte% Corporation in the (nite& States an& other !ountries.Java an& a%% Java)re%ate& tra&e ar's an& %o*os are tra&e ar's or re*istere& tra&e ar's of Sun Mi!ros+ste s, In!., in the (nite& States an& other !ountries.Mi!rosoft, -in&o s an& -in&o s / are re*istere& tra&e ar's of Mi!rosoft Corporation.(/I is a re*istere& tra&e ar' of he 2pen 3roup in the (nite& States an& other !ountries.

%% other pro&u!ts a+ be tra&e ar's or re*istere& tra&e ar's of their respe!tive !o panies.*otes:Perfor"ance is in &nterna$ Throughput +ate &T+- ratio .ased on "easure"ents and pro ections using standard &BM .ench"arks in a contro$$ed en!iron"ent) The actua$throughput that any user %i$$ e0perience %i$$ !ary depending upon considerations such as the a"ount of "u$tiprogra""ing in the user1s o. strea", the &/O configuration,the storage configuration, and the %ork$oad processed) Therefore, no assurance can .e gi!en that an indi!idua$ user %i$$ achie!e throughput i"pro!e"ents e2ui!a$ent tothe perfor"ance ratios stated here)

&BM hard%are products are "anufactured fro" ne% parts, or ne% and ser!icea.$e used parts) +egard$ess, our %arranty ter"s app$y)

3$$ custo"er e0a"p$es cited or descri.ed in this presentation are presented as i$$ustrations of the "anner in %hich so"e custo"ers ha!e used &BM products and theresu$ts they "ay ha!e achie!ed) 3ctua$ en!iron"enta$ costs and perfor"ance characteristics %i$$ !ary depending on indi!idua$ custo"er configurations and conditions)

This pu.$ication %as produced in the (nited States) &BM "ay not offer the products, ser!ices or features discussed in this docu"ent in other countries, and the infor"ation"ay .e su. ect to change %ithout notice) 'onsu$t your $oca$ &BM .usiness contact for infor"ation on the product or ser!ices a!ai$a.$e in your area)

&nfor"ation a.out non4&BM products is o.tained fro" the "anufacturers of those products or their pu.$ished announce"ents) &BM has not tested those products andcannot confir" the perfor"ance, co"pati.i$ity, or any other c$ai"s re$ated to non4&BM products) 5uestions on the capa.i$ities of non4&BM products shou$d .e addressed tothe supp$iers of those products)

Prices su. ect to change %ithout notice) 'ontact your &BM representati!e or Business Partner for the "ost current pricing in your geography)

This presentation and the c$ai"s out$ined in it %ere re!ie%ed for co"p$iance %ith (S $a%) 3daptations of these c$ai"s for use in o ther geographies "ust .e re!ie%ed .y the$oca$ country counse$ for co"p$iance %ith $oca$ $a%s)

Boo'Mana*erCICS6B6B (niversa% 6atabase&eve%oper-or's67SMS&fp67SMS&ss67SMShs67SMSr67S286o ino

nterprise Stora*e ServerS:90007%ashCop+36;SHiperSo!'etsIBMIBM eServer IBM e<%o*o=serverIBM %o*oIMSInfo;rint

I; ;rint-a+>an*ua*e nviron ent>otusMu%tipriseM?S/otes2S:$90;ara%%e% S+sp%e8 C78 M C

8M7S:$A0S:$90

ivo%iota%Stora*e

-ebSpherez: r!hite!turez:2SzSeries



5

3genda Syste" Managed Storage O!er!ie%

-hat is SMS Benefits of SMS SMS Confi*urations CS 8outines

Best ;ra!ti!esDFSMSdss Best Practices

Convertin* nonSMS &ata to SMS ithout &ata ove ent e+ or&s re%ate& to SMS pro!essin* S3 CS an& rena in* &ata sets ?o%u e Se%e!tion ?S M C Size 8eDuire ents

F$ash'opy Hints and Tips



E

-hat is s+ste ana*e& stora*eF

● >ets the operatin* s+ste ta'e over stora*e ana*e enttas's

• 6ata set a%%o!ation• Ba!'up ana*e ent• Spa!e ana*e ent• vai%abi%it+ ana*e ent

● 8e&u!es nu ber of peop%e nee&e& to ana*e stora*e



A

-hat is SMSF

● SMS is an M?S subs+ste• Mana*es the !urrent stora*e ana*e ent po%i!+ <a!tive

!onfi*uration=• 8e&u!es en& user &ata set !reation G a%%o!ation !o p%e it+• In!reases insta%%ation !ontro% of 6 S6, tape, an& opti!a% stora*e

● here is one SMS an& one SMS a&&ress spa!e per instan!eof M?S <z:2S=

● SMS runs in both the user s an& the SMS a&&ress spa!e



SMS 6esi*n Consi&erations

● C%ear%+ separate the &o ains of users, &ata an& stora*ee&ia

● Intro&u!e the ro%e of stora*e a& inistrator●

;reserve !usto er invest ent in JC> an& otherstru!tures



10

So"e Basic Ter"s

● SMS !onfi*uration● Mini a% !onfi*uration● Base !onfi*uration infor ation● Stora*e *roup● Stora*e !%ass● Mana*e ent !%ass● 6ata !%ass● CS routine



11

So"e Basic Ter"s6

● SMS !onfi*uration● Mini a% !onfi*uration● Base !onfi*uration infor ation● Stora*e *roup●

Stora*e !%ass● Mana*e ent !%ass● 6ata !%ass● CS routine

● 3 configuration is a storage"anage"ent po$icy

● &t contains e$e"ents %hichdefine that po$icy:

• Storage groups 7 !o$u"es•

Storage c$asses• Manage"ent c$asses• Data '$asses• 3uto"atic '$ass Se$ection 3'S-

routines• Optica$ and tape $i.raries and

dri!es• 3ggregate groups



1

So"e Basic Ter"s6

● SMS !onfi*uration● Mini a% !onfi*uration● Base !onfi*uration

infor ation● Stora*e *roup● Stora*e !%ass● Mana*e ent !%ass● 6ata !%ass● CS routine

● Base configurationinfor"ation

● One storage c$assdefinition

● One storage group %ith at$east one !o$u"e

● 3 storage c$ass 3'Sroutine

●

3 storage group 3'Sroutine



1$

So"e Basic Ter"s6

● SMS !onfi*uration● Mini a% !onfi*uration● Base Confi*uration

6efinition ● Stora*e *roup● Stora*e !%ass● Mana*e ent !%ass● 6ata !%ass● CS routine

● Syste" 7 syste" groupna"es

● Defau$t "anage"entc$ass

● Defau$t unit● Defau$t de!ice geo"etry



14

So"e Basic Ter"s6

● SMS !onfi*uration● Mini a% !onfi*uration● Base !onfi*uration infor ation● Stora*e *roup ●

Stora*e !%ass● Mana*e ent !%ass● 6ata !%ass● CS routine

● Physica$ storage "anaged.y SMS

• 'o$$ection of D3SD !o$u"es• 8o$u"es in tape $i.raries• 8o$u"es in optica$ $i.raries• 8irtua$ &/O storage

● 'an .e ena.$ed, 2uiesced,2uiesced ne%, disa.$ed ordisa.$ed ne%

● 'an .e set to auto "igrate,

auto .ackup and/or autodu"p



15

So"e Basic Ter"s6

● SMS !onfi*uration● Mini a% !onfi*uration● Base !onfi*uration infor ation● Stora*e *roup● Stora*e !%ass ● Mana*e ent !%ass● 6ata !%ass● CS routine

● Perfor"ance attri.utes• Direct 7 se2uentia$

"i$$isecond response• Direct 7 se2uentia$ .ias•

&nitia$ access response ti"e● 3!ai$a.i$ity● 3ccessi.i$ity● 9uaranteed space● 9uaranteed synchronous

%rite



1E

So"e Basic Ter"s6

● SMS !onfi*uration● Mini a% !onfi*uration● Base !onfi*uration infor ation● Stora*e *roup● Stora*e !%ass● Mana*e ent !%ass ● 6ata !%ass● CS routine

● Space "anage"ent attri.utes• 0piration 7 retention attri.utes• Migration attri.utes• 9D9 "anage"ent attri.utes

● Backup attri.utes• Backup fre2uency• Backup !ersions• Backup retention

● '$ass transition attri.utes● 3ggregate .ackup attri.utes



1A

So"e Basic Ter"s6

● SMS !onfi*uration● Mini a% !onfi*uration● Base !onfi*uration

infor ation● Stora*e *roup● Stora*e !%ass● Mana*e ent !%ass● 6ata !%ass ● CS routine

● + 'O+9 or + 'FM● #+ '#● Space● DS*T P● 8o$u"e count● 8S3M attri.utes● + TPD or ;PDT● 'o"paction



1

So"e Basic Ter"s6

● SMS !onfi*uration● Mini a% !onfi*uration● Base !onfi*uration infor ation● Stora*e *roup● Stora*e !%ass● Mana*e ent !%ass● 6ata !%ass● CS routine

● (sed to deter"ine SMS c$assesand storage groups

● (sed for .oth data sets ando. ects

● 'an o!erride specifications ofSMS c$asses and groups on:

• <'# DD state"ents• Dyna"ic a$$ocation re2uests• DFSMSdss 'OP , + STO+ 7

'O*8 +T8• DFSMShs" + '3## 7 + 'O8 +• &D'3MS D F&* , 3#T + 7

&MPO+T• O3M STO+ , 'H3*9 7 c$asstransition



19

SMS Best Practices

● CS 8outines• 8 MI/6 8 ) CS pro!essin* is un!apture& ti e• (se 7I> >IS s ith i%&!ar&s

• 6on t use %on* 7I> >IS s ith !o p%ete 6S/ s• (se S > C state ents henever possib%e

• %%o s +ou to e it the routine a %itt%e faster

● C6S s• nsure C6Ss have 8 (S spe!ifie&• nsure C6Ss have p%ent+ of spa!e• Separate the C6S an& C2MM6S



0

SMS Best Practices cont-

● Confi*uration

• See 2 $$1 A an& app%+ the ; 7• fter 811, nu%% vo%u e entries are not &ea%t ith e%%

• II14E0 &es!ribes ho to Kprevent 2 $$1 A s %oop



1

● S 2838; 'e+ or&• Spe!ifies that a%% on%ine vo%u es in the Stora*e 3roups be

&+na i!a%%+ a%%o!ate&• Can spe!if+ up to 55 stora*e *roup na es• 6o not nee& to spe!if+ S > C M(> I 'e+ or&• Cata%o* fi%terin* is use& to fin& &ata sets but 6SS i%% on%+ se%e!t

&ata sets for vo%u es in the spe!ifie& stora*e *roups• Ma+ !ause an in!rease in "ob run ti e be!ause 6SS has to rea& ? 2Cs

<si i%ar behavior if spe!if+in* >23I/66 an& >23I/6L=• Can be use& for C2;L, 6(M;, an& 8 > S !o an&s• Custo ers have use& this to &eter ine hi!h vo%u es in a stora*e

*roup &ata sets have been !opie& to usin* L;8(/ /28(/

67SMS&ss e+ or&s re%ate& to SMS



● S 28C> S 'e+ or&• Spe!ifies a stora*e !%ass na e for 67SMS&ss to pass to CS• 6oes not *uarantee that the stora*e !%ass spe!ifie& i%% be

assi*ne& to the &ata set• Must spe!if+ BL; SS CS to *uarantee spe!ifie& S 28C> SS

is assi*ne& to tar*et• Lou !an a%so use a *uarantee&)spa!e &efine& stora*e !%ass to

p%a!e& &ata sets on spe!ifie& 2( 66:2( 6L/ M vo%u es• S3 CS ust use SC to &eter ine stora*e *roup

• a p%e sho s ovin* &ata sets fro a%% stora*e !%asses, e !eptt o, into one stora*e !%ass usin* BL 7I> 8I/3

C2;L 6 S <I/C>(6 < = ) BL<S 28C> S,/ ,<SC/ M 1,SC/ M === ) S 28C> S<SC/ M $= BL; SS CS< = 6 >




$

● (sin* 8 / M ( to have CS se%e!t stora*e *roup ithoutS 28C> S 'e+ or& usin* 7I> >IS <na e as'in*=

;82C S 28C> S CS7I> >IS J2BC I/C>(6 <K .6S 3 . =

: ssi*ns stora*e !%ass :-H / <G6S/ GJ2BC=

62S GS 28C> S K6S 83

I C26 <0=

3D+DSS( o. :C2;L 6S<I/C<;826.6SS8C.6S01. 1900== )

8 / M (<< .6SS8C. , .6S 3 . == =444444 na"e assigned

S3 CS an& rena in* &ata setsusin* 67SMS&ss



4

● M3M C> S 'e+ or&• Spe!ifies a ana*e ent !%ass to rep%a!e the sour!e ana*e ent

!%ass to pass to CS• Spe!if+in* /(>>M3M C> S provi&es a nu%% ana*e ent !%ass to

the input of the CS routines• %so &oes not propa*ate sour!e ana*e ent !%ass to tar*et

• Lou !an a%so &o BL 7I> 8I/3 b+ M3M C> S na eC2;L 6 S <I/C>(6 < = BL<M3M C> S, N,

<M3 / M 1,M3 / M === )

S 28C> S<SC/ M $= 6 >




5

● BL; SS CS 'e+ or&• -a+ to for!e the spe!ifie& S 28C> S an& M3M C> S to be

assi*ne& to tar*et• CS routines are not invo'e&

C2;L 6 S <I/C>(6 < = M3M C> S<M3/ M 1=

S 28C> S<SC/ M $=BL; SS CS< =




E

● (sin* /(>>S 28C> S an& BL; SS CS< = 'e+ or&s• -a+ to for!e the C2;L an& 8 S 28 of the &ata sets to be

nonSMS ana*e&• CS routines are not invo'e&

C2;L 6 S <I/C>(6 < = BL; SS CS< =

/(>>S 28C> S 8 / M (<<S2(8C . , 83 . == 2( 6L/ M< 83 ?=




A

● SMS fo%%o s sa e seDuen!e of steps as it &oes fornor a% a%%o!ations <outsi&e of 6SS=

• ?o%u es ust be &efine& in a stora*e *roups se%e!te& for the&ata set b+ the stora*e *roup CS routine

• 7or &ata sets a%%o!ate& for 7%ashCop+, SMS i%% atte pt tose%e!t vo%u es in the sa e S7I as the sour!e &ata set

• ;erfor an!e !onsi&erationsO• -hen pro!essin* an+ <100 s= of 7C s, hen a!!essin* tar*et,

response ti e i%% be better hen 7C sour!e an& tar*et resi&e inthe sa e !%uster on an 6S 000• eepin* &ata sets fro !rossin* e tents poo%s is a%so a H-

perfor an!e benefit• If +ou have stora*e *roups ith hun&re&s of vo%u es P!onsi&erQ

usin* SMS ; 8M>IB option 7 S R?2>S ><2/ 277=

67SMS&ss an& SMS vo%u e se%e!tion



●

%%o s a&&itiona% fi%terin* base& on &ata set !hara!teristi!s● Benefits

● >i its the nu ber of &ata sets pro!esse& hen spe!if+in* *eneri!in!%u&e !riteria

– 6one b+ rea&in* ? 2C to see if &ata set that eets in!%u&e !riteriashou%& be se%e!te&

– Man+ uses● Finding uncataloged data sets- BY(CATLG EQ NO)

– Useful if you ant to delete t!e"- (#U$% #ELETE)– $ay get e&&o& if data set is uncataloged on "ulti'le olu"es

● %&ocessing data sets t!at !a e c!anged since last ac*u'-BY(#+C,A EQ YE+)

● Allo s fo& "ulti'le BY c&ite&ia to e s'ecified it!out additional&eads

● 6ra ba!'s● 8eDuires 6SS to rea& ? 2Cs

– &&s overhea&● Based on you& include c&ite&ia t!is could tu&n out to e a lot

"o&e .O and C%U

BL 7i%terin* <shou%& I or shou%&n t I=



9

● /e in ?1810● /e ?S M a%%o!ations ust have a !ontro% area

size of 1, $, 5, A, 9, or 15 tra!'s● I6C MS i%% auto ati!a%%+ for!e an+ a%%o!ations to abi&e● -hen !op+in* &ata sets that &on t fo%%o the C size reDuire ents

67SMS&ss ust pro!ess it usin* I6C MS• ;revents use of 7ast 8ep%i!ation• Must be ab%e to obtain e !%usive enDueue• eep in in& hen an a%%o!ation is at or over the B;? the a%%o!ation i%%

use !hun' ana*e& spa!e an& pri ar+ a%%o!ation i%% be in 1 !+%

in!re ents• Ma+ a%so prevent 78 if sour!e is fu%% an& tar*et is a%%o!ate& bi**er< 6891 I 8C E.....>6Ss i%% be an e !eption soon ith a re!ent ; 8=

● oo% avai%ab%e to !he!' for in!o patab%e C size• ;%ease refer to the z2S ?1810 Mi*ration pub%i!ation for ore infor ation

● 2 $$5$1O Stripe& ?S M ith spanne& re!or&s not S e%i*ib%e

?S M C Size 8eDuire ents



$0

● Be*innin* in ?1810 vo%u es !ou%& be $3B < E ,EE !+%in&ers=● Support for 1 B vo%u es <1,1 ,00E !+%= as a&e avai%ab%e in Sept

011● 67SMS&ss ;erfor an!e testin* has foun& that there is no

&e*ra&ation hen !onso%i&atin* &ata onto ?s <C2;L,6(M;:8 S 28 ,6 78 3= usin* tra&itiona% I:2

●

3ot ?sF

> ?> @>> @?> A>> A?> B>> B?>

Fu$$ 8o$u"e Du"p

Fu$$ 8o$u"e 'opy

$apsed Ti"e ,Mins-

A>C 0 Mod !o$sBA 0 EC !o$sBA 0 EC data on A?E !o$sG 0 A?E !o$s



$1

-hat about Cop+ Servi!esF● Initia%ization ti e reDuire& for Con!urrent Cop+ <CC=, 7%ashCop+ <7C=, an& ?iruta% CC

<?CC= initia%ization !an be re&u!e& b+ !onso%i&atin* an+ s a%%er vo%u es onto fe erbi* ones

● ?CC has the a&vanta*es of 7C <point)in)ti e !op+ !ontaine& ithin 6S 000, no hostresour!e reDuire&=, an& CC <&u p to tape, or !op+ to other &is' subs+ste s=

●

3ot ?sF <!ont.=

>

AC

E

G

@>@A

'' F' 8''

& n i t i a $ i z a t i o n

T i " e

, S e c s -

CG ModD !o$sG EC cy$ !o$s

G A?E cy$ !o$s



$$

● B+pass authorization !he!'in*, e piration &ate !he!'in*,or unuse& spa!e !he!'in*

● 6MI/IS 8 28 'e+ or&● ;(83 'e+ or&● >>6 < = >> C; 'e+ or&s● If a%% of the options are not spe!ifie& 6SS i%% rea& ever+ ? 2C tra!'

an& fin& ea!h 71 6SCB

67SMS&ss C2;L:6(M;:8 S 28 7(>>



$4

● -ith 6u p Con&itionin*, hen a fu%% vo%u e !op+ is &one, thesour!e vo%u e is !opie& to the tar*et vo%u e, but the tar*etvo%u e %abe% &oes not !han*e

• %%o s both the sour!e an& tar*et to re ain on%ine● a p%eO

• Cop+ ?o%u e to ?o%u e B ith 6u p!on&itionin*• 6u p ?o%u e B to ape• 8estore ape to ?o%u e C or ba!' to ?o%u e •

?o%u e C no %oo's e a!t%+ %i'e ?o%u e ● Lou !an a%so ph+si!a%%+ !op+ or restore in&ivi&ua% &ata sets

• o ?o%u e C or • If !op+in* or restorin* to C ?S M an& u%ti vo%u e &ata sets

reDuire re!ata%o*in*

67SMS&ss 6(M;C2/6I I2/I/3



$5

● Must be reDueste& hen pro!essin* C; ?2>(M S ith 6SS● n&in* ran*e spe!ifi!ation

• Spe!if+in* 07777777 for !+% 6SS i%% pro!ess to %ast !+%• E ,4$5,455 !+%in&ers

• 8e!o en&e& so +our bat!h "obs &on t iss !op+in* or &u pin*&ata

• a p%e

6(M; 8 C S )<< 1 , 0 , 07777777 , 07 == )I/66 <6S A960= 2; <4= 6MI/ C;?2>(M )2( 66/ M <669 -8 =

67SMS&ss 8 C S ;ro!essin*



$E

● 6SS %i its para%%e% pro!essin* to 0 sub tas's● 4 subtas's in para%%e% per SI6 *ives +ou the a i u

benefit●

6SS &efau%t %i it is 0 subtas's per SI6• Can be over ritten via 68; CH <offset 45 =• n+thin* over 0 para%%e% subtas's !ou%& resu%t in A aben&s

67SMS&ss ;ara%%e% ;ro!essin*



$A

● 3oo& Duestion, it &epen&s. 7irst a histor+V..● ;rior to ?1811, 2 5E44 intro&u!e& usin* CSI to %o!ate &ata sets

• nab%e& via 68; CH● Be!a e the &efau%t in ?1811, but 2 $ 1 0 !han*e& it ba!'

•

8easonO run ti es in!rease& hen spe!if+in* I/C● Lou shou%& see a benefit hen CSI is enab%e& hen I/C is notspe!ifie&

● /o benefit if input vo%u es or S 2838; is spe!ifie&• CSI is not use& b+ 67SMS&ss

●

If usin* CSI be sure to have fi provi&e& in 2 $ 1E5• 7i%ter !ontainin* in first !hara!ter of Dua%ifier i%% not se%e!t &atasets

• I/C>(6 <6S< .7I> or ;.7I> ==

nab%e or 6isab%e 67SMS&ss CSI usa*eF



$

● In ?181 6SS be*an usin* BS M to• -rite bi**er tape b%o!'s• (se an 7S M as 6(M; output:8 S 28 input on 6 S6• If ba!'up is on 7 S M %o er %eve% re%eases !annot restore

ba!'up• 2ne a+ aroun& this is to C2;L6(M; fro an 7S M to a

>ar*e S M• ar*et b%o!'size has to at!h sour!e

•

If ba!'up is on tape 6SS !an restore it on %o er re%eases• /o atter hat the b%o!'size is

• -e sa a perfor an!e i prove ent up to $EU• vea*e 0)$0U

67SMS&ss 6(M;:8 S 28 on ?181



$9

o C2;L or to /2C2;LF hat is the DuestionW• B3' 9+O(*D *O'OP is typica$$y the .est choice to

"ini"ize acti!ity %ithin the physica$ .o0• ButV. Lou ust as' h+ are +ou a'in* a !op+F n&V. -hat t+pe of

app%i!ation or'%oa& &o I haveF• 7or e a p%eO

• Is the !op+ on%+ *oin* to be use& for !reatin* a tape ba!'upF• BAC/G0OUN# NOCO%Y s!ould e used and t!e &elations!i' it!d&a n

afte& t!e ta'e ac*u' is co"'lete• Is the !op+ *oin* to be use& for testin* or &eve%op entF

• NOCO%Y again is ty'ically t!e est c!oice• -i%% +ou nee& a !op+ of the !op+F

• BAC/G0OUN# CO%Y "ust e used so t!at t!e ta&get ill e it!d&a nf&o" its &elations!i' afte& all of t!e t&ac*s a&e co'ied t!e&e y allo ing it to

e a sou&ce in a ne &elations!i'• %ossi ly use NOCO%Y to CO%Y o'tion• $ost efficient !en t!e sou&ce and ta&get olu"es a&e it!in

t!e sa"e cluste&• Is the or'%oa& 2> ; </2C2;L t+pi!a%%+ is the !hoi!e= or are there a %ar*e

nu ber of ran&o rites an& are not !a!he frien&%+ <C2;L a+ be the

better !hoi!e=



40

● 7or!es &ata sets to be !opie& to a spe!ifi! stora*e *roup hen7%ashCop+ is use& as the &ata over

● Must !reate a ne stora*e *roup to !ontain the 7%ashCop+ tar*ete%i*ib%e vo%u es <e a p%e non 8C vo%u es=

●

;opu%ate ne S3 ith the 7%ashCop+ tar*et vo%u es● Mo&if+ S3 CS routine to &ire!t a%%o!ations to the ne S3 hen the

va%ue of the ne CS variab%e G CS /?8 is eDua% to 7> SHC;L● 8eva%i&ate the CS routine an& re)a!tivate the SMS !onfi*uration● ; 8s 2 $ 101 an& 2 $ 10$● a p%e

;82C GS 2838;I7 G CS /?8 7> SHC;L H / S GS 2838; 7C 83

67SMS&ss 7%ashCop+ Bat!h ;rote!tionusin* SMS



41

+ed 3$ert

•

2 $ 94 O ;ossib%e &ata %oss Abstract:Possible data loss for EAV Users on releases z/OS 1.11, 1.12 and 1.13 using DSS Logi alDu!" or #S$ $igrate and %a &u" "ro essing

Description: DSS !a' s&i" so!e of t(e user)s data set during du!" "ro essing and result

in a failure *(en atte!"ting to +estore, +e all or +e o er t(ese data sets. -(is failure *ill"re ent an' of t(e data set fro! being restored AD+3 1E0. -(e "roble! an o ur *(enusing EAV olu!es *it( data sets in t(e EAS region E tended Addressabilit' S"a e

'linder !anaged region0 *(ere t(e addresses of t(e data set e tents are not in as ending'linder order, ie. t(e # address of a later e tent is less t(an a "re ious e tent.

Please see APA+ OA34562 for additional infor!ation and a tions to deter!ine e "osure.

Recommended Actions: A""l' 77APA+ for OA34562



4

8eferen!e Materia%s

● ;ub%i!ationsO• SC$5)04 O z:2S ?1810.0 Mi*ration• 3 )A499O z:2S ?181 Mi*ration• 3 )A499 O 67SMS&ss Stora*e & inistration



Su ar+

● SMS 2vervie● 67SMS&ss Best ;ra!ti!es● NuestionsF

10954 march 14 2012 sms dss best practices

Documents