Results 91 to 100 of about 21,441,590 (245)

COMPARATIVE ANALYSIS OF BIT-PARALLEL STRING PATTERN MATCHING ALGORITHMS FOR BIOLOGICAL SEQUENCES

Operational Research in Engineering Sciences: Theory and Applications, 2023
The inherent parallelism in a bit operation like AND/OR inside a computer word is known as bit parallelism. It plays a greater role in string pattern matching and has good application in the analysis of biological data. The use of recently developed bit
Muhammad Yusuf Muhammad, Mathias Fonkam, Salu George Thandekatu, Sandip Rakshit, Rao Narasimha Vajjhala   +4 more
doaj  

Abstract data type support in Prolog and its relation to parallelism [PDF]

, 1994
Isambo Karali, C. Halatsis
openalex   +1 more source

Couillard: Parallel Programming via Coarse-Grained Data-Flow Compilation [PDF]

arXiv, 2011
Data-flow is a natural approach to parallelism. However, describing dependencies and control between fine-grained data-flow tasks can be complex and present unwanted overheads. TALM (TALM is an Architecture and Language for Multi-threading) introduces a user-defined coarse-grained parallel data-flow model, where programmers identify code blocks, called
arxiv  

Skeletons for data parallelism in p31 [PDF]

, 1997
Marco Danelutto, Fabrizio Pasqualetti, Susanna Pelagatti   +2 more
openalex   +1 more source

Comparing Portability of FPGA High-Level Synthesis Frameworks in the Context of a Highly-Parallel Application

IEEE Access
With the growing popularity of FPGA-based accelerators in HPC applications, new challenges have emerged, particularly in terms of programming and portability. This paper provides an overview of the current state of FPGA tools and their limitations.
Manuel De Castro, Roberto R. Osorio, Francisco J. Andujar, Rocio Carratala-Saez, Yuri Torres, Diego R. Llanos   +5 more
doaj   +1 more source

Parallel and distributed Gröbner bases computation in JAS [PDF]

arXiv, 2010
This paper considers parallel Gr\"obner bases algorithms on distributed memory parallel computers with multi-core compute nodes. We summarize three different Gr\"obner bases implementations: shared memory parallel, pure distributed memory parallel and distributed memory combined with shared memory parallelism.
arxiv  

The application of improved densenet algorithm in accurate image recognition

Scientific Reports
Image recognition technology belongs to an important research field of artificial intelligence. In order to enhance the application value of image recognition technology in the field of computer vision and improve the technical dilemma of image ...
Yuntao Hou, Zequan Wu, Xiaohua Cai, Tianyu Zhu   +3 more
doaj   +1 more source

Scalable deep text comprehension for Cancer surveillance on high-performance computing

BMC Bioinformatics, 2018
Background Deep Learning (DL) has advanced the state-of-the-art capabilities in bioinformatics applications which has resulted in trends of increasingly sophisticated and computationally demanding models trained by larger and larger data sets.
John X. Qiu, Hong-Jun Yoon, Kshitij Srivastava, Thomas P. Watson, J. Blair Christian, Arvind Ramanathan, Xiao C. Wu, Paul A. Fearn, Georgia D. Tourassi   +8 more
doaj   +1 more source

Shared Memory Parallelization of MTTKRP for Dense Tensors [PDF]

arXiv, 2017
The matricized-tensor times Khatri-Rao product (MTTKRP) is the computational bottleneck for algorithms computing CP decompositions of tensors. In this paper, we develop shared-memory parallel algorithms for MTTKRP involving dense tensors. The algorithms cast nearly all of the computation as matrix operations in order to use optimized BLAS subroutines ...
arxiv  

High-Performance Hybrid Algorithm for Minimum Sum-of-Squares Clustering of Infinitely Tall Data

Mathematics
This paper introduces a novel formulation of the clustering problem, namely, the minimum sum-of-squares clustering of infinitely tall data (MSSC-ITD), and presents HPClust, an innovative set of hybrid parallel approaches for its effective solution.
Ravil Mussabayev, Rustam Mussabayev
doaj   +1 more source