Computation Takes Time, But How Much?
The article discusses research attempting to determine how much time computation takes. The authors argue that reliable information on the execution times of all computational tasks involved is the basis for verifying the timeliness of system reactions, noting that worst-case execution-time (WCET) a...
| Publicado en: | Communications of the ACM Vol. 57; no. 2; pp. 94 - 104 |
|---|---|
| Autores principales: | , |
| Formato: | Artículo |
| Publicado: |
Association for Computing Machinery
Feb2014
|
| 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=94282385&site=ehost-live header: @attributes: shortDbName: hlh uiTerm: 94282385 longDbName: Humanities International Complete uiTag: AN controlInfo: bkinfo: jinfo: jid: 00010782 ACM jtl: Communications of the ACM issn: 00010782 maglogo: N pubinfo: dt: Feb2014 vid: 57 iid: 2 pid: 68 pub: Association for Computing Machinery artinfo: ui: 94282385 10.1145/2500886 ppf: 94 ppct: 10 formats: tig: atl: Computation Takes Time, But How Much? aug: au: WILHELM, REINHARD GRUND, DANIEL affil: Professor, Saarland University, Saarbrücken, Germany Systems Architect Thales Transportation Systems in Stüttgart, Germany. su: Computer software execution Computer science Computer programming Compilers (Computer programs) Computer architecture Approximation theory Time measurements sug: subj: Computer software execution Computer science Computer programming Compilers (Computer programs) Computer architecture Approximation theory Time measurements ab: The article discusses research attempting to determine how much time computation takes. The authors argue that reliable information on the execution times of all computational tasks involved is the basis for verifying the timeliness of system reactions, noting that worst-case execution-time (WCET) analysis is used to determine such information. Topics include an approximation, called the timing schema method, why compilers and progress in computer architecture render the timing schema method impractical, infeasible, or imprecise, and the objective and main challenges of subtasks in a quasi-standard computer architecture for static timing analysis. pubtype: Periodical doctype: Article src: R language: English refInfo: copyright: @attributes: flag: Y dt: @attributes: year: 2014 holdings: @attributes: islocal: N |
|---|