Very High Level Parallel Programming
It is becoming increasingly clear that high level programming languages are a prerequisite for the more widespread use of parallel computers. Can we design high level programming languages that are convenient to program with and also lead to efficient execution? One high level model that is frequently used for algorithm design is the PRAM. While the PRAM has been found to be very convenient to program, it is substantially different from realistic parallel computers. Thus it is possible that efficient algorithms for PRAMs may not necessarily translate to efficient algorithms for realistic machines. One possibility, then, is to base high level languages on a model that is intermediate between the ideal PRAM model and the more realistic, distributed parallel computation models.
Unable to display preview. Download preview PDF.
- Abhiram G. Ranade. How to emulate shared memory. In Proceedings of the IEEE Symposium on Foundations of Computer Science, 1987. Also available as Yale Univ. Comp. Sc. TR-578.Google Scholar
- Abhiram G. Ranade, Sandeep N. Bhatt, and S. Lennart Johnsson. The fluent abstract machine. In Proceedings of the Fifth MIT Conference on Advanced Research in VLSI, pages 71–94, March 1988. Also available as Yale Univ. Comp. Sc. TR-573.Google Scholar