Scheduling of routing tasks for execution in parallel based on geometric reach
Опубликовано: 05-04-2023
Автор(ы): Daniel Vasquez Lopez, Jamie Randall Kuesel, Jason Michael LEE, Kenneth Reneris, Matus Lipka, Michael B. GOULDING, Paul W. ACCISANO, Srinivas Raghu Gatta
Принадлежит: Microsoft Technology Licensing LLC
Реферат: Systems and methods related to scheduling of tasks for execution in parallel based on geometric reach are described. An example method includes processing information pertaining to connectivity among superconducting components and nodes included in a shared floor plan to generate a plurality of areas of reach, where each of the plurality of areas of reach corresponds to a portion of the shared floor plan. The method further includes generating a plurality of inflated areas of reach by inflating each of the plurality of areas of reach based on a target inductance of wires for routing signals among the superconducting components and the nodes included in the shared floor plan. The method further includes scheduling parallel execution of tasks for routing wires among a subset of the superconducting components and the nodes within any of the plurality of inflated areas of reach satisfying a geometric constraint.
Scheduling of routing tasks for execution in parallel based on geometric reach
Номер патента: WO2021242348A1. Автор: Kenneth Reneris,Srinivas Raghu Gatta,Matus Lipka,Daniel Vasquez Lopez,Jason Michael LEE,Michael B. GOULDING,Paul W. ACCISANO,Jamie Randall Kuesel. Владелец: Microsoft Technology Licensing, LLC. Дата публикации: 2021-12-02.