blob: 7485812dbb7f0a86f466b2150eeece291b155ee6 (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
|
// -*- C++ -*-
//=============================================================================
/**
* @file FailureAwareWCRT.cpp
*
* $Id$
*
* @author Friedhelm Wolf (fwolf@dre.vanderbilt.edu)
*/
//=============================================================================
#include "FailureAwareWCRT.h"
FailureAwareWCRT::FailureAwareWCRT (const TASK_LIST & tasks,
const REPLICA_GROUPS & rep_groups)
: tasks_ (tasks),
replica_finder_ (rep_groups)
{
}
double
FailureAwareWCRT::operator () (double previous,
const PROCESSOR_SET & failures)
{
// find all tasks that need to become active
std::set<Taskname> active_tasks;
for (TASK_LIST::iterator t_it = tasks_.begin ();
t_it != tasks_.end ();
++t_it)
{
// check in the replica map if all previous tasks get activated
// and switch the task to primary if this is the case
PROCESSOR_SET necessary_failures = replica_finder_ (*t_it);
PROCESSOR_SET difference;
std::set_intersection (failures.begin (),
failures.end (),
necessary_failures.begin (),
necessary_failures.end (),
std::inserter (difference,
difference.begin ()));
// If all necessary processors are failing, make the task primary.
// This is the case if all necessary_failures are contained in the
// difference set.
if (difference.size () == necessary_failures.size ())
{
active_tasks.insert (t_it->name);
// activate relevant tasks
t_it->role = PRIMARY;
}
}
double result = ctt_ (tasks_);
// deactivate relevant tasks
for (TASK_LIST::iterator t_it = tasks_.begin ();
t_it != tasks_.end ();
++t_it)
{
if (active_tasks.find (t_it->name) != active_tasks.end ())
{
t_it->role = BACKUP;
}
}
if ((result > .0) && (previous != .0))
return std::max(result,
previous);
return .0;
}
|
