skip to main content


Title: GraphBLAS C API: Ideas for future versions of the specification
The GraphBLAS C specification provisional release 1.0 is complete. To manage the scope of the project, we had to defer important functionality to a future version of the specification. For example, we are well aware that many algorithms benefit from an inspector-executor execution strategy. We also know that users would benefit from a number of standard predefined semirings as well as more general user-defined types. These and other features are described in this paper in the context of a future release of the GraphBLAS C API.  more » « less
Award ID(s):
1629657 1740333
NSF-PAR ID:
10047271
Author(s) / Creator(s):
; ; ; ;
Date Published:
Journal Name:
2017 IEEE High Performance Extreme Computing Conference (HPEC)
Page Range / eLocation ID:
1 to 6
Format(s):
Medium: X
Sponsoring Org:
National Science Foundation
More Like this
  1. In 2013, we released a position paper to launch a community effort to define a common set of building blocks for constructing graph algorithms in the language of linear algebra. This led to the GraphBLAS. We released a specification for the C programming language binding to the GraphBLAS in 2017. Since that release, multiple libraries that conform to the GraphBLAS C specification have been produced. In this position paper, we launch the next phase of this ongoing community effort: a project to assemble a set of high level graph algorithms built on top of the GraphBLAS. While many of these algorithms are well-known with high quality implementations available, they have not been assembled in one place and integrated with the GraphBLAS. We call this project the LAGraph graph algorithms project and with this position paper, we put out a call for collaborators to join us. While the initial goal is to just assemble these algorithms into a single framework, the long term goal is a library of production-worthy code, with the LAGraph library serving as an open source repository of verified graph algorithms that use the GraphBLAS. 
    more » « less
  2. In 2013, we released a position paper to launch a community effort to define a common set of building blocks for constructing graph algorithms in the language of linear algebra. This led to the GraphBLAS. We released a specification for the C programming language binding to the GraphBLAS in 2017. Since that release, multiple libraries that conform to the GraphBLAS C specification have been produced. In this position paper, we launch the next phase of this ongoing community effort: a project to assemble a set of high level graph algorithms built on top of the GraphBLAS. While many of these algorithms are well-known with high quality implementations available, they have not been assembled in one place and integrated with the GraphBLAS. We call this project the LAGraph graph algorithms project and with this position paper, we put out a call for collaborators to join us. While the initial goal is to just assemble these algorithms into a single framework, the long term goal is a library of production-worthy code, with the LAGraph library serving as an open source repository of verified graph algorithms that use the GraphBLAS. 
    more » « less
  3. The purpose of the GraphBLAS Forum is to standardize linear-algebraic building blocks for graph computations. An important part of this standardization effort is to translate the mathematical specification into an actual Application Programming Interface (API) that (i) is faithful to the mathematics and (ii) enables efficient implementations on modern hardware. This paper documents the approach taken by the C language specification subcommittee and presents the main concepts, constructs, and objects within the GraphBLAS API. Use of the API is illustrated by showing an implementation of the betweenness centrality algorithm. 
    more » « less
  4. Graph algorithms can be expressed in terms of linear algebra. GraphBLAS is a library of low-level building blocks for such algorithms that targets algorithm developers. LAGraph builds on top of the GraphBLAS to target users of graph algorithms with high-level algorithms common in network analysis. In this paper, we describe the first release of the LAGraph library, the design decisions behind the library, and performance using the GAP benchmark suite. LAGraph, however, is much more than a library. It is also a project to document and analyze the full range of algorithms enabled by the GraphBLAS. To that end, we have developed a compact and intuitive notation for describing these algorithms. In this paper, we present that notation with examples from the GAP benchmark suite. 
    more » « less
  5. null (Ed.)
    Aims Climate warming in northern ecosystems is triggering widespread permafrost thaw, during which deep soil nutrients, such as nitrogen, could become available for biological uptake. Permafrost thaw shift frozen organic matter to a saturated state, which could impede nutrient uptake. We assessed whether soil nitrogen can be accessed by the deep roots of vascular plants in thermokarst bogs, potentially allowing for increases in primary productivity. Methods We conducted an ammonium uptake experiment on Carex aquatilis Wahlenb. roots excavated from thermokarst bogs in interior Alaska. Ammonium uptake capacity was compared between deep and shallow roots. We also quantified differences in root ammonium uptake capacity and plant size characteristics (plant aboveground and belowground biomass, maximum shoot height, and maximum root length) between the actively-thawing margin and the centre of each thermokarst bog as a proxy for time-following-thaw. Results Deep roots had greater ammonium uptake capacity than shallow roots, while rooting depth, but not belowground biomass, was positively correlated with aboveground biomass. Although there were no differences in aboveground biomass between the margin and centre, our findings suggest that plants can benefit from investing in the acquisition of resources near the vertical thaw front. Conclusions Our results suggest that deep roots of C. aquatilis can contribute to plant nitrogen uptake and are therefore able to tolerate anoxic conditions in saturated thermokarst bogs. This work furthers our understanding of how subarctic and wetland plants respond to warming and how enhanced plant biomass production might help offset ecosystem carbon release with future permafrost thaw. 
    more » « less