Parallel symbolic execution on cluster of commodity hardware

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.


Year:
2014
Other identifiers:
EPO Family ID: 51661295
TTO: 6.1014
Patent number(s):
Laboratories:




 Record created 2017-05-24, last modified 2018-10-15


Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)