65 articles for “distributed computation”

Research ArticleOpen accessIn the abstractResource Selection in Grid Environment Based on Trust Evaluation Using Feedback and PerformancePrakash Mohan, Ravichandran ThangavelA grid computing is a collection of distributed computing resources owned by many organizations across boundaries and not dedicated for a single user available in the Virtual Organization. Grid computing environment provides more computational capabilities to increase the scalability and efficiency of the infra-structure. Resource selection in computational grid is the open issue for executing complex jobs. Trust is the … …American Journal of Applied Sciences, Vol. 10, Issue 8 · 24 Jul 2013 · 7,169 accessesView PDF Cite

Research ArticleOpen accessIn the abstractA Computational Trust Model for Collaborative VenturesMohd Mokhtar, Weigang WangProblem statement: The conceptual notion of trust and its underlying computational methods has been an important issue for researchers in electronic communities. While the independent trust evaluation is suitable in certain circumstances, such unilateral process falls short in supporting mutual evaluation between partners. Perceived reputation, the depth and breadth of trust, Trust Perception (TP), Repeat Collaborators at a Threshold (RCT) … …Journal of Computer Science, Vol. 8, Issue 9 · 15 Aug 2012 · 7,206 accessesView PDF Cite

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 PDF Cite

Research ArticleOpen accessIn the abstractConsistent and Proficient Algorithm for Data Gathering in Wireless Sensor NetworksP. Balamurugan, K. DuraiswamyProblem statement: A wireless sensor network is usually deployed in a harsh geographical area to gather data that can be delivered to the remotely located base station. Sensor nodes have irreplaceable energy source, limited computational capability and limited memory. It is a challenge to maximize the use of energy of these sensor nodes to extend the network lifetime. Approach: This … …Journal of Computer Science, Vol. 7, Issue 9 · 25 Jul 2011 · 6,732 accessesView PDF Cite

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 PDF Cite

Research ArticleOpen accessIn the abstractSolving Protein Folding Problem using Elitism-Based Compact Genetic AlgorithmAmr Badr, Ibtehal M. Aref, Basma M. Hussien, Yosr EmanProteins are vital components of living cells. A number of diseases such as Alzheimer's, Cystic fibrosis and Mad Cow diseases are shown to result from misfunctioning of proteins. Problem statement: Protein folding problem is the process of predicting the optimal 3D molecular structure of a protein, or tertiary structure, which is an indication of its proper function. Approach: An enhancement … …Journal of Computer Science, Vol. 4, Issue 7 · 31 Jul 2008 · 6,856 accessesView PDF Cite

Research ArticleOpen accessIn the abstractComputational Discrete Time Markov Chain with Correlated Transition ProbabilitiesPeerayuth CharnsethikulThis study presents a computational procedure for analyzing statistics of steady state probabilities in a discrete time Markov chain with correlations among their transition probabilities. The proposed model simply uses the first order Taylor’s series expansion and statistical expected value properties to obtain the resulting linear matrix equations system. Computationally, the bottleneck is O(n4) but can be improved by distributed … …Journal of Mathematics and Statistics, Vol. 2, Issue 4 · 31 Dec 2007 · 6,648 accessesView PDF Cite

Research ArticleOpen accessIn the abstractAutonomic Middleware Services for Just-In-Time Grid Services ProvisioningWail M. Omar, A. Taleb-Bendiab, Yasir KaramThe advent of widespread distributed computing environment, such as information systems and computational grids computing has enabled a new generation of applications that are based on seamless access, aggregation and interaction. The dramatic side of the story is a strong presence of the plea that those decentralized Grids are potentially affected by a number of primitives derived from their anatomy, … …Journal of Computer Science, Vol. 2, Issue 6 · 30 Jun 2006 · 6,579 accessesView PDF Cite

Review ArticleOpen accessAll words, across the recordReview of Fault Tolerance, Replication, and Fragmentation in Grid-Cloud Distributed SystemsMohammed Adam Kunna Azrag et al.The study investigates key aspects of data management in distributed systems, focusing on fragmentation, replication and fault tolerance. With the increasing complexity of modern applications, efficient data handling across multiple nodes has become critical. The study begins by reviewing existing literature and moves on to analyze fragmentation techniques, evaluating their role in optimizing performance and resource utilization. Replication methods are … …Journal of Computer Science, Vol. 21, Issue 7 · 7 Jul 2025 · 3,796 accessesView PDF Cite

Research ArticleOpen accessAll words, across the recordUsing 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 PDF Cite