EEMCS

Home > Publications
Home University of Twente
Education
Research
Prospective Students
Jobs
Publications
Intranet (internal)
 
 Nederlands
 Contact
 Search
 Organisation

EEMCS EPrints Service


27792 Run-time mapping: dynamic resource allocation in embedded systems
Home Policy Brochure Browse Search User Area Contact Help

ter Braak, T.D. (2016) Run-time mapping: dynamic resource allocation in embedded systems. PhD thesis, Univ. of Twente. ISBN 978-90-365-4213-5

Full text available as:

PDF

11047 Kb
Open Access



Official URL: http://dx.doi.org/10.3990/1.9789036542135

Abstract

Many desired features of computing platforms, such as increased fault tolerance, variable quality of service, and improved energy efficiency, can be achieved by postponing resource management decisions from design-time to run-time.

While multiprocessing has been widespread in embedded systems for quite some time, allocation of (shared) resources is typically done at design-time to meet the constraints of applications. The inherent flexibility of large-scale embedded systems is then reduced to a fixed, static resource allocation derived at design-time. At run-time, unanticipated situations in either the system itself or in its environment may render resources inaccessible that were assumed to be available at design-time. The increased flexibility obtained by run-time resource allocation can be exploited to increase the degree of fault tolerance, quality of service, energy efficiency and to support a higher variability in use-cases. The term run-time mapping is used to refer to resource allocation at run-time to meet the dynamic requirements of applications.

The introduction of full-fledged run-time mapping systems in the domain of embedded systems has long been delayed due to the inherent complexity of the problems to be solved. While similar mapping problems have been solved at design-time for a long time already, different analysis and problem solving techniques are required at run-time. The guided local search technique presented in this thesis provides a balance between robustness and overhead. The results of guided local search and the required computation time on synthetic datasets are competitive with industry standard solvers, while the memory footprint is one or two orders of magnitude lower. Therefore, the algorithm can be implemented on an embedded platform. The computation time required for solving the resource allocation problems at run-time may be further reduced by a hybrid form between design-time allocation and run-time adaptation.

Item Type:PhD Thesis
Supervisors:Smit, G.J.M.
Assistant Supervisors:Kokkeler, A.B.J.
Research Group:EWI-CAES: Computer Architecture for Embedded Systems
Research Program:CTIT-General
Research Project:STARS: Sensor Technology Applied in Reconfigurable systems for Sustainable Security
ID Code:27792
Deposited On:09 March 2017
More Information:statistics

Export this item as:

To correct this item please ask your editor

Repository Staff Only: edit this item