Proceedings DARPA Information Survivability Conference and Exposition. DISCEX'00
DOI: 10.1109/discex.2000.825032
|View full text |Cite
|
Sign up to set email alerts
|

Realize: resource management for soft real-time distributed systems

Abstract: The

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
8
0

Publication Types

Select...
5
1

Relationship

0
6

Authors

Journals

citations
Cited by 10 publications
(8 citation statements)
references
References 27 publications
0
8
0
Order By: Relevance
“…The quasi-static scheduling algorithm is iterating while improving the total utility value with new schedules (lines [3][4][5][6][7][8][9][10][11][12][13][14][15][16][17][18][19][20], at the same time, preserving deadlines of hard processes. At each iteration, we consider a selected schedule φ max , which is initially the Root schedule (line 2) or has been obtained on the previous iteration (lines [14][15][16][17][18].…”
Section: Value-based Schedulingmentioning
confidence: 99%
See 2 more Smart Citations
“…The quasi-static scheduling algorithm is iterating while improving the total utility value with new schedules (lines [3][4][5][6][7][8][9][10][11][12][13][14][15][16][17][18][19][20], at the same time, preserving deadlines of hard processes. At each iteration, we consider a selected schedule φ max , which is initially the Root schedule (line 2) or has been obtained on the previous iteration (lines [14][15][16][17][18].…”
Section: Value-based Schedulingmentioning
confidence: 99%
“…Regarding soft real-time systems, the available approaches in [1,17,21] address fault tolerance only in the context of online scheduling. In [17] researchers have shown how faults can be tolerated with active replication while maximizing the quality level of the system.…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…Regarding soft real-time systems, researchers have shown how faults can be tolerated with active replication while maximizing the utility of the system [12]. In [1] faults are tolerated while maximizing the reward in the context of online scheduling and an imprecise computation model, where processes are composed of mandatory and optional parts.…”
Section: Introductionmentioning
confidence: 99%
“…Regarding soft real-time systems, researchers have shown how faults can be tolerated with active replication while maximizing the utility of the system [14]. In [2] faults are tolerated while maximizing the reward in the context of online scheduling and an imprecise computation model, where processes are composed of mandatory and optional parts.…”
Section: Introductionmentioning
confidence: 99%