Characterization of message-passing overhead on the AP3000 multicomputer

2001 ◽  
Author(s):  
J. Tourino ◽  
R. Doallo
Keyword(s):  
Message Passing

scholarly journals Characterization of MPI Communication Primitives on a Heterogeneous Cluster

2009 ◽  
Vol 6 (2) ◽  
pp. 23
Author(s):  
Siti Arpah Ahmad ◽  
Mohamed Faidz Mohamed Said ◽  
Norazan Mohamed Ramli ◽  
Mohd Nasir Taib
Keyword(s):  
Message Passing ◽  
High Performance ◽  
Data Transfer ◽  
The Other ◽  
Small Cluster ◽  
Heterogeneous Cluster ◽  
Processing Power ◽  
Basic Performance ◽  
Point To Point

This paper focuses on the performance of basic communication primitives, namely the overlap of message transfer with computation in the point-to-point communication within a small cluster of four nodes. The mpptest has been implemented to measure the basic performance of MPI message passing routines with a variety of message sizes. The mpptest is capable of measuring performance with many participating processes thus exposing contention and scalability problems. This enables programmers to select message sizes in order to isolate and evaluate sudden changes in performance. Investigating these matters is interesting in that non-blocking calls have the advantage of allowing the system to schedule communications even when many processes are running simultaneously. On the other hand, understanding the characteristics of computation and communication overlap is significant, because high- performance kernels often strive to achieve this, since it is both advantageous with respect to data transfer and latency hiding. The results indicate that certain overlap sizes utilize greater node processing power either in blocking send and receive operations or non-blocking send and receive operations. The results have elucidated a detailed MPI characterization of the performance regarding the overlap of message transfer with computation in a small cluster system. 

A unifying type-theoretic framework for objects

1995 ◽  
Vol 5 (4) ◽  
pp. 593-635 ◽  
Author(s):  
Martin Hofmann ◽  
Benjamin Pierce
Keyword(s):  
Message Passing ◽  
Object Oriented ◽  
Object Oriented Programming ◽  
Theoretic Characterization ◽  
Abstract Framework

AbstractWe give a direct type-theoretic characterization of the basic mechanisms of object-oriented programming, including objects, methods, message passing, and subtyping, by introducing an explicit constructor for object types and suitable introduction, elimination, and equality rules. The resulting abstract framework provides a basis for justifying and comparing previous encodings of objects based on recursive record types (Cardelli, 1984; Cardelli, 1992; Bruce, 1994; Cook et al., 1990; Mitchell, 1990a) and encodings based on existential types (Pierce & Turner, 1994).

scholarly journals Liveness in broadcast networks

Computing ◽  
2021 ◽  
Author(s):  
Peter Chini ◽  
Roland Meyer ◽  
Prakash Saivasan
Keyword(s):  
Model Checking ◽  
Polynomial Time ◽  
Message Passing ◽  
Linear Time ◽  
Polynomial Time Algorithm ◽  
Time Algorithm ◽  
Final State ◽  
Broadcast Network ◽  
Broadcast Networks

AbstractWe study liveness and model checking problems for broadcast networks, a system model of identical clients communicating via message passing. The first problem that we consider is Liveness Verification. It asks whether there is a computation such that one clients visits a final state infinitely often. The complexity of the problem has been open. It was shown to be $$\texttt {P}$$ P -hard but in $$\texttt {EXPSPACE}$$ EXPSPACE . We close the gap by a polynomial-time algorithm. The latter relies on a characterization of live computations in terms of paths in a suitable graph, combined with a fixed-point iteration to efficiently check the existence of such paths. The second problem is Fair Liveness Verification. It asks for a computation where all participating clients visit a final state infinitely often. We adjust the algorithm to also solve fair liveness in polynomial time. Both problems can be instrumented to answer model checking questions for broadcast networks against linear time temporal logic specifications. The first problem in this context is Fair Model Checking. It demands that for all computations of a broadcast network, all participating clients satisfy the specification. We solve the problem via the Vardi–Wolper construction and a reduction to Liveness Verification. The second problem is Sparse Model Checking. It asks whether each computation has a participating client that satisfies the specification. We reduce the problem to Fair Liveness Verification.

scholarly journals Towards a Theory of Regular MSC Languages

1999 ◽  
Vol 6 (52) ◽  
Author(s):  
Jesper G. Henriksen ◽  
Madhavan Mukund ◽  
K. Narayan Kumar ◽  
P. S. Thiagarajan
Keyword(s):  
Message Passing ◽  
Finitely Generated ◽  
Message Sequence Charts ◽  
Proper Subclass ◽  
Finite State ◽  
Sequence Graph ◽  
System Requirements ◽  
Sequential Processes ◽  
Theoretic Characterization

