Scheduling Multiprocessor Tasks with Correlated Failures Using Population Learning Algorithm

  • Piotr Jędrzejowicz
  • Ewa Ratajczak
Conference paper


The paper considers a problem of scheduling multiprocessor tasks with correlated failures to maximize schedule reliability under time constraints. Since the problem is NP-hard the approximation algorithms based on a population learning algorithm are proposed.


Local Search Tabu Search Multiple Processor Redundant Variant Variant Software 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    J. Błażewicz, K.H. Ecker, E. Pesch, G. Schmidt, J. Węglarz, Scheduling Computer and Manufacturing Processes, Springer, Berlin 1996.Google Scholar
  2. [2]
    I. Czarnowski, P. Jędrzejowicz, E. Ratajczak, Scheduling Fault-Tolerant Programs on Multiple Processors to Maximize Schedule Reliability, Lecture Notes in Computer Science 1698, Springer (1999), pp. 385–395.Google Scholar
  3. [3]
    P. Jędrzejowicz, I. Czarnowski, H. Szreder, A. Skakowski, Evolution-Based Scheduling of Fault-Tolerant Programs on Multiple Processors, Parallel and Distributed Processing, Lecture Notes in Computer Science 1586, Springer (1999), pp. 210–219.CrossRefGoogle Scholar
  4. [4]
    P. Jędrzejowicz, Social Learning Algorithm as a Tool for Solving Some Difficult Scheduling Problems, Foundation of Computing and Decision Sciences 24, 2 (1999), pp. 51–66.MATHGoogle Scholar
  5. [5]
    I. Czarnowski, W.J. Gutjahr, P. Jędrzejowicz, E. Ratajczak, A. Skakowski, I. Wierzbowska, Scheduling multiprocessor tasks in presence of the correlated failures, Procedings of the 2nd Intl. Workshop on Soft Computing Applied to Software Engineering, Rotterdam 2001, (Accepted paper).Google Scholar

Copyright information

© Springer-Verlag Wien 2001

Authors and Affiliations

  • Piotr Jędrzejowicz
  • Ewa Ratajczak
    • 1
  1. 1.Gdynia Maritime AcademyGdyniaPoland

Personalised recommendations