Micro Focus Lcc

Nandish Jayaram

Krishnamurthy Viswanathan

Fei Chen

Maria Teresa Gonzalez Diaz

Example implementations relate to updating an inference graph absent node locking. For example, a processor executing a first thread may receive a first task for updating a node of an inference graph stored by a storage device accessible to a second thread, the first task being assigned during a first iteration of a graph update loop. Absent locking the node from access by the second thread, the processor may generate a value for the node and update the node with the value. Based on detecting that each node of the inference graph has been updated, the processor may continue with a second iteration of the graph update loop.

Growing community of inventors

Palo Alto, CA, United States of America

Nandish Jayaram