Message Sequence Charts (MSCs) are an attractive visual formalism<br /> widely used to capture system requirements during the early<br />design stages in domains such as telecommunication software. It is<br />fruitful to have mechanisms for specifying and reasoning about <br />collections of MSCs so that errors can be detected even at the requirements<br /> level. We propose, accordingly, a notion of regularity for <br />collections of MSCs and explore its basic properties. In particular, we<br />provide an automata-theoretic characterization of regular MSC <br />languages in terms of finite-state distributed automata called bounded<br />message-passing automata. These automata consist of a set of <br />sequential processes that communicate with each other by sending and<br />receiving messages over bounded FIFO channels. We also provide a<br />logical characterization in terms of a natural monadic second-order<br />logic interpreted over MSCs.<br />A commonly used technique to generate a collection of MSCs is<br />to use a Message Sequence Graph (MSG). We show that the class of<br />languages arising from the so-called locally synchronized MSGs constitute<br /> a proper subclass of the languages which are regular in our sense.<br />In fact, we characterize the locally synchronized MSG languages as<br />the subclass of regular MSC languages that are finitely generated.

Lightweight checkpointing for concurrent ML

2010 ◽  
Vol 20 (2) ◽  
pp. 137-173 ◽  
Author(s):  
LUKASZ ZIAREK ◽  
SURESH JAGANNATHAN
Keyword(s):  
Message Passing ◽  
Large Scale ◽  
Software Systems ◽  
Transient Faults ◽  
Standard Ml ◽  
Shared Variables ◽  
Communication Events ◽  
Linguistic Abstraction ◽  
Viable Mechanism

AbstractTransient faults that arise in large-scale software systems can often be repaired by reexecuting the code in which they occur. Ascribing a meaningful semantics for safe reexecution in multithreaded code is not obvious, however. For a thread to reexecute correctly a region of code, it must ensure that all other threads that have witnessed its unwanted effects within that region are also reverted to a meaningful earlier state. If not done properly, data inconsistencies and other undesirable behavior might result. However, automatically determining what constitutes a consistent global checkpoint is not straightforward because thread interactions are a dynamic property of the program. In this paper, we present a safe and efficient checkpointing mechanism for Concurrent ML (CML) that can be used to recover from transient faults. We introduce a new linguistic abstraction, called stabilizers, that permits the specification of per-thread monitors and the restoration of globally consistent checkpoints. Safe global states are computed through lightweight monitoring of communication events among threads (e.g., message-passing operations or updates to shared variables). We present a formal characterization of its design, and provide a detailed description of its implementation within MLton, a whole-program optimizing compiler for Standard ML. Our experimental results on microbenchmarks as well as several realistic, multithreaded, server-style CML applications, including a web server and a windowing toolkit, show that the overheads to use stabilizers are small, and lead us to conclude that they are a viable mechanism for defining safe checkpoints in concurrent functional programs.

Characterization of Wide Area Network Computing

2000 ◽  
Author(s):  
Christopher J. Freitas ◽  
Derrick B. Coffin ◽  
Richard L. Murphy
Keyword(s):  
Message Passing ◽  
High Performance ◽  
Local Area ◽  
Wide Area ◽  
Area Network ◽  
Wide Area Network ◽  
Network Computing ◽  
Distributed Parallel Computing ◽  
International Border

Abstract Distributed parallel computing using message-passing techniques on Networks of Workstations (NOW) has achieved widespread use in the context of Local Area Networks (LAN). Recently, the concept of Grid-based computing using Wide Area Networks (WAN) has been proposed as a general solution to distributed high performance computing. The use of computers and resources at different geographic locations connected by a Wide Area Network and executing a real application introduces additional variables that potentially complicate the efficient use of these resources. Presented here are the results of a study that begins to characterize the performance issues of a WAN-based NOW, connecting resources that span an international border.

scholarly journals A logical characterization of asynchronously communicating agents

1990 ◽  
Vol 19 (309) ◽  
Author(s):  
Søren Christensen
Keyword(s):  
Distributed Systems ◽  
Temporal Logic ◽  
Message Passing ◽  
Partial Orders ◽  
Soundness And Completeness ◽  
Sequential Processes

<p>In this paper we study the behaviour of distributed systems. We consider systems composed of a <em>fixed</em> number of sequential processes communicating by asynchronous message passing. The behaviour is represented by a subclass of partial orders called <em>asynchronously communicating agent structures</em>, abbreviated ACA structures.</p><p>We present a logical characterization of ACA structures in the framework of temporal logic.</p><p>The modalities of the logic capture the concepts of <em>communication</em>, <em>concurrency</em> and <em>locality</em>.</p><p>We define an axiomatic basis for the logic and show both soundness and completeness.</p>

Sign in / Sign up

Export Citation Format

Share Document