Mongenet C., Affine timings for systems of affine recurrence equations. Conference on Parallel Architectures and Languages Europe, PARLE'91, LNCS 505, Springer verlag, pp. 236--251, 1991. Home/Search Document Not in Database Summary Related Articles |
This paper is cited in the following contexts:
Data Compiling for Systems of Affine Recurrence Equations - Mongenet (1994) Self-citation (Mongenet) (Correct)
....on smaller dimensional subsets of the utilization set. If a complete broadcast removal is required, domain transformations are necessary to reduce the dimension of the utilization set by introducing a partial sequentialization of its computations. This problem is related to the study realized in [14] where domain transformations were introduced to deal with problems for which no constant affine timing function exists. It requires a specific study and is out of scope of this paper. Therefore in the following we only consider compiling local communications for 1 dimensional utilization sets. ....
Mongenet C., Affine timings for systems of affine recurrence equations. Conference on Parallel Architectures and Languages Europe, PARLE'91, LNCS 505, Springer verlag, pp. 236--251, 1991.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC