Manish Gupta and Prithviraj Banerjee. Compile-time estimation of communication costs of programs. Journal of Programming Languages, 2(3):191--225, September 1994. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Communication Pre-evaluation in HPF - Boulet, Redon (1998) (1 citation) (Correct)
....of a data parallel program. Its method only handles block distributions and is targeted to the Vienna Fortran Compilation System [2] His method is precise but needs fully specified problem sizes and machine parameters while we use parameterized symbolic analysis methods. Gupta and Banerjee [12] also present a compile time method to estimate the communication costs of programs. Their method takes place early in the compilation process, before the SPMD program communication generation. It is thus less costly than Fahringer s, but also less accurate. They are able to determine what type of ....
Manish Gupta and Prithviraj Banerjee. Compile-time estimation of communication costs of programs. Journal of Programming Languages, 2(3):191--225, September 1994.
Precise MPI Performance Measurement Using MPIBench - Grove, Coddington (2001) (2 citations) (Correct)
.... MPI implementations; comparing the performance of di#erent parallel computers; providing a deeper insight into the inner workings of parallel applications programs; and enabling improved performance prediction of MPI programs using 2 static performance prediction techniques such as those found in [5, 8, 3]. 2 Existing Message Passing Benchmarks There are a number of MPI benchmarks currently available. The IEEE Task Force on Cluster Computing has identified those that are in widespread use [1] In the following sections we categorise the most flexible of these benchmarks according to the ....
M. Gupta and P. Banerjee. Compile-time estimation of communication costs of programs. In Second Workshop on Automatic Data Layout and Performance Prediction, Rice University, Houston, April 1995. Also CRPC-TR95548.
A Framework for Qualitative Performance Prediction - Hsu, Kremer (1998) (Correct)
....coloring schemes. Nevertheless, it is argued to be a perfect fit for the fast coarse grain performance evaluation [vD96] Analysis driven methodology replies on the state of the art static analysis [ASU86] to derive the information for performance prediction. Examples include [MW88, Mac94, Fah93, GB94, Wan94, BSM95, CQ97] It relieves the user from the e#ort and the expert knowledge to construct the performance model, but the cost and complexity of extracting the information out and developing the satisfactory analysis may restrict its usage in performance prediction. Execution driven ....
M. Gupta and P. Banerjee. Compile-time estimation of communication costs of programs. Journal of Programming Languages, 2(3):191--225, September 1994.
Communication Cost Estimation and Global Data Partitioning.. - Prakash Srikant (Correct)
....programs by estimating the communication cost by the scheme presented in this work. 1 Introduction Any strategy for automatic data partitioning needs a way of estimating communication cost involved when we implement the strategy on a target architecture. Many researchers have developed tools [3, 4, 5] that estimate the performance of a parallel program with explicit communication at compile time. In [2] they employ training sets approach to estimate the performance of a parallel program. In [4] profiling is done to get parallel program parameters such as load distribution, communication ....
....of a parallel program with explicit communication at compile time. In [2] they employ training sets approach to estimate the performance of a parallel program. In [4] profiling is done to get parallel program parameters such as load distribution, communication overhead and data locality. In [9, 5], they use pattern matching on array references to generate high level collective communication. We present here a (compile time) scheme to estimate the communication cost involved in executing a loop on a parallel machine. This scheme works with reasonable efficiency only for dimensions upto 3. ....
Manish Gupta and Prithviraj Banerjee. Compiletime estimation of communication costs of programs. Journal of Programming Languages, 5(4), September 1994.
Data Distribution Models and Algorithms - Appelbe, Doddapaneni, Hardnett (Correct)
No context found.
Manish Gupta and Prithviraj Banerjee. Compile-time estimation of communication costs of programs. Journal of Programming Languages, 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