Abstract: A method manages microservices. A number of processors identifies configuration information for a set of assemblies. The number of processors configures a set of namespaces in a computer system for the set of assemblies using a first set of permissions needed to set up the set of namespaces using the configuration information. The number of processors installs the set of assemblies using a second set of permissions using the configuration information. The second set of permissions has a lower level than the first set of permissions.

Abstract: A method manages microservices. A number of processors identifies configuration information for a set of assemblies. The number of processors configures a set of namespaces in a computer system for the set of assemblies using a first set of permissions needed to set up the set of namespaces using the configuration information. The number of processors installs the set of assemblies using a second set of permissions using the configuration information. The second set of permissions has a lower level than the first set of permissions.

Abstract: Parallel processing files on a distributed file system, responds to a request to process the file, by partitioning the file into a set of predetermined sized blocks by a single coordinator and assigns blocks to a reader in a set of readers. Block assignments are recorded to a control table accessible to all readers. The set of readers search the control table for a row assigned to a respective reader. Responsive to locating the row, the respective reader changes a state of the row to in progress updating an associated timestamp. The respective reader scans the control table for an available set of the blocks, when all blocks currently assigned are exhausted and dynamically re-assigns an available block from another owning reader to itself and changes ownership to itself. When no rows are available, the respective reader completes processing and returns an end of file indication to the single coordinator.

Abstract: A computer hardware system and computer program product for performing parallel processing of files is disclosed. A file is partitioned into a set of blocks, and assignments of individual ones of the set of blocks to individual ones in a set of processing engines are recorded in a control table. In response to a request from an individual one in the set of processing engines, access is provided to the control table to identify a block assigned to the individual one in the set of processing engines. Based upon a determination that all blocks currently assigned to the individual one in the set of processing engines are exhausted an available block assigned to another one in the set of processing engines is dynamically reassigning to the individual one in the set of processing engines. The set of processing engines are configured to perform parallel processing of the set of blocks.

Abstract: Parallel processing files on a distributed file system, responds to a request to process the file, by partitioning the file into a set of predetermined sized blocks by a single coordinator and assigns blocks to a reader in a set of readers. Block assignments are recorded to a control table accessible to all readers. The set of readers search the control table for a row assigned to a respective reader. Responsive to locating the row, the respective reader changes a state of the row to in progress updating an associated timestamp. The respective reader scans the control table for an available set of the blocks, when all blocks currently assigned are exhausted and dynamically re-assigns an available block from another owning reader to itself and changes ownership to itself. When no rows are available, the respective reader completes processing and returns an end of file indication to the single coordinator.

Abstract: Parallel processing files on a distributed file system, responds to a request to process the file, by partitioning the file into a set of predetermined sized blocks by a single coordinator and assigns blocks to a reader in a set of readers. Block assignments are recorded to a control table accessible to all readers. The set of readers search the control table for a row assigned to a respective reader. Responsive to locating the row, the respective reader changes a state of the row to in progress updating an associated timestamp. The respective reader scans the control table for an available set of the blocks, when all blocks currently assigned are exhausted and dynamically re-assigns an available block from another owning reader to itself and changes ownership to itself. When no rows are available, the respective reader completes processing and returns an end of file indication to the single coordinator.

Abstract: Parallel processing files on a distributed file system, responds to a request to process the file, by partitioning the file into a set of predetermined sized blocks by a single coordinator and assigns blocks to a reader in a set of readers. Block assignments are recorded to a control table accessible to all readers. The set of readers search the control table for a row assigned to a respective reader. Responsive to locating the row, the respective reader changes a state of the row to in progress updating an associated timestamp. The respective reader scans the control table for an available set of the blocks, when all blocks currently assigned are exhausted and dynamically re-assigns an available block from another owning reader to itself and changes ownership to itself. When no rows are available, the respective reader completes processing and returns an end of file indication to the single coordinator.

Abstract: A method (500) or a diagnostic recording device (400) having transactional memory and a processor coupled to the transactional memory can store (502) contents of a transaction log (40) of the transactional memory, detect (504) an exception event, and replay (506) last instructions that led up to the exception event using a debugger tool (80). The transactional memory can be hardware or software based transactional memory. The processor can also store the transaction log by storing the contents of the transaction log in a core file (302) which can include a stack (60), a register dump (70), a memory dump (75), and the transactional log. The debugger tool can be used to load up the core file, an executable file (95), and a library (90) to enable the diagnostic recording device to retrace transactions occurring at the diagnostic recording device up to the exception event.

Abstract: Embodiments of the invention provide a method for regaining memory consistency after a trap via transactional memory. Transactional memory and a transactional memory log are used to undo changes made to memory from a transaction start point up to the point of a trap event. After the trap event is processed, and the changes are rolled back, the program can resume execution at the beginning of the transaction.

