Looking for breakthrough ideas for innovation challenges? Try Patsnap Eureka!

System, method, and computer program product for performing graph coloring

A graphics and random number technology, applied in the field of independent sets, can solve problems such as low efficiency

Active Publication Date: 2013-11-06
NVIDIA CORP
View PDF6 Cites 5 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

However, current techniques for implementing graph coloring by computing independent sets have been associated with various limitations
[0003] For example, current implementations for implementing graph coloring by computing independent sets have shown various inefficiencies, which can be amplified as the size of the data sets analyzed using these methodologies increases.
Furthermore, the current implementation may show inefficiencies when implemented on parallel computing devices

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
  • System, method, and computer program product for performing graph coloring
  • System, method, and computer program product for performing graph coloring
  • System, method, and computer program product for performing graph coloring

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0011] figure 1 A method 100 for implementing graphics shading is shown, according to one embodiment. As shown in operation 102, a graph having multiple vertices is identified. In one embodiment, a graph may include a representation of a plurality of vertices, where each vertex of the plurality of vertices is connected to one or more other vertices by one or more links (eg, edges, etc.). In another embodiment, each of the plurality of vertices (eg, nodes, etc.) may represent a distinct object (eg, data element, etc.), such that the plurality of vertices of the graph represent a collection of objects. In yet another embodiment, each link of the graph may represent an association between the vertices directly connected by the link. For example, two vertices directly connected by a link may share dependencies, contentions, and the like.

[0012] Additionally, as shown in operation 104, a plurality of vertices of the graph are classified, wherein the classification of the plura...

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 system, method, and computer program product are provided for performing graph coloring. In use, a graph with a plurality of vertices is identified. Additionally, the plurality of vertices of the graph is categorized, where the categorizing of the plurality of vertices is optimized.

Description

technical field [0001] The present invention relates to computing independent sets on graphs, and more particularly to graph coloring. Background technique [0002] Implementing graph coloring by computing independent sets is a valuable decision-making practice. For example, graph coloring can be used by parallel algorithms to find parallelism in data. However, current techniques for implementing graph shading by computing independent sets have been associated with various limitations. [0003] For example, current implementations for implementing graph coloring by computing independent sets have shown various inefficiencies that can be magnified as the size of the data sets analyzed using these methodologies increases. Furthermore, the current implementation may show inefficiencies when implemented on parallel computing devices. There is therefore a need to address these and / or other problems associated with the prior art. Contents of the invention [0004] A system, ...

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): G06T1/00
CPCG06F17/10G06T1/00G06F16/35G06F40/205
Inventor 乔纳森·麦克尔·科亨威廉·N·贝尔麦克尔·J·加兰
Owner NVIDIA CORP
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Patsnap Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Patsnap Eureka Blog
Learn More
PatSnap group products

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

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com