loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
9th International Parallel Processing Symposium
Data parallel programming in an adaptive environment
Santa Barbara, CA
April 25-April 28
ISBN: 0-8186-7074-6
G. Edjlali, Dept. of Comput. Sci., Maryland Univ., College Park, MD, USA
G. Agrawal, Dept. of Comput. Sci., Maryland Univ., College Park, MD, USA
A. Sussman, Dept. of Comput. Sci., Maryland Univ., College Park, MD, USA
J. Saltz, Dept. of Comput. Sci., Maryland Univ., College Park, MD, USA
For better utilization of computing resources, it is important to consider parallel programming environments in which the number of available processors varies at runtime. In this paper, we discuss runtime support for data parallel programming in such an adaptive environment. Executing data parallel-programs in an adaptive environment requires redistributing data when the number of processors changes, and also requires determining new loop bounds and communication patterns for the new set of processors. We have developed a runtime library to provide this support. We also present performance results for a multiblock Navier-Stokes solver run on a network of workstations using PVM for message passing. Our experiments show that if the number of processors is not varied frequently, the cost of data redistribution is not significant compared to the time required for the actual computations.
Index Terms:
parallel programming; message passing; programming environments; data parallel programming; adaptive environment; runtime support; loop bounds; communication patterns; runtime library; performance results; multiblock Navier-Stokes solver; network of workstations; PVM; message passing; data redistribution
Citation:
G. Edjlali, G. Agrawal, A. Sussman, J. Saltz, "Data parallel programming in an adaptive environment," ipps, pp.827, 9th International Parallel Processing Symposium, 1995
Usage of this product signifies your acceptance of the Terms of Use.