In this paper, we discuss a research prototype HPF compiler and a run-time system that allow dynamic processor allocation from HPF programs. Using dynamic processor allocation, an HPF program can be executed on a varying number of processors during a single run. This can improve both program efficiency and overall system utilization of the parallel system on which the program is executing. Performance data is presented to show that dynamic processor allocation in HPF programs can be supported efficiently.
By: Samuel Midkiff, Jose E. Moreira and Vijay K. Naik
Published in: RC20665 in 1996
LIMITED DISTRIBUTION NOTICE:
This Research Report is available. This report has been submitted for publication outside of IBM and will probably be copyrighted if accepted for publication. It has been issued as a Research Report for early dissemination of its contents. In view of the transfer of copyright to the outside publisher, its distribution outside of IBM prior to publication should be limited to peer communications and specific requests. After outside publication, requests should be filled only by reprints or legally obtained copies of the article (e.g., payment of royalties). I have read and understand this notice and am a member of the scientific community outside or inside of IBM seeking a single copy only.
Questions about this service can be mailed to reports@us.ibm.com .