The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
This paper describes an efficient multi-phase parallel algorithm for sparse Cholesky factorization. The algorithm is simple in its concept and takes ideas from Kumar and Gupta [13] and Roman [18]. We adapt the sub-tree to sub-cube mapping strategy introduced by George et al [9] to reconfigurable parallel machines which allows an improvement in communication performances. In the case of regular grid...
This paper presents a compile time scheduling algorithm dedicated to parallel machines in which the interconnection network can be altered during the execution of the same application. We propose an heuristic technique taking ideas from clustering and list scheduling algorithms to schedule a task graph on these machines. We give an upper bound to the performances of the algorithm that generalizes...
This paper presents a new library for the ProActive environment, called AIL-PA (asynchronous iterative library for ProActive). This new library allows to execute programs for solving large scale problems on various architectures. Two models of algorithm can be used: the synchronous iteration model which is efficient on single clusters; the asynchronous iteration model which is more efficient on distributed...
This paper presents many typical problems that are encountered when executing large scale scientific applications over distributed architectures. The causes and effects of these problems are explained and a solution for some classes of scientific applications is also proposed. This solution is the combination of the asynchronous iteration model with JACEP2P-V2 which is a fully decentralized and fault...
The aim of this paper is to study the behaviors of the well known conjugate gradient (CG) algorithm and the multisplitting algorithm in a grid context. We focus on the CG implementation used in the NAS benchmark and on the multisplitting approach which produces similar results (from a numerical point of view). By grid context we mean an architecture composed of several heterogeneous clusters geographically...
This paper introduces a parallel algorithm to solve large stiff ODE systems in a geographically distant cluster environment. This algorithm is based on the coupling of the waveform relaxation concept and the CVODE algorithm. With respect to the standard PVODE algorithm, it allows to drastically reduce the number of messages exchanged between nodes. It is a coarse grained algorithm well suited for...
This paper focuses on large scale experiments with Java and asynchronous iterative applications. In those applications, tasks are dependent and the use of distant clusters may be difficult, for example, because of latencies, heterogeneity, and synchronizations. Experiments have been conducted on the Grid'5000 platform using a new version of the Jace environment. We study the behavior of an application...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.