Research ArticleOpen accessEvery word in the titleThe Parallel Maximal Cliques Algorithm for Protein Sequence ClusteringKhalid Jaber, Nur’Aini Abdul Rashid, Rosni AbdullahProblem statement: Protein sequence clustering is a method used to discover relations between proteins. This method groups the proteins based on their common features. It is a core process in protein sequence classification. Graph theory has been used in protein sequence clustering as a means of partitioning the data into groups, where each group constitutes a cluster. Mohseni-Zadeh introduced a … …American Journal of Applied Sciences, Vol. 6, Issue 7 · 31 Jul 2009 · 7,100 accessesView PDFCite
Research ArticleOpen accessEvery word in the titleParallel Implementation of Polygon Clipping Using TransputerMohammad Qatawneh, Azzam Sleit, Wesam AlmobaideenThis research describes a parallel implementation of Liang-Barsky clipping algorithm on a pipeline network configuration. The implemented configuration uses pipeline of four transputers and programmed under Occam2 language. In order to achieve the concurrency, to improve the performance and to cut down the hold-ups caused by the calculation of intersection, data buffering is used. …American Journal of Applied Sciences, Vol. 6, Issue 2 · 28 Feb 2009 · 7,385 accessesView PDFCite
Research ArticleOpen accessEvery word in the titleSimulation of Parallel Logical Operations with Biomolecular ComputingMahnaz Kadkhoda, Ali A. PouyanBiomolecular computing is the computational method that uses the potential of DNA as a parallel computing device. DNA computing can be used to solve NP-complete problems. An appropriate application of DNA computation is large-scale evaluation of parallel computation models such as Boolean Circuits. In this study, we present a molecular-based algorithm for evaluation of Nand-based Boolean Circuits. The contribution of … …American Journal of Applied Sciences, Vol. 5, Issue 12 · 31 Dec 2008 · 6,687 accessesView PDFCite
Research ArticleOpen accessEvery word in the titleCalculate Sensitivity Function Using Parallel AlgorithmH. A. RjoubProblem statement: To calculate sensitivity functions for a large dimension control system using one processor, it takes huge time to find the unknowns vectors for a linear system, which represents the mathematical model of the physical control system. This study is an attempt to solve the same problem in parallel to reduce the time factor needed and increase the efficiency. … …Journal of Computer Science, Vol. 4, Issue 11 · 30 Nov 2008 · 6,743 accessesView PDFCite
Research ArticleOpen accessEvery word in the titleA Heapify Based Parallel Sorting AlgorithmM. A.A.A. Hija, A. Zabian, S. Qawasmeh, O. H.A.A. HaijaQuick sort is a sorting algorithm whose worst case running time is θ(n2) on an input array of n numbers. It is the best practical for sorting because it has the advantage of sorting in place. Problem statement: Behavior of quick sort is complex, we proposed in-place 2m threads parallel heap sort algorithm which had advantage in sorting in place … …Journal of Computer Science, Vol. 4, Issue 11 · 30 Nov 2008 · 6,766 accessesView PDFCite
Research ArticleOpen accessEvery word in the titleDeterministic Parallel Sorting Algorithm for 2-D Mesh of Connected ComputersHamed Al Rjoub, Arwa Zabian, Ahmad OdatSorting is one of the most important operations in database systems and its efficiency can influences drastically the overall system performance. To accelerate the performance of database systems, parallelism is applied to the execution of the data administration operations. We propose a new deterministic Parallel Sorting Algorithm (DPSA) that improves the performance of Quick sort in sorting an array of … …Journal of Computer Science, Vol. 4, Issue 6 · 30 Jun 2008 · 6,824 accessesView PDFCite
Research ArticleOpen accessEvery word in the titleParallel Approaches for Intervals Analysis of Variable Statistics in Large and Sparse Linear Equations with RHS RangesPeerayuth CharnsethikulThis study proposes an algorithm capable of working in parallel for solving large and sparse linear equations under given right hand side (RHS) ranges. A comparative study to the direct linear programming method is reported theoretically, computationally and discussed. Moreover, the approach can be adapted for the system under domain decompositions structure leading to a better efficiency experimentally. …American Journal of Applied Sciences, Vol. 4, Issue 5 · 31 May 2007 · 6,823 accessesView PDFCite
Research ArticleOpen accessEvery word in the titleParallelisation of Algorithms of Mathematical MorphologyAbdallah Boukerram, Samira A.K. AzzouThe tools of mathematical morphology developed within the framework of the image processing, require of big capacity of data and the very high costs of execution. So today, the limits of the sequential machines are not to be any more to show, the passage in the new parallel machines of type Simd, Mimd, clusters or grids is imperative. This paper … …Journal of Computer Science, Vol. 2, Issue 8 · 31 Aug 2006 · 6,237 accessesView PDFCite
Research ArticleOpen accessEvery word in the titleHighly Efficient Elliptic Curve Crypto-Processor with Parallel GF(2m) Field MultipliersTurki F. Al-Somani, M. K. Ibrahim, Adnan GutubThis study presents a high performance GF(2m) Elliptic Curve Crypto-processor architecture. The proposed architecture exploits parallelism at the projective coordinate level to perform parallel field multiplications. In the proposed architecture, normal basis representation is used. Comparisons between the Projective, Jacobian and Mixed coordinate systems using sequential and parallel designs are presented. Results show that parallel designs using normal basis gives … …Journal of Computer Science, Vol. 2, Issue 5 · 31 May 2006 · 6,874 accessesView PDFCite
Research ArticleOpen accessEvery word in the titleThe Design and Implementation of Parallel Digital Library Management SystemYang Yan, Li Jianzhong, Kan ZhongliangAs the number of documents in digital library grows, it becomes increasingly difficult to store, manage the large amount of documents and finding requested relevant documents by users. Parallel Digital Library management System (PDLS) is used for this purpose. PDLS is a general tool for building and managing digital libraries of all kinds of documents to meet user needs. It … …Journal of Computer Science, Vol. 1, Issue 2 · 30 Jun 2005 · 7,284 accessesView PDFCite