Sharing a Processor Among Many Job Classes

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Sharing a Processor Among Many Job Classes

Full text

Pdf (615 KB)

Source

Journal of the ACM (JACM) archive
Volume 27 , Issue 3 (July 1980) table of contents

Pages: 519 - 532

Year of Publication: 1980

ISSN:0004-5411

Authors

G. Fayolle	INRIA, Domaine de Voluceau, 78150 Le Chesnay, France
I. Mitrani	University of Newcastle-upon-Tyne, England, NE1 7RU and INRIA, Le Chesnay, France
R. Iasnogorodski	University of Orléans, Orléans, France

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 5, Downloads (12 Months): 56, Citation Count: 37

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/322203.322212 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	Forest Baskett , K. Mani Chandy , Richard R. Muntz , Fernando G. Palacios, Open, Closed, and Mixed Networks of Queues with Different Classes of Customers, Journal of the ACM (JACM), v.22 n.2, p.248-260, April 1975 [doi>10.1145/321879.321887]
	2	COHEN, J.W. The multiple phase service network with generalized processor sharing. Tech. Rep. 69, Dept. of Mathematics, Utrecht, U., Utrechl, The Netherlands, 1977.
	3	GRADSHTEIN, I.S., AND RYZHIK, I.M. Tables of Integrals, Series, and Products. Academic Press, New York, 1965.
	4	Leonard Kleinrock, Time-shared Systems: a theoretical treatment, Journal of the ACM (JACM), v.14 n.2, p.242-261, April 1967 [doi>10.1145/321386.321388]
	5	, KLEINROCK, L., AND COFFMAN, E.G. Distribution of attained service in time shared systems. J. Comptr. Sci. 1 (1967), 287-298.
	6	KLEINROCK, L. Queueing Systems, Vol. 11. Wiley lnterscience, New York.
	7	MtTRANt, I., AND HINE, J.H. Complete parameterised families of job scheduling strategies. Acta Inform. 8 (1977), 61-73.
	8	MITRANI, 1., AND O'DoNoVAN, T.M. Private communications.
	9	MUNTZ, R.R. Poisson departure processes and queueing networks. Proc. 7th Ann. Princeton Conf. on Information Science, Princeton, N.J., 1973, pp. 435-440.
	10	O'DONOVAN, T.M. Distribution of attained and residual service in general queueing systems. Oper. Res. 22 (1974), 570-575.
	11	O'DoNOVAN, T.M. Direct solutions of M/G/I processor-sharing models. Oper. Res. 22 (1974L 1232-1235.
	12	SAKATA. M., NOGUCHI, S., ANt) OIZUMX, J. Analysis of a processor shared queueing model for time sharing systems. Proc. 2rid Hawaii Conf. on Systems Science, Honolulu, Hawaii, 1969.

