Sciweavers

822 search results - page 92 / 165
» Contention in shared memory algorithms
Sort
View
96
Voted
CORR
2009
Springer
74views Education» more  CORR 2009»
15 years 9 days ago
Parallelizing Deadlock Resolution in Symbolic Synthesis of Distributed Programs
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...
Fuad Abujarad, Borzoo Bonakdarpour, Sandeep S. Kul...
ICIP
2006
IEEE
16 years 4 months ago
Efficient Saliency-Based Repurposing Method
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...
Olivier Le Meur, Xavier Castellani, Patrick Le Cal...
ISPDC
2005
IEEE
15 years 8 months ago
New Challenges in Parallel Optimization
: 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...
Enrique Alba
OPODIS
2010
15 years 11 days ago
Self-stabilizing Byzantine Asynchronous Unison,
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...
Swan Dubois, Maria Gradinariu Potop-Butucaru, Mikh...
126
Voted
POPL
2009
ACM
15 years 9 months ago
Low-pain, high-gain multicore programming in Haskell: coordinating irregular symbolic computations on multicore architectures
With the emergence of commodity multicore architectures, exploiting tightly-coupled parallelism has become increasingly important. Functional programming languages, such as Haskel...
Abdallah Al Zain, Kevin Hammond, Jost Berthold, Ph...