Parallelization of population-based evolutionary algorithms for combinatorial optimization problems
Graph Chatbot
Chat with Graph Search
Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.
DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.
Evolutionary algorithms have been gaining increased attention the past few years because of their versatility and are being successfully applied in several different fields of study. We group under this heading a family of new computing techniques rooted i ...
TreadMarks supports parallel computing on networks of workstations by providing the application with a shared memory abstraction. Shared memory facilitates the transition from sequential to parallel programs. After identifying possible sources of paralleli ...
An efficient implementation of Cundall's model on the Cray T3D massively parallel computer is presented. This model is used to simulate granular media where every grain is identified separately, generating very time-consuming simulations. First, we show a ...
The paper describes Tempest, a collection of mechanisms for communication and synchronization in parallel programs. With these mechanisms, authors of compilers, libraries, and application programs can exploit-across a wide range of hardware platforms-the b ...
Irregular computation problems underlie many important scientific applications. Although these problems are computationally expensive, and so would seem appropriate for parallel machines, their irregular and unpredictable run-time behavior makes this type ...
We describe a second parallel implementation of the ILINK program from the LINKAGE package that improves on our previous implementation [Human Heredity 44 (1994), pp. 127-141]. To improve running time we integrated the strategy of parallel estimation of th ...
This paper summarizes how distributed shared memory (DSM) can be both efficiently and portably supported by the Tempest interface. Tempest is a collection of mechanisms for communication and synchronization in parallel programs. These mechanisms provide co ...
Parallelizing an algorithm consists of dividing the computation into a set of sequential operations, assigning the operations to threads, synchronizing the execution of threads, specifying the data transfer requirements between threads and mapping the thre ...
Programming parallel shared- and distributed-memory architectures remains a difficult task. This contribution proposes a methodology for the hierarchical specification of pipelined parallel applications running on shared- as well as distributed-memory arch ...
Direct Volume Rendering is a popular technique for visualization of 3D datasets that offers many advantages over other algorithms but requires important computing power. Efficient parallelization is therefore an essential need. Taking advantage of an exist ...
