<XML><RECORDS><RECORD><REFERENCE_TYPE>3</REFERENCE_TYPE><REFNUM>6741</REFNUM><AUTHORS><AUTHOR>Bishop,J.</AUTHOR><AUTHOR>Renaud,K.V.</AUTHOR><AUTHOR>Worrall,B.</AUTHOR></AUTHORS><YEAR>2002</YEAR><TITLE>Composition of Distributed Software with Algon - Concepts and Possibilities</TITLE><PLACE_PUBLISHED>Proceedings Software Composition (SC 2002) affiliated with ETAPS 2002, April 6 - 14, 2002. Volume 65 Issue 4. </PLACE_PUBLISHED><PUBLISHER>Electronic Notes in Theoretical Computer Science</PUBLISHER><LABEL>Bishop:2002:6741</LABEL><ABSTRACT>The perceived advantages of distributed systems, such as increased reliability and availability, are offset by the increased complexity of developing such applications. The developers of distributed applications have, in addition to the core functionality of the application, to both understand and cater for many different issues. It would therefore be beneficial to alleviate the problems associated with having to ensure that all issues are adequately addressed. One way of dealing with this problem is by means of {\em separation of concerns}. This technique reduces complexity by allowing the developer to separate a specific concern from the main application program functionality. The Algon approach uses separation of concerns to provide distributed algorithms to distributed systems. The novelty of Algon is that developers are not expected to understand or implement these algorithms themselves. Algon provides the developer with a choice of pre-coded and tested algorithms. This paper gives an outline of the Algon approach, and provides a pattern specification for the separation of these algorithms from the core functionality of a distributed system. </ABSTRACT></RECORD></RECORDS></XML>