A bi-criteria scheduling heuristic for distributed embedded systems under reliability and real-time constraints

Assayad, Ismail; Girault, Alain; Kalla, Hamoudi

doi:10.1109/dsn.2004.1311904

Cited by 69 publications

(68 citation statements)

References 17 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Assayad et al [2] proposed a list scheduling heuristic (called Reliable Bi-Criteria Scheduling Algorithm) for the bi-criteria problem of scheduling data-flow graphs of operations on to parallel heterogeneous architectures. The two criteria considered are, first, minimisation of the schedule length, and second, maximisation of system reliability.…”

Section: Previous Workmentioning

confidence: 99%

Demand Categorisation, Forecasting, and Inventory Control for Intermittent Demand Items

Babiloni

Cardós

Albarracín

et al. 2012

The South African Journal of Industrial Engineering

View full text Add to dashboard Cite

This paper considers the bi-criteria scheduling problem of simultaneously minimising the total completion time and the number of tardy jobs with release dates on a single machine. Since the problem had been classified as NP-Hard, two heuristics (HR9 and HR10) were proposed for solving this problem. Performance evaluations of the proposed heuristics and selected solution methods (HR7 and BB) from the literature were carried out on 1,100 randomly generated problems ranging from 3 to 500 jobs. Experiment results show that HR7 outperformed HR10 when the number of jobs (n) is less than 30, while HR10 outperformed HR7 for n≥ 30. OPSOMMINGIn hierdie artikel word die bi-kriteria-skeduleringsprobleem bestudeer waar die totale voltooiingstyd en die aantal take wat laat is op 'n enkele masjien geminimiseer moet word. Verskeie heuristieke word voorgestel en getoets om sodoende die beste benadering te identifiseer.

show abstract

Section: Previous Workmentioning

confidence: 99%

Demand Categorisation, Forecasting, and Inventory Control for Intermittent Demand Items

Babiloni

Cardós

Albarracín

et al. 2012

The South African Journal of Industrial Engineering

View full text Add to dashboard Cite

show abstract

“…The SRG λ c of a communicator c is inductively defined as follows: (a) for an input communicator c we have λ c = srel(s), where c is updated by a sensor s; and (b) for a non-input communicator c written by a task t with SRGs given for all communicators in the set icset t , we have (1) …”

Section: Reliability Analysis and Refinementmentioning

confidence: 99%

Logical reliability of interacting real-time tasks

Chatterjee

Ghosal

Henzinger

et al. 2008

Proceedings of the Conference on Design, Automation and Test in Europe

View full text Add to dashboard Cite

We propose the notion of logical reliability for real-time program tasks that interact through periodically updated program variables. We describe a reliability analysis that checks if the given short-term (e.g., single-period) reliability of a program variable update in an implementation is sufficient to meet the logical reliability requirement (of the program variable) in the long run. We then present a notion of design by refinement where a task can be refined by another task that writes to program variables with less logical reliability. The resulting analysis can be combined with an incremental schedulability analysis for interacting real-time tasks proposed earlier for the Hierarchical Timing Language (HTL), a coordination language for distributed real-time systems. We implemented a logical-reliabilityenhanced prototype of the compiler and runtime infrastructure for HTL.

show abstract

“…Then, given an overall reliability (or tolerated probability of failure) a precise analysis can determine for each task if duplication is required. For instance in [1] each processor and communication link is associated with a failure rate. The authors then tackle the problem of scheduling a task graph with deadline constraints and guarantying the best possible reliability.…”

Section: Introductionmentioning

confidence: 99%