Systematic Mapping of Uniform Recurrent Equation onto Linear Systolic Array.

Saved in:

Bibliographic Details
Title:	Systematic Mapping of Uniform Recurrent Equation onto Linear Systolic Array.
Authors:	Mosleh, Mohammad¹ Mohammad.mosle@gmail.com, Kheyrandish, Mohammad¹ Mohkh_2004@yahoo.com, Setayeshi, Saeid² Setayesh@cic.aut.ac.ir, Golshahi, Mohammad¹ Golshahi.iaud@gmail.com
Source:	International MultiConference of Engineers & Computer Scientists 2007 (Volume 1). 2007, p600-604. 5p. 3 Diagrams, 2 Charts, 2 Graphs.
Subjects:	Systolic array circuits, Point mappings (Mathematics), Linear systems, Mathematical mappings, Functional differential equations
Abstract:	This paper presents a systematic procedure to mapping uniform recurrent equations on to linear systolic arrays. In this method, a bijective transformation must be computed first. Then, by applying this transformation over the N-Dim index space of a uniform recurrent equation, a new index space will be obtained that includes a 1-Dim location and a (N-1)-Dim time. By using the location and time dimensions, the location of performing each computation of uniform recurrent equations on the processor array and the time to performing each computation can be determined, respectively. Each computation time is specified by a (N-1)-Dim vector. Therefore, for reaching the scalar times correspond to logical times, we can use full trees first. Then we compute the times correspond to time vectors. The proposed method has been compared with General Parameter method and Dependency method from viewpoint. [ABSTRACT FROM AUTHOR]
	Copyright of International MultiConference of Engineers & Computer Scientists 2007 (Volume 1) is the property of International Association of Engineers (IAENG) and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Database:	Engineering Source

Description
Abstract:	This paper presents a systematic procedure to mapping uniform recurrent equations on to linear systolic arrays. In this method, a bijective transformation must be computed first. Then, by applying this transformation over the N-Dim index space of a uniform recurrent equation, a new index space will be obtained that includes a 1-Dim location and a (N-1)-Dim time. By using the location and time dimensions, the location of performing each computation of uniform recurrent equations on the processor array and the time to performing each computation can be determined, respectively. Each computation time is specified by a (N-1)-Dim vector. Therefore, for reaching the scalar times correspond to logical times, we can use full trees first. Then we compute the times correspond to time vectors. The proposed method has been compared with General Parameter method and Dependency method from <Total time x Processor element> viewpoint. [ABSTRACT FROM AUTHOR]
ISBN:	9789889867140