amk_ccc(1)

🎀 amk_ccc(1) from the Scotch user's manual 🎀

---

✨ NAME ✨

Okay so bestie, these five programs (amk_ccc, amk_fft2, amk_hy, amk_m2, and amk_p2) are all about creating target architectures 💖

🌸 SYNOPSIS 🌸

amk_ccc [options] dim [tfile]

amk_fft2 [options] dim [tfile]

amk_hy [options] dim [tfile]

amk_m2 [options] dimX [dimY] [tfile]

amk_p2 [options] [wght0] [wght1] [tfile]

💅 DESCRIPTION 💅

The amk_* programs make target architecture files for some common, regular topologies. It's giving organized 🧚

amk_ccc makes a decomposition-defined cube-connected-cycle topology of dimension dim. The decomposition happens first by bisection along the dimensions of the hypercube, and then along the remaining cycle graphs. Iconic 👑

amk_fft2 makes a decomposition-defined fast-Fourier-transform topology of dimension dim. The decomposition is done by recursive bisection of the vertices, going by descending dimension (aka the bit number in the labeling of the vertices) ✨

amk_hy makes a decomposition-defined hypercube topology of dimension dim. The decomposition is done by recursive bisection of the vertices, going by descending dimension (aka the bit number in the labeling of the vertices). Real talk though, this one is deprecated unless you're just experimenting, because the algorithmically-defined hcub target architecture is a more convenient and efficient way to represent hypercube architectures 🙈

⚠️ Deprecated: amk_hy is only for experimentation purposes now. Use the algorithmically-defined hcub target architecture instead, it's way more convenient and efficient for hypercubes.

amk_m2 makes a decomposition-defined 2D regular grid topology with dimensions dimX and dimY. The decomposition is done by recursive splitting along the dimensions, either by cutting the longest one or by one-way dissection, depending on the -m option flag 🦋

⚠️ Deprecated: amk_m2 is also for experimentation only now. The algorithmically-defined mesh2D and mesh3D target architectures are a more convenient and efficient way to represent 2D and 3D grid architectures.

amk_p2 makes a weighted path graph topology with only two vertices, of weights wght0 and wght1. It's just a helper program, and it builds a wcmplt algorithmically-defined complete graph with two vertices. You can use it to compute weighted bisections of a graph 🫶

When the proper libraries were included at compile time, the amk_* programs can directly handle compressed files, both as input and output. A stream counts as compressed whenever its name ends with a compressed file extension, like brol.tgt.bz2 or -.gz 🌈 The supported compression formats are:

• bzip2 format (.bz2)
• gzip format (.gz)
• lzma format (.lzma)

🦋 OPTIONS 🦋

• -mmeth — Only for amk_m2, bestie! This picks between recursive dissection and one-way dissection, depending on the method flag you give it:
  • n — nested dissection (this is the default, so you get it if you don't pick anything) 💜
  • o — one-way dissection (cuts across Y, then X) 🍓
• -h — Pulls up some help for you 🎀
• -V — Shows the program version and copyright 👑

🧚 EXAMPLE 🧚

Let's make a cube-connected-cycle target architecture of dimension 4 and save it to the file ccc4.tgt. Super easy, literally one line 💖

$ amk_ccc 4 ccc4.tgt

Next, we run gmap to compute a bisection of the graph brol.grf, splitting it into two parts with weights 3 and 5, and save the mapping to brol.map. The dash - standard file name is what makes this work, since it tells gmap to read the target architecture description from standard input through the pipe. Main character energy ✨

$ amk_p2 3 5 | gmap brol.grf - brol.map

🌈 SEE ALSO 🌈

acpl(1), atst(1), amk_grf(1), dgmap(1), gmap(1).

Scotch user's manual. 📖

💜 AUTHOR 💜

Francois Pellegrini <francois.pellegrini@labri.fr>

---

Okay that's the whole tea, bestie 🫶 This page was last updated on 23 November 2019 and it's amk_ccc(1) forever and ever 💅✨