Results 231 to 240 of about 158,911 (285)

Scaling Invariant Generation Using State Space Embeddings and GPU Streaming

Concurrency and Computation: Practice and Experience, Volume 37, Issue 25-26, 30 November 2025.
ABSTRACT The formal verification of railway control systems can ensure the safety of complex scheme plans through techniques such as induction‐based model checking. While inductive verification performs well in complex settings, it often produces false positives due to its consideration of transitions from unreachable safe states to unsafe states ...
Ben Lloyd‐Roberts, Filippos Pantekis, Phillip James, Liam O'Reilly, Michael Edwards   +4 more
wiley   +1 more source

Parallel DEPSO-Scout: Data Parallelism [PDF]

2018 International Electrical Engineering Congress (iEECON), 2018
DEPSO-Scout is a hybrid optimization algorithm combining Differential Evolution (DE), Particle Swarm Optimization (PSO) and Artificial Bee Colony (ABC). The solution convergence is balanced between exploration of PSO and exploitation from DE. The suboptimal solution has reduced by the scout bee property of ABC.
Prasitchai Boonserm, Suchada Sitjongsataporn   +1 more
openaire   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Integrating task parallelism in data parallel languages for parallel programming on NOWs

Concurrency: Practice and Experience, 2000
Summary: A number of high-level parallel programming platforms for networks of workstations (NOWs) have been developed in recent times. Most of these platforms target the exploitation of data parallelism in applications. They do not allow expressibility of applications as a collection of tasks along with their precedence relationships. As a result, the
K. J. Binu, D. Janaki Ram
openaire   +3 more sources

Function-Parallel Computation in a Data-Parallel Environment

1993 International Conference on Parallel Processing - ICPP'93 Vol2, 1993
Asynchromus problems are those which may be decomposed into a set of independenr sub-tasks which are suitable for concurrent execution. Th function paraIIeIism of these problems cannot normally be direcrly expressed using the data-parallel programming model.
Anthony P. Reeves, Alex L. Cheung
openaire   +2 more sources

Data-Parallel Programming on A Reconfigurable Parallel Computer

IETE Technical Review, 1998
We present a preprocessor which converts programs written in a data parallel version of C into standard C to run on CDOT CHiPPS, a reconfigurable parallel computer. The main contribution is the development of rewriting methods and an optimizing protocol for inter-processor communication during barrier synchronization.
Ranjan K Sen, M Periswamy, Rajesh K, S Selvakumar   +3 more
openaire   +2 more sources

Parallelizing data race detection

ACM SIGARCH Computer Architecture News, 2013
Detecting data races in multithreaded programs is a crucial part of debugging such programs, but traditional data race detectors are too slow to use routinely. This paper shows how to speed up race detection by spreading the work across multiple cores.
Peter M. Chen, Benjamin Wester, Jason Flinn, David Devecsery, Satish Narayanasamy   +4 more
openaire   +2 more sources

Exploitation of control parallelism in data parallel algorithms

Proceedings Frontiers '95. The Fifth Symposium on the Frontiers of Massively Parallel Computation, 2002
This paper considers the matrix decomposition A=LDL/sup T/, as a vehicle to explore the improvement in performance obtainable through the execution of multiple streams of control on SIMD architectures. Several methods for partitioning the SIMD array are considered.
V. Garg, D.E. Schimmel
openaire   +2 more sources

Parallel simulation of data parallel programs

1996
Accurate 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   +2 more sources

PROBLEMS WITH DATA PARALLELISM

Parallel Processing Letters, 2001
The gradual evolution of language features and approaches used for the programming of distributed memory machines underwent substantial advances in the 1990s. One of the most promising and widely praised approaches was based on data parallelism and resulted in High Performance Fortran. This paper reports on an experiment using that approach based on a
Carol Phillips, Ronald H. Perrott
openaire   +2 more sources

Parallel Image Processing with the Block Data Parallel Architecture

IBM Journal of Research and Development, 1996
Many digital signal and image processing algorithms can be speeded up by executing them in parallel on multiple processors. The speed of parallel execution is limited by the need for communication and synchronization between processors. In this paper, we present a paradigm for parallel processing that we call the block data flow paradigm (BDFP).
Douglas S. Reeves, Winser E. Alexander, Clay Gloster   +2 more
openaire   +3 more sources