<XML><RECORDS><RECORD><REFERENCE_TYPE>3</REFERENCE_TYPE><REFNUM>7057</REFNUM><AUTHORS><AUTHOR>O'Donnell,J.T.</AUTHOR><AUTHOR>Rauber,T.</AUTHOR><AUTHOR>Ruenger,G.</AUTHOR></AUTHORS><YEAR>2000</YEAR><TITLE>Cost hierarchies for abstract parallel machines</TITLE><PLACE_PUBLISHED> 13th International Workshop on Languages and Compilers for Parallel Computing (LCPC 2000) </PLACE_PUBLISHED><PUBLISHER>LNCS, Springer</PUBLISHER><LABEL>O'Donnell:2000:7057</LABEL><KEYWORDS><KEYWORD>parallel</KEYWORD></KEYWORDS<ABSTRACT>The Abstract Parallel Machine (APM) model separates the definitions of parallel operations from the application algorithm, which defines the sequence of parallel operations to be executed. An APM contains a set of parallel operation definitions, which specify how the computation is organized into independent sites of computation and what data exchanges are required. This paper adds explicit cost models as the third component of an APM system. The costs of parallel operations can be obtained either by analyzing a parallel operation definition, or by measuring performance on a real machine. Regardless of how they are obtained, costs should satisfy monotonicity constraints, which allow the cost of an algorithm to be transformed automatically as the algorithm itself is transformed.</ABSTRACT></RECORD></RECORDS></XML>