amk_ccc(1)

👑 amk_ccc, amk_fft2, amk_hy, amk_m2, amk_p2 — create target architectures

okay so bestie, welcome to the Scotch user's manual 💖 this is amk_ccc(1) and honestly? this little family of programs is out here just making target architectures. iconic behavior tbh ✨

---

✨ 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 🦋

So like, the amk_* squad — every single one of them — creates target architecture files for some common, regular topologies. that's the whole vibe, that's the assignment, periodt 💅

amk_ccc makes a decomposition-defined cube-connected-cycle topology of dimension dim. the decomposition goes down first by bisection along the dimensions of the hypercube, and then along the remaining cycle graphs. two-phase king behavior 👑

amk_fft2 makes a decomposition-defined fast-Fourier-transform topology of dimension dim. the decomposition is done by recursive bisection of the vertices, by descending dimension — that's bit number in the labeling of the vertices, iykyk 🧚

amk_hy makes a decomposition-defined hypercube topology of dimension dim. decomposition = recursive bisection of the vertices, by descending dimension (again: bit number in the labeling of the vertices).

⚠️ bestie listen — save for experimentation purposes, this program is deprecated, because the algorithmically-defined 'hcub' target architecture is a more convenient and efficient way to represent hypercube architectures. like it still works but it's giving legacy energy 💀

amk_m2 makes a decomposition-defined 2D regular grid topology of dimensions dimX and dimY. the decomposition is recursive splitting along the dimensions, either by cutting the longest one, or by one-way dissection — which one you get depends on the '-m' option flag 🔥

⚠️ and again, no cap: save for experimentation purposes, this program is deprecated, because 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 comprising only two vertices of weights wght0 and wght1. this one is literally just a helper program — it builds a 'wcmplt' algorithmically-defined complete graph with two vertices. it may be used to compute weighted bisections of a graph. tiny but mighty 🥺

---

🌸 compressed files moment 🌸

When the proper libraries have been included at compile time, the amk_* programs can directly handle compressed files, both as input and output, bestie 🫶

A stream is treated as compressed whenever its name is postfixed with a compressed file extension, such as in 'brol.tgt.bz2' or '-.gz'.

The compression formats which can be supported are:

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

---

🎀 OPTIONS 🎀

• -m meth — for amk_m2 only. perform either recursive dissection or one-way dissection, according to the given method flag:
  • n — perform nested dissection (default).
  • o — perform one-way dissection (cut across Y, then X).
• -h — display some help. asking for directions is self-care 💖
• -V — display program version and copyright. receipts, bestie 🧾

---

🔥 EXAMPLE 🔥

Create a cube-connected-cycle target architecture of dimension 4, and save it to file 'ccc4.tgt'.

$ amk_ccc 4 ccc4.tgt

Run gmap to compute a bisection, into two parts of respective weights 3 and 5, of graph 'brol.grf', and save the resulting mapping to file 'brol.map'.

The dash '-' standard file name is used so that the target architecture description is read from the standard input, through the pipe 🫶✨

$ 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>

---

and that's the whole page, bestie 🎀 16 June 2026, straight from the Scotch user's manual, amk_ccc(1) — go make some architectures, you absolute main character 👑💅