Sciweavers

1128 search results - page 15 / 226
» A Case for Buffer Servers
Sort
View
DAC
2003
ACM
16 years 7 months ago
An O(nlogn) time algorithm for optimal buffer insertion
The classic algorithm for optimal buffer insertion due to van Ginneken has time and space complexity O(n2 ), where n is the number of possible buffer positions. We present a new a...
Weiping Shi, Zhuo Li
ASPDAC
2006
ACM
102views Hardware» more  ASPDAC 2006»
15 years 12 months ago
An O(mn) time algorithm for optimal buffer insertion of nets with m sinks
— Buffer insertion is an effective technique to reduce interconnect delay. In this paper, we give a simple O(mn) time algorithm for optimal buffer insertion, where m is the numbe...
Zhuo Li, Weiping Shi
ITIIS
2010
137views more  ITIIS 2010»
15 years 4 months ago
Improving the Availability of Scalable on-demand Streams by Dynamic Buffering on P2P Networks
In peer-to-peer (P2P) on-demand streaming networks, the alleviation of server load depends on reciprocal stream sharing among peers. In general, on-demand video services enable cl...
Chow-Sing Lin
CN
2000
114views more  CN 2000»
15 years 5 months ago
Improving goodputs of IP packets under ATM UBR traffic with port-based queueing schemes
ATM networks are widely adopted as backbone networks. TCP/IP are the most popular protocols today and it is quite possible that packets are forwarded by ATM networks. In ATM netwo...
Wei Kuang Lai, Mu-Rung Shiu
HPCC
2009
Springer
15 years 10 months ago
A Study of Bare PC Web Server Performance for Workloads with Dynamic and Static Content
—Bare PC applications do not use an operating system or kernel. The bare PC architecture avoids buffer copying, minimizes interrupts, uses a single thread of execution for proces...
Long He, Ramesh K. Karne, Alexander L. Wijesinha, ...