R. Gupta and M. Spezialetti, "A Compact Task Graph Representation for Real-Time Scheduling," Journal of Real-Time Systems, July, 1996. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Challenges in Engineering Distributed Shipboard.. - Welch, Ravindran.. (1996) (Correct)
....prototypes of the major components depicted in Figure 3. An important goal is to evlove the infrastructure to address (1) quality of service assessment and (2) adaptive resource management for path based systems. 4. Related Work Resource management in real time systems has been addressed in [1 5,7 33] (a non exhaustive list) In much of this work, a task is defined as an independent program or a program component having a single thread of control, with timing constraints imposed on it. Schedule construction or schedulability analysis is performed statically using some heuristics fixed ....
....which are designed to handle anticipated peak demands leads to (1) inefficient resource utilization and (2) inadequate crisis response. The engineering of systems having the dynamic, large grain characteristics of the AAW system present many challenges to technologists. Can the existing paradigms [1 5,7 33] for real ime computing be extended to meet the challenges Is a new paradigm needed The answers to these questions will become clear as systems such as the Navy s 21 st Century Surface Combatant are engineered. 5. Conclusions This paper describes a representative shipboard control system, and ....
R. Gupta and M. Spezialetti, "A Compact Task Graph Representation for Real-Time Scheduling," Journal of Real-Time Systems, July, 1996.
Real-Time Scheduling Using Compact Task Graphs - Rajiv Gupta (1995) Self-citation (Gupta) (Correct)
....the same processor (Figure 1b) avoiding idle times. The main advantage of CTGs is their representation, which expresses the potential for interleaving (IL) and overlapping (OL) of tasks. The degree of IL and OL allowed for a pair of tasks is computed by the compiler using techniques described in [4]. To maximize the amount of interleaving, the compiler can select legal preemption points in the tasks other than interaction points. Thus, interleaving enables the scheduler to explore task interleavings not achievable by the approach which always splits tasks at interaction points. Furthermore, ....
....online scheduling. Concluding remarks appear in section 5. 2 Busy Idle Profiles and Compact Task Graphs The CTGs are constructed using the busy idle profiles for tasks in an application. In this section we briefly describe the profiles and CTGs. The algorithms for computing them can be found in [4]. The busy idle profiles show the times at which tasks are expected to be busy executing and the times at which the tasks are expected to be idle waiting for inputs. The profiles are obtained by performing timing analysis on the application code. Below, we define busy idle profiles: Definition 1: ....
R. Gupta and M. Spezialetti, "A Compact Task Graph Representation for Real-Time Scheduling," Journal of Real Time Systems, to appear 1996.
An Approach for Monitoring Intrusion Removal in Real Time.. - Jain, Spezialetti, Gupta (1996) (1 citation) Self-citation (Gupta Spezialetti) (Correct)
....which the site communicates (directly or indirectly) Thus, the intrusion times must be used across processors to accommodate the effects of varying intrusion times on inter processor communication. Using the above techniques we intend to provide the user with accurate busy idle execution profiles [1] of a real time application. ....
R. Gupta and M. Spezialetti, "A Compact Task Graph Representation for Real-Time Scheduling", Real Time Systems journal, vol. 11, no. 1, pages 71-102, 1996.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC