Explicit Data Graph Execution

Explicit Data Graph Execution

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 reconfigurable routing layer, allowing the individual operations to communicate their results to the consuming operations without going through the bottleneck of a register file. Each block is calculated in parallel in a different core, which may either be a self-sustained generic processor or an application-specific processor.

The EDGE ISA is defined using the operations in a single block and facilitates encoding the data dependencies within the instruction itself to relieve the processor of detecting dependencies. The data dependencies are then used to model a dataflow graph (or a data graph) which is used as the abstraction used to express concurrency. Though EDGE ISAs make each instruction more expensive, the cost is ammortized as instruction block contains a large number of instructions (the reference TRIPS implementation uses a 1024-instruction window).

EDGE ISA works on a block-atomic model, i.e., a block of instructions is an atomic unit of execution. All the processor cores which form the execution blocks are named in the ISA and blocks are mapped to them. A block of instructions does not have control statements, but can have predicated instructions. The dataflow graph is encoded using these blocks, by specifying the flow of data from one block of instructions to another, or to some storage area. Each block can individually be a sequential program or a SIMD program.

External links

* [http://www.cs.utexas.edu/~trips/overview.html Overview of the TRIPS project] An implementation of an EDGE architecture.


Wikimedia Foundation. 2010.

Игры ⚽ Поможем решить контрольную работу

Look at other dictionaries:

  • Graph reduction — In computer science, graph reduction implements an efficient version of non strict evaluation, an evaluation strategy where the arguments to a function are not immediately evaluated. This form of non strict evaluation is also known as lazy… …   Wikipedia

  • TRIPS architecture — TRIPS is a new microprocessor architecture being designed by a team at the University of Texas at Austin in conjunction with IBM. TRIPS uses a new instruction set architecture that is designed to be easily broken down into large groups of… …   Wikipedia

  • Edge — An edge in common usage denotes a sharp border of a (solid) object.cience and technology* Edge (graph theory), a line segment joining two nodes in a graph * Edge (geometry), a line segment joining two vertices in a polytope * Edge case, a problem …   Wikipedia

  • Business Process Execution Language — As defined in the abstract of the Web Services Business Process Execution Language OASIS Standard WS BPEL 2.0, WS BPEL (or BPEL for short) is a language for specifying business process behavior based on Web Services. Processes in WS BPEL export… …   Wikipedia

  • Edge — (engl. für ‚Rand‘, ‚Kante‘, ‚Schneide‘) steht für: Edge (Texas), eine Stadt in Texas, USA Edge (Zeitschrift), ein Magazin über Computerspiele in englischer und deutscher Ausgabe Edge ist der Familienname folgender Personen: Selwyn Edge… …   Deutsch Wikipedia

  • EDGE — (engl. für ‚Rand‘, ‚Kante‘, ‚Schneide‘) steht für: Edge (Texas), eine Stadt in Texas, USA Edge (Organisation), ein amerikanischer Think Tank, Herausgeber des Internetmagazins Edge – The Third Culture, das sich der Vermittlung zwischen… …   Deutsch Wikipedia

  • Edge — Saltar a navegación, búsqueda Edge puede referirse a: El nombre en el ring del luchador Adam Copeland. Edge, una publicación dedicada al sector de videojuegos. una ciudad dentro del mundo ficticio del videojuego Final Fantasy VII, construida en… …   Wikipedia Español

  • Commitment ordering — In concurrency control of databases, transaction processing (transaction management), and related applications, Commitment ordering (or Commit ordering; CO; (Raz 1990, 1992, 1994, 2009)) is a class of interoperable Serializability techniques …   Wikipedia

  • Two-phase locking — This article is about concurrency control. For commit consensus within a distributed transaction, see Two phase commit protocol. In databases and transaction processing two phase locking, (2PL) is a concurrency control method that guarantees… …   Wikipedia

  • Reactive programming — is a programming paradigm oriented around data flows and the propagation of change. This means that it should be possible to express static or dynamic data flows with ease in the programming languages used, and that the underlying execution model …   Wikipedia

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”