Results 261 to 270 of about 3,741,686 (304)
Some of the next articles are maybe not open access.
Randomized parallel algorithms
1996In this paper we show some important randomized techniques for the parallel processing of discrete problems. In particular, we present a few parallel randomized algorithms frequently used for shortest paths problems, matching problems, depth first search and maximum independent set problems.
Andrea Clementi +2 more
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 +3 more sources
2010
Given a set of weighted hyper-rectangles in a k-dimensional space, the chaining problem is to identify a set of colinear and nonoverlapping hyper-rectangles of total maximal weight. This problem is used in a number of applications in bioinformatics, string processing, and VLSI design.
Mohamed Ibrahim Abouelhoda +1 more
openaire +2 more sources
Given a set of weighted hyper-rectangles in a k-dimensional space, the chaining problem is to identify a set of colinear and nonoverlapping hyper-rectangles of total maximal weight. This problem is used in a number of applications in bioinformatics, string processing, and VLSI design.
Mohamed Ibrahim Abouelhoda +1 more
openaire +2 more sources
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 +2 more sources
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 +2 more sources
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
The Structure of Parallel Algorithms
1980Publisher Summary This chapter presents many examples of parallel algorithms and studies them under a uniform framework. The chapter explains a parallel algorithm as a collection of independent task modules that can be executed in parallel and that communicate with each other during the execution of the algorithm.
openaire +1 more source
Parallel algorithms and architectures
Computer Physics Communications, 1989Abstract In this paper we consider some of the central issues involved in the design of parallel algorithms. We describe several efficient algorithms for idealised shared memory architectures and draw some conclusions as to what would be required to implement them on a realistic physical architecture, i.e. one with distributed memory.
openaire +2 more sources
1984
Publisher Summary This chapter presents a survey on various parallel sorting algorithms. Sorting is a nontrivial problem and has widespread commercial and business applications. Serial algorithms for sorting have been available since the days of punched-card machines. At present, there is a considerable body of literature on serial sorting algorithms.
S. Lakshmivarahan +2 more
openaire +2 more sources
Publisher Summary This chapter presents a survey on various parallel sorting algorithms. Sorting is a nontrivial problem and has widespread commercial and business applications. Serial algorithms for sorting have been available since the days of punched-card machines. At present, there is a considerable body of literature on serial sorting algorithms.
S. Lakshmivarahan +2 more
openaire +2 more sources
2014
We develop a nature-inspired generic programming language for parallel algorithms, one that works for all data structures and control structures. Any parallel algorithm satisfying intuitively-appealing postulates can be modeled by a collection of cells, each of which is an abstract state machine, augmented with the ability to spawn new cells. All cells
Nachum Dershowitz, Evgenia Falkovich
openaire +2 more sources
We develop a nature-inspired generic programming language for parallel algorithms, one that works for all data structures and control structures. Any parallel algorithm satisfying intuitively-appealing postulates can be modeled by a collection of cells, each of which is an abstract state machine, augmented with the ability to spawn new cells. All cells
Nachum Dershowitz, Evgenia Falkovich
openaire +2 more sources