L. Kipp. Perfect Benchmarks Documentation, Suite 1 Center for Supercomputing Research and Development, University of Illinois at Urbana-Champaign, October, 1993. Home/Search Document Not in Database Summary Related Articles |
This paper is cited in the following contexts:
Compile-time Scheduling Algorithms for Heterogeneous.. - Cierniak, Zaki, Li (1997) (20 citations) (Correct)
....constant; for the heterogeneous case, we assume that x i = ai b, i.e. we restrict our attention to loops where the computation is an affine function of the normalized loop index, which captures a large set of scientific programs. Examples include Cholesky, TRFD from the Perfect benchmark suite [12], and SPEC95 benchmark applications. The Computer Journal, Vol. 00, No. 0, 4 M. Cierniak, M. J. Zaki and W. Li 3.2. Communication With the right placement of data, a parallel loop does not require any communication during execution, i.e. there is no data flow between iterations of a parallel ....
L. Kipp. Perfect Benchmarks Documentation, Suite 1 Center for Supercomputing Research and Development, University of Illinois at Urbana-Champaign, October, 1993.
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