Scheduling with multiple voltages under resource constraints

Sarrafzadeh, Majid; Raje, Salil

doi:10.1109/iscas.1999.777875

Cited by 23 publications

(17 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Further refinements could take into account the influence that a very basic search would have and try to implement some look-ahead. Already, the results match and even outperform that obtained in [11]. In addition, the ABFbased method has the benefit that it can handle any number of voltages/processors, and can also easily be extended to other problems, such as homogeneous processor scheduling [12].…”

Section: Search Techniques For Schedulingsupporting

confidence: 52%

“…If the resulting graph weighted with the execution times of the actors does not contain negative cycles as in section 4.1, a valid schedule has been found. Table 2: Comparison between ABF-based search and algorithm of Sarrafzadeh and Raje [11] Since the underlying graph is always the same and only the vertex ordering imposes new edges, we can easily use adaptive negative cycle detection to perform the constraint checking efficiently. We have examined the scheduling formulation addressed by Sarrafzadeh and Raje [11] to illustrate this.…”

Section: Search Techniques For Schedulingmentioning

confidence: 99%

“…Table 2: Comparison between ABF-based search and algorithm of Sarrafzadeh and Raje [11] Since the underlying graph is always the same and only the vertex ordering imposes new edges, we can easily use adaptive negative cycle detection to perform the constraint checking efficiently. We have examined the scheduling formulation addressed by Sarrafzadeh and Raje [11] to illustrate this. The problem is to schedule the graphs on a fixed architecture where a 5V adder takes 1 unit of time to execute, a 2V adder takes 2 units, and a multiplier takes either 1 unit or 2 units depending on the application.…”

Section: Search Techniques For Schedulingmentioning

confidence: 99%

“…In addition, the ABFbased method has the benefit that it can handle any number of voltages/processors, and can also easily be extended to other problems, such as homogeneous processor scheduling [12]. Table 2 shows the power-savings that were obtained on the examples from [11]. S and R power saving indicates the power savings quoted in [11], while ABF power savings refers to the results obtained using the ABF-based scheduling approach.…”

Section: Search Techniques For Schedulingmentioning

confidence: 99%

“…Table 2 shows the power-savings that were obtained on the examples from [11]. S and R power saving indicates the power savings quoted in [11], while ABF power savings refers to the results obtained using the ABF-based scheduling approach. { is the overall timing constraint (the maximum iteration period bound that we are aiming for).…”

Section: Search Techniques For Schedulingmentioning

confidence: 99%

See 4 more Smart Citations

Adaptive negative cycle detection in dynamic graphs

Chandrachoodan

Bhattacharyya

Liu

2001

ISCAS 2001. The 2001 IEEE International Symposium on Circuits and Systems (Cat. No.01CH37196)

View full text Add to dashboard Cite

We examine the problem of detecting negative cycles in a dynamic graph, which is a fundamental problem that arises in electronic design automation and systems theory.We introduce the concept of adaptive negative cycle detection, in which a graph changes over time, and negative cycle detection needs to be done periodically, but not necessarily after every individual change. Such scenarios arise, for example, during iterative design space exploration for hardware and software synthesis. We present an algorithm for this problem, called the Adaptive Bellman-Ford (ABF) algorithm, based on a novel extension of the well known Bellman-Ford algorithm. The ABF algorithm allows us to systematically adapt information for a given graph to a modified version of the graph. We show that the ABF algorithm significantly outperforms previously available approaches for dynamic graphs, which either recompute negative cycle information from scratch whenever a graph is modified, or process the modifications one at a time ("incrementally").As an application of the ABF technique, we show that it can be used to obtain a very fast implementation of Lawler's technique for the computation of the maximum-cycle mean (MCM) of a graph, especially for a certain important kind of sparse graph. We further illustrate the application of the ABF technique to design-space exploration by developing automated search techniques for scheduling iterative data-flow graphs.

show abstract

Section: Search Techniques For Schedulingsupporting

confidence: 52%

Section: Search Techniques For Schedulingmentioning

confidence: 99%

Section: Search Techniques For Schedulingmentioning

confidence: 99%

Section: Search Techniques For Schedulingmentioning

confidence: 99%

Section: Search Techniques For Schedulingmentioning

confidence: 99%

See 3 more Smart Citations

Adaptive negative cycle detection in dynamic graphs

Chandrachoodan

Bhattacharyya

Liu

2001

ISCAS 2001. The 2001 IEEE International Symposium on Circuits and Systems (Cat. No.01CH37196)

View full text Add to dashboard Cite

show abstract

A scheduling scheme with Dynamic Frequency Clocking and multiple voltages for low power designs

Ding

Yang

2007

J. of Electron.(China)

View full text Add to dashboard Cite

In this letter, a scheduling scheme based on Dynamic Frequency Clocking (DFC) and multiple voltages is proposed for low power designs under the timing and the resource constraints. Unlike the conventional methods at high level synthesis where only voltages of nodes were considered, the scheme based on a gain function considers both voltage and frequency simultaneously to reduce energy consumption. Experiments with a number of DSP benchmarks show that the proposed scheme achieves an effective energy reduction.

show abstract