We study the min-max problem in factor graphs, which seeks the assignment that minimizes the maximum value over all factors. We reduce this problem to both min-sum and sum-product inference, and focus on the later. In this approach the min-max inference problem is reduced to a sequence of Constraint Satisfaction Problems (CSP), which allows us to solve the problem by sampling from a uniform dis...

In the k-set agreement problem, each process (in a set of n processes) proposes a value and has to decide a proposed value in such a way that at most k different values are decided. While this problem can easily be solved in asynchronous systems prone to t process crashes when k > t, it cannot be solved when k ≤ t. Since several years, the failure detector-based approach has been investigated t...

We motivate and present a simple measure of eeciency for distributed data structures called \bottleneck complexity". We investigate a distributed counter as a case study for our measure of eeciency. A distributed counter allows each processor in an asynchronous message passing network to access the counter value and increment it. The bottleneck complexity has a lower bound of (k) on an asynchro...

The k-set agreement problem is a coordination problem where each process is assumed to propose a value and each process that does not crash has to decide a value such that each decided value is a proposed value and at most k different values are decided. While it can always be solved in synchronous systems, k-set agreement has no solution in asynchronous send/receive message-passing systems whe...

This paper presents eecient ways to implement one-to-all scatter communication on k-ary n-cubes with multidestination message-passing. Earlier researchers have applied multidestination message-passing to support non-personalized communications. In this paper, for the rst time in the literature, we demonstrate that multidestina-tion message-passing can also be used to support eecient personalize...

In this paper, we address the problem of k-out-of-! exclusion, a generalization of the mutual exclusion problem, in which there are ! units of a shared resource, and any process can request up to k units (1 ≤ k ≤ !). We propose the first deterministic self-stabilizing distributed k-out-of-! exclusion protocol in message-passing systems for asynchronous oriented tree networks which assumes bound...

In this paper, we address the problem of k-out-of-l exclusion, a generalization of the mutual exclusion problem, in which there are l units of a shared resource, and any process can request up to k units (1 ≤ k ≤ l). We propose the first deterministic self-stabilizing distributed k-out-of-l exclusion protocol in message-passing systems for asynchronous oriented tree networks which assumes bound...

In this paper, we address the problem of k-out-of-l Exclusion, a generalization of the mutual exclusion problem, in which there are l units of a shared resource, and any process can request up to k units (1 ≤ k ≤ l). We propose the first deterministic self-stabilizing distributed k-out-of-l Exclusion protocol in message-passing systems for asynchronous oriented tree networks which assumes bound...