Filters








115,274 Hits in 8.0 sec

Evaluating OpenMP 3.0 Run Time Systems on Unbalanced Task Graphs [chapter]

Stephen L. Olivier, Jan F. Prins
2009 Lecture Notes in Computer Science  
The UTS benchmark is used to evaluate task parallelism in OpenMP 3.0 as implemented in a number of recently released compilers and run-time systems.  ...  As such UTS presents a highly unbalanced task graph that challenges scheduling, load balancing, termination detection, and task coarsening strategies.  ...  The Opteron SMP used in this paper is a part of the BASS cluster purchased with funding from the National Institutes of Health's National Center for Research Resources, through their High-End Instrumentation  ... 
doi:10.1007/978-3-642-02303-3_6 fatcat:bzif2b6txvbmhgmv77jdl7h6ay

Dynamic Load Balancing for a Grid Application [chapter]

Menno Dobber, Ger Koole, Rob van der Mei
2004 Lecture Notes in Computer Science  
Extensive lab experiments show that the burstiness in processing speeds has a dramatic impact on the running times, which heightens the need for dynamic load balancing schemes to realize good performance  ...  highly fluctuates over time.  ...  Acknowledgements We are indebted to Mathijs den Burger, Thilo Kielmann, Henri Bal, Jason Maassen and Rob van Nieuwpoort for their useful comments.  ... 
doi:10.1007/978-3-540-30474-6_38 fatcat:zncfbll52fcqdjj2wxeosmycbu

Dynamic Load Balancing of the Adaptive Fast Multipole Method in Heterogeneous Systems

Robert E. Overman, Jan F. Prins, Laura A. Miller, Michael L. Minion
2013 2013 IEEE International Symposium on Parallel & Distributed Processing, Workshops and Phd Forum  
We present a cost model and incremental adjustment strategy to load balance the AFMM on a heterogeneous system.  ...  Parallelization of the AFMM presents a challenging load balancing problem that must be addressed dynamically as the system evolves.  ...  We examine three load balancing strategies for this problem.  ... 
doi:10.1109/ipdpsw.2013.218 dblp:conf/ipps/OvermanPMM13 fatcat:wdcw5mm7yvhrnmv5dnbi2yab2e

Comparison of OpenMP 3.0 and Other Task Parallel Frameworks on Unbalanced Task Graphs

Stephen L. Olivier, Jan F. Prins
2010 International journal of parallel programming  
As such UTS presents a highly unbalanced task graph that challenges scheduling, load balancing, termination detection, and task coarsening strategies.  ...  The UTS benchmark is used to evaluate the expression and performance of task parallelism in OpenMP 3.0 as implemented in a number of recently released compilers and run-time systems.  ...  We are grateful for helpful comments from Alejandro Duran and the reviewers.  ... 
doi:10.1007/s10766-010-0140-7 fatcat:o2uabh7pe5hudla5wjw6acogje

Rate of change load balancing in distributed and parallel systems

Luis Miguel Campos, Isaac D Scherson
2000 Parallel Computing  
Dynamic Load Balancing is an important system function destined to distribute workload among available processors to improve throughput and/or execution times of parallel computer programs either uniform  ...  A novel distributed algorithm for load balancing is proposed and is based on local Rate of Change observations rather than on global absolute load numbers.  ...  ) and highly parallel multicomputer systems.  ... 
doi:10.1016/s0167-8191(00)00036-3 fatcat:bevd6sqhxrdcra4pnqpn4z72xa

Improving Performance in Load Balancing Problem on the Grid Computing System

Prabhat Kr. Srivastava, Sonu Gupta, Dheerendra Singh Yadav
2011 International Journal of Computer Applications  
Load balancing strategies is always used for the emergence of Distributed systems. Generally there are three type of phases related to Load balancing i.e.  ...  Load Balancing is a technique to improve resources, utilizing parallelism, exploiting throughput managing and to reduce response time through proper distribution of the application.  ...  INTRODUCTION Grid computing is a type of parallel and distributed system that enables the distribution, selection and aggregation of geologically resources dynamically at run time depending on their availability  ... 
doi:10.5120/1979-2658 fatcat:y5el63qmfbhjzdc73hbpiondyu

Application of secretary algorithm to dynamic load balancing in user-space on multicore systems

Teng-Sheng Moh, Kyoung-Hwan Yun
2014 2014 International Conference on High Performance Computing & Simulation (HPCS)  
Even when an application is "embarrassingly" parallelized by a careful design of algorithm and implementation, load balancing of tasks across different cores is a very important and critical aspect in  ...  Robert Chun, for their gracious offer of time and advice.  ...  Algorithm Our dynamic load balancer runs as a user-space program that lives during the lifetime of a parallel application that it needs to load balance.  ... 
doi:10.1109/hpcsim.2014.6903793 dblp:conf/hpcs/MohY14 fatcat:cghto5lhxjbx5pypzqudnbfgwy

Diffusive Load Balancing of Loosely-Synchronous Parallel Programs over Peer-to-Peer Networks [article]

Scott Douglas, Aaron Harwood
2004 arXiv   pre-print
This paper contributes a study of load balancing techniques for a general class of loosely-synchronous parallel algorithms when executed over a P2P network.  ...  While a moderate degree of dynamicity can benefit load balancing, significant dynamicity hinders the parallel program performance due to the need for increased load migration.  ...  Therefore, strategies with fast stabilization times perform better for highly dynamic networks even if the quality is less than optimal.  ... 
arXiv:cs/0410009v1 fatcat:3b56n3fu3bcdhlbmr53wy72wcq

Massively parallel cosmological simulations with ChaNGa

Pritish Jetley, Filippo Gioachin, Celso Mendes, Laxmikant V. Kale, Thomas Quinn
2008 Proceedings, International Parallel and Distributed Processing Symposium (IPDPS)  
We outline key requirements for an effective practical implementation and conclude by discussing preliminary results from simulations run with our multiphase load balancer.  ...  In particular, novel load balancing schemes that base decisions on certain characteristics of tree-based particle codes are discussed.  ...  We thank Shawn Brown for help with the Cray XT3 at PSC and Glenn Martyna and Fred Mintzer at IBM Research for the use of BGW (BlueGene/L at Watson).  ... 
doi:10.1109/ipdps.2008.4536319 dblp:conf/ipps/JetleyGMKQ08 fatcat:6sixkatxhbf2zipvnekeb7qbdq

Load Balancing Strategy for Computational Grid System using an Improved Algorithmic Approach

Prakash Kumar, Pradeep Kumar, Vikas Kumar
2013 International Journal of Computer Applications  
A load balancing strategy chooses the resources that should be used to run a job in order to improve a given performance measure.  ...  Enabling backfill will increase system utilization and improve turnaround time by an even greater amount.  ...  PROBLEM STATEMENT PROPOSED METHODOLOGY Some load balancing strategies work well for applications with large parallel jobs, while others work well for short, quick jobs.  ... 
doi:10.5120/13765-1614 fatcat:7l5aoaxs6nfi5ayeif57jajwtu

VFFVA: dynamic load balancing enables large-scale flux variability analysis

Marouen Ben Guebila
2020 BMC Bioinformatics  
To characterize the full metabolic spectrum of such systems, Fast Flux Variability Analysis (FFVA) is commonly used in parallel with static load balancing.  ...  Results Here, we present Very Fast Flux Variability Analysis (VFFVA) as a parallel implementation that dynamically balances the computation load between the cores in runtime which guarantees equal convergence  ...  providing a free academic version of ILOG CPLEX.  ... 
doi:10.1186/s12859-020-03711-2 pmid:32993482 pmcid:PMC7523073 fatcat:fhqdyinznrfzfpnlddh4oihgni

Decentralized Load Balancing for Highly Irregular Search Problems

G. Di Fatta, M.R. Berthold
2006 11th IEEE Symposium on Computers and Communications (ISCC'06)  
The framework is based on a peer-to-peer computing environment and dynamic load balancing.  ...  In this paper, we present a distributed computing framework for problems characterized by a highly irregular search tree, whereby no reliable workload prediction is available.  ...  We thank the Department of Computer and Information Science of the University of Konstanz for the use of their machines.  ... 
doi:10.1109/iscc.2006.56 dblp:conf/iscc/FattaB06 fatcat:wy5iv2n4xrcetggull4jmmbjzm

Decentralized load balancing for highly irregular search problems

Giuseppe Di Fatta, Michael R. Berthold
2007 Microprocessors and microsystems  
The framework is based on a peer-to-peer computing environment and dynamic load balancing.  ...  In this paper, we present a distributed computing framework for problems characterized by a highly irregular search tree, whereby no reliable workload prediction is available.  ...  We thank the Department of Computer and Information Science of the University of Konstanz for the use of their machines.  ... 
doi:10.1016/j.micpro.2007.01.004 fatcat:zecgpmydzvafzd4glb6xuntevm

Cloud Friendly Load Balancing for HPC Applications: Preliminary Work

Osman Sarood, Abhishek Gupta, Laxmikant V. Kale
2012 2012 41st International Conference on Parallel Processing Workshops  
Our scheme uses object migration to achieve load balance for tightly coupled parallel applications executing in virtualized environments that suffer from interfering jobs.  ...  While restoring load balance, it not only reduces the timing penalty caused by interfering jobs, but also reduces energy consumption significantly.  ...  However, in case of Mol3D, the runs without load balancing end up having a lower timing penalty for background load.  ... 
doi:10.1109/icppw.2012.30 dblp:conf/icppw/SaroodGK12 fatcat:xkzdhwwcyrcmfkf73sgoghhddu

Dynamic load balancing of parallel cellular automata

Marc Mazzariol, Benoit A. Gennart, Roger D. Hersch, Hongchi Shi, Patrick C. Coffield, Divyendu Sinha
2000 Parallel and Distributed Methods for Image Processing IV  
We are interested in running in parallel cellular automata. We present an algorithm which explores the dynamic remapping of cells in order to balance the load between the processing nodes.  ...  Two different parallel algorithms are proposed, one with a static load distribution consisting in splitting the cells over several processing nodes and the other with a dynamic load balancing scheme capable  ...  We explore two parallelization methods, one with a static load distribution consisting in splitting the cells over several processing nodes and the other with a dynamic load balancing scheme capable of  ... 
doi:10.1117/12.403602 fatcat:zwegzdq7tzbdhcu2pc6n75552y
« Previous Showing results 1 — 15 out of 115,274 results