Sciweavers

2612 search results - page 396 / 523
» Switching Graphs and Their Complexity
Sort
View
SIGMETRICS
2004
ACM
124views Hardware» more  SIGMETRICS 2004»
15 years 3 months ago
Interposed proportional sharing for a storage service utility
This paper develops and evaluates new share-based scheduling algorithms for differentiated service quality in network services, such as network storage servers. This form of resou...
Wei Jin, Jeffrey S. Chase, Jasleen Kaur
MICRO
2003
IEEE
125views Hardware» more  MICRO 2003»
15 years 3 months ago
WaveScalar
Silicon technology will continue to provide an exponential increase in the availability of raw transistors. Effectively translating this resource into application performance, how...
Steven Swanson, Ken Michelson, Andrew Schwerin, Ma...
EUROSYS
2010
ACM
15 years 3 months ago
Residue objects: a challenge to web browser security
A complex software system typically has a large number of objects in the memory, holding references to each other to implement an object model. Deciding when the objects should be...
Shuo Chen, Hong Chen, Manuel Caballero
GECCO
2010
Springer
159views Optimization» more  GECCO 2010»
15 years 2 months ago
Evolution of division of labor in genetically homogenous groups
Within nature, the success of many organisms, including certain species of insects, mammals, slime molds, and bacteria, is attributed to their performance of division of labor, wh...
Heather Goldsby, David B. Knoester, Charles Ofria
MMB
2010
Springer
194views Communications» more  MMB 2010»
15 years 2 months ago
Searching for Tight Performance Bounds in Feed-Forward Networks
Abstract. Computing tight performance bounds in feed-forward networks under general assumptions about arrival and server models has turned out to be a challenging problem. Recently...
Andreas Kiefer, Nicos Gollan, Jens B. Schmitt