The Cost of A BSP Algorithm
The cost of a superstep is determined as the sum of three terms; the cost of the longest running local computation, the cost of global communication between the processors, and the cost of the barrier synchronisation at the end of the superstep. The cost of one superstep for processors:
where is the cost for the local computation in process, and is the number of messages sent or received by process . Note that homogeneous processors are assumed here. It is more common for the expression to be written as where and are maxima. The cost of the algorithm then, is the sum of the costs of each superstep.
where is the number of supersteps.
, and are usually modelled as functions, that vary with problem size. These three characteristics of a BSP algorithm are usually described in terms of asymptotic notation, e.g. .
Read more about this topic: Bulk Synchronous Parallel
Famous quotes containing the word cost:
“Life! Life! Don’t let us go to life for our fulfilment or our experience. It is a thing narrowed by circumstances, incoherent in its utterance, and without that fine correspondence of form and spirit which is the only thing that can satisfy the artistic and critical temperament. It makes us pay too high a price for its wares, and we purchase the meanest of its secrets at a cost that is monstrous and infinite.”
—Oscar Wilde (1854–1900)