K.Parhi, "Algorithmic transformation techniques for concurrent processors ", Proc. of the IEEE, Vol.77, No.12, pp.1879-1895, Dec. 1989. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Global Communication and Memory Optimizing.. - Wuytack.. (1994) (19 citations) (Correct)
....in the literature. The emphasis up to now lies mostly on interactive systems which aim at a user friendly environment for executing the transformations [14, 18, 19] Within automated techniques, the effects studied most are the number of arithmetic operations and the performance (critical path) [11, 8, 12]. The main exceptions to this are the work at U.C.Berkeley on power optimizing transformations [4] and at Philips on memory organization [10] The power oriented work at Berkeley is focussed on data paths. Moreover, few CAD techniques have been reported up to now. The memoryoriented optimizations ....
K.Parhi, "Algorithmic transformation techniques for concurrent processors", Proc. of the IEEE, Vol.77, No.12, pp.1879-1895, Dec. 1989.
Global Communication and Memory Optimizing.. - Catthoor.. (1994) (26 citations) (Correct)
....in the literature. The emphasis up to now lies mostly on interactive systems which aim at a user friendly environment for executing the transformations [15, 18, 19] Within automated techniques, the effects studied most are the number of arithmetic operations and the performance (critical path) [8, 12, 13]. The main exceptions to this are the work at U.C.Berkeley on power optimizing transformations [4] and at Philips on memory organization [11] The power oriented work at Berkeley is focussed on data paths. Moreover, few CAD techniques have been reported up to now. The memory oriented optimizations ....
....to this buffer access is relatively small compared to the image information access though still significant compared to the data path related power. After transformation with the MASAI transformation tool, the following Silage code is produced automatically: func main(proj data:w168[32] 32][12]; Iin:w127[512] 512] Iout:w127[ begin (j : 0 . 511) i : 0 . 511) begin (th : 0 . 25) begin pds data[511 i] j] th 1] if ( th = 1) 12 = th) w168(proj data[0] 0] th 1] proj data[0] 31] th 1] proj data[31] 0] th 1] proj data[31] 31] th 1] fi; I[511 i] j] th 13] ....
K.Parhi, "Algorithmic transformation techniques for concurrent processors", Proc. of the IEEE, Vol.77, No.12, pp.1879-1895, Dec. 1989.
Loop Transformation Methodology for Fixed-rate Video.. - Catthoor, Geurts, De Man (1994) (9 citations) (Correct)
....algorithms in this target domain [1, 24] In general, a fixed rate realisation of these applications exploits only a relatively small part of the available parallelism. Hence, the main problem is not only to derive upper bounds on the amount of parallelism and on the achievable throughput [2, 20, 22, 15, 21], but especially to select a loop organisation matched to the required throughput. This important problem necessitates the traversal of a very large search space and has not been well researched yet. Only very recently, some research has addressed part of this problem. It is oriented mostly to ....
....is valid when each operation o is mapped on synchronous hardware where the delay is a multiple of the clock period. been proposed in the past to remedy this. The most important ones are retiming on loops [12, 20] software pipelining or loop winding folding [5, 6] and loop unrolling unfolding [15]. Retiming of loop bodies in a flow graph: In many cases TCP can be reduced by redistributing the delays in a way which makes the CP shorter. This is a well known technique [12] and will not be discussed in more detail. The result on our biquad filter is shown in fig. 4. As a result, the CP ....
[Article contains additional citation context not shown here]
K.Parhi, "Algorithmic transformation techniques for concurrent processors", Proc. of the IEEE, Vol.77, No.12, pp.1879-1895, Dec. 1989.
Modeling Multi-Dimensional Data and Control flow - Franssen, Balasa, van.. (1993) (7 citations) (Correct)
....structures and function hierarchy. In order to arrive at efficient synthesis results, it has been recognized that transformations on algorithm specifications are crucial. Up to now this issue has been investigated mainly for data flow transformations on scalar processing, as in digital filters [6, 15, 19]. We claim however that these transformations are even more crucial in the presence of M D signals. Indeed, studies on memory organization for M D signals [8, 26] have shown that, for instance, loop transformations can have effects that influence implementation costs in the order of several ....
K.Parhi. "Algorithmic transformation techniques for concurrent processors", Proc. of the IEEE, Vol.77, No.12, pp.1879-1895, Dec. 1989.
Strategy For Power Efficient Design Of Parallel Systems - Danckaert, Masselos.. (Correct)
No context found.
K.Parhi, "Algorithmic transformation techniques for concurrent processors ", Proc. of the IEEE, Vol.77, No.12, pp.1879-1895, Dec. 1989.
Strategy for Power Efficient Combined Task and.. - Danckaert.. (1999) (Correct)
No context found.
K.Parhi, "Algorithmic transformation techniques for concurrent processors", Proc. of the IEEE, Vol.77, No.12, pp.1879-1895, Dec. 1989.
System-Level Data-Flow Transformation Exploration.. - Catthoor.. (1997) (1 citation) (Correct)
No context found.
K.Parhi, "Algorithmic transformation techniques for concurrent processors", Proc. of the IEEE, Vol.77, No.12, pp.18791895, Dec. 1989.
System Specification and Storage Architecture Exploration for.. - Moolenaar (1996) (1 citation) (Correct)
No context found.
K.Parhi, "Algorithmic transformation techniques for concurrent processors", Proc. of the IEEE, Vol.77, No.12, pp.1879-1895, Dec. 1989.
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