Data transfer and staging services are common components in Grid-based, or more generally, in service-oriented applications. Security mechanisms play a central role in such services, especially when they are deployed in sensitive application fields like e-health. The adoption of WS-Security and related standards to SOAP-based transfer services is, however, problematic as a straightforward adopt...

Overlapping computation and communication, not only pointto-point but also collective communications, is an important technique to improve the performance of parallel programs. Since the current nonblocking collective communications have been mostly implemented using an extra thread to progress communication, they have extra overhead due to thread scheduling and context switching. In this paper...

There are two approaches to reduce the overhead associated with coordinated checkpointing: )rst is to minimize the number of synchronization messages and the number of checkpoints; the other is to make the checkpointing process non-blocking. In our previous work (IEEE Parallel Distributed Systems 9 (12) (1998) 1213), we proved that there does not exist a non-blocking algorithm which forces only...

We present a formal connection between supervisory control theory in the field of control engineering and reactive synthesis in the field of formal methods. We focus on the case of fully-observed discrete-event systems that are controlled by a single controller/supervisor in order to achieve a safety specification and a non-blocking specification. The connection is shown by a reduction of the c...

We present a simple library which equips MPI implementations with truly asynchronous non-blocking point-to-point operations, and which is independent of the underlying communication infrastructure. It utilizes the MPI profiling interface (PMPI) and the MPI_THREAD_MULTIPLE thread compatibility level, and works with current versions of Intel MPI, Open MPI, MPICH2, MVAPICH2, Cray MPI, and IBM MPI....

We define and study a new approach to the implementability of timed automata, where the semantics is perturbed by imprecisions and finite frequency of the hardware. In order to circumvent these effects, we introduce parametric shrinking of clock constraints, which corresponds to tightening these. We propose symbolic procedures to decide the existence of (and then compute) parameters under which...

Atomic Broadcast and Atomic Commitment are fundamental problems that have to be solved when managing distributed/replicated data. This short note aims at showing that solutions to these problems can benefit from results associated with the Consensus problem. Such an approach helps gain a better insight into distributed/replicated data management problems. More precisely, this note addresses one...

We present a mechanism based on Chandra and Toueg unreliable failure detectors model. This mechanism can be used as building block for distributed systems running on Internet and requiring a non-blocking agreement between their components. The protocol we propose tolerates both local participants and groups of participants' failures in a large-scale and asynchronous environment prone to failures.

Transactional memory (TM) is an inherently optimistic abstraction: it allows concurrentprocesses to execute sequences of shared-data accesses (transactions) speculatively, with anoption of aborting them in the future. Early TM designs avoided using locks and relied onnon-blocking synchronization to ensure obstruction-freedom: a transaction that encounters nostep contention is no...

We study the π-calculus, enriched with pairing and non-blocking input, and define a notion of type assignment that uses the type constructor →. We encode the circuits of the calculus X into this variant of π, and show that all reduction (cut-elimination) and assignable types are preserved. Since X enjoys the Curry-Howard isomorphism for Gentzen’s calculus LK, this implies that all proofs in LK ...