Ding-Kai Chen and Pen-Chung Yew. Statement reordering for doacross loops. In International Conference on Parallel Processing, pages 24--28, August 1994. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Compiling For Multithreaded Architectures - Tang (1999) (1 citation) (Correct)
....is to extract the continuation stage from the TSAG stage. The continuation stage contains the computation that is essential to start the next thread. In general, it contains instructions to update the value of recurrent variables such as the loop index. Finally, the statement reordering [25] technique can be used to schedule target stores as early as possible, or schedule load instructions that may be data dependent on the target stores of some predecessors as late as possible. A.5 STAMPede Model An STAMPede processor is a single chip multiprocessor, in which each processor has its ....
Ding-Kai Chen and Pen-Chung Yew. Statement reordering for doacross loops. In International Conference on Parallel Processing, pages 24--28, August 1994.
The Superthreaded Processor Architecture - Jenn-Yuan Tsai (1999) (14 citations) Self-citation (Yew) (Correct)
....threads complete their TSAG stages and forward all of their target store addresses. The compiler will try to increase the execution overlap of concurrent threads by minimizing the stall time caused by data dependences between threads. To do this, the compiler can perform statement reordering [3] and schedule target stores as early as possible. The compiler can also schedule load instructions that may be data dependent on the target stores of some predecessor threads as late as possible. 3.4 Advanced Compiler Techniques for Superthreading 3.4.1 Conversion of Data Speculation to Control ....
Ding-Kai Chen and Pen-Chung Yew. Statement reordering for doacross loops. In Proceedings of International Conference on Parallel Processing, volume Vol. II, pages 24--28, August 1994.
Compiler Techniques for the Superthreaded Architectures - Tsai, Jiang, Yew (1998) (7 citations) Self-citation (Yew) (Correct)
....complete their TSAG stages and forward all of their target store addresses. In the thread pipelining, the compiler will try to increase the execution overlap of concurrent threads by minimizing the stall caused by data dependences between threads. To do this, we can perform statement reordering [1] and schedule target stores as early as possible, or schedule load instructions that may be data dependent on the target stores of some predecessor threads as late as possible. 3.4 Advanced Compiler Techniques for Superthreading Conversion of Data Speculation to Control Speculation Some concurrent ....
Ding-Kai Chen and Pen-Chung Yew. Statement reordering for doacross loops. In Proceedings of International Conference on Parallel Processing, volume Vol. II, pages 24--28, August 1994.
Program Optimization for Concurrent Multithreaded Architectures - Tsai, Jiang, Yew (1997) Self-citation (Yew) (Correct)
....It also generates target store instructions to facilitate run time data dependence checking. The compiler will try to increase the execution overlap of concurrent threads by minimizing the stalls caused by data dependences between threads. To do this, we will perform statement reordering [1] to schedule target stores as early as possible, and to schedule load instructions that may be data dependent on the target stores of some predecessor threads as late as possible. 3.2 Conversion of Data Speculation to Control Speculation Some concurrent multiple threaded architectures, such as ....
Ding-Kai Chen and Pen-Chung Yew. Statement reordering for doacross loops. In Proceedings of International Conference on Parallel Processing, volume Vol. II, August 1994.
Superthreading - Tsai (1998) Self-citation (Yew) (Correct)
....complete their TSAG stages and forward all of their target store addresses. In the thread pipelining, the compiler will try to increase the execution overlap of concurrent threads by minimizing the stall caused by data dependences between threads. To do this, we can perform statement reordering [6] and schedule target stores as early as possible, or schedule load instructions that may be data dependent on the target stores of some predecessor threads as late as possible. 5.4 Advanced Compiler Techniques for Superthreading 5.4.1 Conversion of Data Speculation to Control Speculation Some ....
Ding-Kai Chen and Pen-Chung Yew. Statement reordering for doacross loops. In Proceedings of International Conference on Parallel Processing, volume Vol. II, pages 24--28, August 1994.
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