Preemptive Scheduling with Release Times, Deadlines, and Due Times

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Preemptive Scheduling with Release Times, Deadlines, and Due Times

Full text

Pdf (898 KB)

Source

Journal of the ACM (JACM) archive
Volume 29 , Issue 3 (July 1982) table of contents

Pages: 812 - 829

Year of Publication: 1982

ISSN:0004-5411

Author

Charles Martel

Department of Electrical and Computer Engineering, University of California, Davis, CA

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 11, Downloads (12 Months): 70, Citation Count: 11

Additional Information:

references cited by index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/322326.322337 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	BRUNO. J, AND GONZALEZ, T Scheduhng ~ndependent tasks w~th release dates and due dates on parallel machines Tech. Rep 213, Computer Science Dep., Pennsylvania State Umv, College Park, Pa, 1976.
	2	Teofilo Gonzalez , Sartaj Sahni, Open Shop Scheduling to Minimize Finish Time, Journal of the ACM (JACM), v.23 n.4, p.665-679, Oct. 1976 [doi>10.1145/321978.321985]
	3	Teofilo Gonzalez , Sartaj Sahni, Preemptive Scheduling of Uniform Processor Systems, Journal of the ACM (JACM), v.25 n.1, p.92-101, Jan. 1978 [doi>10.1145/322047.322055]
	4	HORN, W.Some simple scheduling algorithms Naval Res Log Q 21 (1974), 177-185.
	5	Edward C. Horvath , Shui Lam , Ravi Sethi, A Level Algorithm for Preemptive Scheduling, Journal of the ACM (JACM), v.24 n.1, p.32-43, Jan. 1977 [doi>10.1145/321992.321995]
	6	LABETOULLE, J, LAWLER, E L, LENSTRA, J K., AND RINNOOY KAN, A H.G Preemptive sehe6uhng of uniform machines subject to release dates Tech Rep BW 99/79, Mathematisch Centrum, Amsterdam, The Netherlands, Sept 1979
	7	LAWLER, E L, AND MARTEL, C Computing maxtmal 'polymatroldar network flows. Tech+ Rep, Electromcs Research Lab, Unlv. of Cahfornla, Berkeley, Calif., Dec 1980
	8	PAPADIMITRIOU, C. Efftctent search for rat,onals,"lnf Proc Lea. 8 (Jan. 2, 1979), 1-9.
	9	SAHNI, S., AND CHO, Y Nearly on lme scheduhng of a uniform processor system with release times SIAM J Comput 8 (1979), 275-285
	10	Sartaj Sahni , Yookun Cho, Scheduling Independent Tasks with Due Times on a Uniform Processor System, Journal of the ACM (JACM), v.27 n.3, p.550-563, July 1980 [doi>10.1145/322203.322214]

CITED BY 11

	Jia Xu , David Lorge Parnas, On satisfying timing constraints in hard-real-time systems, ACM SIGSOFT Software Engineering Notes, v.16 n.5, p.132-146, Dec. 1991
	John P. Lehoczky , Lui Sha, Performance of real-time bus scheduling algorithms, ACM SIGMETRICS Performance Evaluation Review, v.14 n.1, p.44-53, May 1986
	J. Xu , D. L. Parnas, On Satisfying Timing Constraints in Hard-Real-Time Systems, IEEE Transactions on Software Engineering, v.19 n.1, p.70-84, January 1993
	J. Xu, Multiprocessor Scheduling of Processes with Release Times, Deadlines, Precedence, and Exclusion Relations, IEEE Transactions on Software Engineering, v.19 n.2, p.139-154, February 1993
	K. Ramamritham , J. A. Stankovic , P. F. Shiah, Efficient Scheduling Algorithms for Real-Time Multiprocessor Systems, IEEE Transactions on Parallel and Distributed Systems, v.1 n.2, p.184-194, April 1990
	Yaser Khamayseh , Ehab S. Elmallah, A delay bounded approach for streaming services in CDMA cellular networks, Proceedings of the 1st ACM international workshop on Quality of service & security in wireless and mobile networks, October 13-13, 2005, Montreal, Quebec, Canada
	Jia Xu , David Parnas, Scheduling Processes with Release Times, Deadlines, Precedence and Exclusion Relations, IEEE Transactions on Software Engineering, v.16 n.3, p.360-369, March 1990
	John Augustine , Sudarshan Banerjee , Sandy Irani, Strip packing with precedence constraints and strip packing with release times, Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures, July 30-August 02, 2006, Cambridge, Massachusetts, USA
	B. V. Grechuk , M. G. Furugyan, Optimal Preemptive Scheduling in Multiprocessor Systems with Incomplete Communication Graph, Cybernetics and Systems Analysis, v.41 n.3, p.397-402, May 2005
	David Sarne , Sarit Kraus , Takayuki Ito, Scaling-up shopbots: a dynamic allocation-based approach, Proceedings of the 6th international joint conference on Autonomous agents and multiagent systems, May 14-18, 2007, Honolulu, Hawaii
	John Augustine , Sudarshan Banerjee , Sandy Irani, Strip packing with precedence constraints and strip packing with release times, Theoretical Computer Science, v.410 n.38-40, p.3792-3803, September, 2009