**Commenced**in January 2007

**Frequency:**Monthly

**Edition:**International

**Paper Count:**7

# Distributed Computing Related Publications

##### 7 Accelerating Side Channel Analysis with Distributed and Parallelized Processing

**Authors:**
Dooho Choi,
Kyunghee Oh

**Abstract:**

Although there is no theoretical weakness in a cryptographic algorithm, Side Channel Analysis can find out some secret data from the physical implementation of a cryptosystem. The analysis is based on extra information such as timing information, power consumption, electromagnetic leaks or even sound which can be exploited to break the system. Differential Power Analysis is one of the most popular analyses, as computing the statistical correlations of the secret keys and power consumptions. It is usually necessary to calculate huge data and takes a long time. It may take several weeks for some devices with countermeasures. We suggest and evaluate the methods to shorten the time to analyze cryptosystems. Our methods include distributed computing and parallelized processing.

**Keywords:**
Distributed Computing,
DPA,
parallelized processing

##### 6 A New Self-stabilizing Algorithm for Maximal 2-packing

**Authors:**
Zhengnan Shi

**Abstract:**

**Keywords:**
Distributed Computing,
Fault tolerance,
graph algorithms,
self-stabilization

##### 5 A Self-stabilizing Algorithm for Maximum Popular Matching of Strictly Ordered Preference Lists

**Authors:**
Zhengnan Shi

**Abstract:**

In this paper, we consider the problem of Popular Matching of strictly ordered preference lists. A Popular Matching is not guaranteed to exist in any network. We propose an IDbased, constant space, self-stabilizing algorithm that converges to a Maximum Popular Matching an optimum solution, if one exist. We show that the algorithm stabilizes in O(n5) moves under any scheduler (daemon).

**Keywords:**
Distributed Computing,
Algorithm,
Fault tolerance,
self-stabilization,
popular matching

##### 4 PeliGRIFF: A Parallel DEM-DLM/FD Method for DNS of Particulate Flows with Collisions

**Authors:**
Anthony Wachs,
Guillaume Vinay,
Gilles Ferrer,
Jacques Kouakou,
Calin Dan,
Laurence Girolami

**Abstract:**

An original Direct Numerical Simulation (DNS) method to tackle the problem of particulate flows at moderate to high concentration and finite Reynolds number is presented. Our method is built on the framework established by Glowinski and his coworkers [1] in the sense that we use their Distributed Lagrange Multiplier/Fictitious Domain (DLM/FD) formulation and their operator-splitting idea but differs in the treatment of particle collisions. The novelty of our contribution relies on replacing the simple artificial repulsive force based collision model usually employed in the literature by an efficient Discrete Element Method (DEM) granular solver. The use of our DEM solver enables us to consider particles of arbitrary shape (at least convex) and to account for actual contacts, in the sense that particles actually touch each other, in contrast with the simple repulsive force based collision model. We recently upgraded our serial code, GRIFF 1 [2], to full MPI capabilities. Our new code, PeliGRIFF 2, is developed under the framework of the full MPI open source platform PELICANS [3]. The new MPI capabilities of PeliGRIFF open new perspectives in the study of particulate flows and significantly increase the number of particles that can be considered in a full DNS approach: O(100000) in 2D and O(10000) in 3D. Results on the 2D/3D sedimentation/fluidization of isometric polygonal/polyedral particles with collisions are presented.

**Keywords:**
Distributed Computing,
Sedimentation,
MPI,
discrete element method,
Particulate flow,
distributed lagrange multiplier/fictitious domain method,
polygonal shape

##### 3 Service-Oriented Architecture for Object- Centric Information Fusion

**Authors:**
Jeffrey A. Dunne,
Kevin Ligozio

**Abstract:**

**Keywords:**
Distributed Computing,
Service-Oriented Architecture,
Data fusion,
SOA

##### 2 An Exploratory Environment for Concurrency Control Algorithms

**Authors:**
Jinhua Guo

**Abstract:**

**Keywords:**
Distributed Computing,
Simulation,
Visualization,
Consistency,
InteractiveSteering

##### 1 Distributed 2-Vertex Connectivity Test of Graphs Using Local Knowledge

**Authors:**
Brahim Hamid,
Bertrand Le Saec,
Mohamed Mosbah

**Abstract:**

The vertex connectivity of a graph is the smallest number of vertices whose deletion separates the graph or makes it trivial. This work is devoted to the problem of vertex connectivity test of graphs in a distributed environment based on a general and a constructive approach. The contribution of this paper is threefold. First, using a preconstructed spanning tree of the considered graph, we present a protocol to test whether a given graph is 2-connected using only local knowledge. Second, we present an encoding of this protocol using graph relabeling systems. The last contribution is the implementation of this protocol in the message passing model. For a given graph G, where M is the number of its edges, N the number of its nodes and Δ is its degree, our algorithms need the following requirements: The first one uses O(Δ×N2) steps and O(Δ×logΔ) bits per node. The second one uses O(Δ×N2) messages, O(N2) time and O(Δ × logΔ) bits per node. Furthermore, the studied network is semi-anonymous: Only the root of the pre-constructed spanning tree needs to be identified.

**Keywords:**
Distributed Computing,
Networks,
Fault-Tolerance,
local knowledge,
graph relabeling systems,
local computations,
message passing system,
vertex connectivity