Results 291 to 300 of about 186,522 (338)
Some of the next articles are maybe not open access.
2002
Data mining refers to a process on nontrivial extraction of implicit, previously unknown and potential useful information (such as knowledge rules, constraints, regularities) from data in databases. With the availability of inexpensive storage and the progress in data capture technology, many organizations have created ultra-large databases of business
David Taniar, J. Wenny Rahayu
+6 more sources
Data mining refers to a process on nontrivial extraction of implicit, previously unknown and potential useful information (such as knowledge rules, constraints, regularities) from data in databases. With the availability of inexpensive storage and the progress in data capture technology, many organizations have created ultra-large databases of business
David Taniar, J. Wenny Rahayu
+6 more sources
Proceedings of the 2007 workshop on Declarative aspects of multicore programming, 2007
We describe the design and current status of our effort to implement the programming model of nested data parallelism into the Glasgow Haskell Compiler. We extended the original programming model and its implementation, both of which were first popularised by the NESL language, in terms of expressiveness as well as efficiency.
Manuel M. T. Chakravarty +4 more
openaire +1 more source
We describe the design and current status of our effort to implement the programming model of nested data parallelism into the Glasgow Haskell Compiler. We extended the original programming model and its implementation, both of which were first popularised by the NESL language, in terms of expressiveness as well as efficiency.
Manuel M. T. Chakravarty +4 more
openaire +1 more source
[Proceedings 1992] The Fourth Symposium on the Frontiers of Massively Parallel Computation, 1992
The authors present Data Parallel Fortran (DPF), a set of extensions to Fortran aimed at programming scientific applications on a variety of parallel machines. DPF portrays a global name space to programmers and allows programs to be written in a clear, data-parallel style.
P.M. Elustondo +6 more
openaire +1 more source
The authors present Data Parallel Fortran (DPF), a set of extensions to Fortran aimed at programming scientific applications on a variety of parallel machines. DPF portrays a global name space to programmers and allows programs to be written in a clear, data-parallel style.
P.M. Elustondo +6 more
openaire +1 more source
Kernel-control parallel versus data parallel
ACM SIGPLAN Notices, 1993The dusty deck problem is the problem of how to automatically transform large existing serial/vector codes into a form suitable for efficient execution on new parallel architectures. Kernel-control parallel (KCP) methods provide a promising approach to solving the dusty deck problem for MIMD ...
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
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
openaire +1 more source
Parallel simulation of data parallel programs
1996Accurate simulations of parallel programs for large datasets can often be slow; parallel execution has been shown to offer significant potential in reducing the execution time of many discrete-event simulators. In this paper, we describe the design and implementation of a parallel simulator called DPSIM that simulates the execution of data parallel ...
Sundeep Prakash, Rajive Bagrodia
openaire +1 more source
Polarized data parallel data flow
Proceedings of the 5th International Workshop on Functional High-Performance Computing, 2016We present an approach to writing fused data parallel data flow programs where the library API guarantees that the client programs run in constant space. Our constant space guarantee is achieved by observing that binary stream operators can be provided in several polarity versions.
Ben Lippmeier, Fil Mackay, Amos Robinson
openaire +1 more source
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.
Dieter W. Heermann, Anthony N. Burkitt
openaire +1 more source
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.
Dieter W. Heermann, Anthony N. Burkitt
openaire +1 more source
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
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