F. Desprez, J. Dongarra, F. Rastello, Y. Robert, Determining the idle time of a tiling: new results, in:  Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Optimal Semi-Oblique Tiling - Andonov, Balev, Rajopadhye (2001) (Correct)
....but assume an unbounded number of processors [12] The case of oblique tiling has not received much attention, principally because of the diOEculty of analytically modeling the running time of the tiled program. H#gstedt et al. 14] develop a cost model (later simplied somewhat by Desprez et al. [9]) for 2 D semi oblique tiling of parallelogram (or trapezium) shaped domains. They dene and identify the rise as a critical parameter, and give analytic formul# for the idle time of the program (from which its running time can be easily computed) Their model is dioeerent from bsp, and in ....
F. Desprez, J. Dongarra, F. Rastello, and Y. Robert. Determining the idle time of a tiling: New results. Journal of Information Science and Engineering, 14:167190, 1998.
Time-Minimal Tiling When Rise is Larger Than Zero - Xue, Cai (2002) (Correct)
....distributed memory machine. We introduce our program model in Section 1.1 and give a statement of the problem in Section 1.2. 1.1. Program Model Figure 1 illustrates our model, which is the most general one used in the literature when the execution time is the objective function to be minimised [1, 2, 7, 11, 14]. Iteration Space. The iteration space, which is a parallelogram with vertical left and right edges, is characterised by a triple (W; H; s iter ) where s iter denotes the slope of its top (or bottom) edge. The number of iterations in the iteration space is approximated by WH . Tiling. The ....
....or waiting to synchronise with other processors. They introduce the concept of rise to relate the shape of the iteration space with that of the tiles. Based on this concept, they present the idle time and execution time formulas for parallelogram shaped and trapezoidal iteration spaces. Later in [7], simpler formulas with simpler proofs are presented. In addition, the execution time formulas for all three types of rises are also given. Recently, this line of research has been extended by considering block distribution of parallelepiped tiles to processors for n dimensional convex iteration ....
F. Desprez, J. Dongarra, F. Rastello, and Y. Robert. Determining the idle time of a tiling: New results. Journal of Information Science and Engineering (Special Issue on Compiler Techniques for High-Performance Computing), 14(1):167--190, Mar. 1998.
Selecting Tile Shape for Minimal Execution Time - Karin Hogstedt (1999) (1 citation) (Correct)
....rectangular tiles, or tiles of the same slope as the iteration space. 3 For such tiles, only tile size selection is of concern [CM95, Sar97, ARY98] Our previous work [HCF97] recognizes the importance of tile shape selection for minimizing the idle time of parallel execution. Both that work and [DDRR97] considered parallelepiped shaped tiles for two dimensional iteration spaces, and determined simple formulas for idle time and finishing time. Allowing more general tile shapes is particularly useful when tiling is applied in the context of multiple levels of parallelism [MCFH97, MHCF98] such as ....
....simple formulas for idle time and finishing time. Allowing more general tile shapes is particularly useful when tiling is applied in the context of multiple levels of parallelism [MCFH97, MHCF98] such as in hierarchical tiling [CFH95a, CFH95b] The difference between our previous work and [DDRR97] is that the latter used a slightly different model of partial tiles, resulting in simpler formulas and proofs. This paper directly extends [HCF97] from 2 dimensional iteration spaces to K dimensional iteration spaces of a much more general shape. DKR91] uses linear programming to determine the ....
[Article contains additional citation context not shown here]
Frederic Desprez, Jack Dongarra, Fabrice Rastello, and Yves Robert. Determining the idle time of a tiling: New results. In International Conference on Parallel Architectures and Compilation Techniques (PACT'97), November 1997.
Optimal taskscD[[--fiWD at run time to exploit intra-tile.. - Fabric Rastello Amit (2003) Self-citation (Rastello) (Correct)
No context found.
F. Desprez, J. Dongarra, F. Rastello, Y. Robert, Determining the idle time of a tiling: new results, in:
Parallelization of the Numerical Lyapunov Calculation for the.. - RASTELLO (2001) Self-citation (Rastello) (Correct)
No context found.
Frederic Desprez, Jack Dongarra, Fabrice Rastello, and Yves Robert. Determining the idle time of a tiling: new results. Journal of Information Science and Engineering, 14:167-190, 1998.
Efficient tiling for an ODE discrete integration program: .. - Instead Of Trapezoidal Self-citation (Rastello) (Correct)
No context found.
F. Desprez, J. Dongarra, F. Rastello, and Y. Robert. Determining the idle time of a tiling: new results. Journal of Information Science and Engineering, 14:167--190, 1998.
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