CITED BY 37

	T. Bonald , J. W. Roberts, Congestion at flow level and the impact of user behaviour, Computer Networks: The International Journal of Computer and Telecommunications Networking, v.42 n.4, p.521-536, 15 July 2003
	Tian Bu , Don Towsley, Fixed point approximations for TCP behavior in an AQM network, ACM SIGMETRICS Performance Evaluation Review, v.29 n.1, p.216-225, June 2001
	Thomas Bonald , Laurent Massoulié, Impact of fairness on Internet performance, ACM SIGMETRICS Performance Evaluation Review, v.29 n.1, p.82-91, June 2001
	Liang Guo , Ibrahim Matta, Scheduling flows with unknown sizes: approximate analysis, ACM SIGMETRICS Performance Evaluation Review, v.30 n.1, June 2002
	D. Mitra , A. Weiss, A closed network with a discriminatory processor-sharing server, ACM SIGMETRICS Performance Evaluation Review, v.17 n.1, p.200-208, May 1989
	D. H. J. Epema, An analysis of decay-usage scheduling in multiprocessors, ACM SIGMETRICS Performance Evaluation Review, v.23 n.1, p.74-85, May 1995
	D. H. J. Epema, Decay-usage scheduling in multiprocessors, ACM Transactions on Computer Systems (TOCS), v.16 n.4, p.367-415, Nov. 1998
	S. Ben Fred , T. Bonald , A. Proutiere , G. Régnié , J. W. Roberts, Statistical bandwidth sharing: a study of congestion at flow level, ACM SIGCOMM Computer Communication Review, v.31 n.4, p.111-122, October 2001
	Predrag Jelenković , Petar Momčilović, Finite buffer queue with generalized processor sharing and heavy-tailed input processes, Computer Networks: The International Journal of Computer and Telecommunications Networking, v.40 n.3, p.433-443, 22 October 2002
	Gijs van Kessel , Rudesindo Núñez-Queija , Sem Borst, Asymptotic regimes and approximations for discriminatory processor sharing, ACM SIGMETRICS Performance Evaluation Review, v.32 n.2, September 2004
	Thomas Bonald , Alexandre Proutiere, Wireless downlink data channels: user performance and cell dimensioning, Proceedings of the 9th annual international conference on Mobile computing and networking, September 14-19, 2003, San Diego, CA, USA
	Jeongsim Kim , Bara Kim, Sojourn time distribution in the M/M/1 queue with discriminatory processor-sharing, Performance Evaluation, v.58 n.4, p.341-365, December 2004
	J. W. Roberts, A survey on statistical bandwidth sharing, Computer Networks: The International Journal of Computer and Telecommunications Networking, v.45 n.3, p.319-332, 21 June 2004
	Sem Borst, User-level performance of channel-aware scheduling algorithms in wireless data networks, IEEE/ACM Transactions on Networking (TON), v.13 n.3, p.636-647, June 2005
	Sem Borst , Dennis van Ooteghem , Bert Zwart, Tail asymptotics for discriminatory processor-sharing queues with heavy-tailed service requirements, Performance Evaluation, v.61 n.2-3, p.281-298, July 2005
	Sing-Kong Cheung , Hans van den Berg , Richard J. Boucherie, Decomposing the queue length distribution of processor-sharing models into queue lengths of permanent customer queues, Performance Evaluation, v.62 n.1-4, p.100-116, October 2005
	S. F. Yashkov , A. S. Yashkova, Processor sharing: A survey of the mathematical theory, Automation and Remote Control, v.68 n.9, p.1662-1731, September 2007
	Arzad A. Kherani, Sojourn times in (discrete) time shared systems and their continuous time limits, Proceedings of the 1st international conference on Performance evaluation methodolgies and tools, October 11-13, 2006, Pisa, Italy
	P. Lieshout , S. Borst , M. Mandjes, Heavy-traffic approximations for linear networks operating under α-fair bandwidth-sharing policies, Proceedings of the 1st international conference on Performance evaluation methodolgies and tools, October 11-13, 2006, Pisa, Italy
	Yujing Wu , Carey Williamson , Jingxiang Luo, On processor sharing and its applications to cellular data network provisioning, Performance Evaluation, v.64 n.9-12, p.892-908, October, 2007
	Thomas Bonald , James Roberts, Scheduling network traffic, ACM SIGMETRICS Performance Evaluation Review, v.34 n.4, March 2007
	Juha Leino, Approximating optimal load balancing policy in discriminatory processor sharing systems, Proceedings of the 2nd international conference on Performance evaluation methodologies and tools, October 22-27, 2007, Nantes, France
	Hanhua Feng , Vishal Misra , Dan Rubenstein, PBS: a unified priority-based scheduler, ACM SIGMETRICS Performance Evaluation Review, v.35 n.1, June 2007
	Sing-Kong Cheung , Bara Kim , Jeongsim Kim, Slowdown in the M/M/1 discriminatory processor-sharing queue, Performance Evaluation, v.65 n.8, p.586-605, July, 2008
	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
	T. Bonald , A. Proutière, On Stochastic Bounds for Monotonic Processor Sharing Networks, Queueing Systems: Theory and Applications, v.47 n.1-2, p.81-106, May-June 2004
	Sem Borst , Rudesindo Núñez-Queija , Bert Zwart, Sojourn time asymptotics in processor-sharing queues, Queueing Systems: Theory and Applications, v.53 n.1-2, p.31-51, June 2006
	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
	T. Bonald , L. Massoulié , A. Proutière , J. Virtamo, A queueing analysis of max-min fairness, proportional fairness and balanced fairness, Queueing Systems: Theory and Applications, v.53 n.1-2, p.65-84, June 2006
	J Vinyes-Sanz , J Riera-Garcia, Waiting times in a transport protocol entity scheduler, ACM SIGCOMM Computer Communication Review, v.16 n.5, p.4-12, Oct./Nov. 1986
	Thomas Bonald , Ali Ibrahim , James Roberts, Traffic capacity of multi-cell WLANS, ACM SIGMETRICS Performance Evaluation Review, v.36 n.1, June 2008
	T. Bonald , M. -A. Tran, Flow vs. time sampling for throughput performance evaluation, Performance Evaluation, v.64 n.9-12, p.1181-1193, October, 2007
	Arzad a. Kherani, Asymptotic properties of sojourn times in multiclass time-shared systems, Probability in the Engineering and Informational Sciences, v.22 n.2, p.231-259, March 2008
	Arzad A. Kherani, Sojourn times in (discrete) time shared systems and their continuous time limits, Queueing Systems: Theory and Applications, v.60 n.3-4, p.171-191, December 2008
	Vicent Pla , Jorma Virtamo , Jorge Martínez-Bauset, Optimal robust policies for bandwidth allocation and admission control in wireless networks, Computer Networks: The International Journal of Computer and Telecommunications Networking, v.52 n.17, p.3258-3272, December, 2008
	P. Lieshout , M. Mandjes, Importance sampling in rate-sharing networks, Proceedings of the 1st international conference on Simulation tools and techniques for communications, networks and systems & workshops, March 03-07, 2008, Marseille, France
	Vicent Pla , Jorma Virtamo , Jorge Martínez-Bauset, Optimal robust policies for bandwidth allocation and admission control in wireless networks, Proceedings of the 3rd International Conference on Performance Evaluation Methodologies and Tools, October 20-24, 2008, Athens, Greece