Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 218,276,774 papers from all fields of science
Search
Sign In
Create Free Account
Explicit data graph execution
Known as:
Edge
Explicit data graph execution, or EDGE, is a type of instruction set architecture (ISA) which intends to greatly improve computing performance…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
9 relations
Basic block
C++
Compiler
Data-flow analysis
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2019
2019
Performance Modeling and Bottleneck Analysis of EDGE Processors Using Dependence Graphs
Hossein Golestani
,
G. Gupta
,
Rathijit Sen
IEEE computer architecture letters
2019
Corpus ID: 182641087
Exploring new directions in ISA and microarchitecture design can be challenging due to the large search space. Efficient tools…
Expand
2018
2018
Towards an Area-Efficient Implementation of a High ILP EDGE Soft Processor
J. Gray
,
Aaron Smith
arXiv.org
2018
Corpus ID: 3975292
In-order scalar RISC architectures have been the dominant paradigm in FPGA soft processor design for twenty years. Prior out-of…
Expand
2010
2010
Atomic block formation for explicit data graph execution architectures
K. McKinley
,
D. Burger
,
Bertrand A. Maher
2010
Corpus ID: 35745921
Limits on power consumption, complexity, and on-chip latency have focused computer architects on power-efficient designs that…
Expand
2010
2010
M5 based EDGE architecture modeling
Pengfei Gou
,
Qingbo Li
,
+4 authors
Jinxiang Wang
IEEE International Conference on Computer Design
2010
Corpus ID: 16212567
EDGE (Explicit Data Graph Execution) architectures, a class of architectures distinct from traditional RISC and CISC…
Expand
Highly Cited
2009
Highly Cited
2009
An evaluation of the TRIPS computer system
Mark Gebhart
,
Bertrand A. Maher
,
+10 authors
K. McKinley
International Conference on Architectural Support…
2009
Corpus ID: 6512576
The TRIPS system employs a new instruction set architecture (ISA) called Explicit Data Graph Execution (EDGE) that renegotiates…
Expand
2007
2007
TRIPS: A distributed explicit data graph execution (EDGE) microprocessor
Madhu Saravana Sibi Govindan
,
D. Burger
,
S. Keckler
IEEE Hot Chips Symposium
2007
Corpus ID: 7765262
This article consists of a collection of slides from the author's conference resentation on TRIPS, a distributed explicit data…
Expand
2007
2007
Software Infrastructure and Tools for the TRIPS Prototype
B. Yoder
,
J. Burrill
,
+13 authors
K. McKinley
2007
Corpus ID: 8852698
The TRIPS hardware prototype is the first instantiation of an Explicit Data Graph Execution (EDGE) architecture. Building the…
Expand
2006
2006
Merging Head and Tail Duplication for Convergent Hyperblock Formation
Bertrand A. Maher
,
Aaron Smith
,
D. Burger
,
K. McKinley
Micro
2006
Corpus ID: 6021289
VLIW and EDGE (explicit data graph execution) architectures rely on compilers to form high-quality hyper-blocks for good…
Expand
2005
2005
Breaking the GOP / Watt Barrier with EDGE Architectures
D. Burger
,
S. Keckler
2005
Corpus ID: 11686192
Achieving excellent power/performance ratios is easy for processor designs that have sufficiently low performance needs. The…
Expand
Highly Cited
2004
Highly Cited
2004
Scaling to the end of silicon with EDGE architectures
D. Burger
,
S. Keckler
,
+7 authors
William Yode
Computer
2004
Corpus ID: 16309496
Microprocessor designs are on the verge of a post-RISC era in which companies must introduce new ISAs to address the challenges…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE