Filters








1,581 Hits in 7.2 sec

Parallel Implementations of Candidate Solution Evaluation Algorithm for N-Queens Problem

Jianli Cao, Zhikui Chen, Yuxin Wang, He Guo, Leo Y. Zhang
2021 Complexity  
The N-Queens problem plays an important role in academic research and practical application. Heuristic algorithm is often used to solve variant 2 of the N-Queens problem.  ...  The experimental results show that, for a large-scale N-Queens problem, the coarse-grained GPU scheme achieved a maximum 307-fold speedup over a single-threaded CPU counterpart in evaluating a candidate  ...  Acknowledgments is work was supported by the National Natural Science Foundation of China (61672123).  ... 
doi:10.1155/2021/6694944 fatcat:aamswkg5efgvbio2k5yse6be2a

Foreword to the Special Section on Reconfigurable Computing

Steven Derrien, Kubilay Atasu, João M. P. Cardoso, Juergen Becker
2017 Journal of Signal Processing Systems  
Their work, which is part of an open-source effort, aims at accelerating the search of solutions to a previously unsolved problem instance of the well-known N-Queens Puzzle.  ...  An in-depth discussion of current results and a projection on the remaining run time to solve the problem are also provided in the paper.  ... 
doi:10.1007/s11265-017-1237-7 fatcat:xrk3eikqkzgfbbvg5pyv25bngy

Complex matter field universal models with optimal scaling for solving combinatorial optimization problems [article]

Natalia G. Berloff
2022 arXiv   pre-print
We explicitly formulate one-to-one mapping for three famous problems: graph colouring, the travelling salesman, and the modular N-queens problem.  ...  We develop a universal model based on the classical complex matter fields that allow the optimal mapping of many real-life NP-hard combinatorial optimisation problems into the problem of minimising a spin  ...  A vertex takes one of the possible n colours for the graph colouring task. The N-queen problem requires N 2 spins to represent the chessboard squares.  ... 
arXiv:2201.10595v1 fatcat:irpcg3mvcfh7fk3ryjlun6bj6e

ASSOCIATION RULE MINING USING BIO INSPIRED BEES SWARM INTELLIGENCE ON CUDA

A. S. Shelar
2017 International Journal of Advanced Research in Computer Science  
In this case GPUs can be used to increase performance of the computation.  ...  These kinds of problems need more powerful processors and are time expensive. For such issues solution can be provided by graphics processing units (GPUs).  ...  Following this brief state of the art, different ways have been proposed for parallel ARM problem. For each approach, the authors take advantage of the used parallel hardware.  ... 
doi:10.26483/ijarcs.v8i7.4572 fatcat:zr6my6dmdnf2jjwbi5cgbg4ozq

Dynamic Configuration of CUDA Runtime Variables for CDP-Based Divide-and-Conquer Algorithms [chapter]

Tiago Carneiro, Jan Gmys, Nouredine Melab, Francisco Heron de Carvalho Junior, Pedro Pedrosa Rebouças Filho, Daniel Tuyttens
2019 Water Governance and Management in India  
The proposed algorithm was implemented for solving permutation combinatorial problems and experimented on two test-cases: N-Queens and the Asymmetric Travelling Salesman Problem.  ...  The proposed algorithm was implemented for solving permutation combinatorial problems, experimented on two test-cases: N-Queens and the Asymmetric Travelling Salesman Problem.  ...  Algorithm 5: Calculating a suitable chunk size. Input: chunk, the size N of the problem, and the number k of kernel generations. Output: A suitable chunk size.  ... 
doi:10.1007/978-3-030-15996-2_2 dblp:conf/vecpar/CarneiroGMJFT18 fatcat:g3yhoidckrglrpm4ffb6vrip5y

Accelerating sequential programs using FastFlow and self-offloading [article]

Marco Aldinucci, Marco Danelutto, Peter Kilpatrick, Massimiliano Meneghin, Massimo Torquati
2010 arXiv   pre-print
In this paper we present a further evolution of FastFlow enabling programmers to offload part of their workload on a dynamically created software accelerator running on unused CPUs.  ...  The offloaded function can be easily derived from pre-existing sequential code. We emphasize in particular the effective trade-off between human productivity and execution efficiency of the approach.  ...  N-queens problem The N-queens problem is a generalization of the well-known 8-queens problem. N-queens have to be placed on an NxN sized chessboard such that no queen can attack any of the others.  ... 
arXiv:1002.4668v1 fatcat:4j4yjef6jncpng5tuuewmkcukq

A GPU Task-Parallel Model with Dependency Resolution

Stanley Tzeng, Brandon Lloyd, John D. Owens
2012 Computer  
We apply our methods to intra prediction in the H.264 video codec and an N-queens backtracking problem.  ...  We present a task-parallel programming model for the GPU. Our task model is robust enough to handle irregular workloads that contain dependencies.  ...  Acknowledgments The authors appreciate the support of the National Science Foundation (grants CCF-0644602 and CCF-1017399), the Intel Science and Technology Center for Visual Computing, and a CITRIS seed  ... 
doi:10.1109/mc.2012.255 fatcat:bzm74dafengdvm57bwjz4bdko4

A Performance Evaluation of Dynamic Parallelism for Fine-Grained, Irregular Workloads

Max Plauth, Frank Feinbube, Frank Schlegel, Andreas Polze
2016 International Journal of Networking and Computing  
For the evaluation of the proposed approaches, a case study is conducted on the N-Queens problem.  ...  This work investigates methods for employing Dynamic Parallelism with the goal of improved workload distribution for tree search algorithms on modern GPU hardware.  ...  Disclaimer This paper reflects only the authors' views and the European Commission is not responsible for any use that may be made of the information it contains.  ... 
doi:10.15803/ijnc.6.2_212 fatcat:gaxxwmmsnraovbdzpbozb67oue

Development of an Application for Interactive Research and Analysis of the N-Queens Problem

Velin Kralev, Radoslava Kraleva, Dimitar Chakalov
2021 International Journal on Advanced Science, Engineering and Information Technology  
This paper presents a study on the N-Queens Problem. Different approaches to its solution discussed in the scientific literature are analyzed.  ...  The experimental results show that with a linear increase in the number of queens (equivalent to a quadratic increase in the number of fields on the board, the number of recursive calls made by the algorithm  ...  ACKNOWLEDGMENT This work was supported by the South-West University "Neofit Rilski" in Bulgaria.  ... 
doi:10.18517/ijaseit.11.5.14523 fatcat:zng5zyncunadrem6odeo2ajdme

Comparison of OpenMP & OpenCL Parallel Processing Technologies

Krishnahari Thouti, S.R.Sathe
2012 International Journal of Advanced Computer Science and Applications  
The focus of our study is on the performance of benchmark comparing OpenMP and OpenCL. We observed that OpenCL programming model is a good option for mapping threads on different processing cores.  ...  This paper presents a comparison of OpenMP and OpenCL based on the parallel implementation of algorithms from various fields of computer applications.  ...  N-Queens Problem The n-queen problem is a classic problem of placing nchess queens on chessboard so that no two queens attack each other.  ... 
doi:10.14569/ijacsa.2012.030410 fatcat:c4jtftwvvfag5dfpfutryzzuee

Exploiting the Constrainedness in Constraint Satisfaction Problems [chapter]

Miguel A. Salido, Federico Barber
2004 Lecture Notes in Computer Science  
A general rule in constraint satisfaction is to tackle the hardest part of a search problem first. In this paper, we introduce a parameter (τ ) that measures the constrainedness of a search problem.  ...  This heuristic may accelerate the search due to inconsistencies can be found earlier and the number of constraint checks can significantly be reduced.  ...  n-queens problem.  ... 
doi:10.1007/978-3-540-30106-6_13 fatcat:fl4mo3qpoba6voxniuq33y5ajq

Reconstructing Hardware Transactional Memory for Workload Optimized Systems [chapter]

Kunal Korgaonkar, Prabhat Jain, Deepak Tomar, Kashyap Garimella, Veezhinathan Kamakoti
2011 Lecture Notes in Computer Science  
This biennial event provides a forum for representing this community's research efforts and exchanging viewpoints.  ...  To ensure a high-quality program and ensure interactive discussions, we made authors aware of the existence of a pre-filtering mechanism.  ...  The research was funded by Intel  ... 
doi:10.1007/978-3-642-24151-2_1 fatcat:32cx745cn5cfdm5sbeah6eyiey

Enhancing data parallelism for Ant Colony Optimization on GPUs

José M. Cecilia, José M. García, Andy Nisbet, Martyn Amos, Manuel Ujaldón
2013 Journal of Parallel and Distributed Computing  
Our contribution within this context is threefold: (1) a data parallelism scheme for tour construction tailored to GPUs, (2) novel GPU programming strategies for the pheromone update stage, and (3) a new  ...  Our implementation leads to factor gains exceeding 20x for any of the two stages of the ACO algorithm as applied to the TSP when compared to its sequential counterpart version running on a similar single-threaded  ...  Acknowledgments This work was partially supported by a travel grant from the EU  ... 
doi:10.1016/j.jpdc.2012.01.002 fatcat:ij7nt4flejgkviwfqcsrxykski

Indices

1981 Mathematics of Computation  
POMERANCE, CARL QUEEN, LARISSA RAPPAZ, J. RAPPAZ, JACQUES RAVIART, P. A. RICE, JOHN R., HOUSTIS, ELIAS N. & DYKSEN, WAYNE R. RICHTER, GERARD R. ROLEFF, K.  ...  for Solving Finite Ele- ment Equations. 36 35 The Vortex Method With Finite Elements. 36 119 Rates of Convergence for Viscous Splitting of the Navler-Stokes Equations. 37 243 See: BARDOS,  ... 
doi:10.1090/s0025-5718-81-99834-3 fatcat:tydelb6be5dovhnhoitotpqpzi

On the characterization of OpenCL dwarfs on fixed and reconfigurable platforms

Konstantinos Krommydas, Wu-chun Feng, Muhsen Owaida, Christos D. Antonopoulos, Nikolaos Bellas
2014 2014 IEEE 25th International Conference on Application-Specific Systems, Architectures and Processors  
As such, we present the latest release of OpenDwarfs, a benchmark suite that currently realizes the Berkeley dwarfs in OpenCL, a vendor-agnostic and open-standard computing language for parallel computing  ...  Furthermore, we desire a common programming model for the benchmarks that facilitates code portability across a wide variety of different processors (e.g., CPU, APU, GPU, FPGA, DSP) and computing environments  ...  The authors would also like to thank the OpenDwarfs project, supported by the NSF Center for High-Performance Reconfigurable Computing (CHREC).  ... 
doi:10.1109/asap.2014.6868650 dblp:conf/asap/KrommydasFOAB14 fatcat:2jiwfdlfgjakroxde2n37y734y
« Previous Showing results 1 — 15 out of 1,581 results