Location sensitive shared memory implementation for mobile system

This thesis presents the implementation of an attributed key-value store distributed shared memory (DSM) that provides a way of programming distributed robotics applications. Traditional message-passing method requires the programmer to explicitly specify when and how information should be propagated between different agents while allowing them to communicate. In contrast with the message-passing method, shared memory makes the communication more implicit, allowing the agents to exchange information through read and write operations on shared variables. This feature allows a broad set of algorithms being implemented with more sufficient programs. To reduce the message overheads, an alternative type of shared memory is implemented. The alternative publish/subscribe shared memory will only deliver messages to intended receivers instead of broadcasting all the messages. This property especially benefits applications where one agent requests information from only a subset of neighbors. The shared memory and the publish/subscribe system does reduce the number of messages compared to the shared memory.U of I OnlyUndergraduate senior thesis not recommended for open acces