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

12 results for “speedup”
Set a search alert
Research ArticleOpen accessEvery word in the titleSpeedup of Particle Transport Problems with a Beowulf ClusterZhongxiang Zhao, G. Ivan MaldonadoThe MCNP code is a general Monte Carlo N-Particle Transport program that is widely used in health physics, medical physics and nuclear engineering for problems involving neutron, photon and electron transport[1]. However, due to the stochastic nature of the algorithms employed to solve the Boltzmann transport equation, MCNP generally exhibits a slow rate of convergence. In fact, engineers and scientists … …American Journal of Applied Sciences, Vol. 3, Issue 8 · 31 Dec 2006 · 6,918 accessesView PDFCite
Research ArticleOpen accessIn the keywordsLow Complexity Performance Effective Task Scheduling Algorithm for Heterogeneous Computing EnvironmentsE. Ilavarasan, P. ThambiduraiA heterogeneous computing environment is a suite of heterogeneous processors interconnected by high-speed networks, thereby promising high speed processing of computationally intensive applications with diverse computing needs. Scheduling of an application modeled by Directed Acyclic Graph (DAG) is a key issue when aiming at high performance in this kind of environment. The problem is generally addressed in terms of task … …Journal of Computer Science, Vol. 3, Issue 2 · 28 Feb 2007 · 9,663 accessesView PDFCite
Research ArticleOpen accessIn the abstractReal-Time Endoscopic Image Semantic Segmentation for Efficient Polyp IdentificationM. Al-AsliThe advancement of endoscopic procedures has significantly enhanced diagnostic capabilities in polyp identification and removal, which is critical for colorectal cancer prevention. However, the success of these procedures hinges on the accuracy and speed of real-time image analysis. Traditional image processing methods often fail to provide timely and precise segmentation of endoscopic images. This paper presents the implementation of endoscopic … …Journal of Computer Science, Vol. 21, Issue 10 · 10 Dec 2025 · 2,397 accessesView PDFCite
Research ArticleOpen accessIn the abstractDDRSHARP: A Fast and Extensible DRAM SimulatorTesfamichael Gebregziabher Gebrehiwot, Fitsum Assamnew Andargie, Mohammed IsmailDynamic Random-Access Memory (DRAM) is a crucial component of modern computing systems and there exist a variety of DRAM standards. The variance in DRAM architecture calls for an extensible simulator to accommodate current and future DRAM standards. Moreover, as every researcher may not be an expert in programming, choosing an easier programming language to construct a simulator would reduce the … …Journal of Computer Science, Vol. 19, Issue 7 · 16 Jun 2023 · 5,747 accessesView PDFCite
Research ArticleOpen accessIn the abstractPARALLEL IMPLEMENTATION OF EXPECTATION-MAXIMISATION ALGORITHM FOR THE TRAINING OF GAUSSIAN MIXTURE MODELSG. F. Araújo, H. T. Macedo, M. T. Chella et al.Most machine learning algorithms need to handle large data sets. This feature often leads to limitations on processing time and memory. The Expectation-Maximization (EM) is one of such algorithms, which is used to train one of the most commonly used parametric statistical models, the Gaussian Mixture Models (GMM). All steps of the algorithm are potentially parallelizable once they iterate over … …Journal of Computer Science, Vol. 10, Issue 10 · 9 Jul 2014 · 6,937 accessesView PDFCite
Research ArticleOpen accessIn the abstractDYNAMIC PLANNING BASED SCHEDULING APPROACH FOR WIRELESS SENSOR NETWORKSM. Senthil Kumaran, R. RangarajanEnergy efficiency is an important issue in wireless sensor networks. A sensor node has a microprocessor and a small amount of memory for signal processing and task scheduling. Dynamic Planning is a method is used in this approach it combines the flexibility of dynamic scheduling with the predictability offered by schedulabilty check. Whenever a node wants to transmit data packet … …Journal of Computer Science, Vol. 9, Issue 10 · 5 Sep 2013 · 6,819 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 abstractMethods of Fast ExponentiationMohammed Al-MaitahProblem statement: Modular exponentiation constitutes the basis of many well-known and widely used public key cryptosystems. Approach: A fast portable modular exponentiation algorithm considerably enhanced the speed and applicability of these systems, also an efficient implementation of this algorithm was the key to high performance of such system. Results: In this study, two main approaches for solving this problem were … …Journal of Computer Science, Vol. 6, Issue 5 · 31 May 2010 · 7,695 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,100 accessesView PDFCite