Massively parallel fault tolerant computations on syntactical patterns

Massively parallel fault tolerant computations on syntactical patterns

Distributed and fault-tolerant thread management for parallel computations

Application of distributed computations becomes more attractive with the advances in computer networks. Lemick is an environment for automation of real-time distributed programming expressed in the terms of more traditional multithreaded programming. This paper gives a brief introduction into the implementation of Lemick distributed threads. A focus is made on the mechanisms employed to support...

Towards Fault-Tolerant Massively Multiagent Systems

In order to construct and deploy massively multiagent systems, we must address one of the fundamental issues of distributed systems, the possibility of partial failures. In this paper, we discuss the issues and propose an approach for fault-tolerance of massively multiagent systems. The starting idea is the application of replication strategies to agents. As criticality of agents may evolve dur...

Verifying Massively Data Parallel Multi-Stage Computations

Data parallel, multi-stage computations occurring on a massive scale are difficult to verify. With the recent advent of various parallel computing platforms [2, 4], and the resultant increased availability and accessibility of significant computational resources at a relatively economical price, more and more users are going to take advantage of the computational resources offered by the cloud ...

On the Cost of Task Re-Scheduling in Fault-Tolerant Task Parallel Computations

Fault tolerance is still an “hot” topic in the context of Grid computing. There exist several solutions and techniques to face this issue, some of them inherited from the fault tolerance research, some other introduced in the context of Grid computing. Anyway, poor work has been done in providing such fault tolerance strategies in a lightweight, scalable and analyzable way. In this technical re...