1257 search results - page 176 / 252 » Near-Optimal Scheduling of Distributed Algorithms |
EUROPAR
2008
Springer
14 years 11 months ago
2008
Springer
Cache affinity between a process and a processor is observed when the processor cache has accumulated some amount of the process state, i.e., data or instructions. Cache affinity i...
PLDI
2006
ACM
15 years 4 months ago
2006
ACM
In order to generate high-quality code for modern processors, a compiler must aggressively schedule instructions, maximizing resource utilization for execution efficiency. For a ...
SIGMETRICS
2005
ACM
15 years 3 months ago
2005
ACM
In addition to providing small mean response times, modern applications seek to provide users predictable service and, in some cases, Quality of Service (QoS) guarantees. In order...
PODC
2009
ACM
15 years 10 months ago
2009
ACM
In the interference scheduling problem, one is given a set of n communication requests described by pairs of points from a metric space. The points correspond to devices in a wire...
CODES
2011
IEEE
13 years 9 months ago
2011
IEEE
Reliability is a major requirement for most safety-related systems. To meet this requirement, fault-tolerant techniques such as hardware replication and software re-execution are ...