Complexity of matrix product on modular linear systolic arrays for algorithms with affine schedules

Djamegni, Clémentin Tayou

doi:10.1016/j.jpdc.2005.07.008

Journal of Parallel and Distributed Computing

2006

DOI: 10.1016/j.jpdc.2005.07.008

|View full text |Cite

Complexity of matrix product on modular linear systolic arrays for algorithms with affine schedules

Clémentin Tayou Djamegni

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2009

2013

Publication Types

Select...

Article2

Relationship

Self Cite0

Independent2

Authors

Journals

Cited by 2 publications

(1 citation statement)

References 28 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…It also permits to allocate input/output nodes to PEs located at the border of the array. This can permit to eliminate eventual additional steps for data loading and result unloading that may force a slowdown of the algorithm [16,11,12,13,14]. This new allocation approach is simple, suitable for software tools and could be included in a language manipulating recurrence equations like the ALPHA language.…”

mentioning

confidence: 99%

A reindexing based approach towards mapping of DAG with affine schedules onto parallel embedded systems

Djamegni

Quinton

Rajopadhye

et al. 2009

Journal of Parallel and Distributed Computing

View full text Add to dashboard Cite

We address the problem of optimally mapping uniform DAGs to systolic arrays, given an affine timing function. We introduce an automatic allocation method based on a preprocessing by reindexing that transforms the initial DAG into a new one that enables the well known projection method to minimize the number of processors along a number of directions. We demonstrate its superiority to other methods, and establish the space-optimality of the proposed method. We also show an upper bound on the number of processors that corresponds to the best space complexity that both the projection method and the so-called grouping method can give for the initial DAG. We also describe how the new allocation method can be implemented in tools.

show abstract

mentioning

confidence: 99%

A reindexing based approach towards mapping of DAG with affine schedules onto parallel embedded systems

Djamegni

Quinton

Rajopadhye

et al. 2009

Journal of Parallel and Distributed Computing

View full text Add to dashboard Cite

show abstract

A direct method for optimal VLSI realization of deeply nested n-D loop problems

Sundari

Padmanabhan

2013

Microprocessors and Microsystems

View full text Add to dashboard Cite

scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.

Contact Info

customersupport@researchsolutions.com

10624 S. Eastern Ave., Ste. A-614

Henderson, NV 89052, USA

This site is protected by reCAPTCHA and the Google Privacy Policy and Terms of Service apply.

Blog Terms and Conditions API Terms Privacy Policy Contact Cookie Preferences Do Not Sell or Share My Personal Information

Made with 💙 for researchers

Part of the Research Solutions Family.

Complexity of matrix product on modular linear systolic arrays for algorithms with affine schedules

Cited by 2 publications

References 28 publications

A reindexing based approach towards mapping of DAG with affine schedules onto parallel embedded systems

A reindexing based approach towards mapping of DAG with affine schedules onto parallel embedded systems

A direct method for optimal VLSI realization of deeply nested n-D loop problems

Contact Info

Product

Resources

About