CA Dynam for VSE User Guide

CA Dynam for VSE User Guide CA Dynam for VSE User Guide

supportcontent.ca.com
from supportcontent.ca.com More from this publisher
03.03.2015 Views

Managing the VTOC Searching the VTOC A request for a format-1 record would normally result in a hardware search (on CKD devices) of the entire VTOC, or a sequential reading (on FBA devices) of the VTOC. With the presence of a VTOC index, the following search method is used: • Looking up the data set name in the VTOC index (usually a single I/O) • Reading the format-1 record directly from the VTOC (a single, short I/O) Thus the channel is freed for other work, and I/O to the VTOC is minimized. The index to the VTOC is built as a prefix-balanced tree structure. A balanced tree structure is one in which an equal number of index records must be searched (one record for each index level) for all entries in the index. A prefixbalanced tree, or prefix B-tree, is a balanced tree in which common portions of keys (in this case, data set names) are stored only on higher index levels, conserving space on lower levels. A VTOC index also contains a record of all space on the volume, depending on whether it is occupied. This information is used to allocate new data sets and check for overlapping extents, greatly reducing the time (and resources) spent performing these functions. Creating New VTOC Records When a new VTOC record is to be created, a free (format-0) VTOC record must be found. This operation is usually similar to the format-1 record lookup described above, except that a search is made for a record having a key of binary zeros. The process is subject to the same problems as the format-1 lookup described above. In order to alleviate this situation, a VTOC index contains a bit map describing the VTOC itself. When free VTOC records are required, they are found by examining the VTOC allocation map, instead of the conventional search. 4–12 User Guide

Managing the VTOC Deleting Expired Files When you are processing an allocation request for a volume without a VTOC index, expired files that were allocated by CA Dynam/D are automatically deleted. But automatic deletion is not performed on volumes having VTOC indexes, because all allocation information is maintained within the VTOC index. Instead, the indexes are automatically rebuilt each day on or after 8:00 a.m. Any expired data sets that were allocated by CA Dynam/D are deleted at this time. Benchmark tests have shown that the use of indexed VTOCs can significantly improve performance and overall system throughput, even when used on DASD volumes not under the control of CA Dynam/D. Indexed VTOC Processing CA Dynam-indexed VTOC processing can be used effectively on all CKD volumes except perhaps volumes which contain only VSAM data spaces. On FBA devices, VTOC indexes should be used only if there are more than 200 files on the volume. Increase the VTOC CISIZE to 4K or 8K to improve performance on FBA volumes with fewer than 200 files. To use VTOC indexes, all systems must be running VSE r2 and above. If volumes having VTOC indexes are to be updated by more than one CPU, all updating systems must be running CA Dynam VTOC management. For more information about how to define and initialize VTOC indexes, see the DYNCAT VTOC command in the chapter "Maintaining the Catalog DYNCAT Program." CA Dynam/D VTOC management is similar in concept to the OS Data Facility Device Support VTOC management. For more information, see the IBM publication, Data Facility Device Support: General Information. Chapter 4: Disk File Management 4–13

Managing the VTOC<br />

Searching the VTOC<br />

A request <strong>for</strong> a <strong>for</strong>mat-1 record would normally result in a hardware search<br />

(on CKD devices) of the entire VTOC, or a sequential reading (on FBA devices)<br />

of the VTOC.<br />

With the presence of a VTOC index, the following search method is used:<br />

• Looking up the data set name in the VTOC index (usually a single I/O)<br />

• Reading the <strong>for</strong>mat-1 record directly from the VTOC (a single, short I/O)<br />

Thus the channel is freed <strong>for</strong> other work, and I/O to the VTOC is minimized.<br />

The index to the VTOC is built as a prefix-balanced tree structure. A balanced<br />

tree structure is one in which an equal number of index records must be<br />

searched (one record <strong>for</strong> each index level) <strong>for</strong> all entries in the index. A prefixbalanced<br />

tree, or prefix B-tree, is a balanced tree in which common portions of<br />

keys (in this case, data set names) are stored only on higher index levels,<br />

conserving space on lower levels.<br />

A VTOC index also contains a record of all space on the volume, depending on<br />

whether it is occupied. This in<strong>for</strong>mation is used to allocate new data sets and<br />

check <strong>for</strong> overlapping extents, greatly reducing the time (and resources) spent<br />

per<strong>for</strong>ming these functions.<br />

Creating New VTOC Records<br />

When a new VTOC record is to be created, a free (<strong>for</strong>mat-0) VTOC record must<br />

be found. This operation is usually similar to the <strong>for</strong>mat-1 record lookup<br />

described above, except that a search is made <strong>for</strong> a record having a key of<br />

binary zeros. The process is subject to the same problems as the <strong>for</strong>mat-1<br />

lookup described above.<br />

In order to alleviate this situation, a VTOC index contains a bit map describing<br />

the VTOC itself. When free VTOC records are required, they are found by<br />

examining the VTOC allocation map, instead of the conventional search.<br />

4–12 <strong>User</strong> <strong>Guide</strong>

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!