Sign inSubmit
Tips: “quotes” for a phrase · author:Lee · a DOI goes straight to its article

40 results for “Parallel Computing”
Set a search alert
Research ArticleOpen accessIn the abstractUsing Threads to Overcome Synchronization Delays in Parallel Multiple Progressive Alignment AlgorithmsEvandro A. Marucci, Geraldo F.D. Zafalon, Julio C. Momente et al.Problem statement: The parallelization of multiple progressive alignment algorithms is a difficult task. All known methods have strong bottlenecks resulting from synchronization delays. This is even more constraining in distributed memory systems, where message passing also delays the interprocess communication. Despite these drawbacks, parallel computing is becoming increasingly necessary to perform multiple sequence alignment. Approach: In this study, it is … …Current Research in Bioinformatics, Vol. 1, Issue 1 · 8 Mar 2012 · 14,192 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,090 accessesView PDFCite
Research ArticleOpen accessIn the abstractSecure Selection of Multiple Resources Based on Virtual Private Network for Computational GridsG. Kavitha, V. SankaranarayananProblem statement: Grid computing provides a virtual framework for controlled sharing of resources across institutional boundaries. In computational grids, a client application is executed on the available set of resources that satisfy the user QoS requirements. Some applications require exhaustive computation power for execution of its tasks. In general, these tasks are assigned to a single available resource on the … …Journal of Computer Science, Vol. 7, Issue 12 · 22 Oct 2011 · 7,607 accessesView PDFCite
Research ArticleOpen accessIn the abstractMembrane Computing as a Modeling Tool for Discrete SystemsRavie Chandren Muniyandi, Abdullah Mohd. ZinProblem statement: Discrete systems have been modeled by using Ordinary Differential Equation (ODE) in which the variation of concentration of an object was modeled as continuous and deterministic manner, contrary to the real behaviors of such systems. Although, this approaches able to generate the general behavior of the system, the specific discrete processes and stochastic behaviors in the system have … …Journal of Computer Science, Vol. 7, Issue 11 · 24 Aug 2011 · 6,793 accessesView PDFCite
Research ArticleOpen accessIn the abstractInteractive Computing Framework for Engineering ApplicationsJovana Knezevic, Jerome Frisch, Ralf-Peter Mundani, Ernst RankProblem statement: Even though the computational steering state-of-the-art environments allow users to embed their simulation codes as a module for an interactive steering without the necessity for their own expertise in high-performance computing and visualisation, e.g., these environments are limited in their possible applications and mostly entail heavy code changes in order to integrate the existing code. Approach: In this … …Journal of Computer Science, Vol. 7, Issue 5 · 7 May 2011 · 7,207 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,617 accessesView PDFCite
Research ArticleOpen accessIn the abstractExperimenting the Simulation Strategy of Membrane Computing with Gillespie Algorithm by Using Two Biological Case StudiesRavie Chandren Muniyandi, Abdullah Mohd ZinProblem statement: The evolution rules of membrane computing have been applied in a nondeterministic and maximally parallel way. In order to capture these characteristics, Gillespie’s algorithm has been used as simulation strategy of membrane computing in simulating biological systems. Approach: This study was carried to discuss the simulation strategy of membrane computing with Gillespie algorithm in comparison to the simulation … …Journal of Computer Science, Vol. 6, Issue 5 · 31 May 2010 · 6,941 accessesView PDFCite
Research ArticleOpen accessIn the abstractDesign and Implementation of Parallel Subunit for Synthesis Mathematical ModelsIssa M. ShehabatProblem statement: Mathematical modeling of different natural and technical objects and processes is one of the most important directions that needs high performance computing with huge memory. To reduce the computational time and expenses we need to carry out the calculations on specialized subunits. Approach: We described a self-organizing approximation method and introduced a new methodology of structural synthesis of … …Journal of Computer Science, Vol. 6, Issue 3 · 31 Mar 2010 · 6,920 accessesView PDFCite
Research ArticleOpen accessIn the abstractIrregular Class of Multistage Interconnection Network in Parallel ProcessingSandeep Sharma, K. S. Kahlon, P. K. Bansal, Kawaljeet SinghA major problem in designing a large-scale parallel and distributed system was the construction of an Interconnection Network (IN) to provide inter-processor communication. One of the biggest issues in the development of such a system was the development of an effective architecture and algorithms that have high reliability, give good performance (even in the presence of faults), low cost, low … …Journal of Computer Science, Vol. 4, Issue 3 · 31 Mar 2008 · 7,057 accessesView PDFCite
Research ArticleOpen accessIn the abstractAdapting the LMF Temporal Splining Procedure From Serial to MPI/Linux ClustersSajia Akhter, Ipshita Sarkar, Kazi G. Rabbany et al.Remote Sensing (RS) provides images over large areas such as provincial or country level. During the last 20 years, it plays a vital role for developing many complex applications. However, RS image includes data noises due to influence of haze or cloud especially in the rainy season. It is thus necessary to remove the noise to recover the real ground … …Journal of Computer Science, Vol. 3, Issue 3 · 31 Mar 2007 · 7,461 accessesView PDFCite