Asynchronous modeled system to perform graph analytics on fault-tolerant environments

Abstract: a system for randomized trace approximation calculation based on asynchronous computing architecture is disclosed. the system retrieves an adjacency matrix associated with a complex graph. the system determines a random vector based on the retrieved adjacency matrix. the system generates a matrix-vector based on the adjacency matrix and the random vector. the system determines a first set of natural numbers based on the first dimension of the adjacency matrix. the system selects a subset of entries from the generated matrix-vector based on the determined first set of natural numbers. the system determines a diagonal random matrix based on a summation of canonical outer products formed by the selected subset of entries. the system calculates a trace approximation of the adjacency matrix based on the determined diagonal random matrix and the selected subset of entries and stores the calculated trace approximation of the adjacency matrix.

Inventor(s): Lior Horesh, Vasileios Kalantzis, Georgios Kollias, Shashanka Ubaru, Chai Wah Wu

CPC Classification: G06F11/263 (Generation of test inputs, e.g. test vectors, patterns or sequences {; with adaptation of the tested hardware for testability with external testers})

Search for rejections for patent application number 20250181465