Sciweavers

734 search results - page 77 / 147
» Multiprocess Time Queue
Sort
View
SIGMETRICS
2006
ACM
116views Hardware» more  SIGMETRICS 2006»
15 years 6 months ago
The Erlang model with non-poisson call arrivals
The Erlang formula is known to be insensitive to the holding time distribution beyond the mean. While calls are generally assumed to arrive as a Poisson process, we prove that it ...
Thomas Bonald
105
Voted
FOCS
2005
IEEE
15 years 6 months ago
Linear Lower Bounds on Real-World Implementations of Concurrent Objects
This paper proves   ¡ £ ¥ lower bounds on the time to perform a single instance of an operation in any implementation of a large class of data structures shared by £ processe...
Faith Ellen Fich, Danny Hendler, Nir Shavit
119
Voted
JSSPP
2001
Springer
15 years 5 months ago
SRPT Scheduling for Web Servers
This note briefly summarizes some results from two papers: [4] and [23]. These papers pose the following question: Is it possible to reduce the expected response time of every req...
Mor Harchol-Balter, Nikhil Bansal, Bianca Schroede...
CPE
1997
Springer
79views Hardware» more  CPE 1997»
15 years 4 months ago
Storage Alternatives for Large Structured State Spaces
We consider the problem of storing and searching a large state space obtained from a high-level model such as a queueing network or a Petri net. After reviewing the traditional te...
Gianfranco Ciardo, Andrew S. Miner
94
Voted
CORR
2010
Springer
83views Education» more  CORR 2010»
15 years 22 days ago
Breaking the Legend: Maxmin Fairness notion is no longer effective
In this paper we analytically propose an alternative approach to achieve better fairness in scheduling mechanisms which could provide better quality of service particularly for re...
Yaser Miaji, Suhaidi Hassan