Abstract
In today’s virtualized cloud infrastructure and advanced technology era, there are resources that are represented as an interconnected graph with root node and child nodes. These resources are growing exponentially on day-to-day basis and adding to the complexity of traversing and processing all the nodes in the graph. Major challenge involved is to traverse and process each child node asynchronously and mark the completion of all the nodes in the graph. Disclosed is an approach of tracking asynchronous traversal completion of a graph with indefinite nodes, using a time series moving window aggregator. This idea will address the graph traversal starting with a root node and process all its child nodes spanned by indefinite depth and breadth.
Creative Commons License
This work is licensed under a Creative Commons Attribution-Noncommercial-No Derivative Works 4.0 License.
Recommended Citation
Abu Saleh, Syed and Sivaraj, Arun Kumar, "Track Asynchronous Graph Traversal Completion using Time moving window Aggregators", Technical Disclosure Commons, (January 08, 2018)
https://www.tdcommons.org/dpubs_series/1025