1991
DOI: 10.1109/32.83911
|View full text |Cite
|
Sign up to set email alerts
|

Analyzing hard-real-time programs for guaranteed schedulability

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
16
0
1

Year Published

1992
1992
1997
1997

Publication Types

Select...
3
2
1

Relationship

0
6

Authors

Journals

citations
Cited by 93 publications
(17 citation statements)
references
References 18 publications
0
16
0
1
Order By: Relevance
“…Additionally, the use of ADTs in parallel and distributed hard real-time systems is being explored, with some results being reported in [24]. Results of the effort in schedulability analysis and scheduling are reported in [17,20,21]. The model presented in this paper is based 29 INCORPORATING TEMPORAL CONSIDERATIONS DURING ASSIGNMENT on the DEpendable Distributed Operating System (DEDOS) [7,8], which also supports the use of objects in distributed fault-tolerant, real-time systems [20,21].…”
Section: Related Workmentioning
confidence: 98%
See 1 more Smart Citation
“…Additionally, the use of ADTs in parallel and distributed hard real-time systems is being explored, with some results being reported in [24]. Results of the effort in schedulability analysis and scheduling are reported in [17,20,21]. The model presented in this paper is based 29 INCORPORATING TEMPORAL CONSIDERATIONS DURING ASSIGNMENT on the DEpendable Distributed Operating System (DEDOS) [7,8], which also supports the use of objects in distributed fault-tolerant, real-time systems [20,21].…”
Section: Related Workmentioning
confidence: 98%
“…Given such a model, schedulability analysis techniques can be used to analyze an application [17]. Alternately, one can schedule a hard real-time system prerun-time, such that all timing constraints are satisfied and consistency of all resources, including processors, communication media, and devices, is guaranteed.…”
mentioning
confidence: 99%
“…These algorithms solve the general problem of (10) v := Remove_Item_With_Earliest.Deadline(Earliest_Deadline_Set); (11) Working_Ready_Set := Working_Ready_Set-{v}; (12) else (13) v := Remove_Item_With_Earliest_Start_Time(Working_Ready_Set); (14) end if; (15) st ( Temp_Ready_Set := Ready_Set -{v}; (20) Temp_Stop_Time_Array := Last_Stop_Time_Array; (21) Temp_Stop_Time_Array[i] := cv(t); (22) For each child u of v in CG loop (23) if all parents of u are in Temp_Schedule_Array then (24) Add_Item_To_Set(u, Temp_Ready_Set); (25) end if; (26) end loop; (27) if Not_Empty(Temp_Ready_Set) then (28) Limited_BackTrack(Backtrack_Limit, Temp_Stop_Time_Array, Temp_Schedule_Array, Temp_Ready_Set, Best_Schedule_Array); (29) Found := Non.Empty(Best_Schedule_Array); (30) else --no unscheduled vertex (31) Best_Schedule_Array := Temp_Schedule_Array; (32) Found := true; (33) end if; (34) end if; (35) end loop; End. x -no prototype generated for this case y -all prototypes are eliminated by the limited-backtrack algorithm * -improved success-rates automated pre-run-time scheduling of processes with arbitrary release times, deadlines and precedence relations in hard real-time systems as defined by the PSDL specification.…”
Section: Discussionmentioning
confidence: 99%
“…The feasibility analysis is usually done either via static timing analyzers [27,33] or pre-run-time schedulers [34]. One drawback of static timing analyzers is that the analysis works well only if the hard realtime system runs exactly as specified in the high-level description.…”
Section: Real-time Scheduling Methods In Capsmentioning
confidence: 99%
See 1 more Smart Citation