NDLI: Data alignments for modular time-space mappings of BLAS-like algorithms

Content Provider	IEEE Xplore Digital Library
Author	Hyuk-Jae Lee Fortes, J.A.B.
Copyright Year	1995
Description	Author affiliation: Sch. of Electr. Eng., Purdue Univ., West Lafayette, IN, USA (Hyuk-Jae Lee; Fortes, J.A.B.)
Abstract	Modular time-space transformations have been recently proposed for algorithm mappings that cannot be described by affine functions. This paper extends affine data alignments to a new class of data alignments, called expanded modular data alignments (EMDAs), for algorithms that are mapped by modular time-space transformations. An EMDA is a set of modular data alignments (MDAs) which are described by affine functions module a constant vector. With an EMDA, multiple copies of a data array are mapped into target processors by different modular data alignments (MDAs) and therefore can be efficiently used with modular time-space transformations which may require several operations to access the same data at the same time. Conditions of EMDAs that guarantee local access of data entries are provided. These conditions cover initial data alignment, data movement during the computation, and the number of copies required to avoid unnecessary communications. These conditions can be used to derive the EMDA for a given modular mapping or to generate a modular mapping for a given EMDA so that communication due to data misalignment does not occur. Several examples are given to show that EMDAs are well suited for modular time-space mappings.
Starting Page	34
Ending Page	41
File Size	479111
Page Count	8
File Format	PDF
ISBN	0818671092
ISSN	10636862
DOI	10.1109/ASAP.1995.522903
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	1995-07-24
Publisher Place	France
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Vectors Scheduling Linear algebra Terminology Difference equations Indexing
Content Type	Text
Resource Type	Article
Subject	Computer Networks and Communications Hardware and Architecture

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Resource constrained scheduling of uniform algorithm

Piecewise Linear Schedules For Recurrence Equations

The naive execution of affine recurrence equations

Revisiting the decomposition of Karp, Miller and Winograd

Data compiling for systems of affine recurrence equations

On the injectivity of modular mappings

Scheduling partitions in systolic algorithms

Optimal fine and medium grain parallelism detection in polyhedral reduced dependence graphs

Optimal mapping of systolic algorithms by regular instruction shifts

Data alignments for modular time-space mappings of BLAS-like algorithms

Similar Documents

Resource constrained scheduling of uniform algorithm

Piecewise Linear Schedules For Recurrence Equations

The naive execution of affine recurrence equations

Revisiting the decomposition of Karp, Miller and Winograd

Data compiling for systems of affine recurrence equations

On the injectivity of modular mappings

Scheduling partitions in systolic algorithms

Optimal fine and medium grain parallelism detection in polyhedral reduced dependence graphs

Optimal mapping of systolic algorithms by regular instruction shifts

Data alignments for modular time-space mappings of BLAS-like algorithms