loading...
Algon: A Framework for Supporting Comparison of Distributed Algorithm Performance
Genova, Italy February 05-February 07
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/EMPDP.2003.1183620Eleventh Euromicro Conference on Para ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Karen Renaud, University of Glasgow
Johnny Lo, University of Pretoria
Judith Bishop, University of Pretoria
Pieter van Zyl, University of Pretoria
Basil Worrall, University of Pretoria
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. 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 se the algorithms.
Citation:
Karen Renaud, Johnny Lo, Judith Bishop, Pieter van Zyl, Basil Worrall, "Algon: A Framework for Supporting Comparison of Distributed Algorithm Performance," pdp, pp.425, Eleventh Euromicro Conference on Parallel, Distributed and Network-Based Processing, 2003
Usage of this product signifies your acceptance of the Terms of Use.


Suggestions