I. Ripoll, A. Crespo, A. Garca-Fornes, "An Optimal Algorithm for Scheduling Soft Aperiodic Tasks in Dynamic-Priority Preemptive Systems", IEEE Transactions on Software Engineering, Vol.23. No.6, pp. 388-400, June 1997. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
A Dynamic Voltage Scaling Algorithm for Dynamic-Priority Hard.. - Kim, Kim, Min (2002) (14 citations) (Correct)
....Therefore, the energy efficiency of a real time DVS algorithm largely depends on how accurately these slack times are estimated. Slack time analysis has been extensively investigated in real time server systems in which aperiodic (or sporadic) tasks are jointly scheduled with periodic tasks [1, 15, 10]. In these systems, the purpose of slack time analysis is to improve the response time of aperiodic tasks or to increase their acceptance ratio. However, since the existing slack analysis methods [1, 15, 10] usually require high time and or space overheads, they are not applicable to mobile ....
....systems in which aperiodic (or sporadic) tasks are jointly scheduled with periodic tasks [1, 15, 10] In these systems, the purpose of slack time analysis is to improve the response time of aperiodic tasks or to increase their acceptance ratio. However, since the existing slack analysis methods [1, 15, 10] usually require high time and or space overheads, they are not applicable to mobile embedded systems where resources are constrained. For this reason, most existing on line DVS algorithms for embedded systems use simple heuristics in estimating slack times. While there have been various research ....
[Article contains additional citation context not shown here]
I. Ripoll, A. Crespo, and A. G. Fornes. An Optimal Algorithm for Scheduling Soft Aperiodic Tasks in Dynamic-Priority Preemptive Systems. IEEE Transactions on Software Engineering, 23(6):388--400, 1997.
Duality in the Parametric Polytope and its Application to a.. - Subramani (2000) (Correct)
....through an increase in the processing time for the mandatory and optional parts. Their strategy is similar to ours, in that they model error rates through processing times, whereas we account for resource variability through execution times. Related modeling approaches have been suggested in [RCGF97] in which both soft and hard preemptive tasks are considered. In both [Cho97] and [Sak94] the Loss of Schedulability phenomenon, discussed in Section x4.3 is mentioned. However, they use the phenomenon to motivate the 49 necessity for parametric scheduling in periodic job sets, with and ....
Ismael Ripoll, Alfons Crespo, and Ana Garcia-Fornes. An optimal algorithm for scheduling soft aperiodic tasks in dynamic-priority preemptive systems. IEEE Transactions on Software Engineering, 23(6):388-- 399, June 1997. 143
Performance Analysis of Various Scheduling Algorithms for.. - Goossens, Macq (1999) (Correct)
....Server Time complexity Space complexity Implementation work Stat. Dyn. Background O(1) O(1) obvious 3 3 Polling O(1) O(1) simple 3 3 Deferrable O(1) O(1) simple 3 3 Priority exch. O(n) O(n) hard 3 3 Sporadic O(1) O(d Ts 2 e) simple 3 3 Total band. O(m Delta n) O(1) simple 7 3 Slack see [7] see [7] hard 7 3 Table 1: Complexities, implementation and static dynamic compliance of the various algorithms. time which can be stolen to the periodic request) and the slack stealer itself. This approach minimizes the response time of aperiodic tasks while preserving the schedulability of ....
....Time complexity Space complexity Implementation work Stat. Dyn. Background O(1) O(1) obvious 3 3 Polling O(1) O(1) simple 3 3 Deferrable O(1) O(1) simple 3 3 Priority exch. O(n) O(n) hard 3 3 Sporadic O(1) O(d Ts 2 e) simple 3 3 Total band. O(m Delta n) O(1) simple 7 3 Slack see [7] see [7] hard 7 3 Table 1: Complexities, implementation and static dynamic compliance of the various algorithms. time which can be stolen to the periodic request) and the slack stealer itself. This approach minimizes the response time of aperiodic tasks while preserving the schedulability of periodic ....
[Article contains additional citation context not shown here]
Ripoll, I., Crespo, A., and Garc' ia-Fornes, A. An optimal algorithm for scheduling soft aperiodic tasks in dynamic-priority preemptive systems. IEEE Transactions on Software Engineering 23, 6 (June 1997), 388--400.
Engineering Dynamic Real-Time Distributed Systems: Architecture, .. - Ravindran (2001) (Correct)
....load characteristics of the application. Most of the past efforts on real time scheduling and resource management have focused on realtime systems that are static (in both the above senses) and perform device level, sampled data monitoring and regulatory control that is usually centralized [Bak91, LRT92, LSS87, RCF97, RTL93, SB96, SKG91, SLS88, SSL89, TLS96, XP90], but occasionally distributed [CSR86, HS92, Kao95, KDK89, RSZ89, Shi91, SR91, SRC85, Ver95, WSM95] These techniques cannot be practically employed or adapted for systems that are dynamic [Jen99, Koob96, Sta96, SK97] Dynamic real time computer systems and their applications have workload ....
I. Ripoll, A. Crespo, and A. G. Fornes, "An Optimal Algorithm for Scheduling Soft Aperiodic Tasks in Dynamic Priority Preemptive Systems," IEEE Transactions on Software Engineering, 23(6):388--400, June 1997.
A Binary-Tree Architecture for Scheduling Real-Time.. - Angel Garca Universidad Self-citation (Crespo) (Correct)
No context found.
I. Ripoll, A. Crespo, A. Garca-Fornes, "An Optimal Algorithm for Scheduling Soft Aperiodic Tasks in Dynamic-Priority Preemptive Systems", IEEE Transactions on Software Engineering, Vol.23. No.6, pp. 388-400, June 1997.
On Accepting Aperiodic Transactions in Distributed Systems - Sergio Saez Joan (2000) Self-citation (Crespo) (Correct)
No context found.
I. Ripoll, A. Crespo, and A. Garca-Fornes. An optimal algorithm for scheduling soft aperiodic tasks in dynamic-priority preemptive systems. IEEE Transactions on Software Engineering, 23(6):388--400, June 1997.
Soft Aperiodic Task Scheduling on Hard Real-Time.. - Sergio Saez Joan Self-citation (Crespo) (Correct)
No context found.
I. Ripoll, A. Crespo, and A. Garca-Fornes. An optimal algorithm for scheduling soft aperiodic tasks in dynamic-priority preemptive systems. IEEE Transactions on Software Engineering, 23(6):388--400, June 1997.
A Hardware Scheduler for Complex Real-Time Systems - Sergio Aez Joan Self-citation (Crespo) (Correct)
No context found.
I. Ripoll, A. Crespo, and A. Garca-Fornes. An optimal algorithm for scheduling soft aperiodic tasks in dynamic-priority preemptive systems. IEEE Transactions on Software Engineering, 23(6):388-400, June 1997.
Real-Time Distributed Systems - Ravi Devarasetty In (Correct)
No context found.
I. Ripoll, A. Crespo, and A. G. Fornes, "An Optimal Algorithm for Scheduling Soft Aperiodic Tasks in Dynamic Priority Preemptive Systems," IEEE Transactions on Software Engineering, Vol. 23, No. 6, pp. 388-400, June 1997.
Using Application Benefit for Proactive Resource.. - Asynchronous Real-Time .. (Correct)
No context found.
I. Ripoll, A. Crespo, and A. Fornes, "An Optimal Algorithm for Scheduling Soft Aperiodic Tasks in Dynamic Priority Preemptive Systems," IEEE Transactions on Software Engineering, Volume 23, Number 6, pages 388-400, June 1997.
Linear Time On-Line Feasibility Testing Algorithms for.. - Thomadakis (2000) (Correct)
No context found.
Ismail Ripoll, Alfons Crespo, and Ana Garca-Formes, "An optimal algorithm for scheduling soft aperiodic tasks in dynamic-priority preemptive systems," IEEE Trans. on Software Engineering, vol. 23, no. 6, pp. 388--400, June 1997.
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