US 11,966,783 B1
Real time scheduling using expected application resource usage
Erica Lin, Cambridge, MA (US); Jeffrey Chou, Boston, MA (US); Suraj Bramhavar, Arlington, MA (US); Titash Rakshit, Austin, TX (US); and Jeffrey G. Bernstein, Middleton, MA (US)
Assigned to Sync Computing Corp., Cambridge, MA (US)
Filed by Sync Computing Corp., Cambridge, MA (US)
Filed on Aug. 13, 2021, as Appl. No. 17/402,432.
Claims priority of provisional application 63/070,168, filed on Aug. 25, 2020.
Claims priority of provisional application 63/067,195, filed on Aug. 18, 2020.
Claims priority of provisional application 63/066,774, filed on Aug. 17, 2020.
Int. Cl. G06F 3/00 (2006.01); G06F 9/48 (2006.01); G06F 9/50 (2006.01)
CPC G06F 9/5038 (2013.01) [G06F 9/4881 (2013.01)] 18 Claims
OG exemplary drawing
 
1. A method of assigning processing resources, comprising: receiving an application; analyzing the application to determine an expected run time use of the processing resources; and assigning at least a portion of the processing resources to the application based on the expected run time use of the processing resources;
wherein the processing resources include a plurality of servers and wherein the analyzing the processing resources further includes: determining a plurality of latencies within each of the plurality of servers and between the plurality of servers; determining resource contention costs for each of the plurality of servers; and wherein the assigning is based on the plurality of latencies and the resource contention costs;
wherein the analyzing includes mapping the expected run time use of the processing resources to an optimization problem; and wherein the assigning the at least the portion of the processing resources uses a dedicated optimization coprocessor that receives the mapping of the expected run time use of the processing resources and outputs a solution to the optimization problem, the solution corresponding to an assignment of the at least the portion of the processing resources.