Abstract: A dynamic status tree facility for providing status information about one or more systems. The facility includes a tree data structure and methods for manipulating the data structure. The facility is accessible to provider processes using a set of provider interface methods. The facility is accessible to consumer processes using a set of consumer interface methods. The tree data structure is defined by nodes stored in shared memory and attached to by way of a defined data structure made available to the provider and consumer interface methods. The nodes in the tree data structure are defined to have a control block and a variable set of export data. The export data for any one node is specified by a variable in the control block. Certain of the exported data in the tree is representable in a format selected to have one of four defined properties.

Abstract: A data structure, method and system are provided incorporating a general purpose memory allocator and defensive heap memory manager. This provides an ability to reliably detect various types of memory errors, dynamically enable or disable memory debugging, enhance success of read and write operations using various memory verification techniques. Further, through separation of control information associated with allocated and free chunks of memory from the chunks themselves (separation of metadata from actual data), enhanced protection of vital information about the heap memory layout in general is provided. The heap memory manager uses read, write, and execute protected heap header walls and pool header walls and may, for each pool and memory block, separately use hidden front and back Memory Debug Information Areas (MDIAs) with checksums and well-known signature fields thereby enhancing overall memory management.

Abstract: A method for describing activities in software products is provided. The method provides for identifying a plurality of activities in a software product that are of interest, defining an event structure to describe each identified activity as an event, associating each identified activity with one or more problem determination technologies, executing the software product, and responsive to detecting one of the plurality of identified activities during execution of the software product, creating one or more event records for the one detected activity based on the defined event structure, initiating the one or more problem determination technologies associated with the one detected activity, and passing the one or more event records to each of the one or more problem determination technologies.

Abstract: Disclosed is a data processing system for facilitating problem resolution. The data processing system-implemented system includes a configuring module for configuring a system pathway that leads to a solution, and an associating module for associating a usage indicator with the symptom pathway, the usage indicator indicating a frequency in which the symptom pathway was previously implemented for successfully resolving previously experienced problems.

Abstract: A method (500) or a diagnostic recording device (400) having transactional memory and a processor coupled to the transactional memory can store (502) contents of a transaction log (40) of the transactional memory, detect (504) an exception event, and replay (506) last instructions that led up to the exception event using a debugger tool (80). The transactional memory can be hardware or software based transactional memory. The processor can also store the transaction log by storing the contents of the transaction log in a core file (302) which can include a stack (60), a register dump (70), a memory dump (75), and the transactional log. The debugger tool can be used to load up the core file, an executable file (95), and a library (90) to enable the diagnostic recording device to retrace transactions occurring at the diagnostic recording device up to the exception event.

Abstract: Embodiments of the invention provide a method for regaining memory consistency after a trap via transactional memory. Transactional memory and a transactional memory log are used to undo changes made to memory from a transaction start point up to the point of a trap event. After the trap event is processed, and the changes are rolled back, the program can resume execution at the beginning of the transaction.

Abstract: A dynamic status tree facility for providing status information about one or more systems. The facility includes a tree data structure and methods for manipulating the data structure. The facility is accessible to provider processes using a set of provider interface methods. The facility is accessible to consumer processes using a set of consumer interface methods. The tree data structure is defined by nodes stored in shared memory and attached to by way of a defined data structure made available to the provider and consumer interface methods. The nodes in the tree data structure are defined to have a control block and a variable set of export data. The export data for any one node is specified by a variable in the control block. Certain of the exported data in the tree is representable in a format selected to have one of four defined properties. A set of tags are defined for the identification of nodes and export information in the tree data structure.

Abstract: A method for describing activities in software products is provided. The method provides for identifying a plurality of activities in a software product that are of interest, defining an event structure to describe each identified activity as an event, associating each identified activity with one or more problem determination technologies, executing the software product, and responsive to detecting one of the plurality of identified activities during execution of the software product, creating one or more event records for the one detected activity based on the defined event structure, initiating the one or more problem determination technologies associated with the one detected activity, and passing the one or more event records to each of the one or more problem determination technologies.

Abstract: Disclosed is a data processing system for facilitating problem resolution. The data processing system-implemented system includes a configuring module for configuring a system pathway that leads to a solution, and an associating module for associating a usage indicator with the symptom pathway, the usage indicator indicating a frequency in which the symptom pathway was previously implemented for successfully resolving previously experienced problems.

Abstract: Disclosed is a data processing system-implemented method. The data processing system-implemented method includes configuring a symptom pathway that leads to a solution, and associating a usage indicator with the symptom pathway, the usage indicator indicating a frequency in which the symptom pathway was previously implemented for successfully resolving previously experienced problems.

Abstract: A dynamic status tree facility for providing status information about one or more systems. The facility includes a tree data structure and methods for manipulating the data structure. The facility is accessible to provider processes using a set of provider interface methods. The facility is accessible to consumer processes using a set of consumer interface methods. The tree data structure is defined by nodes stored in shared memory and attached to by way of a defined data structure made available to the provider and consumer interface methods. The nodes in the tree data structure are defined to have a control block and a variable set of export data. The export data for any one node is specified by a variable in the control block. Certain of the exported data in the tree is representable in a format selected to have one of four defined properties.