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.
Following earlier work on independent multi-walk parallel local search, we present in this paper a framework for dependent multi-walk and its implementation. The new framework provides the possibility to communicate configurations between concurrent local search engines in order to better focus the overall search on promising configurations. An MPI-based implementation has been realized and its evaluation...
We study in this paper the influence of the restart policy on the sequential and parallel performance of combinatorial search problems. Our evaluation relies on several experiments using a constraint-based local search method, named Adaptive Search, and a few combinatorial problems such as Magic Square and Costas Array Problems.
The Costas Array Problem is a highly combinatorial problem linked to radar applications. We present in this paper its detailed modeling and solving by Adaptive Search, a constraint-based local search method. Experiments have been done on both sequential and parallel hardware up to several hundreds of cores. Performance evaluation of the sequential version shows results outperforming previous implementations,...
Quenlig is a web application where users answer textually, generic to any kind of questionnaires, and designed as a formative assessment tool. Students can learn their courses, test their knowledge, exercise themselves and get ranked. It allows teachers to automatize examinations and practice lessons (giving context dependent advice when needed), dynamically monitor students progression and transparently...
The time to solution of linear equation solver strongly depends on the type of the problem, the target computer architecture, the selected algorithm, its implementation and the control parameters. Thus huge work has been performed to propose GridTLSE whose expert web site part provides assistance to a user in choosing the right solver for his problems as well as appropriate values for the control...
We address the issue of parallelizing constraint solvers based on local search methods for massively parallel architectures, involving several thousands of CPUs. We present a family of a constraint-based local search algorithms and investigate their performance results on hard wares with several hundreds of processors. The first method is a basic independent multiple-walk algorithm: each processor...
This paper details an extension to the GridRPC API that responds both to the data management needs of distributed applications and to middleware interoperability. It provides a minimal set of functions to handle a large set of data operations: movements, replications, migrations, persistency and data prefetch, which can be used by clients or workflow systems for example. We trust that this API covers...
In this paper, we study the impact of tasks reallocation onto a multi-cluster environment where clusters are heterogeneous and use different resources management policies. In this context, we propose a reallocation mechanism that migrates waiting jobs from one cluster to another. We performed simulations using real traces to study benefits of reallocations. We compared two algorithms providing the...
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.