Sciweavers

1222 search results - page 151 / 245
» Mistreatment-resilient distributed caching
Sort
View
SPAA
2010
ACM
13 years 9 months ago
A universal construction for wait-free transaction friendly data structures
Given the sequential implementation of any data structure, we show how to obtain an efficient, wait-free implementation of that data structure shared by any fixed number of proces...
Phong Chuong, Faith Ellen, Vijaya Ramachandran
TOOLS
2010
IEEE
13 years 7 months ago
Visualizing Dynamic Metrics with Profiling Blueprints
While traditional approaches to code profiling help locate performance bottlenecks, they offer only limited support for removing these bottlenecks. The main reason is the lack of v...
Alexandre Bergel, Romain Robbes, Walter Binder
ICDE
1996
IEEE
178views Database» more  ICDE 1996»
14 years 10 months ago
Query Folding
Query folding refers to the activity of determining if and how a query can be answered using a given set of resources, which might be materialized views, cached results of previou...
Xiaolei Qian
EUROPAR
2007
Springer
14 years 3 months ago
Locality Optimized Shared-Memory Implementations of Iterated Runge-Kutta Methods
Iterated Runge-Kutta (IRK) methods are a class of explicit solution methods for initial value problems of ordinary differential equations (ODEs) which possess a considerable poten...
Matthias Korch, Thomas Rauber
MM
2004
ACM
107views Multimedia» more  MM 2004»
14 years 2 months ago
Collusion attack on a multi-key secure video proxy scheme
In ACM Multimedia’2002, a video proxy scheme was proposed for secure video delivery. In the scheme, a video is cached in proxies in encrypted form so that it remains nondisclose...
Yongdong Wu, Feng Bao