Search results for "LCFS"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
54	Qi-Ming He, Hui Li	Stability Conditions of the MMAP[K]/G[K]/1/LCFS Preemptive Repeat Queue.	Queueing Syst. Theory Appl.	2003	DBLP DOI BibTeX RDF	Markov process of matrix M/G/1 type with a tree structure, stability, linear programming, queueing system, matrix analytic methods
52	V. Anantharam, A. Ganesh	Optimal buffer allocation in tandems of last come first served queues.	Queueing Syst. Theory Appl.	1995	DBLP DOI BibTeX RDF	LCFS queues, queueing networks, tandem queues, Buffer allocation
47	David Raz, Hanoch Levy, Benjamin Avi-Itzhak	A resource-allocation queueing fairness measure.	SIGMETRICS	2004	DBLP DOI BibTeX RDF	M/M/1, queue disciplines, resource allocation, fairness, job scheduling, processor sharing, FCFS, unfairness, PS
47	Walter Cunto, Patricio V. Poblete	Two Hybrid Methods for Collision Resolution in Open Addressing Hashing.	SWAT	1988	DBLP DOI BibTeX RDF
31	Wen Zhan, Dewei Wu, Xinghua Sun, Ziyang Guo, Peng Liu 0047, Jingjing Liu 0005	Peak Age of Information Optimization of Slotted Aloha: FCFS Versus LCFS.	IEEE Trans. Netw. Sci. Eng.	2023	DBLP DOI BibTeX RDF
31	Royi Jacobovic, Nikki Levering, Onno J. Boxma	Externalities in the M/G/1 queue: LCFS-PR versus FCFS.	Queueing Syst. Theory Appl.	2023	DBLP DOI BibTeX RDF
31	Mohammad Moltafet, Markus Leinonen, Marian Codreanu	Average Age of Information in a Multi-Source M/M/1 Queueing Model with LCFS Prioritized Packet Management.	INFOCOM Workshops	2020	DBLP DOI BibTeX RDF
31	Hideaki Takagi	Waiting and Service Time of a Unique Customer in an M/M/m Preemptive LCFS Queue with Impatient Customers.	QTNA	2017	DBLP DOI BibTeX RDF
31	Hideaki Takagi	Waiting time in the M/M/m LCFS nonpreemptive priority queue with impatient customers.	Ann. Oper. Res.	2016	DBLP DOI BibTeX RDF
31	Esa Hyytiä, Samuli Aalto	On Round-Robin routing with FCFS and LCFS scheduling.	Perform. Evaluation	2016	DBLP DOI BibTeX RDF
31	Hideaki Takagi	Times to Service Completion and Abandonment in the M/M/m Preemptive LCFS Queue with Impatient Customers.	QTNA	2016	DBLP BibTeX RDF
31	Esa Hyytiä, Rhonda Righter, Samuli Aalto	Energy-aware job assignment in server farms with setup delays under LCFS and PS.	ITC	2014	DBLP DOI BibTeX RDF
31	Iván Atencia, Alexander V. Pechinkin	A discrete-time queueing system with optional LCFS discipline.	Ann. Oper. Res.	2013	DBLP DOI BibTeX RDF
31	Esa Hyytiä, Samuli Aalto, Aleksi Penttinen, Jorma T. Virtamo	On the Value Function of the M/G/1 FCFS and LCFS Queues.	J. Appl. Probab.	2012	DBLP DOI BibTeX RDF
31	Opher Baron	Regulated Random Walks and the LCFS Backlog Probability: Analysis and Application.	Oper. Res.	2008	DBLP DOI BibTeX RDF
31	Tetsuya Takine	Matrix Product-Form Solution for an LCFS-PR Single-Server Queue with Multiple Arrival Streams Governed by a Markov Chain.	Queueing Syst. Theory Appl.	2002	DBLP DOI BibTeX RDF
31	Qi-Ming He	Quasi-birth-and-death Markov processes with a tree structure and the MMAP[K]/PH[K]/N/LCFS non-preemptive queue.	Eur. J. Oper. Res.	2000	DBLP DOI BibTeX RDF
31	Shoji Kasahara, Yutaka Takahashi 0001, Toshiharu Hasegawa	Analysis of Waiting Time of M/G/1/K System with Vacations Under Random Scheduling and LCFS.	Perform. Evaluation	1995	DBLP DOI BibTeX RDF
31	Ulrich Schmid 0001, Johann Blieberger	On Nonpreemptive LCFS Scheduling with Deadlines.	J. Algorithms	1995	DBLP DOI BibTeX RDF
31	Masakiyo Miyazawa, Genji Yamazaki	Note on batch arrival LCFS and related symmetric queues.	Oper. Res. Lett.	1993	DBLP DOI BibTeX RDF
31	Johann Blieberger, Ulrich Schmid 0001	Preemptive LCFS Scheduling in Hard Real-Time Applications.	Perform. Evaluation	1992	DBLP DOI BibTeX RDF
28	David Raz, Hanoch Levy, Benjamin Avi-Itzhak	The twin measure for queueing system predictability.	VALUETOOLS	2007	DBLP DOI BibTeX RDF	LCFS, LJF, LRPT, SJF, queue disciplines, twin measure, predictability, job scheduling, processor sharing, round robin, SRPT, FCFS, LAS, PS
28	Qi-Ming He, Attahiru Sule Alfa	The MMAP[K]/PH[K]/1 queues with a last-come-first-served preemptive service discipline.	Queueing Syst. Theory Appl.	1998	DBLP DOI BibTeX RDF	LCFS, quasi-birth-and-death Markov process, queueing theory, tree structure, matrix analytic methods
28	Susan H. Xu	A duality approach to admission and scheduling controls of queues.	Queueing Syst. Theory Appl.	1994	DBLP DOI BibTeX RDF	expulsion control, preemptive LCFS, ordered-entry queues, control of queues, nonidentical processors, Scheduling, admission control, FCFS
28	François Baccelli, Zhen Liu 0001, Donald F. Towsley	Extremal Scheduling of Parallel Processing with and without Real-Time Constraints.	J. ACM	1993	DBLP DOI BibTeX RDF	LCFS, Schur convex ordering, convex ordering, convex symmetric ordering, extremal policy, local order preserving, longest due time first, shortest due time first, parallel processing, throughput, response time, precedence constraints, FIFO, real-time constraints, optimal scheduling, dateness, stochastic ordering, FCFS, LIFO
23	Michel Mandjes, Bert Zwart	Large deviations of sojourn times in processor sharing queues.	Queueing Syst. Theory Appl.	2006	DBLP DOI BibTeX RDF	Processor sharing queues, Change of measure, Importance sampling, Large deviations, Sojourn time
23	Zhaofu Wang, Wensong Zhang, Kun Deng	The Consistency Mechanism of Meta-data Management in Distributed Storage System.	GCC (2)	2003	DBLP DOI BibTeX RDF
23	Sem C. Borst, Onno J. Boxma, R. Núñez Queija	Heavy Tails: The Effect of the Service Discipline.	Computer Performance Evaluation / TOOLS	2002	DBLP DOI BibTeX RDF
23	S. A. Berezner, C. F. Kriel, Anthony E. Krzesinski	Quasi-reversible multiclass queues with order independent departure rates.	Queueing Syst. Theory Appl.	1995	DBLP DOI BibTeX RDF	Product from networks, order independent departure rates, MSCCC queues, loss networks, quasi-reversibility