Process algebra provides essential tools for studying distributed and concurrent systems. Stochastic process algebra (i.e., YAWN ) enhances the process algebra with stochastic extensions which is perfect to analyze phenomena of process with executing durations in the real world. What’s more, in system runs, value passing is tightly bounded with their processes. However, stochastic process algeb...

Message passing programs commonly use buffers to avoid unnecessary synchronizations and to improve performance by overlapping communication with computation. Unfortunately, using buffers makes the program no longer portable, potentially unable to complete on systems without a sufficient number of buffers. Effective buffer use entails that the minimum number needed for a safe execution be alloca...

The cost of using message-passing to implement linearizable read/write objects for shared memory multiprocessors with drifting clocks is studied. We take as cost measures the response times for performing read and write operations in distributed implementations of virtual shared memory consisting of such objects. A collection of necessary conditions on these response times are presented for a l...

Software based DSM systems like TreadMarks have traditionally not performed well compared to message passing applications because of the high overhead of communication associated with traditional stack based protocols like UDP. Modern interconnects like Myrinet offer reliable message delivery with very low communication overhead through user level protocols. This paper examines the viability of...

background: platelet mps are produced automatically during platelet storage. their size is about 0.1 – 1 µm and have ability for sub- endothelium adhering, strengthen of platelet aggregation and also platelet pre- coagulation. in fact, the release of membrane particles helps to signal to the neighbor cells or to seclude target cells from apoptosis. the purpose of this study is to determine the ...

Message Sequence Charts (MSCs) and High-level Message Sequence Charts (HMSC) are formalisms used to describe scenarios of message passing protocols. We propose using Allen’s logic to study the temporal order of the messages. We introduce the concept of discord to quantify the order discrepancies between messages in different nodes of an HMSC and study its algorithmic properties. We show that wh...

Parallel systems are increasingly being used to meet the demands of today’s high technology applications. While such systems provide decreased processing time they incur a degree of communication overhead that degrades their performance. To reduce this overhead, the static communication scheduling of message transmissions is considered. The compile-time determination of when nodes should transm...

We study the gossip problem in a message-passing environment: When a process receives a message, it has to decide whether the sender has more recent information on other processes than itself. This problem is at the heart of many distributed algorithms, and it is tightly related to questions from formal methods concerning the expressive power of distributed automata. We provide a non-determinis...

Given the rapid increase in traffic, greater demands have been put on research in high-speed switching systems. Such systems have to simultaneously meet several constraints, e.g., high throughput, low delay and low complexity. This makes it challenging to design an efficient scheduling algorithm, and has consequently drawn considerable research interest. However, previous results either cannot ...

Water is the most essential component for sustaining lives of humans and other living creatures. Supplying potable water with adequate residual pressure is a fundamental responsibility of city administration, which they do during normal conditions. But sometimes, abnormal conditions are formed resulting pressure deficient conditions during the daily operations of water distribution networks. Th...