Access the full text.
Sign up today, get DeepDyve free for 14 days.
S Chowdhury (1989)
The mean resequencing delay forM/H k /∞ systemsIEEE Trans Softw Eng, 15
P. Kearns, T. Camp, Mohan Ahuja (1992)
An implementation of flush channels based on a verification methodology[1992] Proceedings of the 12th International Conference on Distributed Computing Systems
Mohan Ahuja, M. Raynal (1995)
An Implementation of Global Flush Primitives Using CountersParallel Process. Lett., 5
Mohan Ahuja (1990)
Flush Primitives for Asynchronous Distributed SystemsInf. Process. Lett., 34
(1994)
Receiving messages in receive-phases and incrementally publishing the needed partial order
(1991)
Designing concurrent systems using hierarchy of communication speeds
(1994)
Highway's position with respect to CATOCS
Mohan Ahuja (1993)
Assertions About Past and Future in Highways: Global Flush Broadcast and Flush-Vector-TimeInf. Process. Lett., 48
A Tanenbaum (1988)
Computer Networks
K. Shafer, Mohan Ahuja (1992)
Process-channel/sub agent/-process model of asynchronous distributed communication[1992] Proceedings of the 12th International Conference on Distributed Computing Systems
A. Tanenbaum (1988)
Computer networks: 2nd edition
T. Yum, Tin-Yee Ngai (1986)
Resequencing of messages in communication networksIEEE Trans. Commun., 34
(1989)
Repeated global snapshots in asynchronous concurrent systems
T. Camp, P. Kearns (2006)
Fast batched data transfer with flush channels: A performance analysisJ. Parallel Distributed Comput., 66
Rahim Ramezanian (1978)
Communicating sequential processesCommun. ACM, 21
Subhash Agrawal, Ravi Ramaswamy (1987)
Analysis of the resequencing delay for M/M/m systems
Mohan Ahuja (1993)
An Implementation of F-ChannelsIEEE Trans. Parallel Distributed Syst., 4
D. Dolev, D. Malkhi (1996)
The Transis approach to high availability cluster communicationCommun. ACM, 39
K. Birman, A. Schiper, Patrick Stephenson (1991)
Lightweight causal and atomic group multicastACM Trans. Comput. Syst., 9
R. Schlichting, F. Schneider (1984)
Using message passing for distributed programming: proof rules and disciplinesACM Trans. Program. Lang. Syst., 6
L. Peterson, N. Buchholz, R. Schlichting (1989)
Preserving and using context information in interprocess communicationACM Trans. Comput. Syst., 7
Process - Channe ' , a ~ en , - Process model of asynchronous distributed communication
S. Chowdhury (1989)
The Mean Resequencing Delay for M/H_K/infty SystemsIEEE Trans. Software Eng., 15
(1991)
Designing concurrent systems using hierarchy of communication speeds. Technical Report OSU-CISRC-1/91 TR1
M. Ahuja, K. Varadhan, Amitabh Sinha (1990)
Flush Message Passing in Communicating Sequential Processes.
(1994)
Faster communication using multiple and heterogeneous paths
M. Raynal, A. Schiper, S. Toueg (1991)
The Causal Ordering Abstraction and a Simple Way to Implement itInf. Process. Lett., 39
D. Cheriton, D. Skeen (1994)
Understanding the limitations of causally and totally ordered communication
K. Birman (1994)
A response to Cheriton and Skeen's criticism of causal and totally ordered communicationACM SIGOPS Oper. Syst. Rev., 28
K. Birman, T. Joseph (1987)
Reliable communication in the presence of failuresACM Trans. Comput. Syst., 5
T. Lai, Li-Fen Wu (1992)
An (N-1)-resilient algorithm for distributed termination detection[1992] Proceedings of the Fourth IEEE Symposium on Parallel and Distributed Processing
Mohan Ahuja (1993)
Assertions about past and future: Communication in a high-performance distributed system HighwaysProceedings of 1993 5th IEEE Symposium on Parallel and Distributed Processing
T. Lai, Y. Tseng, Xuefeng Dong (1992)
A more efficient message-optimal algorithm for distributed termination detectionProceedings Sixth International Parallel Processing Symposium
The mean resequencing delay for M / Hk / < systems
K. Shafer, Mohan Ahuja (1993)
Distributed modeling and implementation of high performance communication architectures[1993] Proceedings. The 13th International Conference on Distributed Computing Systems
K. Shafer (1992)
Modeling, implementing, and tools for studying logical process-to-process channels in asynchronous distributed systems
High performance distributed computing systems require high performance communication systems.F-channels andHierarchical F-channels address this need by permitting a high level of concurrency like non-FIFO channels while retaining the simplicity of FIFO channels critical to the design and proof of many distributed algorithms. In this paper, we present counter-based implementations for F-channels and Hierarchical F-channels using message augmentation-appending control information to a message. These implementations guarantee that no messages are unnecessarily delayed at the receiving end.
Distributed Computing – Springer Journals
Published: Oct 19, 2005
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.