scientific article; zbMATH DE number 2080856

MaRDI QIDQ4473894zbMATH OpenFDO

Authors Mor Harchol-Balter, N. Bansal, Bianca Schröder, Mukesh Agrawal

Publication date 4 August 2004

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2221/22210011.htm

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Computing methodologies and applications (68U99)

Recommendations

• Open problem: \(M/G/k/SRPT\) under medium load
• New results on competitive analysis of online SRPT scheduling
• Revisiting unfairness in Web server scheduling
• On the average sojourn time under \(M/M/1/\)SRPT
• scientific article; zbMATH DE number 2088487

Cited in

(15)

• Relationship between guaranteed rate server and latency rate server.
• Research on scheduling algorithms in Web cluster servers
• Quantitative fairness for assessing perceived service quality in queues
• Round robin scheduling of heterogeneous parallel servers in heavy traffic
• Fluid and diffusion limits for transient sojourn times of processor sharing queues with time varying rates
• Multi-layered round robin routing for parallel servers
• Optimal processing policies for an e-commerce web server
• scientific article; zbMATH DE number 2088487 (Why is no real title available?)
• Minimization of the total completion time for asynchronous transmission in a packet data-transmission system
• Effectiveness of early replies in client–server systems
• Open problem: \(M/G/k/SRPT\) under medium load
• Reducing network and computation complexities in neural based real-time scheduling scheme
• SEH: size estimate hedging scheduling of queues
• On the inapproximability of \(M/G/K\): Why two moments of job size distribution are not enough
• Revisiting unfairness in Web server scheduling

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4473894)