MAHEVE: An Efficient Reliable Mapping of Asynchronous Iterative Applications on Volatile and Heterogeneous Environments
نویسندگان
چکیده
The asynchronous iteration model, called AIAC, has been proven to be an efficient solution for heterogeneous and distributed architectures. An efficient mapping of application tasks is essential to reduce their execution time. In this paper we present a new mapping algorithm, called MAHEVE (Mapping Algorithm for HEterogeneous and Volatile Environments) which is efficient on such architectures and integrates a fault tolerance mechanism to resist computing node failures. Our experiments show gains on a typical AIAC application execution time up to 65%, executed on distributed clusters architectures containing more than 400 computing cores with the JaceP2P-V2 environment.
منابع مشابه
Map-merging in Multi-robot Simultaneous Localization and Mapping Process Using Two Heterogeneous Ground Robots
In this article, a fast and reliable map-merging algorithm is proposed to produce a global two dimensional map of an indoor environment in a multi-robot simultaneous localization and mapping (SLAM) process. In SLAM process, to find its way in this environment, a robot should be able to determine its position relative to a map formed from its observations. To solve this complex problem, simultan...
متن کاملA modified Mann iterative scheme for a sequence of nonexpansive mappings and a monotone mapping with applications
In a real Hilbert space, an iterative scheme is considered to obtain strong convergence which is an essential tool to find a common fixed point for a countable family of nonexpansive mappings and the solution of a variational inequality problem governed by a monotone mapping. In this paper, we give a procedure which results in developing Shehu's result to solve equilibrium prob...
متن کاملUse of run time predictions for automatic co-allocation of multi-cluster resources for iterative parallel applications
Metaschedulers co-allocate resources by requesting a fixed number of processors and usage time for each cluster. These static requests, defined by users, limit the initial scheduling and prevent rescheduling of applications to other resource sets. It is also difficult for users to estimate application execution times, especially on heterogeneous environments. To overcome these problems, metasch...
متن کاملALTA: Asynchronous Loss Tolerant Algorithms for Grid Computing
This paper describes an environment dedicated to the building of efficient scientific applications for the Grid on top of unreliable communication networks. Nowadays, scientific computing applications are usually built on top of reliable communication protocols (such as TCP). Nevertheless, the additional cost introduced by the reliability layer is not negligible in wide area network-based grid ...
متن کاملZnO-NPs as an efficient reusable heterogeneous catalyst for synthesis of 1,4-Dihydropyrimidine derivatives in solvent-free conditions
An efficient synthesis route to 1,4-dihydropyrimidine derivatives from reaction of divergent aldehydes with ethylacetoacetate and urea under solvent-free conditions by ZnO nanoparticles as a relative in expansive, eco-friendly, easy available, non-volatile, non-explosion, thermally robust, recyclable and easy to handle catalyst at 90°C with excellent yields is described. Unenhanced reaction tim...
متن کامل