Sciweavers

10 search results - page 2 / 2
» Allocation of FIFO Structures in RTL Data Paths
Sort
View
HIPC
2007
Springer
13 years 9 months ago
Accomplishing Approximate FCFS Fairness Without Queues
First Come First Served (FCFS) is a policy that is accepted for implementing fairness in a number of application domains such as scheduling in Operating Systems, scheduling web req...
K. Subramani, Kamesh Madduri
IEEEPACT
2003
IEEE
13 years 10 months ago
Resolving Register Bank Conflicts for a Network Processor
This paper discusses a register bank assignment problem for a popular network processor--Intel's IXP. Due to limited data paths, the network processor has a restriction that ...
Xiaotong Zhuang, Santosh Pande
ICCAD
1995
IEEE
135views Hardware» more  ICCAD 1995»
13 years 9 months ago
An iterative improvement algorithm for low power data path synthesis
We address the problem of minimizing power consumption in behavioral synthesis of data-dominated circuits. The complex nature of power as a cost function implies that the effects ...
Anand Raghunathan, Niraj K. Jha
OSN
2008
83views more  OSN 2008»
13 years 5 months ago
Path selection in user-controlled circuit-switched optical networks
User-controlled circuit-switched optical networks are gaining popularity in an effort to fulfill the insatiable data transport needs of the online community. In this paper we cons...
Wojciech M. Golab, Raouf Boutaba
WWW
2010
ACM
13 years 5 months ago
Mining advertiser-specific user behavior using adfactors
Consider an online ad campaign run by an advertiser. The ad serving companies that handle such campaigns record users' behavior that leads to impressions of campaign ads, as ...
Nikolay Archak, Vahab S. Mirrokni, S. Muthukrishna...