This work addresses the analysis and validation of modular CHP specifications for asynchronous circuits, using formalisms and tools coming from the field of distributed software. CHP specifications are translated into an intermediate format (IF) based on communicating extended finite state machines. They are then validated using the IF environment, which provides model checking and bi-simulatio...

Byzantine fault tolerance is important because it can be used to implement highly-available systems that tolerate arbitrary behaviorfrom faulty components. This paper presents a detailed performance evaluation of BFT, a state-machine replication algorithm that tolerates Byzantine faults in asynchronous systems. Our results contradict the common belief that Byzantine fault tolerance is too slow ...

Reversible computing is a concept reflecting physical reversibility. Until now several reversible systems have been investigated. In a series of papers Kenichi Morita defines the rotary element RE, that is a reversible logic element. By reversibility, he understands [2] that ’every computation process can be traced backward uniquely from the end to the start. In other words, they are backward d...

This paper presents generic model of hybrid power system consisting in a combined solution one wind turbine with asynchronous generator and on hydro generator with synchronous machine. This technology was developed by to reduce the cost of supplying electricity in remote communities. The optimal wind penetration (installed wind capacity/peak electrical demand) for this system depends on the sit...

Checkpointing overhead is a major obstacle for the effectiveness of Time Warp parallel discrete event simulators. Semi-asynchronous checkpointing is a recent solution to tackle this obstacle for Time Warp simulations on distributed memory systems based on Myrinet. In this solution, checkpoint operations are offloaded from the host CPU and are charged to a DMA engine on board of Myrinet network ...

This paper proposes the model of the High Level Parallel Compositions or CPANs to communication patterns / interaction Pipeline and TreeDV for implementing a sorting algorithm by Structured Parallel Programming approach based on the concept of Parallel Objects. The CPANS TreeDV and PipeLine are displayed using the paradigm of object orientation and sorting problem is solved using two different ...

With the recent proliferation of large-scale learning problems, there have been a lot of interest on distributed machine learning algorithms, particularly those that are based on stochastic gradient descent (SGD) and its variants. However, existing algorithms either suffer from slow convergence due to the inherent variance of stochastic gradients, or have a fast linear convergence rate but at t...

This paper describes the results of simulation experiments performed on a suite of learning algorithms. We focus on games in network contexts. These are contexts Ž . Ž . in which 1 agents have very limited information about the game and 2 play can be extremely asynchronous. There are many proposed learning algorithms in the literature. We choose a small sampling of such algorithms and use numer...

Atomic broadcast is an important communication primitive often used to implement state-machine replication. Despite the large number of atomic broadcast algorithms proposed in the literature, few papers have discussed how to turn these algorithms into efficient executable protocols. This paper focuses on a class of atomic broadcast algorithms based on Paxos, with its corresponding desirable pro...

A bstract In order to generate colloquial language within the computational lin­ guistics paradigm the problems o f co-occurrence must be solved. As of yet research on co-occurrence has mostly focused on problems of syntax and selectional restrictions to describe the contextual relation within the sentence. Collocations and idioms have been neatly put aside as a unified problem to be dealt with...