Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Review Help
Search
Fast rendezvous on a cycle by agents with different speeds
Feinerman O., Korman A., Kutten S., Rodeh Y. Theoretical Computer Science688  77-85,2017.Type:Article
Date Reviewed: Oct 16 2017

Feinerman et al. provide illustrations concerned with the usefulness of different processing speeds and asynchrony of tasks of the operating agents in distributed computing systems. To investigate the rendezvous (meeting point) problem, a cycle topology is considered, which discusses and models different scenarios of the problem.

The scenarios are discussed with regard to different operational parameters of the involved agents. The main aim of the research is the estimation of lower and upper bounds of the time it takes until a rendezvous occurs. Length of the cycle, speed of moving agents in the cycle, movement direction, awareness of the direction, leaving arbitrary marks, and white board model were the different alternative scenarios discussed in the paper.

Considering the nature of agents with stochastic speed difference, research on multiple agent scenarios and other topological structures have been counted as cases for future investigations.

In addition to smooth reasoning concerned with the achieved formulas and theorems, the paper provides a simplification of the asynchrony problem in the distributed system to a kind of agents racing problem, to get more insight into the agents’ interactions and behavior.

Reviewer:  Mohammad Sadegh Kayhani Pirdehi Review #: CR145590 (1712-0807)
Bookmark and Share
  Featured Reviewer  
 
Heterogeneous (Hybrid) Systems (C.1.3 ... )
 
 
Mobile Processors (C.1.4 ... )
 
 
Multiagent Systems (I.2.11 ... )
 
Would you recommend this review?
yes
no
Other reviews under "Heterogeneous (Hybrid) Systems": Date
 Computationally intelligent hybrid systems: the fusion of soft computing and hard computing
Ovaska S., Wiley-IEEE Press, 2004. Type: Book (9780471476689)
Jun 10 2005
A high performance, low complexity algorithm for compile-time task scheduling in heterogeneous systems
Hagras T., Janeček J. Parallel Computing 31(7): 653-670, 2005. Type: Article
Aug 8 2006
On the efficacy of GPU-integrated MPI for scientific applications
Aji A., Panwar L., Ji F., Chabbi M., Murthy K., Balaji P., Bisset K., Dinan J., Feng W., Mellor-Crummey J., Ma X., Thakur R.  HPDC 2013 (Proceedings of the 22nd International Symposium on High-Performance Parallel and Distributed Computing, New York, NY, Jun 17-21, 2013)191-202, 2013. Type: Proceedings
Nov 14 2013
more...

E-Mail This Printer-Friendly
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud®
Terms of Use
| Privacy Policy