Download:
|
by Sissades Tongsima, Chantana Chantrapornchai, Edwin H. -m. Sha
http://irish.hpcc.nectec.or.th/~stongsim/research/conf/jobipps98.ps
Add To MetaCart
Abstract:
This paper presents a new methodology for statically scheduling a cyclic data-
ow graph whose node computation times can be represented by random variables. A communication cost issue is also considered as another uncertain factor in which each node from the graph can produce dierent amount of data depending on the probability of its computation time. Since such communication costs rely on the amount of transfered data, this overhead becomes uncertain as well. We propose an algorithm to take advantage of the parallelism across a loop iteration while hiding the communication overhead. The resulting schedule will be evaluated in terms of condence probability|the probability of having a schedule completed before a certain time. Experimental results show that the proposed framework performs better than a traditional algorithm running on an input which assumes xed average timing information. 1
Citations
|
3266
|
Computer Architecture A Quantitative Approach
– Hennessy, Patterson
- 1995
|
|
888
|
An Introduction to Probability Theory and Its Applications
– FELLER
- 1968
|
|
571
|
High Performance Compilers for Parallel Computing
– Wolfe
- 1996
|
|
370
|
A Loop Transformation Theory and an Algorithm to Maximize Parallelism
– Wolf, Lam
- 1991
|
|
255
|
Fuzzy sets as a basis for a theory of possibility, Fuzzy Sets and Systems
– Zadeh
- 1978
|
|
252
|
Retiming synchronous circuitry
– Leiserson, Saxe
- 1991
|
|
174
|
Unimodular transformations of double loops
– Banerjee
- 1990
|
|
131
|
Optimizing synchronous systems
– Leiserson, Saxe
- 1983
|
|
119
|
A singular loop transformation framework based on non-singular matrices
– Li, Pingali
- 1994
|
|
81
|
Rotation Scheduling: A Loop Pipelining Algorithm
– Chao, LaPaugh, et al.
- 1993
|
|
75
|
High-Level Synthesis of ASICs under Timing and Synchronization Constraints
– Micheli, Ku
- 1992
|
|
71
|
Fuzzy Logic with Engineering Applications
– Ross
- 1995
|
|
56
|
Retiming Synchronous Circuitry. Algorithmica
– Leiserson, Saxe
- 1991
|
|
55
|
A Comparison of Multiprocessor Scheduling Heuristics
– Khan, McCreary, et al.
- 1994
|
|
54
|
Relative scheduling under timing constraints: Algorithm for high-level synthesis
– Ku, Micheli
- 1992
|
|
49
|
A scheduling algorithm for conditional resource sharing
– Kim, Liu, et al.
- 1991
|
|
43
|
Static scheduling for synthesis of DSP algorithms on various models
– Chao, Sha
- 1995
|
|
32
|
Loop pipelining for scheduling multidimensional systems via rotation
– Passos, Sha, et al.
- 1994
|
|
28
|
Introductory Probability and Statistical Applications
– Meyer
- 1970
|
|
25
|
Software pipelining
– Lam
- 1988
|
|
25
|
Optimal Retiming of Multi-Phase, Level-Clocked Circuits
– Lockyear, Ebeling
- 1992
|
|
19
|
Dynamic list-scheduling with finite resources
– Kamin, Adams, et al.
- 1994
|
|
18
|
Retiming synchronous circuitry with imprecise delays
– Karkowski, Otten
- 1995
|
|
16
|
winding-A data flow approach to functional pipelining
– Girczyc, “Loop
- 1987
|
|
3
|
Dynamic list-scheduling with resources
– Kamin, Adams, et al.
- 1994
|
|
2
|
Communcation-sensitive loop scheduling for DSP applications
– Tongsima, Sha, et al.
- 1997
|
|
2
|
winding|a data approach to functional pipeline
– Girczyc, \Loop
- 1987
|
|
2
|
winding|a data ow approach to functional pipeline
– Loop
- 1987
|
|
2
|
Dynamic list-scheduling with nite resources
– Kamin, Adams, et al.
- 1994
|
