	US 12,106,157 B1
	Memory efficient and scalable approach to stimulus (waveform) reading
Anup Kumar Sultania, Plano, TX (US); Ajay Singh Bisht, San Jose, CA (US); and Mark W. Brown, Little Elm, TX (US)
Assigned to Synopsys, Inc., Sunnyvale, CA (US)
Filed by Synopsys, Inc., Sunnyvale, CA (US)
Filed on Jun. 29, 2023, as Appl. No. 18/344,672.
Application 18/344,672 is a continuation of application No. 17/224,382, filed on Apr. 7, 2021, granted, now 11,734,080.
Claims priority of provisional application 63/006,639, filed on Apr. 7, 2020.
Int. Cl. G06F 9/50 (2006.01)

CPC G06F 9/5061 (2013.01)

19 Claims

1. A method comprising:

generating, by a processing device, reading tasks, wherein the reading tasks comprise:

reading time slices of a signal from a stimulus file; and

pushing partial waveforms corresponding to the time slices of the signal to a data store, each partial waveform comprising a head and a tail that each has a smaller data size than an entirety of the partial waveform;

making the reading tasks available to worker processes for execution;

generating stitching tasks for stitching together the heads and tails of the partial waveforms pushed to the data store according to a temporal order of the partial waveforms; and

making the stitching tasks available to worker processes for execution.