Sciweavers

734 search results - page 96 / 147
» Multiprocess Time Queue
Sort
View
SIGMETRICS
2008
ACM
101views Hardware» more  SIGMETRICS 2008»
13 years 11 months ago
How to parameterize models with bursty workloads
Although recent advances in theory indicate that burstiness in the service time process can be handled effectively by queueing models (e.g., MAP queueing networks [2]), there is a...
Giuliano Casale, Ningfang Mi, Ludmila Cherkasova, ...
FOCS
2005
IEEE
14 years 4 months ago
Towards a Final Analysis of Pairing Heaps
Fredman, Sedgewick, Sleator, and Tarjan proposed the pairing heap as a self-adjusting, streamlined version of the Fibonacci heap. It provably supports all priority queue operation...
Seth Pettie
INFOCOM
2005
IEEE
14 years 4 months ago
Differentiated bandwidth sharing with disparate flow sizes
Abstract— We consider a multi-class queueing system operating under the Discriminatory Processor-Sharing (DPS) discipline. The DPS discipline provides a natural approach for mode...
Gijs van Kessel, R. Núñez Queija, Se...
SIGMETRICS
2003
ACM
131views Hardware» more  SIGMETRICS 2003»
14 years 4 months ago
Classifying scheduling policies with respect to unfairness in an M/GI/1
It is common to evaluate scheduling policies based on their mean response times. Another important, but sometimes opposing, performance metric is a scheduling policy’s fairness....
Adam Wierman, Mor Harchol-Balter
CSREAEEE
2006
174views Business» more  CSREAEEE 2006»
14 years 12 days ago
Using Temporal Information in Collaborative Filtering: An Empirical Study
- Collaborative filtering is a widely used and proven method of building recommender systems that provide personalized recommendations on products or services based on explicit rat...
Young Park, Tong-Queue Lee