21 search results - page 1 / 5 » A Formal Reduction for Lock-Free Parallel Algorithms |
CAV
2004
Springer
13 years 10 months ago
2004
Springer
SCP
2000
13 years 4 months ago
2000
An extension of the -calculus called BS is introduced as a formal basis for functional languages expressing bulk synchronous parallel algorithms. A con uence result is shown. The ...
TCS
2010
13 years 2 months ago
2010
We consider a graph-theoretical formalization of the process of gene assembly in ciliates introduced in Ehrenfeucht et al (2003), where a gene is modeled as a signed graph. The ge...
SPAA
2006
ACM
13 years 10 months ago
2006
ACM
Tree contraction algorithms, whose idea was first proposed by Miller and Reif, are important parallel algorithms to implement efficient parallel programs manipulating trees. Desp...
ENTCS
2007
13 years 4 months ago
2007
Formal sequentialization is introduced as a rewriting process for the reduction of parallelism and internal communication statements of distributed imperative programs. It constru...