Sciweavers

132 search results - page 20 / 27
» Local Reasoning about Data Update
Sort
View
POPL
2009
ACM
14 years 8 months ago
A cost semantics for self-adjusting computation
Self-adjusting computation is an evaluation model in which programs can respond efficiently to small changes to their input data by using a change-propagation mechanism that updat...
Ruy Ley-Wild, Umut A. Acar, Matthew Fluet
VLDB
2008
ACM
127views Database» more  VLDB 2008»
14 years 7 months ago
Delay aware querying with Seaweed
Large highly distributed data sets are poorly supported by current query technologies. Applications such as endsystembased network management are characterized by data stored on l...
Dushyanth Narayanan, Austin Donnelly, Richard Mort...
ICS
1999
Tsinghua U.
13 years 11 months ago
An experimental evaluation of tiling and shackling for memory hierarchy management
On modern computers, the performance of programs is often limited by memory latency rather than by processor cycle time. To reduce the impact of memory latency, the restructuring ...
Induprakas Kodukula, Keshav Pingali, Robert Cox, D...
SIROCCO
2004
13 years 8 months ago
Long-Lived Rambo: Trading Knowledge for Communication
Shareable data services providing consistency guarantees, such as atomicity (linearizability), make building distributed systems easier. However, combining linearizability with ef...
Chryssis Georgiou, Peter M. Musial, Alexander A. S...
EAGC
2004
Springer
14 years 26 days ago
Monitoring Message-Passing Parallel Applications in the Grid with GRM and Mercury Monitor
Application monitoring in the grid for parallel applications is hardly supported in recent grid infrastructures. There is a need to visualize the behavior of the program during its...
Norbert Podhorszki, Zoltán Balaton, Gabor G...