Sciweavers

123 search results - page 13 / 25
» Experimenting with buffer sizes in routers
Sort
View
HIPC
2009
Springer
14 years 7 months ago
Fast checkpointing by Write Aggregation with Dynamic Buffer and Interleaving on multicore architecture
Large scale compute clusters continue to grow to ever-increasing proportions. However, as clusters and applications continue to grow, the Mean Time Between Failures (MTBF) has redu...
Xiangyong Ouyang, Karthik Gopalakrishnan, Tejus Ga...
INFOCOM
2007
IEEE
15 years 3 months ago
Multimodal Congestion Control for Low Stable-State Queuing
— To discover an efficient fair sending rate for a flow, Transmission Control Protocol (TCP) saturates the bottleneck link and its buffer until the router discards a packet. Su...
Maxim Podlesny, Sergey Gorinsky
INFOCOM
2003
IEEE
15 years 2 months ago
Interaction of TCP Flows as Billiards
Abstract— The aim of this paper is to analyze the performance of a large number of long lived TCP controlled flows sharing many routers (or links), from the knowledge of the net...
François Baccelli, Dohy Hong
SIGMOD
1993
ACM
163views Database» more  SIGMOD 1993»
15 years 1 months ago
The LRU-K Page Replacement Algorithm For Database Disk Buffering
This paper introduces a new approach to database disk buffering, called the LRU–K method. The basic idea of LRU–K is to keep track of the times of the last K references to pop...
Elizabeth J. O'Neil, Patrick E. O'Neil, Gerhard We...
ICMCS
1999
IEEE
113views Multimedia» more  ICMCS 1999»
15 years 1 months ago
Optimally Ensured Interactive Service in Distributed Multimedia Presentation Systems
In this paper, we develop a new service to support optimally ensured user interactions with minimum latency in interactive distributed multimedia presentation environments. The no...
Markus Mielke, Aidong Zhang