Efficient Computation of Address Sequences in Data Parallel Programs Using Closed Forms for Basis Vectors

ISSN： 0743-7315

Source： Journal of Parallel and Distributed Computing, Vol.38, Iss.2, 1996-11, pp. : 188-203

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Minimization of Data Address Computation Overhead in DSP Programs

By Wess Bernhard

Design Automation for Embedded Systems, Vol. 4, Iss. 2-3, 1999-03 ,pp. : 167-185

Springer Publishing Company

Access to resources Recommend Favorite

Minimization of Data Address Computation Overhead in DSP Programs

By Wess B.

Design Automation for Embedded Systems, Vol. 4, Iss. 2, 1999-02 ,pp. : 167-185

Springer Publishing Company

Access to resources Recommend Favorite

On the Utility of Communication-Computation Overlap in Data-Parallel Programs

By Quinn M.J. Hatcher P.J.

Journal of Parallel and Distributed Computing, Vol. 33, Iss. 2, 1996-03 ,pp. : 197-204

Academic Press

Access to resources Recommend Favorite

On Data Distributions in the Construction of Parallel Programs

By Niculescu Virginia

The Journal of Supercomputing, Vol. 29, Iss. 1, 2004-07 ,pp. : 5-25

Springer Publishing Company

Access to resources Recommend Favorite

A method for efficient parallel computation of Tate pairing

By Su Zhitu

International Journal of Grid and Utility Computing, Vol. 3, Iss. 1, 2012-03 ,pp. : 43-52

Inderscience Publishers

Access to resources Recommend Favorite