1993
DOI: 10.1109/43.238604
|View full text |Cite
|
Sign up to set email alerts
|

SALSA: a new approach to scheduling with timing constraints

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
3
0

Year Published

1996
1996
2023
2023

Publication Types

Select...
5
1

Relationship

0
6

Authors

Journals

citations
Cited by 57 publications
(3 citation statements)
references
References 22 publications
0
3
0
Order By: Relevance
“…SALSA, a scheduling method in HLS for optimizing HW resource cost under the latency constraint, was proposed in Nestor and Krishnamoorthy. 15 It employs an SA-based approach for improving the initial schedule that satisfies the timing constraint by exploring alternative schedules to minimize resource cost. Again, the energy and reliability considerations were left out of the HLS process.…”
Section: Related Workmentioning
confidence: 99%
See 1 more Smart Citation
“…SALSA, a scheduling method in HLS for optimizing HW resource cost under the latency constraint, was proposed in Nestor and Krishnamoorthy. 15 It employs an SA-based approach for improving the initial schedule that satisfies the timing constraint by exploring alternative schedules to minimize resource cost. Again, the energy and reliability considerations were left out of the HLS process.…”
Section: Related Workmentioning
confidence: 99%
“…Statistical analysis is important if we wish to adopt the optimal cooling strategy for the problem at hand. 63 The cooling schedule adopted in this study is a frequently used cooling approach known as the geometric schedule that originates from Kirkpatrick et al 43 It is formulated in Equation (15), where α c is usually chosen to be a positive constant smaller than but close to 1 (0:8 ≥ α c ≤ 0:99).…”
Section: Annealing Schedulementioning
confidence: 99%
“…We obtain empirical correlation results for the MR-LCS HLS problem for 11 DFGs in [9] by varying the degree of FU-centric optimization in the initial scheduling stage via using the following different well-known algorithms ranging from the seminal/classical and low-to medium quality (LS, FDS, SA) to the state-of-the-art approximate and high quality (FALLS) to an optimal formulation with exponential complexity (ILP): list scheduling (LS) [5], force-directed scheduling (FDS) [7], a simulated-annealing-based technique (SA) [8], FALLS [3], and ILP [6]. We note that for keeping the complexity of our empirical and probabilistic analysis tractable, we do not perform module selection (e.g., [4]) here, but believe that the conclusions we derive should hold when module selection is performed.…”
Section: Scheduling Techniques For Obtaining Varying Degrees Of Fu Op...mentioning
confidence: 99%