12 papers · ranked by Valyu relevance
Bahman Arasteh, Seyed Salar Sefati, Huseyin Kusetogullari, Farzad Kiani + 3 more
Efficient task scheduling remains a key challenge in High-Performance Computing and Internet of Things (IoT) systems, where the sequential execution of nested loops often limits parallelism. This paper proposes a hybrid approach that dynamically parallelizes nested loops in heterogeneous IoT environments. The suggested…
H.K. Al-Mahdawi, A. I Sidikova, Hussein Alkattan, Mostafa Abotaleb + 2 more
'Ammar Kadi' 'El-Sayed M El-kenawy'] We considered in this work the linear operator equation and used the Landweber iterative method as an iterative solver. After that, we used the multigrid method as an optimization method for obtaining an approximation solution with a highly accurate and fast process. A new parallel…
Peiyu Zong, Wenpeng Deng, Jian Liu, Jue Ruan
Farrar recommends employing a stripe method to enhance the implementation of in-sequence parallelism, resulting in significant improvements in parallel performance through the utilization of the SIMD instruction set. This method involves reorganizing the originally sequential computation. The length of each stripe…
Peiyu Zong, Wenpeng Deng, Jian Liu, Jue Ruan
The rapid advancements in sequencing length necessitate the adoption of increasingly efficient sequence alignment algorithms. The Needleman-Wunsch method introduces the foundational dynamic programming (DP) matrix calculation for global alignment, which evaluates the overall alignment of sequences. However, this method…
Kecong Tang, Ahsan Sanaullah, Degui Zhi, Shaojie Zhang
Durbin’s positional Burrows-Wheeler transform (PBWT) enables algorithms with the optimal time complexity of O(MN) for reporting all vs all haplotype matches in a population panel with M haplotypes and N variant sites. However, even this efficiency may still be too slow when the number of haplotypes reaches millions. To…
Mohammed Abutaha, Islam Amar, Salman AlQahtani, Xiaowei Li + 2 more
Encrypting pictures quickly and securely is required to secure image transmission over the internet and local networks. This may be accomplished by employing a chaotic scheme with ideal properties such as unpredictability and non-periodicity. However, practically every modern-day system is a real-time system, for which…
Junichiro Makino, Toshikazu Ebisuzaki, Ryutaro Himeno, Yoshihide Hayashizaki
Rapidly increasing amount of short read data generated by NGSs (new-generation sequencers) calls for the development of fast and accurate read alignment programs. The programs based on hash table (BLAST) and Burrows-Wheeler transform (bwa-mem) are used, and the latter is known to give superior performance. We here…
Alvaro Estebanez, Diego R. Llanos, David Orden, Belen Palop + 1 more
'Rafael Sachetto Oliveira'] Loops are a rich source of parallelism. Unfortunately, many loops cannot be safely parallelized at compile time because the compiler is not able to guarantee that there will be no dependence violations. Thread-Level Speculation (TLS) techniques, either hardware or software-based, allow the…
Wilfried Agbeto, Camille Coti, Vladimir Reinharz
Advances in graph algorithmics have allowed in-depth study of many natural objects from molecular biology or chemistry to social networks. Particularly in molecular biology and cheminformatics, understanding complex structures by identifying conserved sub-structures is a key milestone towards the artificial design of…
Sirilak Ketchaya, Apisit Rattanatranurak
Quicksort is an important algorithm that uses the divide and conquer concept, and it can be run to solve any problem. The performance of the algorithm can be improved by implementing this algorithm in parallel. In this paper, the parallel sorting algorithm named the Multi-Deque Partition Dual-Deque Merge Sorting…
Yuma Osako, Aineias Arango, Toshitake Asabuki
Animals flexibly combine learned behaviors into novel actions without practicing their combinations, yet the computational mechanisms that enable independently acquired computations to be expressed in parallel remain unclear. Here we show that feedback geometry during learning determines whether recurrent dynamics can…
Max Doblas, Oscar Lostes-Cazorla, Quim Aguado-Puig, Cristian Iñiguez + 2 more
Pairwise sequence alignment is a core component of multiple sequencing-data analysis tools. Recent advancements in sequencing technologies have enabled the generation of longer sequences at a much lower price. Thus, long-read sequencing technologies have become increasingly popular in sequencing-based studies. However…