Sciweavers

719 search results - page 111 / 144
» Sizing router buffers
Sort
View
FTCS
1993
123views more  FTCS 1993»
15 years 1 months ago
Fast, On-Line Failure Recovery in Redundant Disk Arrays
This paper describes and evaluates two algorithms for performing on-line failure recovery (data reconstruction) in redundant disk arrays. It presents an implementation of disk-ori...
Mark Holland, Garth A. Gibson, Daniel P. Siewiorek

Publication
211views
16 years 10 months ago
Congestion Avoidance in Computer Networks with A Connecitonless Network Layer: Part IV: A Selective Binary Feedback Scheme for G
With increasingly widespread use of computer networks, and the use of varied technology for the interconnection of computers, congestion is a significant problem. In this report, w...
K. Ramakrishnan and R. Jain,
192
Voted
VLDB
2004
ACM
112views Database» more  VLDB 2004»
16 years 22 days ago
Tracking set-expression cardinalities over continuous update streams
There is growing interest in algorithms for processing and querying continuous data streams (i.e., data that is seen only once in a fixed order) with limited memory resources. In i...
Sumit Ganguly, Minos N. Garofalakis, Rajeev Rastog...
96
Voted
ICCAD
2008
IEEE
130views Hardware» more  ICCAD 2008»
15 years 7 months ago
Area-I/O flip-chip routing for chip-package co-design
— The area-I/O flip-chip package provides a high chip-density solution to the demand of more I/O’s in VLSI designs; it can achieve smaller package size, shorter wirelength, an...
Jia-Wei Fang, Yao-Wen Chang
INFOCOM
1999
IEEE
15 years 4 months ago
An Architecture for Noncooperative QoS Provision in Many-Switch Systems
With the proliferation of high-speed networks and networked services, provisioning differentiated services to a diverse user base with heterogeneous QoS requirements has become an ...
Shaogang Chen, Kihong Park