US 12,147,781 B2
Computer processing and outcome prediction systems and methods
Kevin D. Howard, Mesa, AZ (US)
Filed by Kevin D. Howard, Mesa, AZ (US)
Filed on Oct. 14, 2023, as Appl. No. 18/380,167.
Application 18/380,167 is a continuation of application No. 18/074,502, filed on Dec. 4, 2022, granted, now 11,789,698.
Application 18/074,502 is a continuation of application No. 16/730,607, filed on Dec. 30, 2019, granted, now 11,520,560, issued on Dec. 6, 2022.
Claims priority of provisional application 62/786,951, filed on Dec. 31, 2018.
Prior Publication US 2024/0168709 A1, May 23, 2024
This patent is subject to a terminal disclaimer.
Int. Cl. G06F 8/40 (2018.01); G06F 5/01 (2006.01); G06F 8/41 (2018.01); G06F 16/2455 (2019.01); G06F 17/15 (2006.01)
CPC G06F 5/01 (2013.01) [G06F 8/443 (2013.01); G06F 8/45 (2013.01); G06F 16/24558 (2019.01); G06F 17/156 (2013.01)] 17 Claims
OG exemplary drawing
 
1. A method of determining non-linear speedup with overhead of one or more Time-Affecting Linear Pathways (TALPs) executing on multiple processing elements (PEs), comprising:
calculating a scaled processing time of the one or more TALPs given associated individual input variable attributes that affect a number of loop iterations of at least one looping structure of an associated TALP and evenly dividing input variable attribute values that affect loop iterations by a number of PEs, n;
converting the scaled processing time of the one or more TALPs into one or more scaled time complexity functions, which is equivalent to speedup;
separating out a static processing time generated at least by executing and timing one or more static loops;
defining a maximum number of possible PEs n for a given input dataset as scaled input variable attribute values that affect the number of loop iterations for the associated TALP;
finding a maximum speedup of n using a minimum detected processing time that corresponds to the maximum number of possible PEs n and a minimum number of possible loop iterations for a TALP;
defining a cross-communication overhead as an un-scaled time complexity function for a cross-communication time given a required cross-communication model and a number of PEs n used;
defining a non-cross-communication overhead as a time cost required to set up parallel software instances without regard for cross-communication overhead; and
summing together a plurality of scaled overhead processing functions and subtracting scaled summed overhead processing time functions from a same TALP associated speedup function.