Abstract
A technique for deriving the time cost of parallel computations is presented. The technique is based on reducing the given parallel computation into a sequential one and then applying one of the available techniques developed for sequential computations to derive the required time cost. The reduction process is done by replacing each parallel structure in the given computation with a single operation node whose time cost equals the time cost of the structure. Five categories of parallel structures are identified and the time cost of each is estimated. The technique is then written in an algorithmic form.<>

This publication has 3 references indexed in Scilit: