Show simple item record

dc.contributor.authorGibson, Danen_US
dc.contributor.authorWood, Daviden_US
dc.date.accessioned2012-03-15T17:24:16Z
dc.date.available2012-03-15T17:24:16Z
dc.date.created2009en_US
dc.date.issued2009en_US
dc.identifier.citationTR1656en_US
dc.identifier.urihttp://digital.library.wisc.edu/1793/60676
dc.description.abstractPower (and thermal) limits have forced an industry-wide shift from increasingly complex uniprocessors to multicore chips with 4, 8, and even 16 simpler processor cores. Yet Amdahl's Law suggests that these cores should not be too simple, lest they exacerbate even a parallel application's sequential bottlenecks. Furthermore, running all cores at full speed will soon exceed the chip's power envelope. Ideally, future CMPs should use cores that trade-off power and performance, allowing the system to scale up a core's instruction-level parallelism (ILP) and memory-level parallelism (MLP) to improve sequential performance. This work presents the Forwardflow microarchitecture, which executes instructions out-of-order using RAM-based structures in lieu of non-scalable CAM- or matrix-based mechanisms. Forwardflow dynamically builds an explicit internal dataflow representation from a conventional ISA, using forward dependence pointers to guide instruction wakeup, selection, and issue. Because all of Forwardflow's major data structures are RAM-based, the instruction window scales large enough to tolerate long memory access times.en_US
dc.format.mimetypeapplication/pdfen_US
dc.publisherUniversity of Wisconsin-Madison Department of Computer Sciencesen_US
dc.titleForwardflow: Scalable, RAM-Based Dataflow Executionen_US
dc.typeTechnical Reporten_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

  • CS Technical Reports
    Technical Reports Archive for the Department of Computer Sciences at the University of Wisconsin-Madison

Show simple item record