作者: S. Tham , J. Morris
DOI: 10.1109/ICPP.2003.1240575
关键词:
摘要: We measured the relative performance of two support systems for parallel programming on networks workstations: Cilk - an extension C with dataflow semantics and MPI a commonly used library message passing. Although present significantly different processing models, we attempted to code benchmark problems in similar ways. The selected were matrix multiplication, travelling salesman problem, quick sort, Gaussian elimination, fast Fourier transform finite differencing. compared run times, speed-ups coding efficiency as by lines our implementations problems. showed speed advantage when smaller numbers large messages are transferred computation, enabling it gain more from underlying active implementation. algorithms natural solutions was compact, whereas which have simple iterative 'update-in-place' styles (Gaussian elimination differencing) efficiently expressed