The story of the development of a sound, static method for worst-case execution-time analysis: Real Time Spent on Real Time.
THE GENERAL SETTING for worst-case execution time (WCET) analysis is that a set of hard real-time tasks is to be executed on a given hardware platform. Hard real-time tasks have associated deadlines within which they must finish their execution. The deadlines may be given by periods. Timing verifica...
| Publicado en: | Communications of the ACM Vol. 63; no. 10; pp. 54 - 61 |
|---|---|
| Autor principal: | |
| Formato: | Artículo |
| Publicado: |
Association for Computing Machinery
Oct2020
|
| Materias: | |
| Acceso en línea: | Ver este registro en EBSCOhost |
| fields | @attributes: recordID: 1 pdfLink: plink: https://search.ebscohost.com/login.aspx?direct=true&db=hlh&AN=146056004&site=ehost-live header: @attributes: shortDbName: hlh uiTerm: 146056004 longDbName: Humanities International Complete uiTag: AN controlInfo: bkinfo: jinfo: jid: 00010782 ACM jtl: Communications of the ACM issn: 00010782 maglogo: N pubinfo: dt: Oct2020 vid: 63 iid: 10 pid: 68 pub: Association for Computing Machinery artinfo: ui: 146056004 10.1145/3375545 ppf: 54 ppct: 7 formats: tig: atl: The story of the development of a sound, static method for worst-case execution-time analysis: Real Time Spent on Real Time. aug: au: WILHELM, REINHARD affil: Professor Emeritus at Saarland University in Saarbrücken, Germany su: Worst-case circuit analysis Real-time programming Timing circuits Approximation algorithms Cache memory sug: subj: Worst-case circuit analysis Real-time programming Timing circuits Approximation algorithms Cache memory ab: THE GENERAL SETTING for worst-case execution time (WCET) analysis is that a set of hard real-time tasks is to be executed on a given hardware platform. Hard real-time tasks have associated deadlines within which they must finish their execution. The deadlines may be given by periods. Timing verification must verify these timing constraints are satisfied. Traditionally, timing verification is split into a WCET analysis, which determines upper bounds on the execution times of all tasks, and a schedulability analysis, which takes these upper bounds and attempts to verify the given set of tasks when executed on the given platform will all respect their deadlines. The problem to determine upper (and potentially also) lower bounds on execution times underwent a transition in the 1990s: pubtype: Periodical doctype: Article src: R language: English refInfo: copyright: @attributes: flag: Y dt: @attributes: year: 2020 holdings: @attributes: islocal: N |
|---|