Parallel and distributed algorithms

Parallel and Distributed Algorithms

The 6th Dagstuhl Seminar on Parallel and Distributed Algorithms was organized by Bruce M. Maggs (Carnegie Mellon University), Ernst W. Mayr (TUMünchen), and Friedhelm Meyer auf der Heide (Paderborn University). It brought together 26 participants from Canada, Germany, Greece, Italy, Italy, Poland, UK, and the USA. The presented talks covered a wide range of topics, like routing, load balancing,...

Parallel and Distributed Algorithms

Parallel and Distributed Algorithms

(i.e., x ∈ U(x) for all x ∈ Ω, y ∈ N(x) whenever x ∈ N(y) and |U(x)| = |U(y)| for all x, y ∈ Ω). The assumption |U(x)| = |U(y)| for all x, y ∈ Ω will simplify the argument. Moreover assume that there is a path from x to y for any pair (x, y) ∈ Ω2. We fix the temperature T . Then the Markov chain (Ω, PT ) has a unique stationary distribution π. a.) Set qT = e − f (x)) T NT with NT = ∑ x∈Ω e − f ...

Parallel and Distributed Algorithms for Constraint Networks Parallel and Distributed Algorithms for Constraint Networks

This paper develops two new algorithms for solving a nite constraint satisfaction problem (FCSP) in parallel. In particular, we give a parallel algorithm for the EREW PRAM model and a distributed algorithm for networks of interconnected processors. Both of these algorithms are derived from arc consistency algorithms which are preprocessing algorithms in general, but can be used to solve an FCSP...

Parallel and Distributed Algorithms in P Systems

Our group’s recent quest has been to use P systems to model parallel and distributed algorithms. Several framework extensions are recalled or detailed, in particular, modular composition with information hiding, complex symbols, generic rules, reified cell IDs, asynchronous operational modes, asynchronous complexity. We motivate our proposals via P system models of several well-known distribute...