This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
2002 International Conference on Parallel Processing (ICPP'02)
A Lower-Bound Algorithm for Minimizing Network Communication in Real-Time Systems
Vancouver, B.C., Canada
August 18-August 21
ISBN: 0-7695-1677-7
Cecilia Ekelin, Chalmers University of Technology
Jan Jonsson, Chalmers University of Technology
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 the average.
Citation:
Cecilia Ekelin, Jan Jonsson, "A Lower-Bound Algorithm for Minimizing Network Communication in Real-Time Systems," icpp, pp.343, 2002 International Conference on Parallel Processing (ICPP'02), 2002
Usage of this product signifies your acceptance of the Terms of Use.