Sciweavers

1929 search results - page 199 / 386
» Load Balancing with Memory
Sort
View
FOCS
1989
IEEE
15 years 4 months ago
Randomized Search Trees
We present a randomized strategy for maintaining balance in dynamically changing search trees that has optimal expected behavior. In particular, in the expected case a search or a...
Cecilia R. Aragon, Raimund Seidel
94
Voted
CASES
2003
ACM
15 years 4 months ago
Efficient spill code for SDRAM
Processors such as StrongARM and memory such as SDRAM enable efficient execution of multiple loads and stores in a single instruction. This is particularly useful in connection wi...
V. Krishna Nandivada, Jens Palsberg
115
Voted
CSMR
2010
IEEE
14 years 7 months ago
Utilizing Debug Information to Compact Loops in Large Program Traces
In recent years, dynamic program execution traces have been utilized in an attempt to better understand the runtime behavior of various software systems. The unfortunate reality of...
Del Myers, Margaret-Anne D. Storey, Martin Salois
230
Voted
CL
2012
Springer
13 years 3 months ago
Object swapping challenges: An evaluation of imageSegment
In object-oriented systems, runtime memory is composed of an object graph in which objects refer to other objects. This graph of objects evolves while the system is running. Graph...
Mariano Martinez Peck, Noury Bouraqadi, Sté...
73
Voted
CGO
2008
IEEE
15 years 7 months ago
Latency-tolerant software pipelining in a production compiler
In this paper we investigate the benefit of scheduling non-critical loads for a higher latency during software pipelining. "Noncritical" denotes those loads that have s...
Sebastian Winkel, Rakesh Krishnaiyer, Robyn Sampso...