Sciweavers

111 search results - page 16 / 23
» Approximating Low Latency Queueing Buffer Latency
Sort
View
HPCA
2012
IEEE
12 years 3 months ago
Flexible register management using reference counting
Conventional out-of-order processors that use a unified physical register file allocate and reclaim registers explicitly using a free list that operates as a circular queue. We ...
Steven Battle, Andrew D. Hilton, Mark Hempstead, A...
CCR
2010
179views more  CCR 2010»
13 years 7 months ago
An argument for increasing TCP's initial congestion window
TCP flows start with an initial congestion window of at most four segments or approximately 4KB of data. Because most Web transactions are short-lived, the initial congestion wind...
Nandita Dukkipati, Tiziana Refice, Yuchung Cheng, ...
HPCA
2004
IEEE
14 years 8 months ago
Out-of-Order Commit Processors
Modern out-of-order processors tolerate long latency memory operations by supporting a large number of inflight instructions. This is particularly useful in numerical applications...
Adrián Cristal, Daniel Ortega, Josep Llosa,...
ACIVS
2008
Springer
14 years 2 months ago
Sub-optimal Camera Selection in Practical Vision Networks through Shape Approximation
Within a camera network, the contribution of a camera to the observations of a scene depends on its viewpoint and on the scene configuration. This is a dynamic property, as the sc...
Huang Lee, Linda Tessens, Marleen Morbée, H...
ICPP
2006
IEEE
14 years 1 months ago
Data Transfers between Processes in an SMP System: Performance Study and Application to MPI
— This paper focuses on the transfer of large data in SMP systems. Achieving good performance for intranode communication is critical for developing an efficient communication s...
Darius Buntinas, Guillaume Mercier, William Gropp