Move-to-rear list scheduling

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Move-to-rear list scheduling: a new scheduling algorithm for providing QoS guarantees

Full text

Pdf (2.17 MB)

Source

International Multimedia Conference archive
Proceedings of the fifth ACM international conference on Multimedia table of contents

Seattle, Washington, United States

Pages: 63 - 73

Year of Publication: 1997

ISBN:0-89791-991-2

Authors

John Bruno	Bell Laboratories, 600 Mountain Ave., Murray Hill, NJ
Eran Gabber	Bell Laboratories, 600 Mountain Ave., Murray Hill, NJ
Banu Özden	Bell Laboratories, 600 Mountain Ave., Murray Hill, NJ
Abraham Silberschatz	Bell Laboratories, 600 Mountain Ave., Murray Hill, NJ

Sponsors

SIGGRAPH: ACM Special Interest Group on Computer Graphics and Interactive Techniques
SIGGROUP: ACM Special Interest Group on Supporting Group Work
SIGMIS: ACM Special Interest Group on Management Information Systems
SIGCHI: ACM Special Interest Group on Computer-Human Interaction
SIGCOMM: ACM Special Interest Group on Data Communication
SIGIR: ACM Special Interest Group on Information Retrieval
SIGLINK: Hypertext, Hypermedia, and Web
SIGMULTIMEDIA: ACM Special Interest Group on Multimedia
SIGWEB: ACM Special Interest Group on Hypertext, Hypermedia, and Web

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 6, Downloads (12 Months): 28, Citation Count: 3

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/266180.266336 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	Thomas T. Cormen , Charles E. Leiserson , Ronald L. Rivest, Introduction to algorithms, MIT Press, Cambridge, MA, 1990
	2	A. Demers , S. Keshav , S. Shenker, Analysis and simulation of a fair queueing algorithm, Symposium proceedings on Communications architectures & protocols, p.1-12, September 25-27, 1989, Austin, Texas, United States
	3	D. Ferrari and Verma D. C. A scheme for realtime channel establishment in wide-area networks. IEEE Journal on Selected Areas in Communications, 8(3):368-379, April 1990.
	4	J. Golestani. ~A Self-Clocked Fair Queueing Scheme for Broadband Applications". In Proceedings of the IEEE INFOCOM Toronto, June 199j, pages 636-646, June 1994.
	5	Pawan Goyal , Xingang Guo , Harrick M. Vin, A hierarchial CPU scheduler for multimedia operating systems, Proceedings of the second USENIX symposium on Operating systems design and implementation, p.107-121, October 29-November 01, 1996, Seattle, Washington, United States
	6	Pawan Goyal , Harrick M. Vin , Haichen Chen, Start-time fair queueing: a scheduling algorithm for integrated services packet switching networks, Conference proceedings on Applications, technologies, architectures, and protocols for computer communications, p.157-168, August 28-30, 1996, Palo Alto, California, United States
	7	C. Lund, S. J. Phillips, and N. Reingold. Fair Prioritized Scheduling in an Input-Buffered Switch, pages 258-369. Chapman &: Hall, London, 1996.
	8	C. Mercer, S. Savage, and H. Tokuda. Processor capacity reserves: Operating system support for multimedia applications. In .Proceedings of IEEE International Conference on Multimedia Computing and Systems, May 1994.
	9	Abhay K. Parekh , Robert G. Gallager, A generalized processor sharing approach to flow control in integrated services networks: the single-node case, IEEE/ACM Transactions on Networking (TON), v.1 n.3, p.344-357, June 1993 [doi>10.1109/90.234856]
	10	I. Stoica , H. Abdel-Wahab , K. Jeffay , S. K. Baruah , J. E. Gehrke , C. G. Plaxton, A proportional share resource allocation algorithm for real-time, time-shared systems, Proceedings of the 17th IEEE Real-Time Systems Symposium (RTSS '96), p.288, December 04-06, 1996
	11	C. A. Waldspurger , E. Weihl. W., Stride Scheduling: Deterministic Proportional- Share Resource Management, Massachusetts Institute of Technology, Cambridge, MA, 1995
	12	1t. Zhang. Service discil?lines for guaranteed performance service in packet-switching networks. Proceedings of the IEEE, 83(10), October 1995.
	13	L. Zhang, Virtual clock: a new traffic control algorithm for packet switching networks, Proceedings of the ACM symposium on Communications architectures & protocols, p.19-29, September 26-28, 1990, Philadelphia, Pennsylvania, United States

CITED BY 3

	James C. Pang , Gholamali C. Shoja , Eric G. Manning, Providing soft real-time QoS guarantees for Java threads, Proceedings of the 2001 joint ACM-ISCOPE conference on Java Grande, p.39-47, June 2001, Palo Alto, California, United States
	John Bruno , Eran Gabber , Banu Özden , Abraham Silberschatz, The eclipse operating system: providing quality of service via reservation domains, Proceedings of the Annual Technical Conference on USENIX Annual Technical Conference, 1998, p.20-20, June 15-19, 1998, New Orleans, Louisiana
	D. G. Waddington , D. Hutchison, Resource partitioning in general purpose operating systems: experimental results in Windows NT, ACM SIGOPS Operating Systems Review, v.33 n.4, p.52-74, Oct. 1999