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 ...

The performance of collective communication operations is known to have a significant impact on the scalability of some applications. Indeed, the global, synchronous nature of some collective operations directly implies that they will become the bottleneck when scaling to hundreds of thousands of nodes. This fact has led many researchers to try to improve the efficiency of collective operations...

Non-blocking concurrent algorithms offer significant performance advantages, but are very difficult to construct and verify. In this paper, we describe our experience in using SPIN to check linearizability of non-blocking concurrent data-structure algorithms that manipulate dynamically allocated memory. In particular, this is the first work that describes a method for checking linearizability w...

In this paper we present a new approach for building non-blocking optical MINs on building blocks of given size. The network constructed by our approach is self-routing and has Oðlog2 NÞ propagation delay for size N N . The maximum signal loss and crosstalk are compared to those of the widely used crossbar network with the switch complexity of OðN Þ. The proposed approach is a good choice for c...

We propose a framework for a geometric theory of hybrid systems. Given a deterministic, non-blocking hybrid system, we introduce the notion of its hybrifold with the associated hybrid flow on it. This enables us to study hybrid systems from a global geometric perspective as (generally non-smooth) dynamical systems. This point of view is adopted in studying the Zeno phenomenon. We show that it i...

In thiswork,we have presented non-blocking checkpointing and recovery algorithms for bidirectional networks. We have deviated from the conventional approach of taking first temporary checkpoints and then converting them to permanent ones by processes (as followed by any coordinated checkpointing scheme). Thus, the proposed coordinated checkpointing algorithm allows processes to take permanent c...

In our previous work [1], we introduced performance simulation as an instrument to verify hypotheses on causality between locally and spatially distant performance phenomena without altering the application itself. This is accomplished by modifying mpi event traces and using them to simulate hypothetical message-passing behavior. Here, we present enhancements to our approach, which was previous...

Refinement is the notion of development between formal specifications. For specifications given in a relational formalism, downward and upward simulations are the standard method to verify that a refinement holds, their usefulness based upon their soundness and joint completeness. This is known to be true for total relational specifications and has been claimed to hold for partial relational sp...

Concurrent call/return communication (CCRC) allows programmers to conveniently express a communication pattern where a sender invokes a remote operation and uses the result to continue its computation. The blocking semantics requires context switching for eecient utilization of computation resource. We present a compilation technique which allows programmers to use CCRC with the cost of non-blo...

Collective operations improve the performance and reduce code complexity of many applications parallelized with the messagepassing interface (MPI) paradigm. In this article, we will investigate the impact of load imbalance on the performance of collective operations and possibility for hiding parallel overhead caused by a collective communication pattern, by overlapping the communication with c...