Results 251 to 260 of about 158,911 (285)
Some of the next articles are maybe not open access.
Proceedings of the 2nd ACM SIGPLAN workshop on Functional high-performance computing, 2013
The implicit data parallelism in collective operations on aggregate data structures constitutes an attractive parallel programming model for functional languages. Beginning with our work on integrating nested data parallelism into Haskell, we explored a variety of different approaches to array-centric data parallel programming in Haskell, experimented ...
openaire +2 more sources
The implicit data parallelism in collective operations on aggregate data structures constitutes an attractive parallel programming model for functional languages. Beginning with our work on integrating nested data parallelism into Haskell, we explored a variety of different approaches to array-centric data parallel programming in Haskell, experimented ...
openaire +2 more sources
Data-Parallel Sparse Factorization
SIAM Journal on Scientific Computing, 1998The data-parallel implementation of the multifrontal algorithm for the LU factorization, without pivoting, of matrices having symmetric structure and nonsymmetric coefficients is considered. A simple yet efficient and scalable implementation of the multifrontal sparse LU factorization is presented.
Steven G. Kratzer +3 more
openaire +2 more sources
ACM SIGGRAPH 2008 classes, 2008
Users always care about performance. Although often it's just a matter of making sure the software is doing only what it should, there are many cases where it is vital to get down to the metal and leverage the fundamental characteristics of the processor.Until recently, performance improvement was not difficult.
openaire +1 more source
Users always care about performance. Although often it's just a matter of making sure the software is doing only what it should, there are many cases where it is vital to get down to the metal and leverage the fundamental characteristics of the processor.Until recently, performance improvement was not difficult.
openaire +1 more source
Parallel algorithms for data compression
Journal of the ACM, 1985Parallel algorithms for data compression by textual substitution that are suitable for VLSI implementation are studied. Both “static” and “dynamic” dictionary schemes are considered.
M. E. Gonzalez Smith, James A. Storer
openaire +3 more sources
Journal of Parallel and Distributed Computing, 1994
Abstract In data-parallel programming, operations are performed simultaneously on all elements of large data structures. Backus′s FP functional language promotes this view. FP provides a large set of data rearrangement primitives, and a useful set of functional combining forms that are applied to entire data structures.
Deb Banerjee, Clifford Walinsky
openaire +3 more sources
Abstract In data-parallel programming, operations are performed simultaneously on all elements of large data structures. Backus′s FP functional language promotes this view. FP provides a large set of data rearrangement primitives, and a useful set of functional combining forms that are applied to entire data structures.
Deb Banerjee, Clifford Walinsky
openaire +3 more sources
1991
There are a number of situations where data parallelization is to be preferred over geometric parallelization. An example of such a situation that we have already encountered is that of a system with long-range interactions, such as Coulombic or gravitational interactions.
Anthony N. Burkitt, Dieter W. Heermann
openaire +2 more sources
There are a number of situations where data parallelization is to be preferred over geometric parallelization. An example of such a situation that we have already encountered is that of a system with long-range interactions, such as Coulombic or gravitational interactions.
Anthony N. Burkitt, Dieter W. Heermann
openaire +2 more sources
Data-parallel, volumerendering algorithms
The Visual Computer, 1995In this presentation, we consider the image-composition scheme for parallel volume rendering in which each processor is assigned a portion of the volume. A processor renders its data by using any existing volume-rendering algorithm. We describe one such parallel algorithm that also takes advantage of vector-processing capabilities. The resulting images
Raghu Machiraju, Roni Yagel
openaire +2 more sources
COMPCON Spring '91 Digest of Papers, 2002
The author examines a method of applying parallelism to data-moving operations to enhance performance so that they may fit into today's maintenance windows. She specifically discusses converting the algorithm used to load an alternate key file (index) from serial to parallel using Tandem's Non-Stop SQL.
openaire +2 more sources
The author examines a method of applying parallelism to data-moving operations to enhance performance so that they may fit into today's maintenance windows. She specifically discusses converting the algorithm used to load an alternate key file (index) from serial to parallel using Tandem's Non-Stop SQL.
openaire +2 more sources
Data Parallel Programming [PDF]
, 2000 SIMD computers operate as data parallel computers by having the same instruction executed by different processing elements but on different data and all in a synchronous fashion. In an SIMD machine the synchronization is built into the hardware, meaning that the processing elements operate in lock-step fashion.
openaire +1 more source
Mechanisms for Parallel Data Transport
2012Evolving paradigms of parallel transport mechanisms are necessary to satisfy the ever increasing need of high performing communication systems. Parallel transport mechanisms can be described as a technique to send several data simultaneously using several parallel channels.
Okyere Benya J. +4 more
openaire +2 more sources