Sciweavers

1816 search results - page 22 / 364
» Trace oblivious computation
Sort
View
FAST
2007
13 years 11 months ago
//TRACE: Parallel Trace Replay with Approximate Causal Events
//TRACE1 is a new approach for extracting and replaying traces of parallel applications to recreate their I/O behavior. Its tracing engine automatically discovers inter-node data ...
Michael P. Mesnier, Matthew Wachs, Raja R. Sambasi...
EGH
2009
Springer
13 years 7 months ago
Efficient ray traced soft shadows using multi-frusta tracing
Ray tracing has long been considered to be superior to rasterization because its ability to trace arbitrary rays, allowing it to simulate virtually any physical light transport ef...
Carsten Benthin, Ingo Wald
VEE
2009
ACM
246views Virtualization» more  VEE 2009»
14 years 4 months ago
Tracing for web 3.0: trace compilation for the next generation web applications
Today’s web applications are pushing the limits of modern web browsers. The emergence of the browser as the platform of choice for rich client-side applications has shifted the ...
Mason Chang, Edwin W. Smith, Rick Reitmaier, Micha...
SPAA
2006
ACM
14 years 3 months ago
Semi-oblivious routing
We initiate the study of semi-oblivious routing, a relaxation of oblivious routing which is first introduced by R¨acke and led to many subsequent improvements and applications. ...
Mohammad Taghi Hajiaghayi, Robert D. Kleinberg, To...
ISCAPDCS
2003
13 years 11 months ago
N-Tuple Compression: A Novel Method for Compression of Branch Instruction Traces
Branch predictors and processor front-ends have been the focus of a number of computer architecture studies. Typically they are evaluated separately from other components using tr...
Aleksandar Milenkovic, Milena Milenkovic, Jeffrey ...