• STAN

  • Referenced in 38 articles [sw03348]
  • including exploiting a powerful representational structure for the core plan-graph and using a wave ... reduce search and graph construction costs once the plan-graph structure reaches a stable state ... STAN has also always exploited a parallel domain analysis system, TIM, which can be used...
  • JUNG

  • Referenced in 11 articles [sw12112]
  • representations of entities and their relations, such as directed and undirected graphs, multi-modal graphs ... graphs with parallel edges, and hypergraphs. It provides a mechanism for annotating graphs, entities...
  • COCONUT

  • Referenced in 40 articles [sw04760]
  • representation of various matrix classes. The graphs are implemented using the VGTL (Vienna Graph Template ... COCONUT project) to support parallel computing as wel! l. The solution algorithm is an advanced...
  • PowerGraph

  • Referenced in 9 articles [sw17478]
  • several graph-parallel abstractions including Pregel and GraphLab. However, the natural graphs commonly found ... characterize the challenges of computation on natural graphs in the context of existing graphparallel abstractions ... approach to distributed graph placement and representation that exploits the structure of power-law graphs ... evaluation comparing PowerGraph to two popular graph-parallel systems. Finally, we describe three different implementation...
  • HTGviz

  • Referenced in 1 article [sw23529]
  • implemented on top of Parafrase-2 parallelizing compiler, and Tcl/Tk is used as middleware integration ... Hierarchical Task Graph (HTG) program representation where task parallelism is represented by precedence relations (arcs ... partitioning and parallelism by inserting OpenMP directives into the code based on graph manipulation facilities...
  • HAGAR

  • Referenced in 1 article [sw02336]
  • specifically in FPGAs, to implement such graph algorithms for speedup relative to their software counterparts ... examples of this idea. First, we draw parallels to content addressable memories. Second, we show ... mapping the adjacency matrix representation of a graph to a HArdware Graph ARray (HAGAR...
  • RECFMM

  • Referenced in 6 articles [sw21760]
  • RECFMM, a program representation and implementation of a recursive scheme for parallelizing the adaptive fast ... while maintaining mathematical clarity and flexibility. The parallelization scheme signifies the recursion feature that ... parallel rendition of the recursion scheme. Modern software systems -- CILK in particular, which provides graph...
  • Simflowny

  • Referenced in 3 articles [sw19046]
  • open platform which automatically generates parallel code of scientific dynamical models for different simulation frameworks ... spatial domain or on a graph--. Additionally we introduce a flexible graphical user interface ... architecture and summarizes the formal representation and implementation of these new families, providing several validation...
  • FASAN

  • Referenced in 2 articles [sw02895]
  • iteratively on static arrays. Our approach to parallelize such an algorithm with potentially irregular data ... transformed into a data flow graph which allows both concurrent evaluation and pipelines of sequential ... language. The key issue is the representation of hierarchical data structures as wrapper streams. This...
  • PMC

  • Referenced in 1 article [sw21471]
  • parallel maximum clique algorithms. Optimized to be fast for large sparse graphs. Algorithms tested ... selected at runtime. Dynamically reduces the graph representation periodically as vertices are pruned or searched...
  • ROSE

  • Referenced in 4 articles [sw04891]
  • Alamos National Laboratory. ROSE converts the intermediate representations (IRs) produced by the front-ends into ... interfaces. The program analysis available include call graph analysis, control flow analysis, data flow analysis ... function), OpenMP directive lowering, automatic parallelization and loop transformations (a loop optimizer supporting aggressive loop...
  • foxPSL

  • Referenced in 2 articles [sw13725]
  • Soft Logic (PSL) based on the distributed graph processing framework {sc Signal/Collect ... rich relational structures, usually by combining logical representations with probabilistic graphical models ... domain knowledge, like degrees of truth, in parallel with uncertainty.par {it foxPSL} supports the full...
  • qskeleton

  • Referenced in 0 articles [sw15165]
  • qskeleton: parallel polyhedral computing software based on the double description method and Fourier-Motzkin elimination ... description method (DDM) for computing a dual representation of convex polyhedra. The software ... algorithm in the DDM or combining the graph test of skeleton with other accelerating data ... testing in DDM / Chernikov rules in FME. Parallel computing is an important direction of development...
  • ANSYS

  • Referenced in 704 articles [sw00044]
  • ANSYS offers a comprehensive software suite that spans...
  • ATLAS

  • Referenced in 199 articles [sw00056]
  • This paper describes the Automatically Tuned Linear Algebra...
  • ACL2

  • Referenced in 283 articles [sw00060]
  • ACL2 is both a programming language in which...
  • BARON

  • Referenced in 354 articles [sw00066]
  • BARON is a computational system for solving nonconvex...
  • BoomerAMG

  • Referenced in 196 articles [sw00086]
  • BoomerAMG: A parallel algebraic multigrid solver and preconditioner...
  • cdd

  • Referenced in 115 articles [sw00114]
  • The program cdd+ (cdd, respectively) is a C...
  • CGAL

  • Referenced in 394 articles [sw00118]
  • The goal of the CGAL Open Source Project...