Patent US2864977A successfully refreshed from Google Patents.
Patent US6087967A successfully refreshed from Google Patents.
US6087967A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Method for generating and reading a compressed all event trace file
Assignee: International Business Machines Corp
•
Filing: 1998-09-03
•
Granted: 2000-07-11
•
Expires: 2018-09-03
Abstract
Abstract A method for creating a file of compressed data representing trace events produced in a circuit simulation. The method creates first and second arrays of value changes for a facility being monitored, and the time of the changes. The first and second arrays of data are compressed by identifying any data forming a repeating pattern, by the pattern and an iteration count. Each of these arrays have a common index, representing the position data for a facility as changed. Facility names are also compressed using a hashing algorithm which stores an index based on the hash result. The reproduction of the compressed data occurs without expanding the entire data file, by locating stored data by the facility name index which points to the position in the file of the stored facility data. The data is reviewed based on an inquiry which selects particular time intervals, which may be retrieved from the file along with the related values.
Inventors
- 👤 John Budnik
- 👤 John R. Krauss
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-29 07:23
CPC Classifications
G; G06; G06F; G06F11/00; G06F11/22; G06F11/26; G06F11/261; G06F16/00; G06F16/90; G06F16/901; G06F16/9014; G06F30/00; G06F30/30; G06F30/32; G06F30/33
Claims Analysis
Total Claims: 11
Claim 1
Independent Claim
195 words
A method for compressing data produced in an all events trace file comprising: creating time--value pairs of data identifying the value of a trace event and a time of occurrence of said trace event; creating a first array of said time data representing the difference in time between a changes in values of said trace event, and creating a second array of said trace event values for each time in which said change in values occur; compressing the contents of said first array comprising the steps of: determining whether said first array contains any consecutive pairs of data which repeat; each time said first array contains pairs of repeating data, replacing the second and subsequent pairs of said data with a value representing the number of times said time differences repeat in place of second and subsequent values of said pairs of repeating time differences; compressing said second array of trace events comprising the steps of: determining whether said second array contains any consecutive pairs of trace event data which forms a pattern; and replacing each second and subsequent pairs of trace event data with a value representing the number of times said differences repeat.
Claim 2
Independent Claim
195 words
A method for compressing data produced in an all events trace file comprising: creating time--value pairs of data identifying the value of a trace event and a time of occurrence of said trace event; creating a first array of said time data representing the difference in time between a changes in values of said trace event, and creating a second array of said trace event values for each time in which said change in values occur; compressing the contents of said first array comprising the steps of: determining whether said first array contains any consecutive pairs of data which repeat; each time said first array contains pairs of repeating data, replacing the second and subsequent pairs of said data with a value representing the number of times said time differences repeat in place of second and subsequent values of said pairs of repeating time differences; compressing said second array of trace events comprising the steps of: determining whether said second array contains any consecutive pairs of trace event data which forms a pattern; and replacing each second and subsequent pairs of trace event data with a value representing the number of times said differences repeat.
Claim 3
Dependent Claim
64 words
The method for compressing data according to claim 1 wherein said step of replacing said consecutive pairs of data replaces said pairs of trace events and time differences with an iteration count, the most significant bit of said iteration count indicating that the remaining bits of said iteration count represent the number of times a previous pair of values in an array are repeated.
Claim 4
Dependent Claim
22 words
The method for compressing data according to claim 1 further comprising: compressing each facility name accompanying said values of trace event data.
Claim 5
Dependent Claim
69 words
The method according to claim 3 wherein said step of compressing said facility name comprises: recursively applying said facility name to a hashing function to obtain a corresponding hashing value for each level of said facility name; and creating a hierarchial facility table which contains an entry for each level of said facility name and which includes an index value identifying the next higher level of said facility name.
Claim 6
Dependent Claim
37 words
The method according to claim 4 wherein said index identifying each level of said of facility name is contained in a hash table which correlates said index level with a hash value of a respective facility level.
Claim 7
Dependent Claim
22 words
The method according to claim 3 wherein said facility table includes a field which contains the lowest level qualifier for each level.
Claim 8
Dependent Claim
33 words
The method according to claim 6 wherein the highest level is identified as the highest field by an indicator contained in the field which contains the index level of the next higher level.
Claim 9
Independent Claim
211 words
A method for creating a file of trace events produced during a circuit simulation comprising: creating time--value pairs of data identifying the value of a trace event and a time of occurrence of said trace; creating a first array of said time data representing the difference in time between a changes in values of said trace event, creating a second array of said trace event values for each time in which said change in value of said event occurs; compressing the contents of said first array comprising the steps of: determining whether said first array contains data which repeats to form a pattern; each time said first array contains a set of repeating data, replacing the second and subsequent sets of said repeating data with a value representing the number of times said data repeats in place of second and subsequent values of said repeating data; compressing said second array of trace event values comprising the steps of: determining whether said second array contains any repetitive patterns of trace event data; and replacing each second and subsequent repetitive patterns of trace event data with a value representing the number of times said trace event pattern repeats; and storing said first and second arrays of data on a computer readable storage medium.
Claim 10
Independent Claim
211 words
A method for creating a file of trace events produced during a circuit simulation comprising: creating time--value pairs of data identifying the value of a trace event and a time of occurrence of said trace; creating a first array of said time data representing the difference in time between a changes in values of said trace event, creating a second array of said trace event values for each time in which said change in value of said event occurs; compressing the contents of said first array comprising the steps of: determining whether said first array contains data which repeats to form a pattern; each time said first array contains a set of repeating data, replacing the second and subsequent sets of said repeating data with a value representing the number of times said data repeats in place of second and subsequent values of said repeating data; compressing said second array of trace event values comprising the steps of: determining whether said second array contains any repetitive patterns of trace event data; and replacing each second and subsequent repetitive patterns of trace event data with a value representing the number of times said trace event pattern repeats; and storing said first and second arrays of data on a computer readable storage medium.
Claim 11
Dependent Claim
27 words
The method according to claim 8 wherein said repeating data constituting said pattern in said first and second arrays comprises first and second consecutive values of data.
References Cited (Backward Citations)
US5327361A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 2003-07-11 | 2004-01-10 | 2004-07-11 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2007-07-11 | 2008-01-10 | 2008-07-11 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2011-07-11 | 2012-01-10 | 2012-07-11 | $7700.00 | Window Closed / Lapsed |