Basic HTML version of Foils prepared April 7,1995

Foil 32 HPF can express Region Growing in Image Processing

From Programming Paradigms B CRPC/MCNC Workshop -- April 10-13 1995. by Geoffrey C. Fox
Basic Steps:
  • 1) Split phase: regular and can be done in HPF
  • 2) Merge phase: can be performed in HPF. However efficiency depends on the image (random tie breaking to improve the efficiency)
    • Extensions needed for a Reduce in forall.
    • Runtime support for Dynamic Partitioning and Movement of nodes to improve efficiency
Optimization not trivial - for instance on the CM-5
  • CMFortran version of algorithm 10 times slower than "completely equivalent" Fortran+message passing
  • Not certain why - we will use commercial HPF compilers to investigate
  • SIMD implementation reasonable

Northeast Parallel Architectures Center, Syracuse University, npac@npac.syr.edu

If you have any comments about this server, send e-mail to webmaster@npac.syr.edu.

Page produced by wwwfoil on Sun Feb 22 1998