• Home
  • Search
  • Data parallel programming in an adaptive environment
  • Open Access IconOpen Access
  • Cite Icon29
  • https://doi.org/10.1109/ipps.1995.395855Copy DOI Icon

Data parallel programming in an adaptive environment

  • Apr 25, 1995
  • G Edjlali +3 more
Show More
  • Abstract
  • Literature Map
  • References
  • Citations
  • Similar Papers
Abstract

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. >

Similar Papers
  • Conference Article
  • Citations3

A parallel compiler scheduler

  • Jan 01, 2001
  • M Solar +1
  • Research Article
  • Citations11

Fast parallel algorithm for distance transform

  • Jul 01, 2003
  • IEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans
  • A Datta +1
  • Research Article
  • Citations52

Scheduling in and out forests in the presence of communication delays

  • Jan 01, 1996
  • IEEE Transactions on Parallel and Distributed Systems
  • T.A Varvarigou +3
  • Research Article
  • Citations1

Tuning Task Granularity and Data Locality of Data Parallel GPH Programs

  • Dec 01, 2001
  • Parallel Processing Letters
  • H Loidl
  • Research Article
  • Citations16

Optimal schedules for d-D grid graphs with communication delays

  • Oct 01, 1998
  • Parallel Computing
  • E Bampis +2
  • Conference Article

Performance Evaluation of a Parallel Algorithm for Determining All Optimal Solutions of the 1D Array Partitioning Problem

  • Oct 01, 2017
  • Hajer Salhi +2
  • Book Chapter
  • Citations4

Application of Fault Parallelism to the Automatic Test Pattern Generation for Sequential Circuits

  • Jan 01, 1993
  • Peter A Krauss +1
  • Book Chapter

An Experimental Comparison of Load Balancing Strategies in a Web Computing Environment

  • Jan 01, 2012
  • Joachim Gehweiler +2
  • Conference Article

Efficient address generation for affine subscripts in data-parallel programs

  • Dec 14, 1998
  • Kuei-Ping Shih +2
  • Conference Article
  • Citations11

Symbolic performance prediction of scalable parallel programs

  • Apr 25, 1995
  • M.J Clement +1
  • Research Article

Simulation of electrically large structures in EMC studies

  • Jan 01, 2004
  • Infoscience (Ecole Polytechnique Fédérale de Lausanne)
  • Abraham Rubinstein
  • Conference Article

Iterative task division method or multiprocessor scheduling problem

  • Sep 05, 1994
  • K Tagawa +4
  • Book Chapter
  • Citations4

An Integrated Scheduling Algorithm for Precedence Constrained Hard and Soft Real-Time Tasks on Heterogeneous Multiprocessors

  • Jan 01, 2004
  • Nitin Auluck +1
  • Research Article
  • Citations32

Discretization and parallel performance of an unstructured finite volume Navier–Stokes solver

  • Feb 16, 2006
  • International Journal for Numerical Methods in Fluids
  • S A Mohsen Karimian +1
  • Conference Article
  • Citations17

A flexible clustering and scheduling scheme for efficient parallel computation

  • Apr 12, 1999
  • S Chingchit +2
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.