Cost-minimal pre-allocation of software tasks under real-time constraints

Authors:
Brian Clark;Ingo Stierand;Eike Thaden
Affiliations:
Institute for Information Technology, Germany;University of Oldenburg, Germany;Institute for Information Technology, Germany
Venue:
Proceedings of the 2011 ACM Symposium on Research in Applied Computation
Year:
2011

Citing 9
Cited 0

Allocating hard real-time tasks: an NP-hard problem made easy

Real-Time Systems
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment

Journal of the ACM (JACM)
Mapping Task-Graphs on Distributed ECU Networks: Efficient Algorithms for Feasibility and Optimality

RTCSA '06 Proceedings of the 12th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications
RTSAT-- An Optimal and Efficient Approach to the Task Allocation Problem in Distributed Architectures

RTSS '06 Proceedings of the 27th IEEE International Real-Time Systems Symposium
Analysis and optimisation of hierarchically scheduled multiprocessor embedded systems

International Journal of Parallel Programming - Special Issue on Multiprocessor-based embedded systems
Exploiting Gaps in Fixed-Priority Preemptive Schedules for Task Insertion

RTCSA '10 Proceedings of the 2010 IEEE 16th International Conference on Embedded and Real-Time Computing Systems and Applications
Stressing Search with Scenarios for Flexible Solutions to Real-Time Task Allocation Problems

IEEE Transactions on Software Engineering
Combinatorial Optimization: Theory and Algorithms

Combinatorial Optimization: Theory and Algorithms
A column generation approach to scheduling of periodic tasks

SEA'11 Proceedings of the 10th international conference on Experimental algorithms

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we motivate, mathematically formulate, and evaluate a novel approach for finding good pre-allocations for software tasks together with their communication messages onto a hardware system. The hardware system is composed of subsystems connected via a global communication bus. Each subsystem contains one or more processors whose type can be chosen from a set of processor types with different properties, such as monetary cost, available memory, etc. The overall optimization objective is to minimize the sum of all processor costs. This is done using a Satisfiability Modulo Theories solver with an extension for performing binary search on input variables.