The MultiThreaded Graph Library (MTGL) is a collection of algorithms and data structures designed to run on shared-memory platforms such as the massively multithreaded Cray XMT, or, with support from the Qthreads library, on Symmetric Multiprocessor (SMP) machines or multi-core workstations. The software and API is modeled after the Boost Graph Library, though the internals differ in order to leverage shared memory machines. The MTGL is copyrighted and released under a Berkeley open source license. If you are a developer, you may get the most recent unreleased version of the MTGL (after logging in) by clicking the ”Browse Source” tab at the top of this page, then clicking on ”trunk,” and finally clicking on the ”zip archive” link. See below for the MTGL 1.0 release, which will have various improvements and will not include deprecated/experimental code.

Keywords for this software

Anything in here will be replaced on browsers that support the canvas element

References in zbMATH (referenced in 1 article )

Showing result 1 of 1.
Sorted by year (citations)

  1. Plimpton, Steven J.; Devine, Karen D.: MapReduce in MPI for large-scale graph algorithms (2011)