The Slack Method: A New Method for Static Allocation ofHard Real-Time Tasks

  • Authors:
  • Peter Altenbernd;Hans Hansson

  • Affiliations:
  • C-LAB, Fürstenalle 11, D-33095 Paderborn, Germany;Department of Computer Engineering, Mälardalens Högskola, S-721 23 Västerås, and Department of Computer Systems, Uppsala University, S-751 05 Uppsala, Sweden

  • Venue:
  • Real-Time Systems
  • Year:
  • 1998

Quantified Score

Hi-index 0.00

Visualization

Abstract

This article presents and evaluates the Slack Method,a new constructive heuristic for the allocation (mapping) ofperiodic hard real-time tasks to multiprocessor or distributedsystems. The Slack Method is based on task deadlines, in contrastwith other constructive heuristics, such as List Processing.The presented evaluation shows that the Slack Method is superiorto list-processing-based approaches with regard to both findingmore feasible solutions as well as finding solutions with betterobjective function values.In a comparativesurvey we evaluate the Slack Method against several alternativeallocation techniques. This includes comparisons with optimalalgorithms, non-guided search heuristics (e.g. Simulated Annealing),and other constructive heuristics. The main practical resultof the comparison is that a combination of non-guided searchand constructive approaches is shown to perform better than eitherof them alone, especially when using the Slack Method.