A Fully Polynomial Time Approximation Scheme for Adaptive Variable Rate Task Demand
| dc.contributor.author | Willcock, Aaron | en |
| dc.contributor.author | Fisher, Nathan | en |
| dc.contributor.author | Chantem, Thidapat (Tam) | en |
| dc.date.accessioned | 2025-02-06T18:36:10Z | en |
| dc.date.available | 2025-02-06T18:36:10Z | en |
| dc.date.issued | 2024-11-06 | en |
| dc.date.updated | 2025-02-01T09:06:55Z | en |
| dc.description.abstract | The Adaptive Variable Rate (AVR) task model defines a task where job WCET and period are a function of engine speed. Motivated by a lack of tractable AVR task demand methods, this work uses predefined job sequences for the Bounded Precedence Constraint Knapsack Problem inherent in AVR task demand calculation instead of enumerating all considered speeds as in existing work. A new, exact approach is proposed and approximated, enabling the derivation of a Fully Polynomial Time Approximation Scheme that outperforms the state-of-the-art in runtime (7,800x improvement) and RAM use (99% reduction) with less than 8% demand overestimate. | en |
| dc.description.version | Published version | en |
| dc.format.mimetype | application/pdf | en |
| dc.identifier.doi | https://doi.org/10.1145/3696355.3696367 | en |
| dc.identifier.uri | https://hdl.handle.net/10919/124521 | en |
| dc.language.iso | en | en |
| dc.publisher | ACM | en |
| dc.rights | Creative Commons Attribution 4.0 International | en |
| dc.rights.holder | The author(s) | en |
| dc.rights.uri | http://creativecommons.org/licenses/by/4.0/ | en |
| dc.title | A Fully Polynomial Time Approximation Scheme for Adaptive Variable Rate Task Demand | en |
| dc.type | Article - Refereed | en |
| dc.type.dcmitype | Text | en |