This paper studies distributed estimation and inference for a general statistical problem with convex loss that could be non-differentiable. For the purpose of efficient computation, we restrict ourselves to stochastic first-order optimization, which enjoys low per-iteration complexity. To motivate proposed method, first investigate theoretical properties straightforward Divide-and-Conquer Stoc...

In distributed applications, a group of application processes is established and the processes in the group communicate with each other. i.e. intra-group communication. Here, messages have to be atomically delivered to all the destinations and be causally ordered. In addition, the processes send messages to any subset of the group at any time. This paper presents an intra-group communication pr...

In distributed applications, group communication among multiple objects is required. Group communication protocols provide a group of multiple objects with reliable data transmission service, i.e. messages are delivered to all the destination objects in the group in a well-de ned order. In the distributed applications, there are two kinds of messages, i.e. requests and responses. Many group com...

It is well known that through code instrumentation, a distributed system’s finite execution can generate a finite trace as a partially ordered set of events. We motivate the need to use LTL model-checking on sequences and not on traces as defined by Diekert and Gastin, to validate distributed control systems executions, abstracted by such traces, and present an efficient symbolic algorithm to d...

During the last two decades the design and development of total order (TO) communications has been one of the main research topics in dependable distributed computing. The huge amount of research work has produced several TO specifications and a wide variety of TO implementations with different guarantees whose differences are often left hidden or unclear. This paper presents a systematic class...

This paper proposes a deadlock prevention algorithm for Distributed Object Oriented Systems (DOOS) based on the popular resource ordering technique. In distributed object oriented system, objects are the resources requested by the transactions. Though resource-ordering technique is not new, novelty of the proposed deadlock prevention algorithm lies in exploiting the relationships among objects ...

Networks of cooperating peers are a new exciting paradigm for evaluating queries in a distributed environment. In this scenario, a query originated at a peer propagates through the network, and the overall result is obtained by aggregating those returned by the peers involved in the evaluation. In this paper we consider the relevant case of preference queries, in which the user is interested in...