Spuri, M., Stankovic, J.A., "How to Integrate Precedence Constraints and Shared Resources in Real-Time Scheduling, " IEEE Transactions on Computers, Vol. 43, No. 12, Dec. 1994, pp. 1407-1412.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....that are dynamically scheduled according to an online assignment of task priorities based on EDF. He has also shown that the resulting EDF # algorithm is optimal. Su#cient conditions for schedulability under the mentioned assumptions are given by Chetto et al. CSB90] while Spuri and Stankovic [SS94] consider also shared resources. Most problems related to hard real time scheduling on multi processor systems under non trivial assumptions have been proven to be NPcomplete [GJ75, Ull75, GJ79, SSDB94] The work of Sun and Liu [SL95] addresses multi processor real time systems where the ....

M. Spuri and J. A. Stankovic. How to integrate precedence constraints and shared resources in real-time scheduling. IEEE Transactions on Computers, 43(12):1407--1412, December 1994.

....The primary problem in developing embedded signal processing applications with a processing graph methodology is creating a predictable real time system in which one can determine if the graph fits on a uniprocessor. Typically a processing graph is mapped to a real time task model (e.g. [7, 12, 16, 17, 19, 24, 22, 23]) and the accompanying schedulability condition is used to see if the graph fits on the processor. Unfortunately for general processing graph methodologies, such as the U.S. Navy s Processing Graph Method (PGM) 18] there is no obvious mapping to existing task models. Without a real time task ....

....the off line schedulers developed for SDF graphs, on line scheduling of PGM graphs uses input data rates and schedulability conditions from real time scheduling theory. The real time literature is replete with examples in which some form of a processing graph is used to construct real time systems [7, 8, 12, 16, 17, 19, 24, 22, 23] (to list a few) The processing graphs of [7, 19] and [24] are task graphs in which only precedence constraints are described. An even simpler processing graph, called task chains, is employed by [8, 22] and [23] Both task graphs and task chains can be represented with PGM graphs, but this paper ....

[Article contains additional citation context not shown here]

Spuri, M., Stankovic, J.A., "How to Integrate Precedence Constraints and Shared Resources in RealTime Scheduling", IEEE Transactions on Computers, Vol. 43, No. 12, December 1994, pp. 1407-1412.

....limit. The information needed to maintain the dynamic RUM could be obtained with low monitoring overhead from the instrumentation of the communication library. Related Work. The resource usage model introduced here improves upon the deficiencies of real time task models used in previous research [37, 10, 11, 16, 21] that do not permit for a low complexity description of a parallel component. According to such models, a parallel application component should be described by a set of tasks with precedence constraints, each with fixed computation and communication needs, and with the I O operations occurring ....

M. Spuri and J. A. Stankovic. How to Integrate Precedence Constraints and Shared Resources in Real-Time Scheduling. IEEE Transactions on Computers, Vol. 43, No. 12, pages 1407--1412, December 1994.

....with processing graphs is building a predictable runtime system so that the buffer space required for graph edges can be bounded and controlled. For this, we appeal to realtime scheduling theory. Typically a processing graph is mapped to a set of tasks according to a model of real time execution [3, 7, 10, 14, 16, 21, 19, 20]. The schedulability conditions for the model are used to see if the graph fits on the processor i.e. to see if enough processing capacity is available to guarantee real time execution to all tasks. By real time execution, we refer to an execution in which the latency and memory ....

Spuri, M., Stankovic, J.A., "How to Integrate Precedence Constraints and Shared Resources in Real-Time Scheduling, " IEEE Transactions on Computers, Vol. 43, No. 12, Dec. 1994, pp. 1407-1412.

....needs arise. The information needed to maintain the dynamic RUM is obtained with low monitoring overhead from the instrumentation of the communication library. Related Work. The resource usage model introduced here improves upon the deficiencies of real time task models used in previous research [36, 10, 11, 16, 22] that do not permit a low complexity description of a parallel component. According to such models, a parallel application component is described by a set of tasks with precedence constraints, each with fixed computation and communication needs, and with the I O operations occurring only at the ....

M. Spuri and J. A. Stankovic. How to Integrate Precedence Constraints and Shared Resources in Real-Time Scheduling. IEEE Transactions on Computers, Vol. 43, No. 12, pages 1407--1412, Dec., 1994.

....system in which one can determine if the graph fits on a processor. A graph fits on a processor if enough processing capacity is available to guarantee a temporally correct execution. Typically a processing graph is mapped to a set of tasks according to a model of real time execution (e.g. [5, 11, 15, 17, 22, 20, 21]) The schedulability conditions for the model are used to see if the graph fits on the processor by verifying processor capacity. Unfortunately for general processing graph methodologies, such as PGM, there is no obvious task model that efficiently describes the execution characteristics of ....

....the off line schedulers developed for SDF graphs, on line scheduling of PGM graphs uses input data rates and schedulability conditions from real time scheduling theory. The real time literature is replete with examples in which some form of a processing graph is used to construct real time systems [5, 6, 11, 15, 17, 22, 20, 21] (to list a few) The processing graphs of [5, 17] and [22] are task graphs in which only precedence constraints are described. An even simpler processing graph, called task chains, is employed by [6, 20] and [21] Both task graphs and task chains can be represented with PGM graphs, but this paper ....

[Article contains additional citation context not shown here]

Spuri, M., Stankovic, J.A., "How to Integrate Precedence Constraints and Shared Resources in Real-Time Scheduling", IEEE Transactions on Computers, Vol. 43, No. 12, Dec. 1994, pp. 1407-1412.

No context found.

Spuri, M., Stankovic, J.A., "How to Integrate Precedence Constraints and Shared Resources in Real-Time Scheduling, " IEEE Transactions on Computers, Vol. 43, No. 12, Dec. 1994, pp. 1407-1412.

No context found.

M. Spuri and J.A. Stankovic, "How to integrate precedence constraints and shared resources in real-time scheduling," IEEE Trans. Computers, vol.43, no.12, pp.1407-1412, Dec. 1994.

No context found.

M. Spuri and J.A. Stankovic, "How to integrate precedence constraints and shared resources in real-time scheduling," IEEE Trans. Computers, vol.43, no.12, pp.1407-1412, Dec. 1994.

No context found.

M. Spuri and J. Stankovic, How to Integrate Precedence Constraints and Shared Resources in Real-Time Scheduling, IEEE Transactions on Computers, vol. 43, no. 12, pp. 1407-1412, (December 1994).

No context found.

M. Spuri and J.A. Stankovic, "How to integrate precedence constraints and shared resources in real-time scheduling," IEEE Trans. Computers, vol.43, no.12, pp.1407-1412, Dec. 1994.

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