One compiler swap

The effcc Compiler accepts standard C and C++. No new language, no framework, no changes to the rest of your toolchain.

A graph node contains an operation

Each graph node is one operation from your code: an add, a multiply, a comparison. The compiler extracts them automatically.

An edge is dataflow

Each edge is data flowing from one operation to the next. The graph captures what your program actually needs to happen, in what order.

Distance costs energy

Moving data takes more energy than computing on it. The farther a value travels, the more it costs, so where operations sit matters.

The compiler finds the shape

The effcc Compiler explores placements and routes so data travels the shortest practical distance. This optimization is automatic.

Compute where the data is

This tile holds one operation from the original C code, with its inputs right beside it. No instruction fetch, no shared register file to wait on.

Strategic placement

Operations that feed each other are placed close to one another. A result lands exactly where it is needed next.

No central controller

The on-chip network carries data between tiles without a central controller orchestrating every step. The structure of the program is the schedule.

Producer to consumer

Values flow directly from the operation that produced them to the one that consumes them, the moment they are ready.