(<< back)

Finite State Machines Using MPI

Introduction

One may use a set of distributed, communicating finite state machines to model distributed algorithms and protocols. This page outlines some examples of implementing distributed FSMs using MPI.

Examples (explainations, applications, and more examples coming shortly)

Applications

The first application implemented using this approach will be a program used to determine the minimum spanning tree in a distributed way using various network related metrics. For now, more details are contained on the old dspan project page.

(<< back)


Copyright © 2004-2009. All Rights Reserved. The statements and opinions included in these pages are those of me only. Any statements and opinions included in these pages are not those of Louisiana State University or the LSU Board of Supervisors.