Sciweavers

5448 search results - page 301 / 1090
» Breakpoints and Time in Distributed Computations
Sort
View
RTAS
2003
IEEE
15 years 12 months ago
Kernel Support for Open QoS-Aware Computing
Most research on QoS-aware computing considers systems where code is generally partitioned into separately schedulable tasks with associated timing constraints. In sharp contrast ...
Ronghua Zhang, Tarek F. Abdelzaher, John A. Stanko...
EUROPAR
2003
Springer
15 years 12 months ago
Replicated Placements in the Polyhedron Model
Abstract. Loop-carried code placement (LCCP) is able to remove redundant computations that cannot be recognized by traditional code motion techniques. However, this comes possibly ...
Peter Faber, Martin Griebl, Christian Lengauer
CVPR
2011
IEEE
15 years 2 months ago
Radiometric Calibration by Transform Invariant Low-rank Structure
We present a robust radiometric calibration method that capitalizes on the transform invariant low-rank structure of sensor irradiances recorded from a static scene with different...
Joon-Young Lee, Boxin Shi, Yasuyuki Matsushita, In...
SIGMETRICS
2006
ACM
174views Hardware» more  SIGMETRICS 2006»
16 years 18 days ago
Understanding the management of client perceived response time
Understanding and managing the response time of web services is of key importance as dependence on the World Wide Web continues to grow. We present Remote Latency-based Management...
David P. Olshefski, Jason Nieh
DSN
2005
IEEE
16 years 8 days ago
How Resilient are Distributed f Fault/Intrusion-Tolerant Systems?
Fault-tolerant protocols, asynchronous and synchronous alike, make stationary fault assumptions: only a fraction f of the total n nodes may fail. Whilst a synchronous protocol is ...
Paulo Sousa, Nuno Ferreira Neves, Paulo Verí...