An evaluation of the TRIPS computer system
- Additional Document Info
- View All
The TRIPS system employs a new instruction set architecture (ISA) called Explicit Data Graph Execution (EDGE) that renegotiates the boundary between hardware and software to expose and exploit concurrency. EDGE ISAs use a block-atomic execution model in which blocks are composed of dataflow instructions. The goal of the TRIPS design is to mine concurrency for high performance while tolerating emerging technology scaling challenges, such as increasing wire delays and power consumption. This paper evaluates how well TRIPS meets this goal through a detailed ISA and performance analysis. We compare performance, using cycles counts, to commercial processors. On SPEC CPU2000, the Intel Core 2 outperforms compiled TRIPScode in most cases, although TRIPS matches a Pentium 4. On simple benchmarks, compiled TRIPS code outperforms the Core 2 by 10% and hand-optimized TRIPS code outperforms it by factor of 3. Compared to conventional ISAs, the block-atomic model provides a larger instruction window, increases concurrency at a cost of more instructions executed, and replaces register and memory accesses with more efficient direct instruction-to-instruction communication. Our analysis suggests ISA, microarchitecture, and compiler enhancements for addressing weaknesses in TRIPS and indicates that EDGE architectures have the potential to exploit greater concurrency in future technologies. 2009 ACM.
name of conference
Proceeding of the 14th international conference
Proceeding of the 14th international conference on Architectural support for programming languages and operating systems - ASPLOS '09
author list (cited authors)
Gebhart, M., Burrill, J., Keckler, S. W., Burger, D., McKinley, K. S., Maher, B. A., ... Smith, A.
complete list of authors
Gebhart, Mark||Burrill, James||Keckler, Stephen W||Burger, Doug||McKinley, Kathryn S||Maher, Bertrand A||Coons, Katherine E||Diamond, Jeff||Gratz, Paul||Marino, Mario||Ranganathan, Nitya||Robatmili, Behnam||Smith, Aaron