Electrical Engineering
      and Computer Sciences

Electrical Engineering and Computer Sciences

COLLEGE OF ENGINEERING

UC Berkeley

The PHiPAC v1.0 Matrix-Multiply Distribution

Jeff A. Bilmes, Krste Asanovic, Chee-Whye Chin and Jim Demmel

EECS Department
University of California, Berkeley
Technical Report No. UCB/CSD-98-1020
October 1998

http://www.eecs.berkeley.edu/Pubs/TechRpts/1998/CSD-98-1020.pdf

Modern microprocessors can achieve high performance on linear algebra kernels but this currently requires extensive machine-specific hand tuning. We have developed a methodology whereby near-peak performance on a wide range of systems can be achieved automatically for such routines. First, by analyzing current machines and C compilers, we've developed guidelines for writing Portable, High-Performance, ANSI C (PHiPAC, pronounced "fee-pack"). Second, rather than code by hand, we produce parameterized code generators. Third, we write search scripts that find the best parameters for a given system. We report on a BLAS GEMM compatible multi-level cache-blocked matrix multiply generator which produces code that achieves around 90% of peak on the Sparcstation-20/61, IBM RS/6000-590, HP 712/80i, SGI Power Challenge R8k, and SGI Octane R10k, and over 80% of peak on the SGI Indigo R4k. In this paper, we provide a detailed description of the PHiPAC V1.0 matrix multiply distribution. We describe the code generator in detail including the various register and higher level blocking strategies. We also document the organization and parameters of the search scripts. This technical report is an expanded version of a previous paper that appeared in ICS97.


BibTeX citation:

@techreport{Bilmes:CSD-98-1020,
    Author = {Bilmes, Jeff A. and Asanovic, Krste and Chin, Chee-Whye and Demmel, Jim},
    Title = {The PHiPAC v1.0 Matrix-Multiply Distribution},
    Institution = {EECS Department, University of California, Berkeley},
    Year = {1998},
    Month = {Oct},
    URL = {http://www.eecs.berkeley.edu/Pubs/TechRpts/1998/5682.html},
    Number = {UCB/CSD-98-1020},
    Abstract = {Modern microprocessors can achieve high performance on linear algebra kernels but this currently requires extensive machine-specific hand tuning. We have developed a methodology whereby near-peak performance on a wide range of systems can be achieved automatically for such routines. First, by analyzing current machines and C compilers, we've developed guidelines for writing Portable, High-Performance, ANSI C (PHiPAC, pronounced "fee-pack"). Second, rather than code by hand, we produce parameterized code generators. Third, we write search scripts that find the best parameters for a given system. We report on a BLAS GEMM compatible multi-level cache-blocked matrix multiply generator which produces code that achieves around 90% of peak on the Sparcstation-20/61, IBM RS/6000-590, HP 712/80i, SGI Power Challenge R8k, and SGI Octane R10k, and over 80% of peak on the SGI Indigo R4k. In this paper, we provide a detailed description of the PHiPAC V1.0 matrix multiply distribution. We describe the code generator in detail including the various register and higher level blocking strategies. We also document the organization and parameters of the search scripts. This technical report is an expanded version of a previous paper that appeared in ICS97.}
}

EndNote citation:

%0 Report
%A Bilmes, Jeff A.
%A Asanovic, Krste
%A Chin, Chee-Whye
%A Demmel, Jim
%T The PHiPAC v1.0 Matrix-Multiply Distribution
%I EECS Department, University of California, Berkeley
%D 1998
%@ UCB/CSD-98-1020
%U http://www.eecs.berkeley.edu/Pubs/TechRpts/1998/5682.html
%F Bilmes:CSD-98-1020