Search Results - "Computer Science - Distributed"

SPC5: an efficient SpMV framework vectorized using ARM SVE and x86 AVX-512 by Regnault, Evann, Bramas, Bérenger

“…The sparse matrix/vector product (SpMV) is a fundamental operation in scientific computing. Having access to an efficient SpMV implementation is therefore…”
Get full text

Introduction to local certification by Feuilloley, Laurent

“…A distributed graph algorithm is basically an algorithm where every node of a graph can look at its neighborhood at some distance in the graph and chose its…”
Get full text

Impure Simplicial Complexes: Complete Axiomatization by Randrianomentsoa, Rojo, van Ditmarsch, Hans, Kuznets, Roman

“…Combinatorial topology is used in distributed computing to model concurrency and asynchrony. The basic structure in combinatorial topology is the simplicial…”
Get full text

Regular Model Checking Upside-Down: An Invariant-Based Approach by Esparza, Javier, Raskin, Michael, Welzel-Mohr, Christoph

“…Regular model checking is a technique for the verification of infinite-state systems whose configurations can be represented as finite words over a suitable…”
Get full text

Reducing the memory usage of Lattice-Boltzmann schemes with a DWT-based compression by Flint, Clément, Helluy, Philippe

“…This paper presents a new solution to address the challenge of increasing memory usage in high-performance computing simulations of Lattice-Bolzmann or…”
Get full text

Synchronizability of Communicating Finite State Machines is not Decidable by Finkel, Alain, Lozes, Etienne

“…A system of communicating finite state machines is synchronizable if its send trace semantics, i.e.the set of sequences of sendings it can perform, is the same…”
Get full text

Computation Against a Neighbour: Addressing Large-Scale Distribution and Adaptivity with Functional Programming and Scala by Audrito, Giorgio, Casadei, Roberto, Damiani, Ferruccio, Viroli, Mirko

“…Recent works in contexts like the Internet of Things (IoT) and large-scale Cyber-Physical Systems (CPS) propose the idea of programming distributed systems by…”
Get full text

Time-Fluid Field-Based Coordination through Programmable Distributed Schedulers by Pianini, Danilo, Casadei, Roberto, Viroli, Mirko, Mariani, Stefano, Zambonelli, Franco

“…Emerging application scenarios, such as cyber-physical systems (CPSs), the Internet of Things (IoT), and edge computing, call for coordination approaches…”
Get full text

Survey on Parameterized Verification with Threshold Automata and the Byzantine Model Checker by Konnov, Igor, Lazić, Marijana, Stoilkovska, Ilina, Widder, Josef

“…Threshold guards are a basic primitive of many fault-tolerant algorithms that solve classical problems in distributed computing, such as reliable broadcast,…”
Get full text

Modularising Verification Of Durable Opacity by Bila, Eleni, Derrick, John, Doherty, Simon, Dongol, Brijesh, Schellhorn, Gerhard, Wehrheim, Heike

“…Non-volatile memory (NVM), also known as persistent memory, is an emerging paradigm for memory that preserves its contents even after power loss. NVM is widely…”
Get full text

Space-Fluid Adaptive Sampling by Self-Organisation by Casadei, Roberto, Mariani, Stefano, Pianini, Danilo, Viroli, Mirko, Zambonelli, Franco

“…A recurrent task in coordinated systems is managing (estimating, predicting, or controlling) signals that vary in space, such as distributed sensed data or…”
Get full text

Optimal Space Lower Bound for Deterministic Self-Stabilizing Leader Election Algorithms by Blin, Lélia, Feuilloley, Laurent, Bouder, Gabriel Le

“…Given a boolean predicate$\Pi$on labeled networks (e.g., proper coloring, leader election, etc.), a self-stabilizing algorithm for$\Pi$is a distributed…”
Get full text

Worst-Case Input Generation for Concurrent Programs under Non-Monotone Resource Metrics by Pham, Long, Hoffmann, Jan

“…Worst-case input generation aims to automatically generate inputs that exhibit the worst-case performance of programs. It has several applications, and can,…”
Get full text

Field-based Coordination with the Share Operator by Audrito, Giorgio, Beal, Jacob, Damiani, Ferruccio, Pianini, Danilo, Viroli, Mirko

“…Field-based coordination has been proposed as a model for coordinating collective adaptive systems, promoting a view of distributed computations as functions…”
Get full text

Witness structures and immediate snapshot complexes by Kozlov, Dmitry N.

“…In this paper we introduce and study a new family of combinatorial simplicial complexes, which we call immediate snapshot complexes. Our construction and…”
Get full text

Synthesis of Orchestrations and Choreographies: Bridging the Gap between Supervisory Control and Coordination of Services by Basile, Davide, ter Beek, Maurice H., Pugliese, Rosario

“…We present a number of contributions to bridging the gap between supervisory control theory and coordination of services in order to explore the frontiers…”
Get full text

Directed Homotopy in Non-Positively Curved Spaces by Goubault, Eric, Mimram, Samuel

“…A semantics of concurrent programs can be given using precubical sets, in order to study (higher) commutations between the actions, thus encoding the…”
Get full text

Characterization and Derivation of Heard-Of Predicates for Asynchronous Message-Passing Models by Shimi, Adam, Hurault, Aurélie, Queinnec, Philippe

“…In distributed computing, multiple processes interact to solve a problem together. The main model of interaction is the message-passing model, where processes…”
Get full text

Gathering on a circle with limited visibility by anonymous oblivious robots by Giuseppe A. Di Luna, Ryuhei Uehara, Giovanni Viglietta, Yukiko Yamauchi

Get full text

Controlling a random population by Colcombet, Thomas, Fijalkow, Nathanaël, Ohlmann, Pierre

“…Bertrand et al. introduced a model of parameterised systems, where each agent is represented by a finite state system, and studied the following control…”
Get full text