aboutsummaryrefslogtreecommitdiffstats
path: root/include/litmus/edzl_common.h
diff options
context:
space:
mode:
authorGlenn Elliott <gelliott@cs.unc.edu>2010-11-26 15:49:50 -0500
committerGlenn Elliott <gelliott@cs.unc.edu>2010-11-26 15:49:50 -0500
commita58179081abb08862bef0d2fa9f3dc90ac89a74d (patch)
tree430bb77433d2d7f8316bdc1fad4974a69abf0a0e /include/litmus/edzl_common.h
parent1baad08397910f4dee59e071808d74ea4ff8cf11 (diff)
Implementation of Adaptive-EDZL
This patch introduces the Adaptive-EDZL (AEDZL) scheduler. AEDZL uses feedback-control to estimate job execution time. This improves the detection of zero-laxity points if WCETs are not tight.
Diffstat (limited to 'include/litmus/edzl_common.h')
-rw-r--r--include/litmus/edzl_common.h5
1 files changed, 5 insertions, 0 deletions
diff --git a/include/litmus/edzl_common.h b/include/litmus/edzl_common.h
index d9ecfa1a70f9..8b2fbcd455ab 100644
--- a/include/litmus/edzl_common.h
+++ b/include/litmus/edzl_common.h
@@ -21,4 +21,9 @@ int edzl_higher_prio(struct task_struct* first,
21int edzl_ready_order(struct bheap_node* a, struct bheap_node* b); 21int edzl_ready_order(struct bheap_node* a, struct bheap_node* b);
22 22
23int edzl_preemption_needed(rt_domain_t* rt, struct task_struct *t); 23int edzl_preemption_needed(rt_domain_t* rt, struct task_struct *t);
24
25#ifdef CONFIG_PLUGIN_AEDZL
26int aedzl_preemption_needed(rt_domain_t* rt, struct task_struct *t);
27#endif
28
24#endif 29#endif