Abstract:
A method for region guided and change tolerant fast shortest path determination and graph preprocessing for network management and control. In an embodiment, a method includes partitioning, by a network component, a plurality of network nodes into a plurality of regions, each network node belonging to one of the regions; identifying, by the network component, border nodes for each region, each border node in a region connecting to at least one border node in a connecting region; determining, by the network component, intervals between regions according to the border nodes, each interval comprising a minimum distance and a maximum distance between two regions; determining, by the network component, a path from a source node to a target node according to the intervals.
Abstract:
A method implemented in a data processing system comprising receiving an input/output (IO) write request from a processing thread to transfer data from a memory of the data processing system to an IO device, setting the memory as read-only memory to protect the data from overwrite before the data is transferred to the IO device, and sending, in response to the IO write request, a speculative IO write completion response to the processing thread to enable the processing thread to continue execution without waiting for the data to be transferred to the IO device.