Chen, Xian, Megson, G.M (1995) A General Methodology of Partition and Mapping for Given Regular Arrays. IEEE Transactions on Parallel and Distributed Systems, 6 (10). pp. 1100-1107. ISSN 1045-9219. (doi:10.1109/71.473518) (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided) (KAR id:19757)
| The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided. | |
| Official URL: http://dx.doi.org/10.1109/71.473518 |
Abstract
A methodology for partitioning and mapping of arbitrary uniform recurrence equations (UREs) expressed as computation graphs onto a given regular array is proposed. Deriving and based on a set of canonical dependencies together with two models of space projection, we give a general method of parallelization. The method has significant advantages in mapping an arbitrary computation graph onto a given processor array while preserving high efficiency in both communication and computation.
| Item Type: | Article |
|---|---|
| DOI/Identification number: | 10.1109/71.473518 |
| Uncontrolled keywords: | ALGORITHM TRANSFORMATION; AUTOMATIC COMPILATION; GIVEN-SHAPE AND FIXED-MESH PARTITIONING; UNIFORM RECURRENCE EQUATION |
| Subjects: | Q Science > QA Mathematics (inc Computing science) > QA 75 Electronic computers. Computer science |
| Divisions: | Divisions > Division of Computing, Engineering and Mathematical Sciences > School of Computing |
| Depositing User: | P. Ogbuji |
| Date Deposited: | 05 Jun 2009 18:49 UTC |
| Last Modified: | 05 Nov 2024 09:56 UTC |
| Resource URI: | https://kar.kent.ac.uk/id/eprint/19757 (The current URI for this page, for reference purposes) |
- Export to:
- RefWorks
- EPrints3 XML
- BibTeX
- CSV
- Depositors only (login required):
Altmetric
Altmetric
