4889 search results - page 685 / 978 » A Refactoring Approach to Parallelism |
150
click to vote
KBSE
2007
IEEE
16 years 29 days ago
2007
IEEE
We present a divide-and-conquer method, called DiConic, for automatic addition of failsafe fault-tolerance to distributed programs, where a failsafe program guarantees to meet its...
213
click to vote
AGTIVE
2007
Springer
16 years 26 days ago
2007
Springer
In this article, we propose to use the Discrete EVent system Specification (DEVS) formalism to describe and execute graph transformation control structures. We provide a short rev...
182
click to vote
COCOA
2007
Springer
16 years 26 days ago
2007
Springer
The Two-Sided Crossing Minimization (TSCM) problem calls for minimizing the number of edge crossings of a bipartite graph where the two sets of vertices are drawn on two parallel l...
172
click to vote
CONCUR
2007
Springer
16 years 26 days ago
2007
Springer
Abstract. Reactive Systems `a la Leifer and Milner allow to derive from a reaction semantics definition an LTS equipped with a bisimilarity relation which is a congruence. This th...
156
Voted
EUROPAR
2007
Springer
16 years 25 days ago
2007
Springer
Grid applications need to be fault tolerant, malleable, and migratable. In previous work, we have presented orphan saving, an efficient mechanism addressing these issues for divide...