Browse Prior Art Database

KRYPTIC : Automating Support of a Product Disclosure Number: IPCOM000184269D
Original Publication Date: 2009-Jun-18
Included in the Prior Art Database: 2009-Jun-18
Document File: 3 page(s) / 93K

Publishing Venue



When a process suddenly crashes, crash files - which give details of the state of the process at that instant, are generated. These crash files are automatically generated by the system. An end user is not knowledgeable enough to understand and decipher the crytic crash files. The resolution of such a critical case is generally done by level 3 support team of that product. We present a product that will study the crash files, analyze it, interpret the information and identify solutions. The product will not only be a breakthrough for the product support teams but will also help customers fix their application. It will also help companies improve their revenues by reducing the overhead of a support team of the product. Our product shall have the potential of matching an unknown crash into a prior experienced/faced known crash. The dump file is processed to collect relevant information and a comparison is done by block algorithm with the prior database crash dump files. The difference corresponding to the comparison is extracted by our algorithm by applying a pattern rearrangement/matching technique. The rearrangement technique makes the entries corresponding to the unknown crash identical or closer to that of a known one in minimum number of rearrangement moves. Then the system decides the proximity of the crash based on the number of moves taken by the algorithm for the above conversion. The lesser number the moves taken; the closer is the occurred crash with a known crash.

This text was extracted from a PDF file.
This is the abbreviated version, containing approximately 53% of the total text.

Page 1 of 3

KRYPTIC : Automating Support of a Product


Anupama Pande, Anu Bhat, Gaurav Narang

Disclosed is a system that works on a new methodology to analyze the logfile. Block Interchange Algorithm on genome rearrangement that can be used to analyze logs. There is a reason this algorithm is best suited for log analysis.

Description of the Block interchange algorithm

The block-interchanges has been proposed recently as a new kind of global rearrangement events affecting a genome by swapping two nonintersecting segments of any length. The so-called block-interchange distance problem, which is equivalent to the sorting-by-block-interchange

problem, is to find a minimum series of block-interchanges for transforming one chromosome

into another.

Mainly the algorithm works by interchanging blocks rather than separate units.

Block interchange algorithm is itself very new in genome domain. This algorithm can be used in analyzing traces.

Why it is useful in analysis

Even though a program works in by calling functions say the main function in A and then goes to B C so on, in every product in tern there is a background line.

For example: Everytime the Sametime tool was invoked it will follow the following steps broadly

Main function (always)

Authentication function (check user name and password)

Launch the default settings function ("I am available" mode)

Get the details of the users I each group
When an action is triggered (double click) connection is set up function Communication function

Hence all products work in a way to create a implicit flow. This flow can often be grouped into blocks which we want to leverage here. As per the product/ tool KRYPTIC will also put

predefined blocks in our symptom database. This will further enhance the efficiency of analysis


Algorithm functioning (implementation)

Lets have the main function as say A and then the program control goes to B and then C and so on.

The function flow would be
A B C D E F G H I This flow gives an error X.

Another function flow is I H G F E D C B A. This flow gives an error Y.

This entire thing would be stored in our KRYPTIC...