3053 search results - page 410 / 611 » Performance of Generative Programming Based Protocol Impleme... |
141
Voted
VL
2005
IEEE
15 years 9 months ago
2005
IEEE
In 1995, Boehm predicted that by 2005, there would be “55 million performers” of “end user programming” in the United States. The original context and method which generat...
156
Voted
SIGCOMM
2005
ACM
15 years 9 months ago
2005
ACM
This paper introduces a lightweight, scalable and accurate framework, called Meridian, for performing node selection based on network location. The framework consists of an overla...
130
Voted
POPL
2010
ACM
16 years 1 months ago
2010
ACM
We address the verification problem of finite-state concurrent programs running under weak memory models. These models capture the reordering of program (read and write) operation...
122
Voted
PASTE
2004
ACM
15 years 9 months ago
2004
ACM
A context-sensitive analysis is an analysis in which program elements are assigned sets of properties that depend upon the context in which they occur. For analyses on imperative ...
146
Voted
PPOPP
1999
ACM
15 years 8 months ago
1999
ACM
Divide and conquer algorithms are a good match for modern parallel machines: they tend to have large amounts of inherent parallelism and they work well with caches and deep memory...