Research ArticleOpen accessIn the abstractMembrane Computing Inspired Genetic Algorithm on Multi-Core ProcessorsAli Maroosi, Ravie Chandren MuniyandiMembrane computing is a branch of natural computing. Several studies have recently attempted to utilize the structure of membrane computing to improve intelligent algorithms. These studies have applied communication rules in membrane models to facilitate information exchange between membranes, thereby improving the performance of those algorithms. However, parallel membrane computing has not yet been considered. This study proposes a membrane … …Journal of Computer Science, Vol. 9, Issue 2 · 12 Apr 2013 · 6,628 accessesView PDFCite
Research ArticleOpen accessIn the abstractA Dynamic Resource Allocation Method for Parallel DataProcessing in Cloud ComputingV. Venkatesa Kumar, S. PalaniswamiProblem statement: One of the Cloud Services, Infrastructure as a Service (IaaS) provides a Compute resourses for demand in various applications like Parallel Data processing. The computer resources offered in the cloud are extremely dynamic and probably heterogeneous. Nephele is the first data processing framework to explicitly exploit the dynamic resource allocation offered by today’s IaaS clouds for both, task … …Journal of Computer Science, Vol. 8, Issue 5 · 1 Mar 2012 · 7,424 accessesView PDFCite
Research ArticleOpen accessIn the abstractParallel Memetic Algorithm for VLSI Circuit Partitioning Problem using Graphical Processing UnitsP. Subbaraj, P. SivakumarProblem statement: Memetic Algorithm (MA) is a form of population-based hybrid Genetic Algorithm (GA) coupled with an individual learning procedure capable of performing local refinements. Here we used genetic algorithm to explore the search space and simulated annealing as a local search method to exploit the information in the search region for the optimization of VLSI netlist bi-Partitioning problem. However, … …Journal of Computer Science, Vol. 8, Issue 5 · 27 Feb 2012 · 7,094 accessesView PDFCite
Research ArticleOpen accessIn the abstractNew Mersenne Number Transform Diffusion Power AnalysisM. F. Al-Gailani, S. BoussaktaProblem statement: Due to significant developments in the processing power and parallel processing technologies, the existing encryption algorithms are increasingly susceptible to attacks, such as side-channel attacks, for example. Designing new encryption algorithms that work efficiently on different platforms and security levels to protect the transmitted data from any possible attacks is one of the most important issues in today’s … …American Journal of Engineering and Applied Sciences, Vol. 4, Issue 4 · 12 Jan 2012 · 7,454 accessesView PDFCite
Research ArticleOpen accessIn the abstractA Genetic Algorithm for Scheduling n Jobs on a Single Machine with a Stochastic Controllable Processing, Tooling Cost and Earliness-Tardiness PenaltiesMohamed Ali Abdel-Fattah MansourProblem statement: In this research, we addressed the problem of minimizing the earliness-tardiness penalties and manufacturing costs of a single machine with a stochastic controllable processing and tooling cost. Approach: We developed a mathematical non-linear integer programming model and its linearised version to find the optimal solution. We introduced a new genome representation in single machine scheduling literature that evolved … …American Journal of Engineering and Applied Sciences, Vol. 4, Issue 3 · 18 Aug 2011 · 7,591 accessesView PDFCite
Research ArticleOpen accessIn the abstractAn Investigation of Using Parallel Genetic Algorithm for Solving the Shortest Path Routing ProblemSalman Yussof, Rina Azlin Razali, Ong Hang SeeProblem statement: Shortest path routing is the type of routing widely used in computer network nowadays. Even though shortest path routing algorithms are well established, other alternative methods may have their own advantages. One such alternative is to use a GA-based routing algorithm. According to previous researches, GA-based routing algorithm has been found to be more scalable and insensitive to … …Journal of Computer Science, Vol. 7, Issue 2 · 25 Feb 2011 · 7,621 accessesView PDFCite
Research ArticleOpen accessIn the abstractSorting N-Elements Using Natural Order: A New Adaptive Sorting ApproachShamim Akhter, M. Tanveer HasanProblem statement: Researchers focused their attention on optimally adaptive sorting algorithm and illustrated a need to develop tools for constructing adaptive algorithms for large classes of measures. In adaptive sorting algorithm the run time for n input data smoothly varies from O(n) to O(nlogn), with respect to several measures of disorder. Questions were raised whether any approach or technique would … …Journal of Computer Science, Vol. 6, Issue 2 · 28 Feb 2010 · 7,730 accessesView PDFCite
Research ArticleOpen accessIn the abstractAcoustic Echo Cancellation: Dual Architecture ImplementationB. Stark, B. D. BarkanaProblem statement: With the rise in mobile communication, it is becoming more frequent to use a communication device in an enclosed noisy environment, such as a subway or in a lobby. In this setting however, the received microphone is severely degraded by the echo from the speaker and background noise. The audio processing necessary to clarify the desired speech can … …Journal of Computer Science, Vol. 6, Issue 2 · 28 Feb 2010 · 7,392 accessesView PDFCite
Research ArticleOpen accessIn the abstractAn Improved Lazy Release Consistency ModelChapram Sudhakar, T. RameshProblem statement: A network of workstations, viewed as a distributed shared memory system can be used to develop and test parallel algorithms. Approach: For implementing parallel algorithms on such DSMs shared memory consistency model plays a vital role. Results: However on a LAN, strict consistency models like Sequential Consistency model (SC) are not useful since the communication is slow. In … …Journal of Computer Science, Vol. 5, Issue 11 · 30 Nov 2009 · 7,147 accessesView PDFCite
Research ArticleOpen accessIn the abstractThe 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,103 accessesView PDFCite