Evaluation of a distributed numerical simulation optimization approach applied to aquifer remediation

AbstractIn this paper we evaluate a distributed approach which uses numerical simulation and optimization techniques to automatically find remediation solutions to a hypothetical contaminated aquifer. The repeated execution of the numerical simulation model of the aquifer through the optimization cycles tends to be computationally expensive. To overcome this drawback, the numerical simulations are executed in parallel using a network of heterogeneous workstations. Performance metrics for heterogeneous environments are not trivial; a new way of calculating speedup and efficiency for Bag-of-Tasks (BoT) applications is proposed. The performance of the parallel approach is evaluated

The Master-Slave Paradigm with Heterogeneous Processors

In this paper, we revisit the master-slave tasking paradigm in the context of heterogeneous processors. We assume that communications take place in exclusive mode. We present a polynomial algorithm that gives the optimal solution when a single communication is needed before the execution of the tasks on the slave processors. When communications are required both before and after the task processing, we show that the problem is at least as difficult as a problem whose complexity is open. In this case, we present a guaranteed approximation algorithm. Finally, we present asymptotically optimal algorithms when communications are required before the processing of each task, or both before and after the processing of each task.Dans ce rapport, nous nous intéressons au paradigme maître/esclaves pour des plateformes hétérogènes. Nous supposons que les communications ont lieu de façon exclusives. nous donnons un algorithme polynômial qui donne une solution optimale au problème de l'allocation des tâches lorsqu'une seule communication est nécessaire avant le traitement des tâches sur les différents processeurs. Lorsqu'une communication avant et une communication après le traitement des tâches sont nécessaires, nous montrions que le problème est aussi difficile qu'un autre problème dont la complexité est ouverte. Dans ce cas, nous présentons un algorithme d'approximation polynomial garanti. Enfin, nous présentons des algorithmes asymptotiquement optimaux quand des communications sont nécessaires avant ou avant et après le traitement de chaque tâche

The master-slave paradigm with heterogeneous processors

Theme 1 - Reseaux et systemes - Projet ReMaPSIGLEAvailable from INIST (FR), Document Supply Service, under shelf-number : 14802 E, issue : a.2001 n.4156 / INIST-CNRS - Institut de l'Information Scientifique et TechniqueFRFranc

The Master-Slave Paradigm with Heterogeneous Processors

International audienceWe revisit the master-slave tasking paradigm in the context of heterogeneous processors. We assume that communications are handled by a bus and, therefore, at most one communication can take place at a given time step. We present a polynomial algorithm that gives the optimal solution when a single communication is needed before the execution of the tasks on the slave processors. When communications are required both before and after the processing of the tasks, we show that the problem is strongly NP-complete. In this case, we present a guaranteed approximation algorithm. Finally, we present asymptotically optimal algorithms when communications are required before the processing of each task, or both before and after the processing of each task

The master-slave paradigm with heterogeneous processors

SIGLEAvailable from INIST (FR), Document Supply Service, under shelf-number : RP 15835 / INIST-CNRS - Institut de l'Information Scientifique et TechniqueFRFranc