Results 251 to 260 of about 3,741,686 (304)
Some of the next articles are maybe not open access.
Parallel Scheduling Algorithms
Operations Research, 1983Parallel algorithms are given for scheduling problems such as scheduling to minimize the number of tardy jobs, job sequencing with deadlines, scheduling to minimize earliness and tardiness penalties, channel assignment, and minimizing the mean finish time. The shared memory model of parallel computers is used to obtain fast algorithms.
Eliezer Dekel, Sartaj Sahni
openaire +2 more sources
PARALLEL ARCHITECTURES AND INTRINSICALLY PARALLEL ALGORITHMS: GENETIC ALGORITHMS
International Journal of Modern Physics C, 1994Genetic algorithms are search or classification algorithms based on natural models. They present a high degree of internal parallelism. We developed two versions, differing in the way the population is organized and we studied and compared their characteristics and performances when applied to the optimization of multidimensional function problems ...
R. CAMPANINI +4 more
openaire +2 more sources
Proceedings of The Fourth International C* Conference on Computer Science and Software Engineering, 2011
The LLL algorithm is a well-known and widely used lattice basis reduction algorithm. In many applications, its speed is critical. Parallel computing can improve speed. However, the original LLL is sequential in nature. In this paper, we present a multi-threading LLL algorithm based on a recently improved version: an LLL algorithm with delayed size ...
Yixian Luo, Sanzheng Qiao
openaire +2 more sources
The LLL algorithm is a well-known and widely used lattice basis reduction algorithm. In many applications, its speed is critical. Parallel computing can improve speed. However, the original LLL is sequential in nature. In this paper, we present a multi-threading LLL algorithm based on a recently improved version: an LLL algorithm with delayed size ...
Yixian Luo, Sanzheng Qiao
openaire +2 more sources
Parallelization of scheduling algorithms
Proceedings Second International Symposium on Parallel Architectures, Algorithms, and Networks (I-SPAN'96), 2002Most static scheduling algorithms that schedule parallel programs represented by directed acyclic graphs (DAGs) are sequential. Parallelization of scheduling algorithms is a new research area. This paper discusses the essential issues of parallel static scheduling and presents an efficient parallel scheduling algorithm, the HPMCP algorithm.
Min-You Wu, Wei Shu
openaire +2 more sources
2010
Robust and efficient parallel numerical algorithms and their implementation in easy-to-use portable software components are crucial for computational science and engineering applications. They are strongly influenced by the remarkable progress in the development of parallel computer systems.
Amestoy P +4 more
openaire +2 more sources
Robust and efficient parallel numerical algorithms and their implementation in easy-to-use portable software components are crucial for computational science and engineering applications. They are strongly influenced by the remarkable progress in the development of parallel computer systems.
Amestoy P +4 more
openaire +2 more sources
Structuring of Parallel Algorithms
Journal of the ACM, 1968The structuring of algorithms suitable for execution on parallel processors is discussed. Two examples of such algorithms are given. The first example exhibits a restructuring of Bellman's dynamic programming technique; the second presents a method of parsing MAD-type statements in parallel.
openaire +1 more source
PARALLEL ALGORITHMS FOR CONTROL
IFAC Proceedings Volumes, 1992Abstract Two classes of concurrent algorithm for real-time Kalman filtering are presented in order to illustrate some algorithm engineering concepts. One is based on systolic computation, and fine-grained algorithms are derived for both regular and square-root covariance Kalman filtering.
openaire +1 more source
Algorithms for parallel boosting
Fourth International Conference on Machine Learning and Applications (ICMLA'05), 2006We present several algorithms that combine many base learners trained on different distributions of the data, but allow some of the base learners to be trained simultaneously by separate processors. Our algorithms train batches of base classifiers using distributions that can be generated in advance of the training process. We propose several heuristic
Fernando Lozano, Pedro Rangel
openaire +2 more sources
A Parallel Quicksort Algorithm
Journal of Parallel and Distributed Computing, 1993Abstract An optimal parallel version of quicksort, pquicksort, is presented and analyzed. The algorithm is designed for a p-processor MIMD (multiple instruction, multiple data) machine with shared memory and is an exclusive read, exclusive write algorithm.
Theodore Brown, Renbing Xiong
openaire +2 more sources
Parallel clustering algorithms
Parallel Computing, 1989zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Xiaobo Li 0001, Zhixi Fang
openaire +2 more sources