Abstract
This paper addresses the problem of calculating optimum buffer size for a dynamic voltage scaling processor. We determine the minimum required buffer size giving minimum energy solution for periodic (single, multiple) or aperiodic tasks. The calculations are based on information about data size (maximum, minimum), execution time (best case, worst case), and deadlines.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 711-721 |
| Number of pages | 11 |
| Journal | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
| Volume | 3254 |
| State | Published - Dec 1 2004 |
ASJC Scopus subject areas
- Theoretical Computer Science
- Computer Science(all)