Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Implementation of hierarchical F-channels for high-performance distributed computing

Implementation of hierarchical F-channels for high-performance distributed computing 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. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Distributed Computing Springer Journals

Implementation of hierarchical F-channels for high-performance distributed computing

Distributed Computing , Volume 8 (4) – Oct 19, 2005

Loading next page...
 
/lp/springer-journals/implementation-of-hierarchical-f-channels-for-high-performance-ZITL6JCjck

References (36)

Publisher
Springer Journals
Copyright
Copyright © 1995 by Springer-Verlag
Subject
Computer Science; Computer Communication Networks; Computer Hardware; Computer Systems Organization and Communication Networks; Software Engineering/Programming and Operating Systems; Theory of Computation
ISSN
0178-2770
eISSN
1432-0452
DOI
10.1007/BF02242739
Publisher site
See Article on Publisher Site

Abstract

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.

Journal

Distributed ComputingSpringer Journals

Published: Oct 19, 2005

There are no references for this article.