Understanding the Internals of tbb::graph : Balancing Push and Pull

Authored by Michael Voss (Intel)
This article describes the hybrid push-pull protocol used by Intel® Threading Building Blocks graph Feature Last updated on 08/02/2013 - 11:44

Using the Intel® Threading Building Blocks Graph Community Preview Feature: An Implementation of Dining Philosophers.

Authored by Michael Voss (Intel)

Intel® Threading Building Blocks (Intel® TBB) Version 3 Update 5 introduced the class graph as a Community

Last updated on 08/02/2013 - 12:02

Using the Intel® Threading Building Blocks Graph Community Preview Feature: Creating a Simple Message Graph.

Authored by Michael Voss (Intel)

Intel® Threading Building Blocks (Intel® TBB) Version 3 Update 5 introduced the class graph as a Community

Last updated on 08/02/2013 - 12:05

Intel® Threading Building Blocks Version 3.0 Update 5 Introduces Graph as a Community Preview Feature.

Authored by Michael Voss (Intel)

There are some applications that, even on systems with shared memory, are best organized as computations that explicitly pass messages.

Last updated on 08/02/2013 - 12:07

Courseware - Graph Algorithm Examples

Authored by 0
Last updated on 08/27/2012 - 13:39

Parallel algorithm to solve a Hamiltonian Path problem variation (Travelling Baseball Fan) (Alina N. Ciorogar )

Authored by 0

The included source code implements a variation of the Hamiltonian Path problem, called the Travelling Baseball Fan Problem, as described in the included problem description text file.

Last updated on 08/02/2012 - 09:30

Parallel algorithm to solve a Hamiltonian Path problem variation (Travelling Baseball Fan) (Bradley Kuszmaul)

Authored by 0

The included source code implements a variation of the Hamiltonian Path problem, called the Travelling Baseball Fan Problem, as described in the included problem description text file.

Last updated on 08/02/2012 - 09:32

Parallel algorithm to solve a Hamiltonian Path problem variation (Travelling Baseball Fan) (Matthew McGowan)

Authored by 0

The included source code implements a variation of the Hamiltonian Path problem, called the Travelling Baseball Fan Problem, as described in the included problem description text file.

Last updated on 08/02/2012 - 09:32

Parallel algorithm to solve a Hamiltonian Path problem variation (Travelling Baseball Fan) (Nicola Beschin)

Authored by 0

The included source code implements a variation of the Hamiltonian Path problem, called the Travelling Baseball Fan Problem, as described in the included problem description text file.

Last updated on 08/02/2012 - 09:33

Parallel algorithm to solve Maximum Independent Set problem (Bradley Kuszmaul)

Authored by 0

The included source code finds a Maximum Independent Set (MIS) of a given graph, as described in the included problem description text file.

Last updated on 08/02/2012 - 09:40