Techniques for Identifying Inlets and Outlets of Strongly Connected Components

A connected component and identification technology, applied in the computer field, can solve the problems of increasing compilation time and resource usage

Inactive Publication Date: 2011-12-14
MICROSOFT TECH LICENSING LLC
View PDF3 Cites 7 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

This can greatly increase compilation time and resource us...

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Techniques for Identifying Inlets and Outlets of Strongly Connected Components
  • Techniques for Identifying Inlets and Outlets of Strongly Connected Components
  • Techniques for Identifying Inlets and Outlets of Strongly Connected Components

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0011] A graph traversal system that efficiently identifies strongly connected components and simultaneously identifies entries, exits, and corresponding edges is described herein. Existing techniques fail to identify ingress and egress when identifying strongly connected components. Ingress and egress nodes can be identified by scanning each node after identifying the strongly connected components, but revisiting these nodes incurs undesired overhead. The present graph traversal system identifies ingress and egress during a single traversal when strongly connected components are being identified. Furthermore, the present system modifies the semantics for some applications such that a single node alone is not considered a strongly connected component. When used in a compiler, the present graph traversal system uses the node with the most entries for constant identification of loop edges. Doing so stabilizes code generation across multiple small changes, whereby small changes...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

PUM

No PUM Login to view more

Abstract

A graph traversal system that efficiently identifies strongly connected components and simultaneously identifies entries, exits, and corresponding edges is described herein. Ingress and egress nodes can be identified by scanning each node after identifying strongly connected components, but revisiting these nodes incurs undesired overhead. The present graph traversal system identifies ingress and egress in a single traversal when strongly connected components are being identified. Furthermore, the present system modifies the semantics for some applications such that a single node alone is not considered a strongly connected component. Thus, the present graph traversal system allows efficient identification of entries and exits from strongly connected components in a manner that can be applied to a large number of computer software problems using directed graphs as data structures.

Description

technical field [0001] The present invention relates to computer technology, and more particularly, to directed graph traversal. Background technique [0002] Directed graphs are used in computer software for modeling and solving several problems. For example, compilers typically create call graphs in which each node on the directed graph represents a function, and each connection represents a path by which a function calls other functions. Directed graphs (especially directed acyclic graphs) are often used in Bayesian networks to make decisions using multiple known probabilities under uncertain conditions. [0003] Strongly Connected Components (SCCs) in a directed graph are those subgraphs that maximize strong connectivity. A graph or subgraph is strongly connected if there exists a path from every node in the graph to every other node. Paths go in both directions, meaning that for two nodes to be part of a strongly connected graph, there exists a path in every directio...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

Application Information

Patent Timeline
no application Login to view more
IPC IPC(8): G06F9/44
CPCG06F8/74
Inventor S·周T·H·泽恩
Owner MICROSOFT TECH LICENSING LLC
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap