US 12,112,151 B2
Collection and representation of program call stacks
Beau Allen Belgrave, Sammamish, WA (US)
Assigned to MICROSOFT TECHNOLOGY LICENSING, LLC, Redmond, WA (US)
Filed by MICROSOFT TECHNOLOGY LICENSING, LLC, Redmond, WA (US)
Filed on Dec. 22, 2022, as Appl. No. 18/087,652.
Claims priority of provisional application 63/402,902, filed on Aug. 31, 2022.
Prior Publication US 2024/0069879 A1, Feb. 29, 2024
Int. Cl. G06F 8/41 (2018.01); G06Q 30/018 (2023.01)
CPC G06F 8/433 (2013.01) [G06Q 30/018 (2013.01)] 20 Claims
OG exemplary drawing
 
1. A method comprising:
receiving a stack file that includes a plurality of stacks, wherein each stack of the plurality of stacks includes a sequence of flows being executed;
generating a graph for the stack file by sequentially accessing and reading the plurality of stacks from the stack file, wherein the graph includes a plurality of entries and each entry of the plurality of entries represents a unique sequence of flows, and wherein generating the graph includes:
adding a first entry of the plurality of entries to the graph, wherein the first entry of the plurality of entries represents the sequence of flows in a first stack of the plurality of stacks;
for a remaining stack of the plurality of stacks after the first stack of the plurality of stacks:
determining that a particular sequence of flows included in the remaining stack of the plurality of stacks matches a previous sequence of flows included in a previous stack of the plurality of stacks; and
based on the determining that the particular sequence of flows included in the remaining stack of the plurality of stacks matches the previous sequence of flows included in the previous stack of the plurality of stacks, incrementing, for a corresponding entry of the plurality of entries included in the graph, a corresponding weight value that represents a number of times the previous sequence of flows occurs in the plurality of stacks;
determining that a weight value for a particular entry of the plurality of entries included in the graph fails to satisfy a weight value threshold; and
removing the particular entry of the plurality of entries from the graph based on the determining that the weight value for the particular entry of the plurality of entries fails to satisfy the weight value threshold.