Search results for "M/G/1"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
1	Shengquan Wang, Jian-Jia Chen, Jun Liu, Xue Liu 0001	Power Saving Design for Servers under Response Time Constraint.	ECRTS	2010	DBLP DOI BibTeX RDF	response time, power saving, M/G/1, sleep
1	Adam Wierman, Misja Nuyens	Scheduling despite inexact job-size information.	SIGMETRICS	2008	DBLP DOI BibTeX RDF	job size estimates, scheduling, response time, queueing, M/G/1, SMART, SRPT, shortest remaining processing time
1	Samuli Aalto, Urtzi Ayesta	Mean delay optimization for the M/G/1 queue with pareto type service times.	SIGMETRICS	2007	DBLP DOI BibTeX RDF	gittins index, scheduling, pareto distribution, M/G/1, mean delay
1	Predrag R. Jelenkovic, Xiaozhu Kang, Jian Tan	Adaptive and scalable comparison scheduling.	SIGMETRICS	2007	DBLP DOI BibTeX RDF	comparison scheduling, scalability, adaptive thresholds, M/G/1
1	A. Novak, Peter G. Taylor, Darryl Veitch	The distribution of the number of arrivals in a subinterval of a busy period of a single server queue.	Queueing Syst. Theory Appl.	2006	DBLP DOI BibTeX RDF	Ballot theorem, M/D/1, Busy period, Active probing, M/G/1
1	Ho Woo Lee, Sahng Hoon Cheon, Won Joo Seo	Queue length and waiting time of the M/G/1 queue under the D-policy and multiple vacations.	Queueing Syst. Theory Appl.	2006	DBLP DOI BibTeX RDF	D-policy, Multiple vacations, Workload, Waiting time, Queue length, M/G/1
1	Eitan Altman, Konstantin Avrachenkov, Urtzi Ayesta	A survey on discriminatory processor sharing.	Queueing Syst. Theory Appl.	2006	DBLP DOI BibTeX RDF	Discriminatory Processor Sharing, Conservation Law, Asymptotic Analysis, M/G/1
1	Eitan Altman, Uri Yechiali	Analysis of customers' impatience in queues with server vacations.	Queueing Syst. Theory Appl.	2006	DBLP DOI BibTeX RDF	Single and multiple vacations, Abandonment, M/M/1, M/M/c, Queueing, M/G/1, Impatience
1	Lichuan Liu, Hongya Ge, Swades De	Impact of network resource constraints on the performance of wireless sensor relay networks.	IWCMC	2006	DBLP DOI BibTeX RDF	multi-hop sensor network, skip-free negative, Markov chain, M/G/1
1	Adam Wierman, Mor Harchol-Balter	Classifying scheduling policies with respect to higher moments of conditional response time.	SIGMETRICS	2005	DBLP DOI BibTeX RDF	FB, PSJF, foreground-background, least attained service, shortest job first, scheduling, predictability, response time, variance, SET, processor sharing, M/G/1, SRPT, LAS, shortest remaining processing time, PS, cumulants
1	Adam Wierman, Mor Harchol-Balter, Takayuki Osogami	Nearly insensitive bounds on SMART scheduling.	SIGMETRICS	2005	DBLP DOI BibTeX RDF	PSJF, preemptive shortest job first, scheduling, response time, processor sharing, M/G/1, SMART, SRPT, shortest remaining processing time, PS
1	Samuli Aalto, Urtzi Ayesta, Eeva Nyberg-Oksanen	Two-level processor-sharing scheduling disciplines: mean delay analysis.	SIGMETRICS	2004	DBLP DOI BibTeX RDF	FB, MLPS, unfinished truncated work, scheduling, M/G/1, LAS, PS, mean delay
1	Adam Wierman, Mor Harchol-Balter	Classifying scheduling policies with respect to unfairness in an M/GI/1.	SIGMETRICS	2003	DBLP DOI BibTeX RDF	FB, least attained service, shortest elapsed time, scheduling, feedback, SET, processor sharing, M/G/1, SRPT, slowdown, LAS, unfairness, shortest remaining processing time, PS
1	Israel Cidon, Asad Khamisy, Moshe Sidi	On queueing delays of dispersed messages.	Queueing Syst. Theory Appl.	1994	DBLP DOI BibTeX RDF	dispersed messages, M/M/1, bursty traffic, M/G/1, Message delay