Compilation of Parallel Applications via Automated Transformation of BMF Programs

@inproceedings{Alexander2005CompilationOP,
  title={Compilation of Parallel Applications via Automated Transformation of BMF Programs},
  author={Brad Alexander},
  year={2005}
}
Machine Optimised BMF Parallel BMF Abstract Machine CodeMachine Code Figure 13. The Adl project with the translation stage highlighted in black. to leverage the transformational properties of BMF to the maximum possible extent. In keeping with this goal, the translation process was kept as straightforward as possible. Any optimisation of the Adl source or optimisation during the translation process is eschewed in favour of performing that optimisation once the program is expressed in BMF. The… CONTINUE READING
2 Extracted Citations
72 Extracted References
Similar Papers

Citing Papers

Publications influenced by this paper.
Showing 1-2 of 2 extracted citations

Referenced Papers

Publications referenced by this paper.
Showing 1-10 of 72 references

A framework for collective personalized communication

  • S.K.L.V. Kalé, K. Varadarajan
  • In International Parallel and Distributed…
  • 2003

Automated parallelisation of code written in the Bird-Meertens Formalism

  • J. Windows
  • Honours Thesis, School of Computer Science…
  • 2003

Mapping parallel BMF constructs to a parallel machine

  • D. Philp
  • Master’s thesis, School of Computer Science…
  • 2003

Communications benchmarks on high-end and commoditytype computers

  • M. F. Guest
  • CCLRC Daresbury Laboratory,
  • 2002

Optimization of skeletal parallel programs (invited talk ohp slides)

  • Z. Hu
  • In 3rd International Workshop on Constructive…
  • 2002

Similar Papers

Loading similar papers…