Abstract: Described systems and techniques determine causal associations between events that occur within an information technology landscape. Individual situations that are likely to represent active occurrences requiring a response may be identified as causal event clusters, without requiring manual tuning to determine cluster boundaries. Consequently, it is possible to identify root causes, analyze effects, predict future events, and prevent undesired outcomes, even in complicated, dispersed, interconnected systems.

Abstract: This document describes systems and techniques enabling the secure registration of an agent such that the agent has secure and trusted access to its specific tenant and specific resources in a multi-region, multi-tenant, multi-cell SaaS platform. The systems and techniques use a secure and robust agent registration process to enable the creation of a unique security profile for each specific agent to enable access only to its specific tenant and specific resources that the agent uses to communicate with the SaaS platform to carry out jobs. The systems and techniques result in a registration process that is scalable for thousands or millions of agents in an environment having segregated SaaS platform cells.

Abstract: Systems and methods are provided that extract information from IMS log records to reduce the amount of data transmitted and input to an analysis engine. An example method includes writing IMS log records matching log types identified in an extraction list to a file within an IMS control region of a mainframe computer and outside of the IMS control region, and reading records from the file. For each record read, the method may also include extracting fields of interest from the log record based on fields of interest associated with the log type of the log record in the extraction list and a data-to-field mapping for the log type, converting the fields of interest to a predetermined format based on the data-to-field mapping, and writing at least one field of interest to an output file. The method may also include transmitting the output file to an analytics engine for processing.

Abstract: An event graph schema for a technology landscape may be determined, where the technology landscape is characterized using scores assigned to performance metrics. The event graph schema may include a plurality of nodes corresponding to the performance metrics and the scores, and directional edges connecting node pairs of the plurality of nodes, with each directional edge having a score-dependent validity criteria defined by scores of a corresponding node pair. Anomalous scores associated with an event within the technology landscape may be used to find anomalous nodes. Valid edges connecting two of the anomalous nodes and satisfying the score-dependent validity criteria thereof may be used to determine at least one path that includes the valid edges and connected anomalous nodes. In this way, it is possible to traverse the at least one path to identify at least one of the connected anomalous nodes as a root cause node of the event.

Abstract: The system and techniques described herein include receiving a transaction report from a log dataset, where the transaction report includes a class identifier (ID) for each of the transactions, a transaction execution count, and a total transaction response time. A first listing of the transactions is generated. An average number of unique transactions assigned to all of the classes and an average transaction execution count are calculated. A second listing of the transactions is generated that includes all of the transactions for the class IDs where the count of unique transactions assigned to the class is greater than the average number of unique transactions assigned to all of the classes. For each class ID and transaction name, the second listing is updated to identify one or more of the transactions as candidate transactions for running in a P-WFI region when the conditions are met.

Abstract: Described techniques provide convenient, reliable, straightforward techniques for enabling multi-path application outputs. A single application may be configured to output two or more data sets to two or more output destinations within a mainframe environment, without requiring copying or forwarding by an intermediate application utility.

Abstract: Methods, and computer program product for writing data sets to and from cloud storage for legacy mainframe applications. A call to a mount request issued by the operating system is intercepted. An exit call to prepare for dataset write is received from an OS open routine. At least one call to a Basic Sequential Access Method (BSAM) End of Block (EOB) write routine is intercepted. Subject to the at least one call to the BSAM EOB routine being associated with cloud storage, data chunks are sent in an asynchronous manner to cloud storage. A second exit call for finalizing writing of the data chunks to the cloud storage is received. A call to an unmount request is intercepted. As a result, data is written directly from the mainframe to the cloud storage without intermediate storage.

Abstract: Described systems and techniques enable the capture of an archive image copy of at least one database at a first time, as well as the capture of database metadata that includes a runtime environment of the at least one database. The archive image copy and the database metadata may be stored. A request to restore the at least one database may be received at a second time. In response to the request, the archive image copy and the database metadata may be determined. The at least one database may be restored, including re-establishing the runtime environment using the database metadata.

Abstract: For each database subsystem in a plurality of database subsystems running in a logical partition (LPAR), the systems and techniques include collecting data from buffer pools on a periodic interval, monitoring real storage availability on the LPAR, calculating an input/output (I/O) intensity score for each buffer pool for the periodic interval, ranking the buffer pools based on the I/O intensity score, calculating a cumulative I/O intensity score for each buffer pool across a cycle of multiple periodic intervals, ranking the buffer pools based on the cumulative I/O intensity score, and selecting a buffer pool candidate for page fixing. The buffer pool candidate for page fixing is a highest-ranked buffer pool from the plurality of buffer pools during the cycle based on the cumulative I/O intensity score that satisfies the real storage availability on the LPAR.

Abstract: System and techniques for determining an optimal number of regions in an IMS system include receiving a transaction report from a log dataset. A first table is generated from the transaction report, where the first table includes a class identified by a class identifier (ID), a number of regions the class is assigned, and a total percent region occupancy by the class. Classes ineligible to be shut down are identified based on a set of criteria and the classes ineligible to be shut down are eliminated. For each remaining class assigned to a threshold number of regions, candidate regions from the threshold number of regions eligible for shut down are identified and remaining regions from the threshold number of regions that can handle a workload from the candidate regions eligible for shut down are identified, where the remaining regions represent the optimal number of regions in the IMS system.

