Presentation Title: Java Implementation for Arrow Protocol

Committee:

• Dr. Konstantin Busch (Chair)
• Dr. Jianhua Chen
• Dr. Jian Zhang

Date: Apr 25, 2011
Time: 9:00 AM
Location:256 Coates Hall

Abstract:
Distributed computing has many applications pertaining to areas of communication between peer-to-peer systems, solving complex mathematical equations, banking and airline reservation systems. Given a random graph where each node represents a peer in the distributed system, at a particular instance of time, only one node has an object that is being requested by other nodes. This object needs to be passed from the current owner through intermediate nodes to reach the final requesting node. During transfer of the object between nodes, scalability and current ownership issues arise. Hence, Arrow protocol solves the above scalability and locality problems while consistently servicing the concurrent requests.

In this project, we try to implement the arrow protocol by associating each node with a thread and count the number of hops in the communication between nodes holding the object to the requesting node. Message passing is used to send requests generated from each node. Finally, we plot two graphs based on the experimental results. First, graph represents total number of active threads vs. latency between nodes. Second, graph represents total number of active threads vs. number of hops.


All are invited.