Using Guided Local Search for Adaptive Resource Reservation in Large-scale Embedded Systems

T.D. ter Braak

    Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

    3 Citations (Scopus)


    To maintain a predictable execution environment, an embedded system must ensure that applications are, in advance, provided with sufficient resources to process tasks, exchange information and to control peripherals. The problem of assigning tasks to processing elements with limited resources, and routing communication channels through a capacitated interconnect is combined into an integer linear programming formulation. We describe a guided local search algorithm to solve this problem at run-time. This algorithm allows for a hybrid strategy where configurations computed at design-time may be used as references to lower the computational overhead at run-time. Computational experiments on a dataset with 100 tasks and 20 processing elements show the effectiveness of this algorithm compared to state-of-the-art solvers CPLEX and Gurobi. The guided local search algorithm finds an initial solution within 100 milliseconds, is competitive for small platforms, scales better with the size of the platform, and has lower memory usage (2-19%).
    Original languageUndefined
    Title of host publicationProceedings of the Conference on Design, Automation and Test in Europe (DATE 2014)
    Place of PublicationDresden
    PublisherEuropean Design and Automation Association
    Number of pages4
    ISBN (Print)978-3-9815370-2-4
    Publication statusPublished - 26 Mar 2014
    Event2014 Design, Automation and Test in Europe Conference & Exhibition, DATE 2014 - Dresden, Germany
    Duration: 24 Mar 201428 Mar 2014

    Publication series

    PublisherEuropean Design and Automation Association


    Conference2014 Design, Automation and Test in Europe Conference & Exhibition, DATE 2014
    Abbreviated titleDATE


    • EWI-24644
    • METIS-304052
    • IR-90434

    Cite this