Sciweavers

1316 search results - page 171 / 264
» A New Scheduling Algorithm for Servers
Sort
View
IPPS
2002
IEEE
14 years 3 months ago
Hierarchical Interconnects for On-Chip Clustering
In the sub-micron technology era, wire delays are becoming much more important than gate delays, making it particularly attractive to go for clustered designs. A common form of cl...
Aneesh Aggarwal, Manoj Franklin
DATE
1999
IEEE
147views Hardware» more  DATE 1999»
14 years 2 months ago
Efficient BIST Hardware Insertion with Low Test Application Time for Synthesized Data Paths
In this paper, new and efficient BIST methodology and BIST hardware insertion algorithms are presented for RTL data paths obtained from high level synthesis. The methodology is ba...
Nicola Nicolici, Bashir M. Al-Hashimi
SIGCOMM
2012
ACM
12 years 22 days ago
Multi-resource fair queueing for packet processing
Middleboxes are ubiquitous in today’s networks and perform a variety of important functions, including IDS, VPN, firewalling, and WAN optimization. These functions differ vastl...
Ali Ghodsi, Vyas Sekar, Matei Zaharia, Ion Stoica
JNCA
2011
102views more  JNCA 2011»
13 years 1 months ago
Multi-objective zone mapping in large-scale distributed virtual environments
In large-scale distributed virtual environments (DVEs), the NP-hard zone mapping problem concerns how to assign distinct zones of the virtual world to a number of distributed serv...
Ta Nguyen Binh Duong, Suiping Zhou, Wentong Cai, X...
JCSS
2007
89views more  JCSS 2007»
13 years 10 months ago
The relative worst-order ratio applied to paging
The relative worst order ratio, a new measure for the quality of on-line algorithms, was recently defined and applied to two bin packing problems. Here, we extend the definition ...
Joan Boyar, Lene M. Favrholdt, Kim S. Larsen