Show simple item record

Implementing Asynchronous Distributed Systems Using the IOA Toolkit

dc.date.accessioned2005-12-19T23:25:19Z
dc.date.accessioned2018-11-24T10:23:53Z
dc.date.available2005-12-19T23:25:19Z
dc.date.available2018-11-24T10:23:53Z
dc.date.issued2004-10-06
dc.identifier.urihttp://hdl.handle.net/1721.1/30412
dc.identifier.urihttp://repository.aust.edu.ng/xmlui/handle/1721.1/30412
dc.description.abstractThis document is a report about the capabilities and performance of the IOA Toolkit, and in particularthe tools that provide support for implementing and running distributed systems (checker,composer, code generator). The Toolkit compiles distributed systems specified in IOA into Javaclasses, which run on a network of workstations and communicate using the Message Passing Interface(MPI). In order to test the toolkit, several distributed algorithms were implemented, rangingfrom simple algorithms such as LCR leader election in a ring network to more complex algorithmssuch as the GHS algorithm for computing the minimum spanning tree in an arbitrary graph. Allof our experiments completed successfully, and several runtime measurements were made.
dc.format.extent107 p.
dc.format.extent63601552 bytes
dc.format.extent2713486 bytes
dc.language.isoen_US
dc.titleImplementing Asynchronous Distributed Systems Using the IOA Toolkit


Files in this item

FilesSizeFormatView
MIT-CSAIL-TR-2004-062.pdf2.713Mbapplication/pdfView/Open
MIT-CSAIL-TR-2004-062.ps63.60Mbapplication/postscriptView/Open

This item appears in the following Collection(s)

Show simple item record