<XML><RECORDS><RECORD><REFERENCE_TYPE>3</REFERENCE_TYPE><REFNUM>6742</REFNUM><AUTHORS><AUTHOR>Renaud,K.V.</AUTHOR><AUTHOR>Bishop,J.</AUTHOR><AUTHOR>Lo,J.</AUTHOR><AUTHOR>Van Zyl,P.</AUTHOR><AUTHOR>Worrall,B.</AUTHOR></AUTHORS><YEAR>2003</YEAR><TITLE>Algon: A Framework for Supporting Comparison of Distributed Algorithm Performance</TITLE><PLACE_PUBLISHED>Proceedings 11th Euromicro Conference on Parallel Distributed and Network Based Processing </PLACE_PUBLISHED><PUBLISHER>IEEE</PUBLISHER><LABEL>Renaud:2003:6742</LABEL><ABSTRACT>Programmers often need to use distributed algorithms to add non-functional behaviour, such as mutual exclusion, deadlock detection and termination, to a distributed application. They find the selection and implementation of these algorithms daunting. %and mostly find the algorithms themselves difficult to understand. Consequently they have no idea which algorithm will be best for their particular application. % To address this difficulty the Algon framework provides a set of pre-coded distributed algorithms for programmers to choose from, and provides a special performance display tool to support choice between algorithms. The performance tool is discussed in this paper. The developer of a distributed application will be able to observe the performance of each of the available algorithms according to a set of of widely accepted and easily-understandable performance metrics and compare and contrast the behaviour of the algorithms to support an informed choice. The strength of the Algon framework is that it does not require a working knowledge of algorithmic theory or functionality in order for the developer to use the algorithms. </ABSTRACT></RECORD></RECORDS></XML>