Diderot: a Domain-Specific Language for Portable Parallel Scientific Visualization and Image Analysis

Kindlmann, Gordon; Chiw, Charisee; Seltzer, Nicholas; Samuels, Lamont; Reppy, John

doi:10.1109/tvcg.2015.2467449

Cited by 33 publications

(28 citation statements)

References 42 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Σ-SPL [15] is an extension that features index mappings similar to the FlexiblyIndexed nodes in GEM. EIN [9] is another tensor language, and the intermediate representations of Diderot [10,24]. It uses a static single assignment (SSA) form, while GEM is a simple expression language that cannot express control flow.…”

Section: Related Workmentioning

confidence: 99%

TSFC: A Structure-Preserving Form Compiler

Homolya¹,

Mitchell²,

Luporini³

et al. 2018

SIAM J. Sci. Comput.

View full text Add to dashboard Cite

A form compiler takes a high-level description of the weak form of partial differential equations and produces low-level code that carries out the finite element assembly. In this paper we present the Two-Stage Form Compiler (TSFC), a new form compiler with the main motivation to maintain the structure of the input expression as long as possible. This facilitates the application of optimizations at the highest possible level of abstraction. TSFC features a novel, structure-preserving method for separating the contributions of a form to the subblocks of the local tensor in discontinuous Galerkin problems. This enables us to preserve the tensor structure of expressions longer through the compilation process than other form compilers. This is also achieved in part by a two-stage approach that cleanly separates the lowering of finite element constructs to tensor algebra in the first stage, from the scheduling of those tensor operations in the second stage. TSFC also efficiently traverses complicated expressions, and experimental evaluation demonstrates good compile-time performance even for highly complex forms.Algorithm 1 Generated loop nests for the expression (4.2).1: for all q do 2:3: for all q, r do 4: 1) q,r * c r 5: for all q do 6:J (1,2) [q] ← 0 7: for all q, r do 8: 2) q,r * c r 9: for all q do 10: J (2,1) [q] ← 0 11: for all q, r do 12: J (2,1) [q] += C (2,1) q,r * c r 13: for all q do 14: J (2,2) [q] ← 0 15: for all q, r do 16: J (2,2) [q] += C (2,2) q,r * c r

show abstract

Section: Related Workmentioning

confidence: 99%

TSFC: A Structure-Preserving Form Compiler

Homolya¹,

Mitchell²,

Luporini³

et al. 2018

SIAM J. Sci. Comput.

View full text Add to dashboard Cite

show abstract

“…We further use Git [45] as the version control system by utilizing the functionality provided by the libgit2 library [53]. The current version of our application supports Diderot [44] as a programming language specifically designed for the visualization domain, as well as C++ and GLSL. While Diderot code is commonly manageable within a single source file, C++ and GLSL code can become quite large.…”

Section: Methodsmentioning

confidence: 99%

“…Our system was designed to flexibly support multiple back ends. It supports C++ and GLSL code as generalpurpose programming languages, as well as Diderot [44], a domain-specific language (DSL) specifically designed for the development of scientific visualization algorithms. While C++ and GLSL have been utilized in many visualization applications for possible performance gains, DSLs provide benefits in usability and expressiveness, while reducing the complexity of the algorithm's source code with efficient syntax.…”

Section: System Designmentioning

confidence: 99%

Vis-a-Vis: Visual Exploration of Visualization Source Code Evolution

Bolte

Brückner

2021

IEEE Trans. Visual. Comput. Graphics

View full text Add to dashboard Cite

Developing an algorithm for a visualization prototype often involves the direct comparison of different development stages and design decisions, and even minor modifications may dramatically affect the results. While existing development tools provide visualizations for gaining general insight into performance and structural aspects of the source code, they neglect the central importance of result images unique to graphical algorithms. In this paper, we present a novel approach that enables visualization programmers to simultaneously explore the evolution of their algorithm during the development phase together with its corresponding visual outcomes by providing an automatically updating meta visualization. Our interactive system allows for the direct comparison of all development states on both the visual and the source code level, by providing easy to use navigation and comparison tools. The on-the-fly construction of difference images, source code differences, and a visual representation of the source code structure further enhance the user's insight into the states' interconnected changes over time. Our solution is accessible via a web-based interface that provides GPU-accelerated live execution of C++ and GLSL code, as well as supporting a domain-specific programming language for scientific visualization.

show abstract

“…This list does not fairly describe the sophisticated approaches to high-performance computing [23] and computational scheduling [26,33]. We build on Diderot, a visualization DSL limited to regular grids [8,19,20], but distinguished by offering the mathematical abstraction of a C k tensor field. Our current work extends how Diderot fields are defined to include FEM, so that existing Diderot programs can be used with minimal changes, while introducing a new abstraction, a mesh position, which supports the convenient expression of previous methods of moving through the geometry of a curved FEM mesh [11,25].…”

Section: Related Workmentioning

confidence: 99%

“…We present preliminary work on extending the open-source compiler for a scientific visualization DSL [8,19,20], previously limited to regular grids, to also work on higher-order FEM data. Our long-term goal is to connect previous FEM visualization methods [11,18,25,[27][28][29][30][31][32] by simplifying how they can be expressed and combined in working code.…”

Section: Introductionmentioning

confidence: 99%

Point Movement in a DSL for Higher-Order FEM Visualization

Collin

Chiw

Scott

et al. 2019

2019 IEEE Visualization Conference (VIS)

Self Cite

View full text Add to dashboard Cite

Scientific visualization tools tend to be flexible in some ways (e.g., for exploring isovalues) while restricted in other ways, such as working only on regular grids, or only on unstructured meshes (as used in the finite element method, FEM). Our work seeks to expose the common structure of visualization methods, apart from the specifics of how the fields being visualized are formed. Recognizing that previous approaches to FEM visualization depend on efficiently updating computed positions within a mesh, we took an existing visualization domain-specific language, and added a mesh position type and associated arithmetic operators. These are orthogonal to the visualization method itself, so existing programs for visualizing regular grid data work, with minimal changes, on higher-order FEM data. We reproduce the efficiency gains of an earlier guided search method of mesh position update for computing streamlines, and we demonstrate a novel ability to uniformly sample ridge surfaces of higher-order FEM solutions defined on curved meshes.

show abstract

Diderot: a Domain-Specific Language for Portable Parallel Scientific Visualization and Image Analysis

Cited by 33 publications

References 42 publications

TSFC: A Structure-Preserving Form Compiler

TSFC: A Structure-Preserving Form Compiler

Vis-a-Vis: Visual Exploration of Visualization Source Code Evolution

Point Movement in a DSL for Higher-Order FEM Visualization

Contact Info

Product

Resources

About