Related papers: PALS: Plesiochronous and Locally Synchronous Syste…
Dynamically available total-order broadcast (TOB) protocols tolerate fluctuating participation, e.g., as high as 99% of their participants going offline, which is especially useful in permissionless blockchain environments. However,…
The simulation of large ensembles of particles is usually parallelized by partitioning the domain spatially and using message passing to communicate between the processes handling neighboring subdomains. The particles are represented as…
Context: Concurrent objects with asynchronous messaging are an increasingly popular way to structure highly available, high performance, large-scale software systems. To ensure data-consistency and support synchronization between objects…
In this paper we consider a network of processors aiming at cooperatively solving linear programming problems subject to uncertainty. Each node only knows a common cost function and its local uncertain constraint set. We propose a…
We revisit the approach to Byzantine fault-tolerant clock synchronization based on approximate agreement introduced by Lynch and Welch. Our contribution is threefold: (1) We provide a slightly refined variant of the algorithm yielding…
We consider a parallel computational model that consists of $P$ processors, each with a fast local ephemeral memory of limited size, and sharing a large persistent memory. The model allows for each processor to fault with bounded…
The phase-space of a simple synchronization model is thoroughly investigated. The model considers two-mode stochastic oscillators, coupled through a pulse-like interaction controlled by simple optimization rules. A complex phase space is…
Synchronization of coupled continuous-time linear systems is studied in a general setting. For identical neutrally-stable linear systems that are detectable from their outputs, it is shown that a linear output feedback law exists under…
Utilizing on-chip caches in embedded multiprocessor-system-on-a-chip (MPSoC) based systems is critical from both performance and power perspectives. While most of the prior work that targets at optimizing cache behavior are performed at…
Isomorphic (sparse) collective communication is a form of collective communication in which all involved processes communicate in small, identically structured neighborhoods of other processes. Isomorphic neighborhoods are defined via an…
The K2K (KEK E362) long-baseline neutrino oscillations experiment requires synchronization of clocks with ~100 nsec accuracy at the near and far detector sites (KEK and Super-Kamiokande, respectively), which are separated by 250 km. The…
We study the global synchronization of hierarchically-organized Stuart-Landau oscillators, where each subsystem consists of three oscillators with activity-dependent couplings. We consider all possible coupling signs between the three…
A rationale is provided for the emergence of synchronization in a system of coupled oscillators in a stick-slip motion. The single oscillator has a limit cycle in a region of the state space for each parameter set beyond the supercritical…
In an overloaded FaaS cluster, individual worker nodes strain under lengthening queues of requests. Although the cluster might be eventually horizontally-scaled, adding a new node takes dozens of seconds. As serving applications are tuned…
Synchronization is a widespread phenomenon observed across natural and artificial networked systems. It often manifests itself by clusters of units exhibiting coincident dynamics. These clusters are a direct consequence of the organization…
Clocks are a central part of many computing paradigms, and are mainly used to synchronise the delicate operation of switching, necessary to drive modern computational processes. Unfortunately, this synchronisation process is reaching a…
Online local-life service platforms provide services like nearby daily essentials and food delivery for hundreds of millions of users. Different from other types of recommender systems, local-life service recommendation has the following…
We present two related anytime algorithms for control of nonlinear systems when the processing resources available are time-varying. The basic idea is to calculate tentative control input sequences for as many time steps into the future as…
We augment existing generator-side primary frequency control with load-side control that are local, ubiquitous, and continuous. The mechanisms on both the generator and the load sides are decentralized in that their control decisions are…
We study the spatio-temporal behavior of simple coupled map lattices with periodic boundary conditions. The local dynamics is governed by two maps, namely, the sine circle map and the logistic map respectively. It is found that even though…