P. Marcuello and A. Gonzalez. Thread-spawning schemes for speculative multithreading. In Proceedings of the 8th International Symposium on HighPerformance Computer Architecture, pages 55--64, February 2002. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Implicitly-Multithreaded Processors - Il Park Babak (2003) (1 citation) (Correct)
....compiler specified threading. Section 3, describes our proposals for N IMT and O IMT. In Section 4, we present experimental results. We discuss related work in Section 5, and conclude in Section 6. 2 Compiler Specified Speculative Threads Speculatively threaded architectures may use hardware [1,7] or compiler [11,5,12,9] to partition a sequential program into threads. Architectures extracting speculative threads in hardware have the key advantage that they offer binary compatibility with superscalar. These architectures, however, may incur high thread speculation overhead because: 1) ....
....has to ensure that the rename maps for earlier threads source registers are not clobbered by later threads. Second, IMT must guarantee that later threads consumer instructions obtain the correct rename maps and wait for the yet to be fetched earlier threads producer instructions. While others [1,7] employ hardware intensive value prediction to address these issues potentially incurring frequent misspeculation and recovery overhead, IMT uses the create and use masks (Section 2) combined with conventional SMT rename tables. Both IMT variants address these issues as follows. Upon thread ....
Pedro Marcuello and Antonio Gonzalez. Thread-spawning schemes for speculative multithreading. February 2003.
Prescient Instruction Prefetch - Aamodt, Marcuello, Chow, Hammarlund, .. Self-citation (Marcuello) (Correct)
....identifies not just a single instruction, but rather the beginning of an entire region of code. A similar notion can be found in speculative multithreading. For instance, Marcuello and Gonzalez recently proposed using a notion of reaching probability to define control quasi independent points [13], which essentially serve as spawn target pairs. This paper makes three key contributions: One, we propose using spare SMT thread contexts to perform prescient instruction prefetch for single threaded applications. Two, we present a formal mathematical framework for effective selection of ....
....spare SMT thread contexts to perform prescient instruction prefetch for single threaded applications. Two, we present a formal mathematical framework for effective selection of spawn target pairs that generalizes, in a rigorous way, the probabilistic framework introduced by Marcuello and Gonzalez [13]. Three, it proposes and quantitatively evaluates a specific optimization algorithm for spawntarget pair selection within this framework. By using a spare thread context to speculatively execute a probabilistically control independent future region of the same program but far ahead of the main ....
[Article contains additional citation context not shown here]
Pedro Marcuello and Antonio Gonzalez, Thread-Spawning Schemes for Speculative Multithreading, HPCA 8, Jan 2002.
A Framework for Modeling and Optimization of.. - Aamodt.. (2003) Self-citation (Marcuello) (Correct)
....state it generates when the main catches up with it. Traditionally, control flow idioms such as loops and procedure calls have been exploited for identifying spawn target pairs. Generalizing the near control independence between spawn and target common to such idioms, Marcuello and Gonzalez [15] proposed using a reaching probability threshold to define a far larger set of Section 3 Section 4 Stochastic Path Analysis HW Abstraction Optimization Algorithms Path Expression Mappings Figure 1: Modeling and Optimization Framework prefix infix postfix (a) program structure (b) thread ....
....is determined by computing the average instruction cache footprint between two points in the program. The reaching probability, RP (x, y) between basic blocks x and y is defined as the probability that y will be encountered at some time in the future given the processor is at x. In prior work [15], the point y is said to be control quasiindependent of the point x if the reaching probability from x to y is above a given threshold (for example 95 ) Similarly, the posteriori probability is defined as the probability of having previously visited state x since the last occurrence of y (if ....
P. Marcuello and A. Gonzlez. Thread-Spawning Schemes for Speculative Multithreading. In 8th International Symposium on High-Performance Computer Architecture, pages 55--64, 2002.
Enhancing Software Reliability With Speculative Threads - And The Committee (Correct)
No context found.
P. Marcuello and A. Gonzalez. Thread-spawning schemes for speculative multithreading. In Proceedings of the 8th International Symposium on HighPerformance Computer Architecture, pages 55--64, February 2002.
Hardware Support for Thread-Level Speculation - Steffan (2003) (Correct)
No context found.
Pedro Marcuello and Antonio Gonz alez. Thread-Spawning Scheme for Speculative Multithreading. In Proceedings of the 8th HPCA, February 2002.
Hardware Support for Thread-Level Speculation - Steffan (2003) (Correct)
No context found.
Pedro Marcuello and Antonio Gonz alez. Thread-Spawning Scheme for Speculative Multithreading. In Proceedings of the 8th HPCA, February 2002.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC