Sciweavers

69 search results - page 5 / 14
» Information storage capacity of crossbar switching networks
Sort
View
SIGMETRICS
2004
ACM
124views Hardware» more  SIGMETRICS 2004»
14 years 29 days 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
ICANN
2003
Springer
14 years 22 days ago
Online Processing of Multiple Inputs in a Sparsely-Connected Recurrent Neural Network
The storage and short-term memory capacities of recurrent neural networks of spiking neurons are investigated. We demonstrate that it is possible to process online many superimpose...
Julien Mayor, Wulfram Gerstner
BROADNETS
2007
IEEE
14 years 1 months ago
Reduced flow routing: Leveraging residual capacity to reduce blocking in GMPLS networks
— Traffic engineering has been extensively studied to maximize network resource utilization while minimizing call blocking [1]. As the the demand for high data rate services ove...
Xiaolan J. Zhang, Sun-il Kim, Steven S. Lumetta
NOMS
2008
IEEE
14 years 1 months ago
Towards SLA-based optimal workload distribution in SANs
—Storage Area Networks (SANs) connect storage devices to servers over fast network interconnects. We consider the problem of optimal SAN configuration with the goal of meeting s...
Eray Gencay, Carsten Sinz, Wolfgang Küchlin
ASPLOS
2004
ACM
14 years 29 days ago
D-SPTF: decentralized request distribution in brick-based storage systems
Distributed Shortest-Positioning Time First (D-SPTF) is a request distribution protocol for decentralized systems of storage servers. D-SPTF exploits high-speed interconnects to d...
Christopher R. Lumb, Richard A. Golding