An optimal on-line algorithm for metrical task system
Journal of the ACM (JACM)
A polylog(n)-competitive algorithm for metrical task systems
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Proceedings of the 37th Annual Design Automation Conference
A low power unified cache architecture providing power and performance flexibility (poster session)
ISLPED '00 Proceedings of the 2000 international symposium on Low power electronics and design
On-line Learning and the Metrical Task System Problem
Machine Learning
Proceedings of the 33rd annual ACM/IEEE international symposium on Microarchitecture
Introduction to Algorithms
A highly configurable cache architecture for embedded systems
Proceedings of the 30th annual international symposium on Computer architecture
Dynamic Platform Management for Configurable Platform-Based System-on-Chips
Proceedings of the 2003 IEEE/ACM international conference on Computer-aided design
Heterogeneous Chip Multiprocessors
Computer
Configurable cache subsetting for fast cache tuning
Proceedings of the 43rd annual Design Automation Conference
Application-specific customization of parameterized FPGA soft-core processors
Proceedings of the 2006 IEEE/ACM international conference on Computer-aided design
A self-tuning configurable cache
Proceedings of the 44th annual Design Automation Conference
A survey on cache tuning from a power/energy perspective
ACM Computing Surveys (CSUR)
Two-level caches tuning technique for energy consumption in reconfigurable embedded MPSoC
Journal of Systems Architecture: the EUROMICRO Journal
Hi-index | 0.01 |
Architectures with software-writable parameters, or configurable architectures, enable runtime reconfiguration of computing platforms to the applications they execute. Such dynamic tuning can improve application performance, as well as energy. However, reconfiguring incurs a temporary performance cost. Thus, online algorithms are needed that decide when to reconfigure and which configuration to choose such that overall performance is optimized. We introduce the adaptive weighted window (AWW) algorithm, and compare with several other algorithms, including algorithms previously developed by the online algorithm community. We describe experiments showing that AWW results are within 4% of the offline optimal on average. AWW outperforms the other algorithms, and is robust across three datasets and across three categories of application sequences too. AWW improves a non-dynamic approach on average by 6%, and by up to 30% in low-reconfiguration-time situations.