Abstract: Described systems and techniques enable log recovery that spans inter-tablespace movement of one or more tables within a database. Log-related processing, including, e.g., system recovery, auditing, or reporting, may be maintained, even when such inter-tablespace table movements occur within a time window defined for the log-related processing. A table movement of a moved table from a source tablespace to a target tablespace within a database may be identified. Within a plurality of log records of the database, pre-move log records identifying the moved table as being included within the source tablespace may be identified, and post-move log records identifying the moved table as being included within the target tablespace may be identified. The pre-move log records may be updated to obtain updated pre-move log records identifying the moved table as being included within the target tablespace.

Abstract: Described systems and techniques store, at a first time, first system service verification data that includes a first capture of a system services table having at least one system service entry, and a first portion of a system service identified in the at least one system service entry. At a second time, second system service verification data may be stored that includes a second capture of the system services table and a second portion of the system service identified in the at least one system service entry. At least one mismatch between the first system service verification data and the second system service verification data may be determined. At least one security notification message identifying the at least one mismatch with respect to at least one of the second capture of the system services table and the second portion may thus be generated.

Abstract: Methods, system and computer program product, the method comprising: from high level language code (HLLC), receiving a request for reading a data set from a tape onto an object storage connected over TCP/IP to a mainframe; from the HLLC, allocating a data set on a tape comprising information to be imported, the allocation being in a format of the stored data set record and associated with a JFCB, the tape is mounted in SL mode; updating the JFCB to BLP mode; reading from the tape VOL1 data, and for each stored file initiating by the HLLC: reading HDR1/2, content block-by-block; EOF1/2 of the file; organizing the VOL1, HDR1, HDR2, content, EOF1 and EOF2 in the object storage; and closing the tape, wherein said reading is performed without setting a JES of the mainframe to BLP mode, and said reading is performed without unmounting the tape after each file.

Abstract: Described techniques provide a dynamic insert operation that enables easy, intuitive, reliable text entry by a user, while maintaining text within special-purpose positions that are needed, e.g., for later compiling or other text interpretation. For example, one or more positions may be locked, e.g., within a line or other sequence of positions. Then, text may be entered into a text position prior to the locked position(s). The dynamic insert operation may enable insertion of the text, movement of any existing text from the text position to a subsequent position, and maintenance of locked text within the locked position. Similarly, but conversely, if text (e.g., a character) is deleted from the text position, the dynamic insert operation may enable the deletion of the text, movement of any existing subsequent text from the subsequent position to the text position, and maintenance of locked text within the locked position.

Abstract: The systems and techniques include storing topology from each of a plurality of source tools as a plurality of source subgraphs in a graph database using a source schema that mirrors a source topology model for each of the plurality of source tools. Each of the plurality of source subgraphs in the graph database is transformed to a plurality of destination subgraphs using a destination schema and transformation rules that mirror a destination topology model for each of a plurality of destination tools. The plurality of destination subgraphs are stored in the graph database. The topology is delivered to each of the plurality of destination tools by traversing the plurality of destination subgraphs in the graph database and invoking application programming interfaces (APIs) for each of the plurality of destination tools in the destination subgraphs in the graph database.

Abstract: An automated system is presented for unit testing an application in a mainframe execution environment. A plurality of stub objects reside in the mainframe execution environment, such that each stub object in the plurality of stub objects represents a different stub type. A command translator table is configured with an entry for each command available for an online transaction processor. Each entry in the command translator table specifies a stub type for the command and includes a listing of possible arguments associated with the given command, such that each possible argument in the listing of possible arguments has a specified category type. A test configurator executes in the mainframe execution environment and is configured to receive and parse a test input file. A setup routine interacts with the test configurator to receive records from the test input file.

Abstract: Systems and techniques for identifying performance issues and recommending actions during design-time application development include receiving a design-time user interface (UI) having multiple fields associated with data from a database, where the multiple fields including one or more types of fields. In response to receiving a trigger, the systems and techniques iterate through the multiple fields in the design-time UI by applying one or more rules related to the types of fields and cardinality of the data from the database. One or more recommendations are generated for one or more of the fields based on the applied rules to the multiple fields and the recommendations are output to a display. The systems and techniques may include changing the design-time UI without user input using the recommendations.

Abstract: Large numbers of files having widely varying structures and formats may be ingested, and used to generate dynamic slot indexes that enable fast and reliable searching of the files. Unique data patterns within the files are used to generate unique pattern models, which enable model-specific mappings of file fields to slots of a dynamic slot index. Accordingly, the dynamic slot indexes may reuse a single slot for multiple fields. Complex queries may then be processed in a time-efficient and resource-efficient manner, even when rapidly ingesting huge numbers of files having indeterminate data patterns from many different sources.

Abstract: Described systems and techniques determine causal associations between events that occur within an information technology landscape. Individual situations that are likely to represent active occurrences requiring a response may be identified as causal event clusters, without requiring manual tuning to determine cluster boundaries. Consequently, it is possible to identify root causes, analyze effects, predict future events, and prevent undesired outcomes, even in complicated, dispersed, interconnected systems.

Abstract: When a restart event is detected within a technology landscape, restart-impacted performance metrics and non-restart-impacted performance metrics may be identified. The non-restart-impacted performance metrics may continue to be included within a performance characterization of the technology landscape. The restart-impacted performance metrics may be monitored, while being excluded from the performance characterization. The restart-impacted performance metric of the restart-impacted performance metrics may be transitioned to a non-restart-impacted performance metric, based on a monitored value of the restart-impacted performance metric following the restart event.