Sciweavers

155 search results - page 8 / 31
» Reducing Design Complexity of the Load Store Queue
Sort
View
INFOCOM
2006
IEEE
14 years 2 months ago
Stable Scheduling Policies for Maximizing Throughput in Generalized Constrained Queueing Systems
We consider a class of queueing networks referred to as “generalized constrained queueing networks” which form the basis of several different communication networks and inform...
Prasanna Chaporkar, Saswati Sarkar
APPT
2003
Springer
14 years 1 months ago
A Highly Efficient FC-SAN Based on Load Stream
The speed of storing and fetching data on SCSI disks has a great restriction on the efficiency of SAN based on Fiber Channel Network. In this paper, a high-efficient FC-SAN storage...
Jiwu Shu, Jun Yao, Changdong Fu, Weimin Zheng
IEEEPACT
2002
IEEE
14 years 29 days ago
Cost Effective Memory Dependence Prediction using Speculation Levels and Color Sets
Memory dependence prediction allows out-of-order issue processors to achieve high degrees of instruction level parallelism by issuing load instructions at the earliest time withou...
Soner Önder
AICT
2006
IEEE
122views Communications» more  AICT 2006»
14 years 2 months ago
Optimizing and Balancing Load in Fully Distributed P2P File Sharing Systems
A peer-to-peer file sharing system includes a lookup and a content distribution protocol. Very efficient peer-to-peer protocols exist for content distribution, but efficient in...
Anh-Tuan Gai, Laurent Viennot
RTAS
1997
IEEE
14 years 7 days ago
Scalable Hardware Priority Queue Architectures for High-Speed Packet Switches
ÐWith effective packet-scheduling mechanisms, modern integrated networks can support the diverse quality-of-service requirements of emerging applications. However, arbitrating bet...
Sung-Whan Moon, Kang G. Shin, Jennifer Rexford