Filters








51,156 Hits in 5.9 sec

An Effective Structure for Algorithmic Design and a Parallel Prefix Algorithm on Metacube

Yamin Li, Shietung Peng, Wanming Chu
2008 2008 Ninth International Conference on Parallel and Distributed Computing, Applications and Technologies  
Based on the new presentation, we give an efficient algorithm for parallel prefix computation on Metacubes that runs in 2 k m(k + 1) + k communication steps and 2 k+1 m + 2k computation steps. only if  ...  The prefix is an important primitive for data-parallel computing [2] .  ...  Proposed Prefix Algorithm on Metacube Now, we are ready to give an efficient parallel prefix algorithm on Metacube.  ... 
doi:10.1109/pdcat.2008.20 dblp:conf/pdcat/LiPC08 fatcat:zxkeclqk6rdj3mkqz5xr3m4u7q

Efficient iterative receiver for bit-Interleaved Coded Modulation according to the DVB-T2 standard

Meng Li, Charbel Abdel Nour, Christophe Jego, Jianxiao Yang, Catherine Douillard
2011 2011 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)  
The main contribution is scheduling an efficient message passing algorithm with low latency between the demapper and the LDPC decoder.  ...  In this paper, an efficient shuffled iterative receiver is investigated for the second generation of the terrestrial digital video broadcasting standard DVB-T2.  ...  This calls for an efficient message passing between both sides. In this paper, different schedule solutions are investigated for the DVB-T2 standard.  ... 
doi:10.1109/icassp.2011.5946694 dblp:conf/icassp/LiNJYD11 fatcat:ixcsqz6ax5cahhvp6s6mvhmosi

An Efficient Parallel Sorting Algorithm on Metacube Multiprocessors [chapter]

Yamin Li, Shietung Peng, Wanming Chu
2009 Lecture Notes in Computer Science  
One of the practical parallel sorting algorithms is Bitonic Sort, which is implemented in O(n 2 ) time for sorting N = 2 n numbers in an n-cube.  ...  In this paper, we present an efficient sorting algorithm on metacube multiprocessors. The proposed sorting algorithm is based on the Batcher's bitonic sorting algorithm.  ...  More complicated O(n log n)-time algorithms are not competitive to bitonic algorithm for n < 20 and are complex for the implementation on parallel machines [7, 10] .  ... 
doi:10.1007/978-3-642-03095-6_36 fatcat:oekyu63c25axpllvtit7gd2n3i

Prefix Computation and Sorting in Dual-Cube

Yamin Li, Shietung Peng, Wanming Chu
2008 2008 37th International Conference on Parallel Processing  
We propose efficient algorithms for parallel prefix computation and sorting in dual-cube based on the two techniques, respectively.  ...  In this paper, we describe two algorithmic techniques for the design of efficient algorithms in dual-cube.  ...  techniques for the design of efficient algorithms in dual-cube.  ... 
doi:10.1109/icpp.2008.18 dblp:conf/icpp/LiPC08 fatcat:rq6iyi4jgfhevj4zfcdcc4n73u

A shuffled iterative bit-interleaved coded modulation receiver for the DVB-T2 standard: Design, implementation and FPGA prototyping

Meng Li, Charbel Abdel Nour, Christophe Jego, Jianxiao Yang, Catherine Douillard
2011 2011 IEEE Workshop on Signal Processing Systems (SiPS)  
Scheduling an efficient message passing algorithm with low latency between the demapper and the LDPC decoder represents the main contribution.  ...  In this paper, an efficient shuffled iterative receiver is investigated for the second generation of the terrestrial digital video broadcasting standard DVB-T2.  ...  The basic idea of the parallelized iterative receiver Shuffled Parallel Demapping and Decoding Algorithm For iteration max 1, 2,..., t t   , within one parallel processing unit with Q bits  ... 
doi:10.1109/sips.2011.6088949 dblp:conf/sips/LiNJYD11 fatcat:23mahphazbgpzngrjoigpgh2bm

A Novel Header Matching Algorithm For Intrusion Detection Systems

Mohammad A Alia, Adnan A Hnaif, Hayam K Al Anie, Khulood Abu Maria, Ahmed M Manasrah, M Imran Sarwar
2011 International journal of network security and its applications  
We proposed a new parallelized matching algorithm for intrusion detection system called distributed packet header matching algorithm (DPHM).  ...  This algorithm can be run on a single processor or multiple-cores platform.  ...  Acknowledgment The authors would like to thank Al-Zaytoonah University of Jordan for supporting this study.  ... 
doi:10.5121/ijnsa.2011.3406 fatcat:si6hx7jxwncf3mlhky7viyktqi

Assessment of Two Privacy Preserving Authentication Methods Using Secure Multiparty Computation Based on Secret Sharing

Diana-Elena Fălămaş, Kinga Marton, Alin Suciu
2021 Symmetry  
The efficiency of the used protocols is evaluated along with two SMPC specific metrics: The number of communication rounds and the communication cost.  ...  In this paper, we propose a system for both password-based and iris-based authentication that uses secure multiparty computation (SMPC) protocols and Shamir secret sharing.  ...  Abbreviations The following abbreviations are used in this manuscript: SMPC Secure Multiparty Computation HD Hamming Distance FBD Fragile Bit Distance  ... 
doi:10.3390/sym13050894 fatcat:r3iwcprkbjaopfvtmmnd45py4m

Parallel Prefix Computation and Sorting on a Recursive Dual-Net

