822 search results - page 92 / 165 » Contention in shared memory algorithms |
101
click to vote
CORR
2009
Springer
15 years 1 months ago
2009
Springer
Previous work has shown that there are two major complexity barriers in the synthesis of fault-tolerant distributed programs, namely generation of fault-span, the set of states re...
108
Voted
ICIP
2006
IEEE
16 years 5 months ago
2006
IEEE
Images play a very relevant role in our daily life. People now can easily shoot and share pictures thanks to the exponential growth of the portable medias, such as digital cameras...
121
click to vote
ISPDC
2005
IEEE
15 years 9 months ago
2005
IEEE
: Optimization is a healthy field targeted to find efficient solutions and algorithms to solve problems either in the academia and the industry. As the solved problems became harde...
134
Voted
OPODIS
2010
15 years 1 months ago
2010
We explore asynchronous unison in the presence of systemic transient and permanent Byzantine faults in shared memory. We observe that the problem is not solvable under less than s...
132
click to vote
POPL
2009
ACM
15 years 10 months ago
2009
ACM
With the emergence of commodity multicore architectures, exploiting tightly-coupled parallelism has become increasingly important. Functional programming languages, such as Haskel...