|
| This Article | ||
| ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
 Digg  Furl  Spurl  Blink  Simpy  Google  Del.icio.us  Y!MyWeb | ||
| Search | ||
| ||
| ASCII Text | x | ||
| Jun Sun, Mark K. Gardner, Jane W.S. Liu, "Bounding Completion Times of Jobs with Arbitrary Release Times, Variable Execution Times, and Resource Sharing," IEEE Transactions on Software Engineering, vol. 23, no. 10, pp. 603-615, October, 1997. | |||
| BibTex | x | ||
| @article{ 10.1109/32.637144, author = {Jun Sun and Mark K. Gardner and Jane W.S. Liu}, title = {Bounding Completion Times of Jobs with Arbitrary Release Times, Variable Execution Times, and Resource Sharing}, journal ={IEEE Transactions on Software Engineering}, volume = {23}, number = {10}, issn = {0098-5589}, year = {1997}, pages = {603-615}, doi = {http://doi.ieeecomputersociety.org/10.1109/32.637144}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - JOUR JO - IEEE Transactions on Software Engineering TI - Bounding Completion Times of Jobs with Arbitrary Release Times, Variable Execution Times, and Resource Sharing IS - 10 SN - 0098-5589 SP603 EP615 EPD - 603-615 A1 - Jun Sun, A1 - Mark K. Gardner, A1 - Jane W.S. Liu, PY - 1997 KW - Real-time systems KW - schedulability analysis KW - precedence constraints KW - resource sharing. VL - 23 JA - IEEE Transactions on Software Engineering ER - | |||
Abstract—The workload of many real-time systems can be characterized as a set of preemptable jobs with linear precedence constraints. Typically their execution times are only known to lie within a range of values. In addition, jobs share resources and access to the resources must be synchronized to ensure the integrity of the system. This paper is concerned with the schedulability of such jobs when scheduled on a priority-driven basis. It describes three algorithms for computing upper bounds on the completion times of jobs that have arbitrary release times and priorities. The first two are simple but do not yield sufficiently tight bounds, while the last one yields the tightest bounds but has the greatest complexity.
[1] A.K. Mok, "Fundamental Design Poblems of Distributed Systems for the Hard Real-Time Environment," PhD thesis, MIT, 1983.
[2] R. Rajkumar, L. Sha, and J.P. Lehoczky, "Real-Time Synchronization Protocols for Multiprocessors," Proc. IEEE Real-Time Systems Symp., pp. 259-269, 1988.
[3] C.L. Liu and J.W. Layland, “Scheduling Algorithms for Multiprogramming in a Hard Real-Time Environment,” J. ACM, vol. 20, no. 1, pp. 40-61, 1973.
[4] J. Lehoczky, L. Sha, and Y. Ding, The Rate Monotonic Scheduling Algorithm: Exact Characterization and Average Case Behavior Proc. IEEE Real-Time Systems Symp., pp. 166-171, 1989.
[5] J.P. Lehoczky, “Fixed Priority Scheduling of Periodic Task Sets with Arbitrary Deadlines,” Proc. IEEE Real-Time Systems Symp., Dec. 1990.
[6] N.C. Audsley, A. Burns, M. Richardson, K. Tindell, and A. Wellings, "Applying New Scheduling Theory to Static Priority Preemptive Scheduling," Software Eng. J. vol. 8, no. 5, pp. 284-292, Sept. 1993.
[7] M.G. Harbour, M.H. Klein, and J.P. Lehoczky, “Timing Analysis for Fixed Priority Scheduling of Hard Real Time Systems,” IEEE Trans. Software Eng., vol. 20, no. 1, pp. 13-28, Jan. 1994.
[8] J.P. Lehoczky, L. Sha, J. K. Strosnider, and H. Tokuda, "Fixed Priority Scheduling Theory for Hard Real-Time Systems," Foundations of Real-Time Computing, Scheduling and Resource Management, A. M. Tilborg and G. M. Koob, eds., ch. 1. Kluwer Academic, 1991.
[9] R. Ha, "Validating Timing Constraints in Multiprocessor and Distributed Systems," PhD thesis, Dept. of Computer Science, Univ. of Illinois at Urbana-Champaign, 1995.
[10] L. Sha, R. Rajkuma, and J.P. Lehoczky, "Priority Inheritance Protocols: An Approach to Real-Time Synchronization," IEEE Trans. Computers, vol. 39, no. 9, pp. 1,175-1,185, Sept. 1990.
[11] T.P. Baker, A Stack-Based Resource Allocation Policy for Real-Time Processes Proc. IEEE Real-Time Systems Symp., pp. 191-200, 1990.
[12] M.K. Gardner, "Resource Sharing Among Linear Job Chains," Technical Report UIUCDCS-R-97-2010, Dept. of Computer Science, Univ. of Illinois at Urbana-Champaign, 1997.