Parallel symbolic execution on cluster of commodity hardware
US8863096B1 · kind B1 · utility
Assignee
Inventors
Key dates
| Filing date | Jan 6, 2012 |
| Grant date | Oct 14, 2014 |
| Priority date | — |
| Expiry date | Sep 20, 2032 |
Classification
- Technology area (CPC G)Physics
- CPC primaryG06F9/5088
- WIPO fieldComputer technology
- WIPO sectorElectrical engineering
Abstract
A symbolic execution task is dynamically divided among multiple computing nodes. Each of the multiple computing nodes explores a different portion of a same symbolic execution tree independently of other computing nodes. Workload status updates are received from the multiple computing nodes. A workload status update includes a length of a job queue of a computing node. A list of the multiple computing nodes ordered based on the computing nodes' job queue lengths is generated. A determination is made regarding whether a first computing node in the list is underloaded. A determination is made regarding whether a last computing node in the list is overloaded. Responsive to the first computing node being underloaded and the last computing node being overloaded, a job transfer request is generated that instructs the last computing node to transfer a set of one or more jobs to the first computing node.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.