Yamin Li, Shietung Peng, Wanming Chu
2011 Journal of Information Processing Systems  
The algorithm for parallel sorting on RDN k (B) is restricted on B = Q m where Q m is an m-cube.  ...  In this paper, we propose efficient algorithms for parallel prefix computation and sorting on a recursive dual-net.  ...  To design efficient algorithms for basic computational problems on an interconnection network is an important issue.  ... 
doi:10.3745/jips.2011.7.2.271 fatcat:lv3mpmlctjcvjnbm4doyyzp5vy

A TCAM-based distributed parallel IP lookup scheme and performance analysis

Kai Zhen, Chengchen Hu, Hongbin Lu, Bin Liu
2006 IEEE/ACM Transactions on Networking  
In our multi-chip scheme, we devise a load-balanced TCAM table construction algorithm together with an adaptive load balancing mechanism.  ...  We propose in this paper an original TCAM-based IP lookup scheme that achieves both ultra-high lookup throughput and optimal utilization of the memory while being power-efficient.  ...  Bermingham from DCU, Ireland, for their efforts in proofreading the revised manuscript.  ... 
doi:10.1109/tnet.2006.880171 fatcat:z75t5nvsgzaehkhutkmf5pvq2y

Parallel Wavelet Tree Construction

Julian Shun
2015 2015 Data Compression Conference  
We present parallel algorithms for wavelet tree construction with polylogarithmic depth, improving upon the linear depth of the recent parallel algorithms by Fuentes-Sepulveda et al.  ...  We experimentally show on a 40-core machine with two-way hyper-threading that we outperform the existing parallel algorithms by 1.3--5.6x and achieve up to 27x speedup over the sequential algorithm on  ...  The parallelism of an algorithm is equal to O(T 1 /T ∞ ). For sequential algorithms, work and span are equivalent.  ... 
doi:10.1109/dcc.2015.7 dblp:conf/dcc/Shun15 fatcat:6upeshmabffhhdmdwqglt7vmii

Multi-core Implementation of Decomposition-Based Packet Classification Algorithms [chapter]

Shijie Zhou, Yun R. Qu, Viktor K. Prasanna
2013 Lecture Notes in Computer Science  
We search in parallel for all the fields using linear search or range-tree search; we store the partial results in a linked list or a bit vector.  ...  Many algorithms and hardware architectures have been proposed to accelerate packet classification.  ...  Efficient parallel algorithms are also needed on multi-core processors to improve the performance of network applications.  ... 
doi:10.1007/978-3-642-39958-9_9 fatcat:2b6l52wlrvaprgtfpu3yk6ysde

Flood Diversion Algorithm for Anticollision in RFID System

Hua Huo, Jun Qiang Liu, Yong Jie Wang
2015 International Journal of Distributed Sensor Networks  
To solve tags identification collision and improve identification efficiency in RFID system, a flood division anticollision (FDAC) algorithm has been presented.  ...  Firstly, the algorithm launches an estimation of the number of tags and according to the estimation result decides whether a flood diversion processing needs to be started or not.  ...  The authors would like to thank the reviewers for their valuable comments.  ... 
doi:10.1155/2015/245914 fatcat:yt4znhw6izgqbe5sdthmuw4yby

Efficient Parallel Join Processing Exploiting SIMD in Multi-Thread Environments

Gilseok HONG, Seonghyeon KANG, Chang soo KIM, Jun-Ki MIN
2018 IEICE transactions on information and systems  
Thus, we devise an efficient parallel join algorithm, called Parallel Merge Join with SIMD instructions (PMJS). In our proposed algorithm, we utilize data parallelism by exploiting SIMD instructions.  ...  In our multi-thread algorithm, to distribute workload evenly to each thread, we devise an efficient workload balancing algorithm based on the kernel density estimator which allows to estimate the workload  ...  We thus devise an efficient parallel join algorithm, called Parallel Merge Join with SIMD instructions (abbreviated by PMJS), based on the sort-merge join algorithm.  ... 
doi:10.1587/transinf.2017edp7300 fatcat:s6acgmspsfg6tbcbeejjo3rdjy

A parallel decoding algorithm of LDPC codes using CUDA

Shuang Wang, Samuel Cheng, Qiang Wu
2008 2008 42nd Asilomar Conference on Signals, Systems and Computers  
The parallel decoding algorithm, based on CUDA, allows that all bit-nodes or check-nodes work simultaneously, thus provides an efficient and fast way for implementing the decoder.  ...  A parallel belief propagation algorithm for decoding low-density parity-check (LDPC) Codes is presented in this paper based on Compute Unified Device Architecture (CUDA).  ...  Daesun et al. presented an efficient highly-parallel decoder architecture using partially overlapped decoding scheme for quasi-cyclic (QC) LDPC codes, which leads to reduction in hardware complexity and  ... 
doi:10.1109/acssc.2008.5074385 fatcat:cdbclk7vmjbc7jghlbzvofxmfy

Parallel, Portable Algorithms for Distance-2 Maximal Independent Set and Graph Coarsening [article]

Brian Kelley, Sivasankaran Rajamanickam
2022 arXiv   pre-print
We also describe an approach for implementing a parallel multicolor "cluster" Gauss-Seidel preconditioner using this MIS-2 coarsening, and demonstrate better performance with an efficient, parallel, multicolor  ...  The resulting algorithm is also deterministic, producing an identical result for a given input across all of these platforms.  ...  We thank Mike Gilbert (Pennsylvania State University) for creating the initial reference implementation of the Bell/Dalton/Olson MIS-2 algorithm.  ... 
arXiv:2204.02934v1 fatcat:rv5wttkz7be6jcyk34oci5kpta
« Previous Showing results 1 — 15 out of 51,156 results