Sciweavers

719 search results - page 96 / 144
» Sizing router buffers
Sort
View
88
Voted
FOSSACS
2010
Springer
15 years 3 months ago
Degrees of Lookahead in Regular Infinite Games
We study variants of regular infinite games where the strict alternation of moves between the two players is subject to modifications. The second player may postpone a move for a f...
Michael Holtmann, Lukasz Kaiser, Wolfgang Thomas
ISCAPDCS
2004
15 years 1 months ago
FG: A Framework Generator for Hiding Latency in Parallel Programs Running on Clusters
FG is a programming environment for asynchronous programs that run on clusters and fit into a pipeline framework. It enables the programmer to write a series of synchronous functi...
Thomas H. Cormen, Elena Riccio Davidson
185
Voted
PODS
2009
ACM
119views Database» more  PODS 2009»
16 years 1 months ago
Dynamic indexability and lower bounds for dynamic one-dimensional range query indexes
The B-tree is a fundamental external index structure that is widely used for answering one-dimensional range reporting queries. Given a set of N keys, a range query can be answere...
Ke Yi
85
Voted
ICC
2007
IEEE
15 years 6 months ago
LOOFA-PB: A Modified LOOFA Scheduler for Variable-Length Packet Switching
—The LOOFA algorithm is a cell-based scheduler for CIOQ crossbar switches that can guarantee the work-conserving property in a cell-based switch if the crossbar switch works twic...
Afshin Shiravi, Paul S. Min
IWMM
2007
Springer
118views Hardware» more  IWMM 2007»
15 years 6 months ago
Detecting and eliminating memory leaks using cyclic memory allocation
We present and evaluate a new technique for detecting and eliminating memory leaks in programs with dynamic memory allocation. This technique observes the execution of the program...
Huu Hai Nguyen, Martin C. Rinard