A Lower-Bound Algorithm for Minimizing Network Communication in Real-Time Systems
Paper i proceeding, 2002

In this paper, we propose a pseudo-polynomial-time lower-bound algorithm for the problem of assigning and scheduling real-time tasks in a distributed system such that the network communication is minimized The key feature of our algorithm is translating the task assignment problem into the so called k-cut problem of a graph, which is known to be solvable in polynomial time for fixed k. Experiments show that the lower bound computed by our algorithm in fact is optimal in up to 89% of the cases and increases the speed of an overall optimization algorithm by a factor of two on average.

Författare

Cecilia Ekelin

Chalmers, Institutionen för datorteknik

Jan Jonsson

Chalmers, Institutionen för datorteknik

International Conference on Parallel Processing, 2002. Proceedings.

0190-3918 (ISSN)

Ämneskategorier

Datorteknik

DOI

10.1109/ICPP.2002.1040890

ISBN

0-7695-1677-7