Results 261 to 270 of about 253,501 (314)
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 +3 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
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 +1 more source
Information Processing Letters, 1985
We give a deterministic algorithm for finding the k th smallest item in a set of n items, running in O((log log n)\({}^ 2)\) parallel time on O(n) processors in Valiant's comparison model.
Richard Cole 0001, Chee-Keng Yap
openaire +1 more source
We give a deterministic algorithm for finding the k th smallest item in a set of n items, running in O((log log n)\({}^ 2)\) parallel time on O(n) processors in Valiant's comparison model.
Richard Cole 0001, Chee-Keng Yap
openaire +1 more source
Communications of the ACM, 1986
Parallel computers with tens of thousands of processors are typically programmed in a data parallel style, as opposed to the control parallel style used in multiprocessing. The success of data parallel algorithms—even on problems that at first glance seem inherently serial—suggests that this style of programming has much wider applicability than was ...
W. Daniel Hillis, Guy L. Steele Jr.
openaire +1 more source
Parallel computers with tens of thousands of processors are typically programmed in a data parallel style, as opposed to the control parallel style used in multiprocessing. The success of data parallel algorithms—even on problems that at first glance seem inherently serial—suggests that this style of programming has much wider applicability than was ...
W. Daniel Hillis, Guy L. Steele Jr.
openaire +1 more source
2001 IEEE Fourth Workshop on Multimedia Signal Processing (Cat. No.01TH8564), 2002
The MAP algorithm used in turbo decoders is very parallelizable. This property can be used to speed them up. The speedup is attained at the expense of increased complexity and processing hardware. The increase in processing hardware is linear with the speedup but the increase in complexity of the parallel implementation compared to the traditional ...
Ramakrishna Akella, Jack K. Wolf
openaire +1 more source
The MAP algorithm used in turbo decoders is very parallelizable. This property can be used to speed them up. The speedup is attained at the expense of increased complexity and processing hardware. The increase in processing hardware is linear with the speedup but the increase in complexity of the parallel implementation compared to the traditional ...
Ramakrishna Akella, Jack K. Wolf
openaire +1 more source
Measuring parallelism in algorithms
Microprocessing and Microprogramming, 1992Abstract Parallel algorithms can be represented by task graphs from which it is easy to obtain the degree of simultaneousness and the degree of connection of the algorithms. The above mentioned degrees are very important features of parallel algorithms.
Borut Jereb, Ljubo Pipan
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
Synergy in parallel algorithms
Parallel Computing, 1987zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Michael E. Henderson +1 more
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