Spark
FLAME code-skeleton generator
Beta version of new Spark webpage. Click here for old page.
If you experience strange rendering of this page, do a hard reload:
Chrome/Firefox/Edge: Cmd+Shift+R
Safari: Cmd+Option+R
FLAME code-skeleton generator
Beta version of new Spark webpage. Click here for old page.
If you experience strange rendering of this page, do a hard reload:
Chrome/Firefox/Edge: Cmd+Shift+R
Safari: Cmd+Option+R
Spark generates the code skeleton for an algorithm derived with the FLAME methodology. Describe the operation on the left and the skeleton appears on the right; fill in the update statements yourself.
Pick a name related to the operation. For a
triangular solve with multiple right-hand sides,
B := L−1B,
a good name is Trsm_llnn, where llnn records that
L is on the left of B, lower triangular,
not transposed, and has a nonunit diagonal. (This convention comes
from the level-3 BLAS.)
Choose whether the algorithm is unblocked, blocked, or recursive, and give the variant number for the algorithm you derived.
By convention upper-case letters denote matrices, lower-case letters denote
vectors (a trailing t marks a row vector), and lower-case Greek
letters denote scalars. At least one operand must be an output, and at least one
must be partitioned.
Spark was written by Tze Meng Low, Robert A. van de Geijn, and Jonathan S. Monette. Please send comments to rvdg@cs.utexas.edu. Generated code is covered by the FLAME license.