Analyzing and reducing dump data

US9037815B2 · US · B2

Patent metadata
FieldValue
Publication numberUS-9037815-B2
Application numberUS-201213536655-A
CountryUS
Kind codeB2
Filing dateJun 28, 2012
Priority dateJun 28, 2012
Publication dateMay 19, 2015
Grant dateMay 19, 2015

How to read this patent

A practical reading order for non-experts. Skip the full description unless you need deep technical detail.

  1. Title

    What the patent document calls the invention.

  2. Abstract

    A short plain-language summary of the technical disclosure.

  3. Assignees and inventors

    Who owns or filed the patent and who is credited as inventor.

  4. Key dates

    Filing, priority, publication, and grant dates set the timeline.

  5. First independent claim

    The legal scope of protection — read this for what is actually claimed.

  6. CPC / IPC classifications

    Technology tags used to group this patent with similar filings.

  7. Citations and related patents

    Prior art links and similar publications in this corpus.

Abstract

Official abstract text for this publication.

For analyzing and reducing dump data, an analysis module identifies each abending task of a job and identifies each stack block of each abending task. A dump module saves only stack block data from the identified stack blocks as dump data.

First claim

Opening claim text (preview).

What is claimed is: 1. An apparatus comprising: a computer readable storage medium storing computer readable program code executable by a processor, the computer readable program code comprising: an analysis module identifying each abending task of a job comprising a job address space, identifying each stack block of each abending task within the job address space, each stack block comprising a request block comprising a register copy that is copy of job registers when the request block was created, identifying a module for each stack block that performs a function for the stack block and has a module address range outside of the job address space, and calculating the module address range for the module using a virtual local storage map indexed by a corresponding stack block; and a dump module saving only stack block data from the identified stack blocks within the job address space and data from the module address range to dump data. 2. The apparatus of claim 1 , wherein identifying the abending task comprises examining a task control block for a specified completion code. 3. The apparatus of claim 1 , wherein identifying each stack block comprises calculating a stack block address range and each stack block comprises a program status word copy that is a copy of a program status word when the request block was created. 4. The apparatus of claim 1 , the analysis module further identifying a diagnostic storage address range for each stack block and appending diagnostic storage address range data to the dump data. 5. The apparatus of claim 1 , the analysis module further identifying a used storage address range for each stack block and appending used storage address range data to the dump data. 6. A method for analyzing and reducing dump data comprising: identifying, by use of a processor, each abending task of a job comprising a job address space; identifying each stack block of each abending task within the job address space, each stack block comprising a request block comprising a register copy that is copy of job registers when the request block was created; identifying a module for each stack block that performs a function for the stack block and has a module address range outside of the job address space; calculating the module address range for the module using a virtual local storage map indexed by a corresponding stack block; and saving only stack block data from the identified stack blocks within the job address space and data from the module address range to dump data. 7. The method of claim 1 , wherein identifying the abending task comprises examining a task control block for a specified completion code. 8. The method of claim 6 , wherein identifying each stack block comprises calculating a stack block address range and each stack block comprises a program status word copy that is a copy of a program status word when the request block was created. 9. The method of claim 8 , wherein a Z/OS® file system comprises the stack block address range. 10. The method of claim 6 , further comprising identifying a diagnostic storage address range for each stack block and appending diagnostic storage address range data to the dump data. 11. The method of claim 6 , further comprising identifying a used storage address range for each stack block and appending used storage address range data to the dump data. 12. The method of claim 6 , wherein the stack block is selected from the group consisting of a request block and a linkage stack entry. 13. A computer program product for analyzing and reducing dump data, the computer program product comprising: a non-transitory computer readable storage medium having computer readable program code embodied therein, the computer readable program code configured to: identify each abending task of a job comprising a job address space; identify each stack block of each abending task within the job address space, each stack block comprising a request block comprising a register copy that is copy of job registers when the request block was created; identify a module for each stack block that performs a function for the stack block and has a module address range outside of the job address space; calculate the module address range for the module using a virtual local storage map indexed by a corresponding stack block; and save only stack block data from the identified stack blocks within the job address space and data from the module address range to dump data. 14. The computer program product of claim 13 , wherein identifying the abending task comprises examining a task control block for a specified completion code. 15. The computer program product of claim 14 , wherein identifying each stack block comprises calculating a stack block address range and each stack block comprises a program status word copy that is a copy of a program status word when the request block was created. 16. The computer program product of claim 13 , the computer readable program code further identifying a diagnostic storage address range for each stack block and appending diagnostic storage address range data to the dump data. 17. The computer program product of claim 13 , the computer readable program code further identifying a used storage address range for each stack block and appending used storage address range data to the dump data.

Assignees

Inventors

Classifications

  • in a system implementing multitasking (multitasking per se G06F9/46) · CPC title

  • G06F9/00Primary

    Arrangements for program control, e.g. control units (program control for peripheral devices G06F13/10) · CPC title

  • Saving or restoring of program or task context · CPC title

  • Dumping, i.e. gathering error/state information after a fault for later diagnosis · CPC title

Patent family

Related publications grouped by family.

External sources

Frequently asked questions

Answers are generated from the same data shown on this page.

What does patent US9037815B2 cover?
For analyzing and reducing dump data, an analysis module identifies each abending task of a job and identifies each stack block of each abending task. A dump module saves only stack block data from the identified stack blocks as dump data.
Who is the assignee on this patent?
Helak Dustin A, Perez Miguel A, Reed David C, and 2 more
What technology area does this patent fall under?
Primary CPC classification G06F9/00. Mapped technology areas include Physics.
When was this patent published?
Publication date Tue May 19 2015 00:00:00 GMT+0000 (Coordinated Universal Time) (B2). Legal status and post-grant events are not shown on this page.
What related patents are in patentsdb?
We list 8 related publications on this page (citations in our corpus or others sharing the same primary CPC).