Mixed scheduling disciplines for network flows

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Mixed scheduling disciplines for network flows

Full text

Pdf (318 KB)

Source

ACM SIGMETRICS Performance Evaluation Review archive
Volume 31 , Issue 2 (September 2003) table of contents
Special issue on the fifth workshop on MAthematical performance Modeling and Analysis (MAMA 2003)

Pages: 36 - 39

Year of Publication: 2003

ISSN:0163-5999

Authors

Hanhua Feng	Columbia University, New York, NY
Vishal Misra	Columbia University, New York, NY

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 2, Downloads (12 Months): 15, Citation Count: 6

Additional Information:

abstract references cited by collaborative colleagues

Tools and Actions:	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/959143.959165 What is a DOI?

ABSTRACT

We introduce a novel method to prove that the FBPS discipline has optimal mean sojourn time and mean slowdown ratio for DHR service time distributions in an M/G/1 queue. We then discuss the problems related to FBPS, and propose a new scheduling discipline to overcome these problems.

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	Nikhil Bansal , Mor Harchol-Balter, Analysis of SRPT scheduling: investigating unfairness, Proceedings of the 2001 ACM SIGMETRICS international conference on Measurement and modeling of computer systems, p.279-290, June 2001, Cambridge, Massachusetts, United States
	2	Liang Guo , Ibrahim Matta, Scheduling flows with unknown sizes: approximate analysis, Proceedings of the 2002 ACM SIGMETRICS international conference on Measurement and modeling of computer systems, June 15-19, 2002, Marina Del Rey, California
	3	L. Kleinrock , R. R. Muntz, Processor Sharing Queueing Models of Mixed Scheduling Disciplines for Time Shared System, Journal of the ACM (JACM), v.19 n.3, p.464-482, July 1972 [doi>10.1145/321707.321717]
	4	L. Kleinrock, R. R. Muntz and J. Hsu, Tight bounds on average response time for processor-sharing models of time-shared computer systems, Information Processing 71, TA-2, 50--58, August 1971.
	5	Adam Wierman, Nikhil Bansal and Mor Harchol-Balter, A note on comparing response times in the M/GI/1/FB and M/GI/1/PS queues, technique report CMU-CS-02-177, School of Computer Science, Carnegie Mellon University (Pittsburgh, PA 15213), September 2002.

CITED BY 6

	Maaike Verloop , Sem Borst , Rudesindo Núñez-Queija, Stability of size-based scheduling disciplines in resource-sharing networks, Performance Evaluation, v.62 n.1-4, p.247-262, October 2005
	Samuli Aalto , Urtzi Ayesta , Eeva Nyberg-Oksanen, Two-level processor-sharing scheduling disciplines: mean delay analysis, ACM SIGMETRICS Performance Evaluation Review, v.32 n.1, June 2004
	Samuli Aalto , Urtzi Ayesta , Sem Borst , Vishal Misra , Rudesindo Núñez-Queija, Beyond processor sharing, ACM SIGMETRICS Performance Evaluation Review, v.34 n.4, March 2007
	Eitan Altman , Konstantin Avrachenkov , Urtzi Ayesta, A survey on discriminatory processor sharing, Queueing Systems: Theory and Applications, v.53 n.1-2, p.53-63, June 2006
	Misja Nuyens , Adam Wierman, The Foreground-Background queue: A survey, Performance Evaluation, v.65 n.3-4, p.286-307, March, 2008
	Samuli Aalto , Urtzi Ayesta, Optimal scheduling of jobs with a DHR tail in the M/G/1 queue, Proceedings of the 3rd International Conference on Performance Evaluation Methodologies and Tools, October 20-24, 2008, Athens, Greece

Collaborative Colleagues:

Hanhua Feng: colleagues

Vishal Misra: colleagues

Adobe Acrobat

QuickTime

Windows Media Player

Real Player