Thread record provider

US10810230B2 · US · B2

Patent metadata
FieldValue
Publication numberUS-10810230-B2
Application numberUS-201715465436-A
CountryUS
Kind codeB2
Filing dateMar 21, 2017
Priority dateMar 21, 2017
Publication dateOct 20, 2020
Grant dateOct 20, 2020

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.

In an example, a computing system may include a thread record provider. In some examples, the computing system may incrementally change a first data structure as threads are established and completed, wherein the first data structure comprises first information of currently active threads; incrementally change a second different data structure responsive to a portion of changes of the first data structure, wherein the second data structure correlates second information that is different than the first information to the currently active threads; identifying a plurality of times; and at each selected time, synchronously extracting content from the first and second data structures for a selected thread and concatenating the extracted content to form a record for the selected thread.

First claim

Opening claim text (preview).

What is claimed is: 1. A computing system, comprising: a processing system; and a non-transitory memory device coupled to the processing system and including instructions stored thereon that, in response to execution by the processing system, are operable to perform operations including: fetching, from a first data source, first thread metadata information of threads of one or more applications of the computing system, the first thread metadata information includes one or more fields; incrementally changing a first data structure to include at least a portion of the fetched first thread metadata information as the threads of the one or more applications are established and completed; fetching, from a second data source separate and distinct from the first data source, second thread metadata information of the threads, the second thread metadata information includes one or more fields and is correlated with and is different than the first thread metadata information for the threads; incrementally changing a second data structure different than the first data structure responsive to a portion of the incremental changes of the first data structure to include at least a portion of the second thread metadata information; wherein the first data structure includes first metadata information and the second data structure includes second metadata information for a specific one of the threads; identifying a plurality of times; at each selected time, synchronously extracting content from the one or more fields from the first thread metadata information of the first data structure and the one or more fields from the second thread metadata information of the second data structure for a selected one of the threads; and forming a record of the selected one of the threads by concatenating the extracted content. 2. The computing system of claim 1 , wherein the operations further comprise: storing the records in a first data store; identifying a portion of content of the first data store; attempting to persist the portion of the content to a second data store that is different than the first data store; and removing the portion of the content from the first data store responsive to persisting the portion of the content to the second data store. 3. The computing system of claim 2 , wherein the first data store resides in a local resource, wherein the local resource comprises at least one of a non-persistent memory or a local persistent storage, and the second data store resides in at least one of a remote storage or a different local resource. 4. The computing system of claim 2 , wherein the operations further comprise: monitoring a size of the content of the first data store based on a drop threshold; and dropping at least one record from the first data store based on a result of the monitoring. 5. The computing system of claim 4 , wherein dropping the at least one record from the first data store comprises overwriting a least recently formed record of the first data store with a most recently formed record. 6. The computing system of claim 2 , wherein the operations further comprise: identifying the plurality of times based on a first interval; selecting a time based on a second interval that is different than the first interval; and wherein identifying of the portion of the content of the first data store is responsive to the selection of the time based on the second interval. 7. The computing system of claim 6 , wherein the first interval is variable and the second interval is non-variable. 8. The computing system of claim 6 , wherein the first interval comprises a random interval. 9. The computing system of claim 6 , wherein the second interval comprises a periodic interval. 10. The computing system of claim 2 , wherein the operations further comprise: determining whether a characteristic of the content of the first data store corresponds to a predefined value; and identifying the portion of the content of the first data store responsive to a result of the determination. 11. The computing system of claim 10 , wherein the characteristic comprises at least one of a record count of the content or a total size of the content. 12. The computing system of claim 11 , further comprising: determining whether a call stack corresponding to at least one of the concatenations corresponds to a call stack of a stored record or a call stack of a different one of the concatenations; and responsive to a result of the determination, performing at least one of forming the record for the concatenation based on a result of the determination or modifying the record after formation to de-duplicate the call stack in a data store. 13. The computing system of claim 11 , further comprising: filtering the records based on one or more filtering criteria, wherein at least one criterion of the one or more filtering criteria corresponds to the second metadata information; identifying a first subset of the records responsive to the filtering; and comparing the first subset of the records to a second different subset of the records based on one or more dimensions to identify a difference between the subsets. 14. The computing system of claim 13 , wherein another filtering criterion of the filtering criteria comprises a time range. 15. The computing system of claim 13 , wherein each record of the first subset of records is formed prior to a selected time and each record of the second subset of records is formed after the selected time. 16. The computing system of claim 13 , wherein the difference comprises a delta of first call stack(s) and second call stack(s), the first call stack(s) associated with the first subset of the records and the second call stack(s) associated with the second record. 17. The computing system of claim 13 , wherein the operations further comprise storing ranking information for a plurality of change paths, the plurality of change paths including the change path of the difference and change paths of previously identified differences. 18. A method, comprising: fetching, from a first data source, first thread metadata information of threads of one or more applications of the computing system, the first thread metadata information includes one or more fields; incrementally changing a first data structure to include at least a portion of the fetched first thread metadata information as the threads of the one or more applications are established and completed fetching, from a second data source separate and distinct from the first data source, second thread metadata information of the threads, the second thread metadata information includes one or more fields and is correlated with and is different than the first thread metadata information for the threads; incrementally changing a second data structure different than the first data structure responsive to a portion of the incremental changes of the first data structure to include at least a portion of the second thread metadata information; wherein the first data structure includes first metadata information and the second data structure includes second metadata information for a specific one of the threads; identifying a plurality of times; at each selected time, synchronously extracting content from the one or more fields from the first thread metadata information of the first data structure and the one or more fields from the second thread metadata information of the second data structure for a selected one of the threads; forming a record of the selected one of the threads by concatenat

Assignees

Inventors

Classifications

  • Data logging (G06F11/14, G06F11/2205 take precedence) · CPC title

  • De-duplication implemented within the file system, e.g. based on file segments (de-duplication techniques in storage systems for the management of data blocks G06F3/0641) · CPC title

  • Data format conversion from or to a database · CPC title

  • G06F16/275Primary

    Synchronous replication · CPC title

  • Monitoring of software · 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 US10810230B2 cover?
In an example, a computing system may include a thread record provider. In some examples, the computing system may incrementally change a first data structure as threads are established and completed, wherein the first data structure comprises first information of currently active threads; incrementally change a second different data structure responsive to a portion of changes of the first dat…
Who is the assignee on this patent?
Salesforce Com Inc
What technology area does this patent fall under?
Primary CPC classification G06F11/3476. Mapped technology areas include Physics.
When was this patent published?
Publication date Tue Oct 20 2020 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 4 related publications on this page (citations in our corpus or others sharing the same primary CPC).