Jump to content

Explicit data graph execution

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Jkl (talk | contribs) at 13:12, 25 April 2007 (Created page with ''''Explicit Data Graph Execution''' or '''EDGE''' is an instruction set architecture which takes a different path from the traditional [[machine code|instructio...'). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

Explicit Data Graph Execution or EDGE is an instruction set architecture which takes a different path from the traditional instruction / register designs like RISC and CISC. Instead, EDGE processors map the computations required in a basic block, called operands, to a flexible routing layer, allowing the individual operations to communicate their results to the consuming operations without going through the bottleneck of a register file.