1995
DOI: 10.1007/978-3-7091-9396-9_8
|View full text |Cite
|
Sign up to set email alerts
|

Toward a Multilevel-Secure, Best-Effort Real-Time Scheduler

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

1996
1996
2008
2008

Publication Types

Select...
2
1

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(2 citation statements)
references
References 2 publications
0
2
0
Order By: Relevance
“…An example for such a third thread is a crypto-gateway, that is, a server we trust to encrypt messages from the sender before relaying them to the receiver, thereby protecting the confidentiality of these messages. 2 We do not claim our predicates to be minimal in the sense that they are the least restrictive predicates that can be statically computed. Further predicates remain to be investigated.…”
Section: Intransitive Policiesmentioning
confidence: 99%
See 1 more Smart Citation
“…An example for such a third thread is a crypto-gateway, that is, a server we trust to encrypt messages from the sender before relaying them to the receiver, thereby protecting the confidentiality of these messages. 2 We do not claim our predicates to be minimal in the sense that they are the least restrictive predicates that can be statically computed. Further predicates remain to be investigated.…”
Section: Intransitive Policiesmentioning
confidence: 99%
“…Boucher et al [2] propose a best-effort scheduler that selects threads according to their time-value function. This function describes how valuable it is to schedule the thread at a given point in time.…”
Section: Aperiodic and Sporadic Threadsmentioning
confidence: 99%