Patent application number | Description | Published |
20080222619 | DETECTION OF ERRORS CAUSED BY INTERACTIONS OF INDEPENDENT SOFTWARE VENDOR CODE WITH HOST CODE - A method is provided for isolating errors which occur when code supplied by independent software vendors (ISV code) interacts with code supplied by a primary vendor (host code). Code suspected of containing ISV code with host code is executed. If the results are in error, the code is scanned and then compared with a master host code. Any differences are stored in a delta file, including locations in the host code where ISV code hooks into the host code. The code is then modified to by-pass the hooks to ISV code to generate a side-executable code and both codes are executed and the results are compared. A lack of substantial difference in the results is indicative that the ISV code adversely affects the host code while a difference between the results is indicative of an error in the modified code. | 09-11-2008 |
20090094413 | Techniques for Dynamic Volume Allocation in a Storage System - A technique for operating a storage system includes determining utilization of multiple storage volumes over a time period. One or more application datasets are then reassigned to a different one of the multiple storage volumes based on the utilization of the multiple storage volumes over the time period and a requested performance level for an associated application. | 04-09-2009 |
20090193062 | STORING INFORMATION IN OTHERWISE UNUSED SPACE IN VTOC AND VVDS FOR RECOVERY OF DATA - When a VTOC and a VVDS are established for information used to access data sets of a volume, unused space remains in both structures. The data sets, VTOC and VVDS are stored on a recordable medium. For VSAM data sets, other, vital information about the data set is also stored in the VTOC; for non-VSAM data sets, vital information about the data set is also stored in the VVDS. If the VOTC entry of a non-VSAM data set becomes corrupted, the vital information in the VVDS may be used to access the stored data set. Similarly, If the VVDS entry of a VSAM data set becomes corrupted, the vital information in the VTOC may be used to access the stored data set. | 07-30-2009 |
20090210617 | MULTI-LEVEL VOLUME TABLE OF CONTENTS - Methods, data structures and systems provide organize a table of contents for a volume (VTOC) stored in a storage system. The volume is divided into a plurality of ranges of tracks, including a first track range. For each track range, an associated sub-VTOC is created containing information about the contents of the track range. A master VTOC is also created containing a plurality of pointers, each pointer pointing to one of the plurality of sub-VTOCs. A first data set stored on one or more tracks within the first track range is updated and the sub-VTOC associated with the first track range is locked, whereby access to other sub-VTOCs is unaffected. The sub-VTOC associated with the first track range may then be accessed, updated and unlocked. Thus, updating data sets stored within different track ranges on the volume may proceed at the same time. | 08-20-2009 |
20090216781 | Technique for Dynamic Creation of a User Catalog for a Storage System - A technique for operating a storage system includes determining, based on a response (e.g., return and reason codes from catalog services) from a storage operating system, that a desired user catalog is unavailable for storage of a new dataset. A new user catalog is then dynamically created, when the desired user catalog is unavailable. An alias entry in a master catalog is then updated to point to the new user catalog, when the desired user catalog is unavailable. | 08-27-2009 |
20090240988 | METHOD OF CORRECTING JOB CONTROL LANGUAGE JOB ERRORS - A method of correcting job control language (JCL) jobs scans a JCL job against a set of JCL syntax rules. The method automatically corrects any syntax errors discovered during the scanning, thereby forming a corrected JCL job. The method then runs the corrected JCL job. If the corrected JCL ends abnormally due to an execution error, the method then automatically determines if the execution error is recoverable. If the execution error is recoverable, the method automatically corrects the recoverable error to form a recovered corrected JCL job. The method reruns the recovered corrected JCL job. | 09-24-2009 |
20090307283 | DYNAMIC BACKUP WINDOW OPTIMIZATION APPARATUS AND METHOD - An apparatus, method, and computer program product to dynamically optimize a backup window for a data store is disclosed herein. In one embodiment, an apparatus may include tracking module, a determination module, a window module, and a backup module. The tracking module may track usage of a data store over a period of time. A determination module may determine a period of minimal usage associated with the data store. The determination module may also determine an expected backup duration for the data store. Once the expected backup duration and period of minimal usage are known, a window module may calculate an optimal backup window for the data store. A backup module may then backup the data store during the backup window. | 12-10-2009 |
20100049937 | VOLUME RECORD DATA SET OPTIMIZATION APPARATUS AND METHOD - A method, apparatus, and computer program product for optimizing the organization of volume records stored in a volume record data set is disclosed herein. In certain embodiments, a method may include monitoring a volume comprising multiple data sets. Each data set may have associated therewith a volume record stored in a volume record data set. The method may further include tracking read and write operations to each of the data sets over a period of time. A count value may be stored in the volume record of each data set. The count value may be increased each time a read operation is performed to the associated data set. The count value may be decreased each time a write operation is performed to the associated data set. The volume records in the volume record data set may then be reorganized according to the size of the count values. | 02-25-2010 |
20100094832 | Catalog Performance Plus - A method, system and computer-usable medium are disclosed for managing an integrated catalog facility (ICF) catalog. An ICF catalog is monitored by a contention detection module. Information related to a detected catalog resource contention is used by the contention detection module to generate a contention event. Information related to the contention event is then provided to a contention resolution module, which uses the information to perform a contention resolution operation. Once the resolution operation has been performed, contention events and contention resolution operations are reported by a contention reporting module. | 04-15-2010 |
20100185688 | VARIABLE-LENGTH RECORD, CORRUPTION RECOVERY APPARATUS, SYSTEM, AND METHOD - A method for identifying records of variable length within a data block containing corrupted data is disclosed herein. In certain embodiments, such a method may include scanning backward from an end of a data block containing variable-length records. The backward scan may proceed, one record at a time, to identify a first span of good (i.e., non-corrupt) records. The method may further include scanning forward from a front of the data block, also proceeding one record at a time, to identify a second span of good records. The method may include identifying a problem region by identifying data that resides between the first span and the second span. The method may also include creating a new record between the first span and the second span that contains the problem region. A corresponding computer program product, apparatus, and system are also disclosed. | 07-22-2010 |
20100287354 | VSAM SMART REORGANIZATION - Various embodiments for adaptive reorganization of a virtual storage access method (VSAM) data set are provided. In one exemplary embodiment, upon each control interval (CI) split of a plurality of CI splits occurring over a period of time, historical data including a key value for a record causing each CI split is recorded in a data repository. The historical data is analyzed with a predictive algorithm to determine an amount of free space to be allocated to each of a plurality of control intervals generated pursuant to the adaptive reorganization. The predictive algorithm allocates a greater percentage of the free space to a first location of the VVDS having a larger proportion of historically placed key values than a second location of the VVDS having a smaller proportion of the historically placed key values. | 11-11-2010 |
20110072230 | ON DEMAND STORAGE GROUP MANAGEMENT WITH RECAPTURE - A method to dynamically adjust the amount of free space in a storage group is disclosed herein. In certain embodiments, such a method may include monitoring the amount of free space in an active storage group. The method may further include maintaining an overflow storage group containing unused volumes. When the free space in the active storage group falls below a lower threshold value, the method may automatically move a volume from the overflow storage group to the active storage group. Conversely, when the free space in the active storage group exceeds an upper threshold value, the method may automatically transfer data from a volume in the active storage group to other volumes in the active storage group, and move the volume from the active storage group to the overflow storage group. A corresponding computer program product and apparatus are also disclosed herein. | 03-24-2011 |
20110167158 | MULTI-SYSTEM DEADLOCK REDUCTION - Method, system, and computer program embodiments for reducing deadlock in multi-system computing environments are provided. A set of default, current wait times is initialized for resource requests of each of a plurality of resources. A plurality of resource holders and resource waiters is monitored within an address space. If one resource holder of the plurality of resource holders of one of the plurality of resources is determined to be one resource waiter on another of the plurality of resources, a current wait time for the one resource holder is incremented and a deadlock indicator for both the one resource holder and the one resource waiter is activated. Following expiration of a predefined interval, the plurality of resource holders and resource waiters are parsed through to determine an original resource holder, indicating a system deadlock. The resource holder associated with the system deadlock having a lowest current wait time is restarted. | 07-07-2011 |
20110167302 | DIAGNOSTIC DATA SET COMPONENT - Various embodiments for retaining diagnostic information for data in a computing storage environment are provided. In one such embodiment, a diagnostic component associated with a base data set via a catalog association record is initialized. The diagnostic component configured to retain base data set-specific diagnostic information retrievable by the computing storage environment to assist in error diagnosis. | 07-07-2011 |
20110173154 | CATALOG REORGANIZATION APPARATUS AND METHOD - A method for reorganizing a catalog to improve I/O performance includes initially placing a shared lock on a source catalog. The method then makes a point-in-time copy of the source catalog to generate a target catalog. Once the target catalog is generated, the method reorganizes the contents of the target catalog. Optionally, while reorganizing the contents of the target catalog, the method temporarily releases the shared lock on the source catalog and mirrors I/O intended for the source catalog to a buffer. The buffered I/O may then be used to update the target catalog to bring it current with the source catalog. When the target catalog is reorganized and up-to-date, the method upgrades the shared lock on the source catalog to an exclusive lock, overwrites the source catalog with the target catalog, and releases the exclusive lock. A corresponding apparatus and computer program product are also disclosed and claimed herein. | 07-14-2011 |
20110191565 | EXTENT SIZE OPTIMIZATION - A method for automatically optimizing an allocation amount for a data set includes receiving an extend request, specifying an allocation amount, for a data set in a storage pool. The method increments a counter in response to receiving the extend request. In the event the counter has reached a threshold value, the method automatically increases the allocation amount of the extend request, such as by multiplying the allocation amount by a multiplier. In the event the allocation amount is larger than a largest free extent in the storage pool, the method automatically decreases the allocation amount of the extend request to correspond to the largest available free extent. Such a method reduces or eliminates the chance that an extend request will fail, and reduces overhead associated with extending and consolidating extents. A corresponding apparatus and computer program product are also disclosed herein. | 08-04-2011 |
20110302192 | SYSTEMS AND METHODS FOR FIRST DATA CAPTURE THROUGH GENERIC MESSAGE MONITORING - In one embodiment, a method for handling an error message includes interrogating an error message issued by a computing system to determine that the error message includes more than an alarm message, determining a message identifier relating to the error message, comparing the message identifier to entries in a database to determine an entry in the database that includes the message identifier, and outputting a set of documentation referenced by the entry in the database which includes the message identifier. In another embodiment, the database includes a plurality of searchable entries, each entry including: a message identifier, a product identifier, a set of documentation, and a set of actions. The set of documentation includes documents for the computing system to output and the set of actions includes actions for the computing system to perform. Other methods, systems, and computer program products are also described according to various embodiments. | 12-08-2011 |
20120005449 | ON-ACCESS PREDICTIVE DATA ALLOCATION AND REALLOCATION SYSTEM AND METHOD - A method for predictively allocating space in a database system includes detecting an access request for a data set, evaluating a growth rate of the data set to determine a predicted increase in size of the data set, and in response dynamically altering an attribute of an allocation for the data set. Attributes altered include the size of volumes and the number of volumes comprising the data set. The method may include setting a flag indicating an instruction to rewrite the data set if the evaluation indicates that rewriting is needed to accommodate the predicted increase in size. The method may include rewriting the data set from a lower address space of a volume to a higher address space of the volume if the size of the data set is equal to or greater than an allocation increment of the upper address space. A corresponding apparatus and computer program product are also disclosed herein. | 01-05-2012 |
20120005528 | DATA SET INDEX RECORD PRESERVATION - Various embodiments for preserving data set information in a computing storage environment are provided. In one such embodiment, at least one of a selected portion of an index record of the dataset is stored as a record in a subindex data set. The at least one component of the subindex data set is recoverable into the index record in an event of an error detected within the index record. | 01-05-2012 |
20120005657 | OPTIMIZATION OF AUTOMATED SYSTEM-MANAGED STORAGE OPERATIONS - Various embodiments for optimizing automated system-managed storage (SMS) operations in a computing storage environment. An execution of at least one automatic class selection (ACS) routine is monitored to determine at least one frequently used instruction. The ACS routine is modified for at least one predetermined time interval. The at least one frequently used instruction is moved to a higher execution priority of the modified ACS routine. | 01-05-2012 |
20120017123 | Time-Based Trace Facility - Method, system, and computer program product embodiments of a time-based trace facility for facilitating software debugging without interfering with the run-time behavior, performance or resource usage of the traced software are provided. The trace facility resides in a different address space than the target address space and uses different time-slices of CPU resources to execute the instructions in the address spaces. The trace facility uses a cross-memory mode to read the state data from the target address space in accordance with a time schedule. The trace facility writes the state data to a trace area, which may be located in either the target or trace address spaces or external storage. With this approach, the trace facility can read a large amount of state data frequently to construct the type of historical record needed to analysis run-time behavior, performance and resource usage. The trace facility may use a parameter file to configure a particular trace e.g. specify the target address space, one or more processing tasks within the target address space, a specific trace module, filters to extract specific state data, the time interval, the trace area, etc. | 01-19-2012 |
20120021721 | SESSION-CONTROLLED-ACCESS OF CLIENT DATA BY SUPPORT PERSONNEL - A method for controlling access to client data by support providers is disclosed herein. In one embodiment, such a method includes initiating a session on a server computer in response to receipt of a request for assistance from a client, the session having client data associated therewith. A session key is generated for the session. The session key includes a session identifier and a support provider identifier corresponding to an assignee. The session key may further include a client identifier corresponding to the client. Requests to access the client data include an assignee key including a session identifier and a support provider identifier, and potentially a client identifier if needed. The assignee key is compared to the session key. If correspondence is found between the identifiers in the assignee key and the session key, access is granted. A corresponding apparatus and computer program product are also disclosed herein. | 01-26-2012 |
20120030175 | SYSTEM FOR OFFLOADING DATA ANALYIS OVERHEAD FROM A PRIMARY SITE TO A REMOTE SITE - A method for reducing the data analysis overhead on a production system is disclosed herein. In one embodiment, such a method includes replicating production data from a primary site to a remote site. A control data set containing information for directing analysis of the production data is generated at the primary site and replicated to the remote site. At the remote site, the method includes analyzing the production data as directed by the control data set by making use of time on a CPU located at the remote site. Analysis may involve executing a diagnostic routine and/or generating a log file documenting the results of the analysis. A corresponding apparatus, system, and computer program product are also disclosed and claimed herein. | 02-02-2012 |
20120030521 | SELECTIVE BRANCH-TRIGGERED TRACE GENERATION APPARATUS AND METHOD - A method for selectively generating trace data is disclosed. Such a method includes executing a first module on a processor. The processor is operably coupled to a memory storing the first module and one or more branch modules. The method further includes detecting the execution of an instruction of the first module to execute a branch module. In response to detecting execution of the instruction, traces of branch modules subsequently executed by the processor are generated. Upon detecting a return of execution by the processor to the first module, the generation of traces is terminated and a trace report is generated. A corresponding apparatus and computer program product are also disclosed herein. | 02-02-2012 |
20120078922 | DATA REORGANIZATION - An approach to efficient data reorganization. The approach may involve searching for control interval (CI) splits and control area (CA) splits in a data component of a VSAM data set. A mapping is created that maps the source location storing the VSAM data set to a target location. The mapping reorders the VSAM data set such that the CI splits and CA splits are removed when the VSAM data set is moved to the target location in accordance with the mapping. Those CAs that do not include CI splits may be moved without using the host devices' processing resources. For example, the storage device may FlashCopy these areas directly from the source location to the target location. Those CAs that do include CI splits may be moved using the host's processing resources. For example, these CAs may be read into the host, re-ordered by the host, and written by the host to the target location. | 03-29-2012 |
20120096053 | PREDICTIVE MIGRATE AND RECALL - Various embodiments for optimizing data migration and recall in a computing storage environment by a processor device are provided. Data stored in the computing storage environment is analyzed over a predetermined period of time to identify a usage pattern of a portion of the data. The portion of the data having the usage pattern is recalled in advance of a usage time, the usage time predicted by the usage pattern for the portion of the data to be accessed. | 04-19-2012 |
20120096236 | USING AN ALIAS VOLUME NAME FOR A VOLUME TO ALLOCATE SPACE TO A DATA SET - Provided are a computer program product, system, and method for using an alias volume name for a volume to allocate space to a data set. An assignment of a plurality of volumes to a data set is maintained, wherein the volumes are configured in a storage system. A request is received to extend the data set. A determination is made as to whether one of the volumes previously assigned to the data set has an allocation amount of available space in the storage system in response to the request to extend the data set. An alias volume name is assigned to the data set for the previously assigned volume determined to have the allocation amount of available space, wherein the alias volume name provides an alternative name for the previously assigned volume. The allocation amount of available space is assigned to the data set for the alias volume name. | 04-19-2012 |
20120110288 | TEMPORARY VTOC LOCKING DURING DEFRAGMENTATION - Various embodiments for defragmentation of a storage volume in a computing storage environment by a processor device are provided. A volume table of contents (VTOC) is serialized for a volume scan operation. At least one dummy data set in the storage volume is allocated, to be subsequently filled with actual data pursuant to a degragmentation operation. The serialization of the VTOC is released, allowing access to the storage volume. Input/output (I/O) operations are allowed to occur. | 05-03-2012 |
20120173833 | SYSTEM, METHOD, AND COMPUTER PROGRAM PRODUCT FOR AVOIDING RECALL OPERATIONS IN A TIERED DATA STORAGE SYSTEM - According to one embodiment, a system includes logic adapted to: receive a request to open an existing data set indicating a write operation, receive new data to write to the existing data set, determine that the existing data set is stored on a lower tier of a tiered data storage system, determine that the existing data set is capable of being updated by appending the new data to an end of the existing data set, create a temporary data set on a higher tier of the tiered data storage system comprising the new data, associate the temporary data set on the higher tier of the tiered data storage system with the existing data set on the lower tier of the tiered data storage system, and create a write indicator associated with the new data set indicating that the new data set belongs at the end of the existing data set. | 07-05-2012 |
20120179936 | EARLY COLLECTION OF DIAGNOSTIC INFORMATION - Generation of diagnostic information of a computer-implemented system is made early so that the data is closer to the causation of errors or for performance analysis. At least one selected activity of the system is monitored from initiation of the activity, and the monitoring is for successful completion. Early collection of diagnostic information is provided by comparing the time of the activity without successful completion to an initial trigger, where the initial trigger is less than the time period for a time-out for the activity. If the time of the activity without successful completion exceeds the initial trigger, diagnostic information is collected and an initial dump of the diagnostic information is taken. In one example, a notification that the dump of diagnostic information has been taken is directed to the host or diagnostic terminal. | 07-12-2012 |
20120185649 | VOLUME RECORD DATA SET OPTIMIZATION APPARATUS AND METHOD - A method for optimizing a plurality of volume records stored in cache may include monitoring a volume including multiple data sets, wherein each data set is associated with a volume record, and each volume record is stored in a volume record data set. The method may include tracking read and write operations to each of the data sets over a period of time. The method may further include reorganizing the volume records in the volume record data set such that volume records for data sets with a larger number of read operations relative to write operations are grouped together, and volume records for data sets with a smaller number of read operations relative to write operation are grouped together. A corresponding apparatus and computer program product are also disclosed. | 07-19-2012 |
20120203995 | ON DEMAND STORAGE GROUP MANAGEMENT WITH RECAPTURE - A method to dynamically adjust the amount of free space in a storage group is disclosed herein. In certain embodiments, such a method may include monitoring the amount of free space in an active storage group. The method may further include maintaining an overflow storage group containing unused volumes. When the free space in the active storage group falls below a lower threshold value, the method may automatically move a volume from the overflow storage group to the active storage group. Conversely, when the free space in the active storage group exceeds an upper threshold value, the method may automatically transfer data from a volume in the active storage group to other volumes in the active storage group, and move the volume from the active storage group to the overflow storage group. A corresponding computer program product and apparatus are also disclosed herein. | 08-09-2012 |
20120210446 | SESSION-CONTROLLED-ACCESS OF CLIENT DATA BY SUPPORT PERSONNEL - A method for controlling access to client data by support providers is disclosed herein. In one embodiment, such a method includes initiating a session on a server computer in response to receipt of a request for assistance from a client, the session having client data associated therewith. A session key is generated for the session. The session key includes a session identifier and a support provider identifier corresponding to an assignee. The session key may further include a client identifier corresponding to the client. Requests to access the client data include an assignee key including a session identifier and a support provider identifier, and potentially a client identifier if needed. The assignee key is compared to the session key. If correspondence is found between the identifiers in the assignee key and the session key, access is granted. | 08-16-2012 |
20120284474 | ENABLING RECOVERY DURING DATA DEFRAGMENTATION - In defragmentation of data of a data storage system, the data storage system having at least one storage control and data storage, allowing defragmentation of data with respect to the data storage, the defragmentation comprising analysis and data movement. During the defragmentation and before completion of the defragmentation, in response to the data movement reaching a stable state, further defragmentation analysis and data movement is interrupted; making a point-in-time copy of the data subject to the defragmentation; and resuming the defragmentation analysis and data movement. At a further stable state where a new point-in-time copy is made, an earlier point-in-time copy is withdrawn. Should the defragmentation process end prematurely, a backup of the data subject to defragmentation may be recovered from a most recent point-in-time copy. | 11-08-2012 |
20120297251 | METHOD AND COMPUTER PROGRAM PRODUCT FOR SYSTEM TUNING BASED ON PERFORMANCE MEASUREMENTS AND HISTORICAL PROBLEM DATA AND SYSTEM THEREOF - According to one embodiment, a test system includes a data collection module adapted for collecting data from a test system, a storage module adapted for storing the collected data in an organized format, the data including problem data, associated configuration information, associated performance information, and activity data, an analysis module adapted for analyzing the collected data to define at least two activity zones by correlating the problem data, the associated configuration information, the associated performance information, and the activity data, the at least two activity zones including a safe zone where the test system operates normally and a danger zone where the test system is susceptible to operational problems, and an adjustment module adapted for adjusting available resources and/or workload of the test system to cause the test system to operate in the danger zone thereby increasing a likelihood of fault occurrence for testing purposes. | 11-22-2012 |
20120303916 | DEFRAGMENTATION OF DATA STORAGE POOLS - In a computer-implemented data storage system comprising at least one storage control and data storage, wherein data is stored in the form of volumes, at least a plurality of volumes having at least some freespace, and a grouping of a plurality of volumes comprises a pool. In response to a defragmentation request, the storage control initiates migration of data from a pool to generate additional freespace. Subsequent to the migration of data, fragmentation of data of the pool is computed, and the amount of existing freespace of the pool is determined. The amount of existing freespace is compared to a freespace threshold, where the freespace threshold is related to the computed fragmentation. If the comparison indicates the amount of freespace is below the threshold, spill volumes are added to the pool; and, else, the pool is kept intact without adding spill volumes. Then, defragmentation of the pool is initiated. | 11-29-2012 |
20120303918 | DEFRAGMENTATION OF DATA STORAGE POOLS - In a computer-implemented data storage system comprising at least one storage control and data storage, wherein data is stored in the form of volumes, at least a plurality of volumes having at least some freespace, and a grouping of a plurality of volumes comprises a pool. In response to a defragmentation request, the storage control initiates migration of data from a pool to generate additional freespace. Subsequent to the migration of data, fragmentation of data of the pool is computed, and the amount of existing freespace of the pool is determined. The amount of existing freespace is compared to a freespace threshold, where the freespace threshold is related to the computed fragmentation. If the comparison indicates the amount of freespace is below the threshold, spill volumes are added to the pool; and, else, the pool is kept intact without adding spill volumes. Then, defragmentation of the pool is initiated. | 11-29-2012 |
20120324176 | STORAGE ALLOCATION BASED ON DATA SET SIZE - An approach to allocating storage that has track managed storage and cylinder managed storage. The approach involves receiving a request to allocate a data set for new data and determining if the size of the new data exceeds a breakpoint value. The size of the new data may be determined by allocating a buffer data set that is the size of the breakpoint value, and writing the new data to the buffer data set. If the new data only partially fills the buffer data set, then the size of the new data is smaller than the breakpoint value. If the new data overfills the buffer data set, then the size of the new data set is larger than the breakpoint value. New data that is larger than the breakpoint value is automatically stored in cylinder managed storage, while new data that is smaller than the breakpoint value is automatically stored in track managed storage. | 12-20-2012 |
20130007292 | DATA SET CONNECTION MANAGER HAVING A PLURALITY OF DATA SETS TO REPRESENT ONE DATA SET - Provided are a computer program product, system, and method for a data set connection manager having a plurality of data sets to represent one data set. A request is processed to open a connection to a data set having members, wherein the connection is used to perform read and write requests to the members in the data set. In response to establishing the connection, establishing for the connection a primary data set having all the members; a secondary data set to which updated members in the primary data set are written; and a pending delete data set to pending delete members comprising members that are updated. | 01-03-2013 |
20130007397 | DYNAMIC VVDS EXPANSION - A method for addressing an out-of-space condition for a VSAM Volume Data Set (VVDS) includes detecting an out-of-space condition in a VVDS on a volume. The method creates, in response to the out-of-space condition, a new VVDS on the volume without adding a record to the old VVDS (e.g., by bypassing “catalog services”). The new VVDS is assigned a temporary name. The method then copies records from the old VVDS to the new VVDS. The method may then rename the old VVDS to a temporary name and rename the new VVDS to the original name of the old VVDS. The old VVDS may then be deleted. Alternatively, instead of renaming the old VVDS to a temporary name, the old VVDS may be deleted. The new VVDS may then be renamed to the original name of the old VVDS. A corresponding apparatus and computer program product are also described. | 01-03-2013 |
20130013566 | STORAGE GROUP SYNCHRONIZATION IN DATA REPLICATION ENVIRONMENTS - A method for dynamically synchronizing storage groups in a data replication environment is disclosed. In one embodiment, such a method includes detecting the addition of a volume to a storage group of a primary storage system. The method then automatically performs the following in response to detecting the addition of the volume: (1) adds a corresponding volume to a corresponding storage group on a secondary storage system; (2) creates a mirroring relationship between the volume added to the primary storage system and the volume added to the secondary storage system; and (3) adds the mirroring relationship to a mirroring session established between the storage groups on the primary and secondary storage systems. A corresponding system and computer program product are also disclosed. | 01-10-2013 |
20130019070 | CONSOLIDATING CONTROL AREASAANM Lehr; Douglas L.AACI AustinAAST TXAACO USAAGP Lehr; Douglas L. Austin TX USAANM McCune; Franklin E.AACI TucsonAAST AZAACO USAAGP McCune; Franklin E. Tucson AZ USAANM Reed; David C.AACI TucsonAAST AZAACO USAAGP Reed; David C. Tucson AZ USAANM Smith; Max D.AACI TucsonAAST AZAACO USAAGP Smith; Max D. Tucson AZ US - A detection module selects logically adjacent first and second control areas of a cluster. The detection module further determines that the first and second control areas satisfy a migration test wherein the first control area has free space exceeding a free threshold, the free space is at least equal to a space requirement for each second control area control interval, and the second control area has fewer control intervals than a control interval threshold. In addition, a copy module copies each second control area control interval to the first control area in response to determining that the first and second control areas satisfy the migration test. | 01-17-2013 |
20130024640 | Virtual Logical Volume for Overflow Storage of Special Data Sets - Method and system embodiments for facilitating overflow storage of special data sets that reside on a single logical volume are provided. A virtual logical volume is created from unallocated memory units across a plurality of logical volumes in a volume group. The virtual logical volume appears the same as any one of the logical volumes in the volume group to an external client. Upon receipt of a special data set that must reside in a single logical volume, an attempt is first made to allocate the special data set to one of the logical volumes in the volume group. If that allocation attempt fails, the special data set is allocated to the virtual logical volume. The virtual logical volume may be created only upon the failure to allocate the special data set to one of the logical volumes, and may be destroyed if sufficient space in one of the logical volumes is freed up to transfer the special data set. Creation of the virtual logical volume may be reserved for only critical special data sets whose failure would result in a storage system outage. | 01-24-2013 |
20130031069 | ALLOWING WRITES TO COMPLETE WITHOUT OBTAINING A WRITE LOCK TO A FILE - Provided are a computer program product, system, and method for allowing writes to complete without obtaining a write lock to a file. A lock is provided to a first request, comprising a read or write request, to access the file. A second write request is received while the first request maintains the lock. A temporary file associated with the file for the second write request is created. The second write request is controlled to write to the temporary file while the lock is held by the first request. In response to completing the first request, the lock is granted to the second write request to write the data in the temporary file to the file. | 01-31-2013 |
20130047032 | DATA SET AUTORECOVERY - An approach to providing auto recovery of data sets in volumes. When an error condition results from an attempt to access an unintentionally deleted data set, an event is generated and sent to other systems with access to the volume in which the data set existed. The volume is also locked to prevent corruption during the recovery process. A system that has the unintentionally deleted data set open retrieves location information for the data set from control blocks in the system's memory. This location information is used to build a new entry for the data set in the VTOC for the volume. When the data set is thus recovered, the data set is validated, the lock removed, and the data set is made available to the systems sharing the volume. | 02-21-2013 |
20130054924 | PREEMPTIVELY ALLOCATING EXTENTS TO A DATA SET - Provided are a computer program product, system, and method for preemptively allocating extents to a data set in a storage system. A data set is comprised of a plurality of extents configured in at least one volume in the storage system. A first extent is allocated to the data set in a first volume to extend the data set. A determination is made as to whether a second extent can be allocated to the data set in the first volume in response to the allocating of the first extent. The second extent in a second volume is allocated for the data set in response to determining that the second extent cannot be allocated to the data set in the first volume. | 02-28-2013 |
20130055219 | OVERLAY IDENTIFICATION OF DATA PROCESSING TARGET STRUCTURE - A method, system, and computer program product for identifying an overlay of a data processing target structure in a computing environment is provided. At least one of examining a mapping macro for the target structure with a set of valid ranges, comparing the set of valid ranges with the target structure to identify a string of at least one first invalid value and a last invalid value and locate invalid regions of the target structure, and examining executable code associated with the target structure, comparing at least one unchanged module against at least one additional module exhibiting an overlay characteristic to identify the string of the at least one first invalid value and the last invalid value and locate invalid regions of the target structure, is performed. | 02-28-2013 |
20130074050 | SELECTIVE TRACE FACILITY - An approach to selectively recording trace data. The approach sifts through process control and state data to store data that is most relevant to aiding debugging while reducing the overall amount of data that is stored in a trace data set by a trace facility. The approach may involve initiating a trace operation for the software component and, for each resource of the software component, determining whether the resource is currently in use. For those resources in use, the current state of the resource is compared with the previous state of the resource. If the current state has changed, the current state is written to the trace data set. If the resource is not in use, or the current state has not changed, no entry is made to the trace data set. The approach may also analyze users to determine which resources the users are holding and/or waiting for. | 03-21-2013 |
20130159258 | DATA SET INDEX RECORD PRESERVATION - Portions of index information are pulled from a name directory and an attribute directory to form a new subindex data set that is stored as a separate file from the name directory and the attribute directory. The name directory and the attribute directory each being associated with partitioned data set extended (PDSE) data sets stored sequentially in members. Pursuant to an update to the PDSE data sets, a selected portion of an index record of the dataset is stored as a record in the new subindex data set and the storing includes acting on an integrated catalog facility catalog to perform operations relating to allowacation and maintenance of the new subindex data set. An oldest existing record is replaced with a recent version if a determination is made that adding the recent version exceeds a predetermined number of versions. A component of the new subindex data set is recoverable. | 06-20-2013 |
20130173542 | REPLICATION OF DATA SETS - An approach that allows for replicating data sets that have different attributes. A logical copy operation may not be possible from a source data set to a target data set due to differences between their respective attributes. The source data set may have obsolete attributes that prevent a logical copy to a target data set with supported attributes. The presented solution may involve allocating an intermediate data set with the same attributes as the source data set. The intermediate data set may be allocated with the same obsolete attributes as the source data set. The approach may also involve executing a logical copy operation from the source data set to the intermediate data set. A standard copy operation that reformats the data may be executed on the intermediate data set to the target data set. | 07-04-2013 |
20130173805 | EXTENDED ADDRESS VOLUME (EAV) ALLOCATION VERIFICATION - In one embodiment, a system includes a first storage including track-managed storage and cylinder-managed storage, logic adapted for receiving a request to allocate a target data set on the first storage, logic adapted for determining a size of a source data set on a second storage, wherein data from the source data set will be copied to the target data set, logic adapted for comparing the determined size of the source data set to a break point value to determine if the target data set is to be stored to the track-managed storage or the cylinder-managed storage of the first storage, logic adapted for receiving the data from the source data set, and logic adapted for storing the data from the source data set to the target data set in either track-managed storage or cylinder-managed storage of the first storage based on the comparison. | 07-04-2013 |
20130174167 | INTELLIGENT INCLUSION/EXCLUSION AUTOMATION - Computer systems and computer program products for automating tasks in a computing environment are provided. In one such embodiment, by way of example only, if an instant task is not found in one of list of included tasks and a list of excluded tasks, at least one of the following is performed: the instant task is compared the with previous instances of the task, if any; the instant task is analyzed, including an input/output (I/O) sequence for the instant task, to determine if the instant task is similar to an existing task; and the instant task is considered as a possible candidate for automation. If the instant task is determined to be an automation candidate, the instant task is added to the list of included tasks, otherwise the instant task is added to the list of excluded tasks. | 07-04-2013 |
20130174171 | INTELLIGENT INCLUSION/EXCLUSION AUTOMATION - Methods, computer systems, and computer program products for automating tasks in a computing environment, are provided. In one such embodiment, by way of example only, if an instant task is not found in one of list of included tasks and a list of excluded tasks, at least one of the following is performed: the instant task is compared the with previous instances of the task, if any; the instant task is analyzed, including an input/output (I/O) sequence for the instant task, to determine if the instant task is similar to an existing task; and the instant task is considered as a possible candidate for automation. If the instant task is determined to be an automation candidate, the instant task is added to the list of included tasks, otherwise the instant task is added to the list of excluded tasks. | 07-04-2013 |
20130179660 | Virtual Logical Volume for Overflow Storage of Special Data Sets - System embodiments for facilitating overflow storage of special data sets that reside on a single logical volume are provided. A virtual logical volume is created from unallocated memory units across a plurality of logical volumes in a volume group. The virtual logical volume appears the same as any one of the logical volumes in the volume group to an external client. Upon receipt of a special data set that must reside in a single logical volume, an attempt is first made to allocate the special data set to one of the logical volumes in the volume group. If that allocation attempt fails, the special data set is allocated to the virtual logical volume. The virtual logical volume may be created only upon the failure to allocate the special data set to one of the logical volumes, and may be destroyed if sufficient space in one of the logical volumes is freed up to transfer the special data set. Creation of the virtual logical volume may be reserved for only critical special data sets whose failure would result in a storage system outage. | 07-11-2013 |
20130191343 | ENSURING PARTITIONED DATASET EXTENDED (PDSE) CRITICAL DATASET REDUNDANCY (CDR) - In one embodiment, a system includes a critical partitioned dataset extended (PDSE) stored to memory of the system; logic adapted for protecting the critical PDSE by creating a copy of the critical PDSE, referred to as a PDSE copy; logic adapted for providing a critical dataset redundancy (CDR) task with exclusive access to the PDSE copy; logic adapted for providing a replacement critical PDSE by redirecting corralled connections to the PDSE copy; logic adapted for protecting the replacement critical PDSE by creating a copy of the replacement critical PDSE, referred to as a replacement PDSE copy; and logic adapted for providing the CDR task with exclusive access to the replacement PDSE copy. | 07-25-2013 |
20130191344 | ENSURING PARTITIONED DATASET EXTENDED (PDSE) CRITICAL DATASET REDUNDANCY (CDR) - In one embodiment a method for providing recoverability to a system includes: protecting a critical PDSE by creating a copy of the critical PDSE, providing a CDR task with exclusive access to the PDSE copy, initiating a transaction queue for tracking updates to the critical PDSE, adding any updates performed to the critical PDSE to the transaction queue, updating the PDSE copy according to the transaction queue, quiescing the critical PDSE, corralling open connections to the critical PDSE, completing each update resident in the transaction queue to the PDSE copy up to a last known uncorrupted state of the critical PDSE, providing a replacement critical PDSE by redirecting the corralled connections to the PDSE copy, protecting the replacement critical PDSE by creating a copy of the replacement critical PDSE, referred to as a replacement PDSE copy, and providing the CDR task with exclusive access to the replacement PDSE copy. | 07-25-2013 |
20130198473 | BACKUP COPY ENHANCEMENTS TO REDUCE PRIMARY VERSION ACCESS - A method, system, and computer program product for performing a backup operation in a computing environment is provided. A dataset corresponding to a backup copy is examined to determine if the dataset has changed from a previous backup operation. If the dataset has not changed, a backup inventory registry is consulted to determine a current version of a backup copy. The current version is one of a plurality of available versions. The backup operation is performed using the current version of the backup copy. | 08-01-2013 |
20130227234 | TEMPORARY VTOC LOCKING DURING DEFRAGMENTATION - Various embodiments for defragmentation of a storage volume in a computing storage environment by a processor device are provided. A volume table of contents (VTOC) is serialized for a volume scan operation. At least one dummy data set in the storage volume is allocated, to be subsequently filled with actual data pursuant to a degragmentation operation. Input/output (I/O) operations are allowed to occur. | 08-29-2013 |
20130232375 | TRANSITIONAL REPLACEMENT OF OPERATIONS PERFORMED BY A CENTRAL HUB - A central hub is coupled to a plurality of computational devices. The central hub stores a data structure that grants locks for accessing common data stored at the central hub, wherein the common data is shared by the plurality of computational devices. Each computational device maintains locally those locks that are held by the computational device in the data structure stored at the central hub. In response to a failure of the data structure stored at the central hub, a selected computational device of the plurality of computational devices is determined to be a manager system. Other computational devices besides the manager system communicate to the manager system all locks held by the other computational devices in the data structure stored at the central hub. The data structure and the common data are generated and stored at the manager system. Transactions are performed with respect to the data structure stored at the manager system, until the data structure stored at the central hub is operational. | 09-05-2013 |
20130232380 | DIAGNOSTIC DATA SET COMPONENT - Various embodiments for retaining diagnostic information for data in a computing storage environment are provided. In one such embodiment, a diagnostic component, apart from a volume table of contents (VTOC), associated with an integrated catalog facility (ICF) catalog and with a base data set from data sets via a catalog association record is initialized. The diagnostic component configured to retain base data set-specific diagnostic information retrievable by the computing storage environment to assist in error diagnosis and the ICF catalog is one of the data sets storing information about the data sets for facilitating a retrieval of a name of the base data set and assists with retaining and retrieval of the base data set-specific diagnostic information. The base data set-specific diagnostic information is stored pursuant to at least one event associated with the base data set. | 09-05-2013 |
20130246467 | Remote Inventory Manager - A documentation inventory manager which assigns a protection key to each piece of documentation that is received. More specifically, when providing information to a receiving company, a client provides their files to a common FTP server. As a support team of the receiving company accesses the files and stores some or all of the files to a local storage system, the files are modified to include an imbedded header record. In certain embodiments, the imbedded header record includes information regarding an original file name sent by the client, a key value that is assigned to that version of the downloaded file, permissions such as whether the file can be copied, and the inventory manager location. Each time a version of the file is downloaded to a different location within the receiving company, that file name, location, and new unique key is updated in the documentation inventory manager. | 09-19-2013 |
20130290341 | MAINTAINING A DATA STRUCTURE WITH DATA SET NAMES AND POINTERS TO A PLURALITY OF CATALOGS - A plurality of catalogs are maintained, and wherein each catalog of the plurality of catalogs includes data sets and attributes of the data sets. An indication that a new data set is to be defined is received. A selected catalog is determined from the plurality of catalogs, wherein the selected catalog is suitable for including the new data set and attributes of the new data set. An entry that indicates a data set name corresponding to the new data set and an index to the selected catalog is inserted in a group table. | 10-31-2013 |
20130326051 | PERFORMANCE ANALYSIS USING ANONYMOUS AGGREGATED DATA - An approach to improving performance of a target system is disclosed. The approach may involve determining how similar a target system being considered is to other systems in use by other clients. For each of these other separate systems, the approach may involve determining the differences between the performance of the target system and the performance of the separate system, accounting for the level of similarity. A report can be generated that identifies performance values of the target system that are outside an acceptable range, which is based on the performance of the other separate systems. Based on this report, the administrator of the target system can consider configuration changes and upgrades to improve performance of the target system. | 12-05-2013 |
20140006732 | ANALYZING AND REDUCING DUMP DATA | 01-02-2014 |
20140006853 | RECOVERING A VOLUME TABLE AND DATA SETS FROM A CORRUPTED VOLUME | 01-02-2014 |
20140006874 | MANAGING TRACES TO CAPTURE DATA FOR MEMORY REGIONS IN A MEMORY | 01-02-2014 |
20140019708 | GRANTING AND REVOKING SUPPLEMENTAL MEMORY ALLOCATION REQUESTS - Provided are a computer program product, system, and method for granting and revoking supplemental memory allocation requests. Supplemental memory allocations of memory resources are granted to applications following initial memory allocations of the memory resources to the applications. In response to determining that available memory resources have fallen below an availability threshold, determining a weighting factor for each supplemental memory allocation based on at least one of an amount of the memory resources allocated to the supplemental memory allocation and a measured duration during which the memory resources have been allocated. At least one of the supplemental memory allocations is selected to revoke based on the determined weighting factors of the supplemental memory allocations. | 01-16-2014 |
20140019800 | INADVERTENT FREED STORAGE RECOVERY - An abnormal termination recovery is performed where storage is referenced shortly after the storage has been freed. More specifically, when storage is freed, and that storage is accessed, an abnormal termination error (e.g., a page translation exception event) occurs due to referencing storage that has not been obtained. When the abnormal termination error occurs, an abnormal termination recovery operation is accessed. The abnormal termination recovery operation scans a history of storage freeing operations (e.g., FREEMAIN operations) to determine whether the storage location accessed by the storage access that caused the abnormal termination error was recently freed from within the same address space. If the storage location was recently freed, then the abnormal termination recovery operation reverses the storage freeing operation by issuing a storage obtaining operation (e.g., a GETMAIN operation) to re-obtain the storage. | 01-16-2014 |
20140040578 | MANAGING DATA SET VOLUME TABLE OF CONTENTS - For managing a data set volume table of contents, a management module creates a data set volume table of contents (DSVTOC) for a data set residing on a volume. The DSVTOC resides in a virtual storage access method (VSAM) system and includes a DSVTOC index, DSVTOC cluster data, and DSVTOC data for the data set. A copy module maintains a copy of the DSVTOC on the volume. | 02-06-2014 |
20140040586 | Orphan Storage Release - A method, system and computer readable medium that identify orphan storage and release the orphaned storage before application or system outages can result. More specifically, in certain embodiments, a method, system and computer readable medium periodically scan through common memory storage and identifies those areas that are no longer associated with a running task or have been allocated for longer than a running task with a matching task address. These areas are then identified as potentially orphaned storage locations. | 02-06-2014 |
20140059376 | RECOVERING A VOLUME TABLE AND DATA SETS FROM A CORRUPTED VOLUME - Provided are a computer program product, system, and method for recovering a volume table and data sets from a corrupted volume. Data corruption is detected in a volume having data sets. A volume table having information on the data sets allocated in the volume is diagnosed. A backup volume table comprising a most recent valid backup of the volume table is accessed from a backup of the volume in response to determining that the diagnosed volume table is not valid. Content from the backup volume table is processed to bring to a current state in a recovery volume table for a recovery volume. The data sets in the volume are processed to determine whether they are valid. The valid data sets are moved to the recovery volume. A data recovery operation is initiated for the data sets determined not to be valid. | 02-27-2014 |
20140068185 | AVOIDING RECALL OPERATIONS IN A TIERED DATA STORAGE SYSTEM - According to one embodiment, a system for recalling a data set, includes logic integrated with and/or executable by a hardware processor, the logic being configured to receive a request to open a data set, determine whether the requested data set is stored to a lower tier of a tiered data storage system in multiple associated portions or to a higher tier of the tiered data storage system, move each associated portion of the requested data set from the lower tier to the higher tier of the tiered data storage system when at least one portion of the requested data set is stored to the lower tier of the tiered data storage system, and assemble the associated portions of the requested data set into a single data set to form the requested data set on the higher tier of the tiered data storage system. | 03-06-2014 |
20140068325 | TEST CASE RESULT PROCESSING - A computer-implemented method for test case result processing includes receiving, by a test case result processing logic in a processor of a computer, a test result from a test case that executes on the computer; determining, by the test case result processing logic based on a result description file, whether a result description corresponding to the received result exists in the result description file; based on the result description corresponding to the received result existing in the result description file, determining an action description associated with the result description based on an action definition file; and executing an action corresponding to the determined action description. | 03-06-2014 |
20140075138 | LOGGING UPDATES TO MONITORED DATA SETS IN A STORAGE - Providing a computer program product, system, and method for logging updates to monitored data sets in a storage. A request is received to monitor changes to a monitored data set comprising one of the data sets in the storage. A determination is made of tracks in the storage in which the data set is stored. The determined tracks are indicated in monitored tracks. Updates to the storage are received and a determination is made as to whether the updates are for the monitored tracks. The updates are logged in response to determining that updates are for the monitored tracks. A determination is made of new tracks added to the monitored data set and the determined new tracks are indicated in the monitored tracks. | 03-13-2014 |
20140075139 | MODIFYING MEMORY SPACE ALLOCATION FOR INACTIVE TASKS - Provided are a computer program product, system, and method for modifying memory space allocation for inactive tasks. Information is maintained on computational resources consumed by tasks running in the computer system allocated memory space in the memory. The information on the computational resources consumed by the tasks is used to determine inactive tasks of the tasks. The allocation of the memory space allocated to at least one of the determined inactive tasks is modified. | 03-13-2014 |
20140075145 | MODIFYING MEMORY SPACE ALLOCATION FOR INACTIVE TASKS - Provided are a computer program product, system, and method for modifying memory space allocation for inactive tasks. Information is maintained on computational resources consumed by tasks running in the computer system allocated memory space in the memory. The information on the computational resources consumed by the tasks is used to determine inactive tasks of the tasks. The allocation of the memory space allocated to at least one of the determined inactive tasks is modified. | 03-13-2014 |
20140082316 | SELECTING PAGES IMPLEMENTING LEAF NODES AND INTERNAL NODES OF A DATA SET INDEX FOR REUSE - Provided are a computer program product, system, and method for selecting pages implementing leaf nodes and internal nodes of a data set index for reuse in memory. Pages in the memory are allocated to internal nodes and leaf nodes of a tree data structure representing all or a portion of a data set index for the data set, wherein the leaf nodes include information on members of the data set. The internal nodes include one or more keys used to traverse the tree data structure to reach the leaf nodes to access the members of the data set. At least one page allocated to the leaf nodes and the internal nodes is selected based on durations during which the allocated pages have not been used. Pages allocated to the leaf nodes are selected for reuse at a higher rate than the pages allocated to the internal nodes. | 03-20-2014 |
20140082752 | Read-Once Data Sets and Access Method - A documentation inventory manager provided which ensures that a client data set may only be read once. More specifically, the documentation inventor manager comprises a data set type and an access module. In certain embodiments, the data set type is only created once and can only be accessed via the read once access module. The read once access module ensures on read, that the data which was read is no longer readable. In various embodiments after being read once the data is automatically corrupted, deleted, or overwritten. | 03-20-2014 |
20140164337 | DATA SET CONNECTION MANAGER HAVING A PLURALITY OF DATA SETS TO REPRESENT ONE DATA SET - Provided are a computer program product, system, and method for a data set connection manager having a plurality of data sets to represent one data set. A request is processed to open a connection to a data set having members, wherein the connection is used to perform read and write requests to the members in the data set. In response to establishing the connection, establishing for the connection a primary data set having all the members; a secondary data set to which updated members in the primary data set are written; and a pending delete data set to pending delete members comprising members that are updated. | 06-12-2014 |
20140188888 | ASSIGNING SHARED CATALOGS TO CACHE STRUCTURES IN A CLUSTER COMPUTING SYSTEM - An apparatus, system, and method for assigning a cache structure to a catalog. The apparatus includes an identification module configured to identify a catalog for sharing in association with a coupling facility. The coupling facility includes a plurality of cache structures for catalogs of a cluster computing system. The coupling facility is configured to facilitate data sharing among a plurality of host systems of the cluster computing system. The apparatus includes a selection module configured to select a cache structure of the plurality of cache structures for the catalog based on one or more usage status indicators according to an assignment policy. The apparatus includes a storage module configured to store catalog information of the catalog in the cache structure in response to the selection module selecting the cache structure. | 07-03-2014 |
20140201459 | OPTIMIZED CACHING BASED ON HISTORICAL PRODUCTION PATTERNS FOR CATALOGS - A method, system and computer readable medium that predict times where cost of catalog caching is not efficient and deactivating catalog caching for that catalog during the predicted times. More specifically, an optimized catalog caching operation conducts historical analysis on catalog usage via records such as resource measurement facility (RMF) records and catalog statistical data. | 07-17-2014 |
20140201482 | SELECTING FIRST DATA SETS IN A FIRST STORAGE GROUP TO SWAP WITH SECOND DATA SETS IN A SECOND STORAGE GROUP - Provided are a computer program product, system, and method for selecting first data sets in a first storage group to swap with second data sets in a second storage group. First data sets are stored in a first storage group and second data sets are stored in a second storage group. A determination is made for a value for each of at least one of the first data sets based on at least one priority of at least one job processing I/O activity at the first data set. At least one of the first data sets for which the value was determined is selected to migrate to the second storage group based on the value. | 07-17-2014 |
20140201487 | SELECTING FIRST DATA SETS IN A FIRST STORAGE GROUP TO SWAP WITH SECOND DATA SETS IN A SECOND STORAGE GROUP - Provided are a computer program product, system, and method for selecting first data sets in a first storage group to swap with second data sets in a second storage group. First data sets are stored in a first storage group and second data sets are stored in a second storage group. A determination is made for a value for each of at least one of the first data sets based on at least one priority of at least one job processing I/O activity at the first data set. At least one of the first data sets for which the value was determined is selected to migrate to the second storage group based on the value. | 07-17-2014 |
20140223130 | ALLOCATING ADDITIONAL REQUESTED STORAGE SPACE FOR A DATA SET IN A FIRST MANAGED SPACE IN A SECOND MANAGED SPACE - Provided are a computer program product, system, and method for allocating additional requested storage space for a data set in a first managed space in a second managed space. A request for additional storage space is received for a requested data set stored in a first managed space in the storage. A revised amount of storage space for the requested data set comprises at least an amount of space currently allocated to the requested data set in the first managed space and the requested additional storage space. If the revised amount of storage space exceeds a value, then allocation is made of the revised amount of storage space in allocated storage space in a second managed space of the storage. The data set is stored in the allocated storage space in the second managed space. | 08-07-2014 |
20140223133 | ALLOCATING ADDITIONAL REQUESTED STORAGE SPACE FOR A DATA SET IN A FIRST MANAGED SPACE IN A SECOND MANAGED SPACE - Provided are a computer program product, system, and method for allocating additional requested storage space for a data set in a first managed space in a second managed space. A request for additional storage space is received for a requested data set stored in a first managed space in the storage. A revised amount of storage space for the requested data set comprises at least an amount of space currently allocated to the requested data set in the first managed space and the requested additional storage space. If the revised amount of storage space exceeds a value, then allocation is made of the revised amount of storage space in allocated storage space in a second managed space of the storage. The data set is stored in the allocated storage space in the second managed space. | 08-07-2014 |
20140289490 | EXTENDED ADDRESS VOLUME (EAV) ALLOCATION VERIFICATION - In one embodiment, a method includes determining that a request to allocate a target data set on a first storage includes a release command, determining an actual size of the target data set after storing the target data set on the first storage, comparing the actual size of the target data set to a break point value, relocating the target data set from cylinder-managed storage to track-managed storage of the first storage when the actual size of the target data set is less than the break point value and the target data set is stored on the cylinder-managed storage, and relocating the target data set from the track-managed storage to the cylinder-managed storage of the first storage when the actual size of the target data set is at least as great as the break point value and the target data set is stored on the track-managed storage. | 09-25-2014 |
20140298102 | DIAGNOSTIC DATA SET COMPONENT - Various embodiments for retaining diagnostic information for data in a computing storage environment. In one such embodiment, a diagnostic component, apart from a volume table of contents (VTOC), associated with an integrated catalog facility (ICF) catalog and with a base data set from data sets via a catalog association record, is initialized. The diagnostic component is configured to retain base data set-specific diagnostic information retrievable by the computing storage environment to assist in error diagnosis and the ICF catalog is one of the data sets storing information about the data sets for facilitating a retrieval of a name of the base data set and assists with retaining and retrieval of the base data set-specific diagnostic information. The base data set-specific diagnostic information is stored pursuant to at least one event associated with the base data set. | 10-02-2014 |
20140304224 | REPLICATING A SOURCE STORAGE SYSTEM - For replicating a source storage system, a scan module generates a source storage server description for each source storage server of the source storage system from a scan of the source storage system. The source storage server description includes a replication type and a source volume record for each source logical volume of the source storage server. A provision module determines a number of replicated instances of each source logical volume for a target storage system from the replication type. In addition the provision module generates a target storage server description for each target storage server of the target storage system from each source storage server description in response to the target storage system satisfying a target storage requirement. | 10-09-2014 |
20140304483 | VOLUME EXTENT ALLOCATION - A method of and system for processing an extend request for a data set in a storage facility is disclosed. The method and system may include receiving the extend request. The extend request may include a new extent allocation amount for the data set. The data set may be associated with a number of volumes in the storage facility. The method and system may include apportioning the new extent allocation amount among fractional amounts. The method and system may include allocating the fractional amounts. | 10-09-2014 |
20140310454 | DATA SET MANAGEMENT - A method of and system for managing a data set stored on units of storage space in a storage facility is disclosed. The method and system may include identifying prospect extents of the data set. The prospect extents may include a first prospect extent stored on a first unit of storage space and a second prospect extent stored on a second unit of storage space. The method and system may include congregating the first prospect extent and the second prospect extent on a destination unit of storage space in the storage facility. | 10-16-2014 |
20140330935 | MANAGING FILE TRANSFER COMMANDS - A method of and system for managing file transfer commands to a remote system is disclosed. The method and system may include establishing a first defined file transfer command having a first group identifier. The first defined file transfer command may be configured to pull data from the remote system. The method and system may include establishing a second defined file transfer command having a second group identifier. The second defined file transfer command may be configured to at least one of delete data of the remote system and push data to the remote system. The method and system may include performing the first defined file transfer command after performing the second defined file transfer command when the first group identifier and the second group identifier match. | 11-06-2014 |
20140337385 | MANAGING FILE USAGE - Embodiments of a system and method are disclosed concerning the management of file usage. The method of controlling file access may manage a file with a target ID that has a sender and a recipient. The method may also establish a priority level key associated with the file. The priority level key may control file access. The method may provide the file access to the recipient if the recipient has access rights corresponding to the priority level key. | 11-13-2014 |
20140351293 | OPENING A DATA SET - A method of and system for opening a data set is disclosed. The method and system may include structuring a storage facility to have address spaces. The address spaces may include a first address space having an open manager. The open manager may be configured and arranged to manage activities associated with an open request in response to receiving the open request. The method and system may include performing pseudo-opens associated with the open request in the address spaces. The method and system may include performing a batch-open utilizing the pseudo-opens and a resource used to complete the open request. | 11-27-2014 |
20140351655 | MANAGING DIAGNOSTIC INFORMATION - A method of and system for managing diagnostic information is disclosed. The method and system may include creating a data space in volatile memory. The data space may be configured to collect a selected diagnostic information. The selected diagnostic information may include a first diagnostic information from a first source and a second diagnostic information from a second source. The method and system may include collecting in the data space the selected diagnostic information. The method and system may include releasing from the data space at least a portion of the selected diagnostic information in response to a triggering event. | 11-27-2014 |
20140358953 | PROBLEM MANAGEMENT RECORD PROFILING - According to embodiments of the invention a method for servicing a problem management record are provided. The method may include creating a problem management record profile from information provided in a problem management record, wherein the information includes characteristics of a client computer system and symptoms of a problem. The method may also include comparing the profile to profiles of previously resolved problem management records to find a profile having at least one matching. The method may also include contrasting information used to obtain a solution to a problem of the previously resolved problem management record to the information provided in the problem management record, wherein information used to obtain a solution which is not provided in the information provided in the problem management record is classified as additional information. The method may also include collecting the additional information, wherein collecting includes searching documentation of the client computer system. | 12-04-2014 |
20140380097 | RECOVERING A VOLUME TABLE AND DATA SETS - Provided are a computer program product, system, and method for recovering a volume table and data sets from a volume. Content from a backup volume table comprising a valid backup of a volume table from backup of the volume is processed to generate a recovery volume table for a recovery volume. The data sets in the volume are processed to determine whether they are valid. The valid data sets are moved to the recovery volume. A data recovery operation is initiated for the data sets determined not to be valid. | 12-25-2014 |
20150026137 | RECOVERING FROM A PENDING UNCOMPLETED REORGANIZATION OF A DATA SET - Provided are a computer program product, system, and method for recovering from a pending uncompleted reorganization of a data set managing data sets in a storage. In response an initiation of an operation to access a data set, an operation is initiated to complete a pending uncompleted reorganization of the data set in response to the data set being in a pending uncompleted reorganization state and no other process currently accessing the data set. | 01-22-2015 |
20150026311 | MANAGING A STORAGE SYSTEM - A method of and system for managing a storage system is disclosed. The method and system may include determining a first operational characteristic of a first configuration. The determination may be made using first data of the first configuration of the storage system and second data related to element interactions of the storage system. The method and system may include generating, using the second data, at least a second configuration of the storage system that differs from the first configuration. The method and system may include predicting, using the second data, at least a second operational characteristic of the second configuration. | 01-22-2015 |
20150026422 | MANAGING DATA SETS OF A STORAGE SYSTEM - A method of and system for managing data sets of a storage facility is disclosed. The method and system may include copying a first data set of a first unit of storage space. A second data set in a second unit of storage space may be created from copying the first data set. The method and system may include copying the second data set of the second unit of storage space. A third data set in a third unit of storage space may be created from copying the second data set. The second data set may be verified. Verification may be performed by comparing the third data set with the first data set. It may be determined whether the third data set matches the first data set. The first and third data sets may be deleted in response to the third data set matching the first data set. | 01-22-2015 |
20150039575 | MANAGING MULTIPLE LOCKS FOR DATA SET MEMBERS IN A DATA SET INDEX - Provided are a computer program product, system, and method for managing multiple locks for data set members in a data set index. The data set index has leaf nodes and internal nodes. In response to determining that a current lock is set at a locked node that prevents a grant to a requested lock, a determination is made as to whether there are different first and second descendant nodes from the locked node at a same level of the tree data structure linked to the requested data set member and the locked data set member, respectively. If so, the requested lock for the requested data set member is set at the first descendant node, the current lock is moved to the second descendant node for the locked data set member and the requested lock is granted. | 02-05-2015 |
20150046751 | MANAGING TRACES TO CAPTURE DATA FOR MEMORY REGIONS IN A MEMORY - Provided are a computer program product, system, and method for managing traces to capture data for memory regions in a memory. A trace includes a monitor parameter used by a trace procedure to monitor data in a memory device. A frequency is determined at which the trace procedure monitors the memory device. The trace procedure is invoked at the determined frequency to perform trace procedure operations comprising determining a region in the memory device according to the monitor parameter and copying data in the determined region to trace data in a data space. | 02-12-2015 |
20150052531 | MIGRATING JOBS FROM A SOURCE SERVER FROM WHICH DATA IS MIGRATED TO A TARGET SERVER TO WHICH THE DATA IS MIGRATED - Provided are a computer program product, system, and method for migrating jobs from a source server from which data is migrated to a target server to which the data is migrated. Mirrored data is copied from a source storage to a target storage. A determination is made of at least one eligible job of the jobs executing in the source server having execution characteristics indicating that the job is eligible for migration to the target server. The determined at least one eligible job is migrated to the target server to execute on the target server and perform operations with respect to the mirrored data in the target storage. The migrated eligible job is disabled at the source server. | 02-19-2015 |
20150058365 | MANAGING A DATA SET - A method of and system for managing a data set of a storage facility is disclosed. The data set may be a sequential-access data set. The method and system may include structuring the sequential-access data set to have a first group-of-records configured for adding a second group-of-records to the sequential-access data set. The method and system add a second group-of-records to the sequential-access data set. The method and system merge the second group-of-records with the first group-of-records in response to a triggering event. The method and system establish, in response to merging the second group-of-records with the first group-of-records, a marker configured to indicate the first and second group-of-records, as merged, is sorted. | 02-26-2015 |
20150081997 | USING AN ALIAS VOLUME NAME FOR A VOLUME TO ALLOCATE SPACE TO A DATA SET - Provided are a computer program product, system, and method for using an alias volume name for a volume to allocate space to a data set. An assignment of a plurality of volumes to a data set is maintained, wherein the volumes are configured in a storage system. A request is received to extend the data set. An alias volume name is assigned to the data set for a previously assigned volume to the data to extend the data set in response to one of the previously assigned volumes having available space to extend the data set. A base volume name is assigned to the data set for a volume not assigned to the data set in response to one of the previously assigned volumes to the data set not having available space to extend the data set. | 03-19-2015 |