Filters








28,394 Hits in 5.3 sec

Load Balancing in Distributed Applications Based on Extremal Optimization [chapter]

Ivanoe De Falco, Eryk Laskowski, Richard Olejnik, Umberto Scafuri, Ernesto Tarantino, Marek Tudruj
2013 Lecture Notes in Computer Science  
The paper shows how to use Extremal Optimization in load balancing of distributed applications executed in clusters of multicore processors interconnected by a message passing network.  ...  Composed of iterative optimization phases which improve program task placement on processors, the proposed load balancing method discovers dynamically the candidates for migration with the use of an Extremal  ...  The Extremal Optimization is used in iterative load balancing phases which are executed in the background, in parallel with the application program.  ... 
doi:10.1007/978-3-642-37192-9_6 fatcat:fxufi47idzaazlkgm4liufr7xy

INTEGRATED EXTREMAL OPTIMIZATION AND RANDOM FOREST BASED SCHEDULING FOR CLOUD COMPUTING ENVIRONMENT

2017 International Journal of Advanced Research in Computer Science  
This paper defines the parallel processor scheduling technique in cloud computing environment.  ...  The major problem nowadays occurs in cloud computing is Load Balancing. Basically it is a term used to spread jobs tasks over multiple networks.  ...  PROBLEM DEFINITION Extremal Optimization is implemented in processor load balancing in accomplishment of distributed programming. It is a nature-inspired meta-heuristic technique.  ... 
doi:10.26483/ijarcs.v8i7.4150 fatcat:lgeyybyvlfafhbqqaoaa5t2b5e

Scaling applications to massively parallel machines using Projections performance analysis tool

Laxmikant V. Kalé, Gengbin Zheng, Chee Wai Lee, Sameer Kumar
2006 Future generations computer systems  
We also explore the techniques for applying the performance visualization/analysis tool on future generation extreme-scale parallel machines and discuss the scalability issues with Projections. automatically  ...  We present case studies involving NAMD, a parallel classic molecular dynamics application for large biomolecular systems, and CPAIMD, Car-Parrinello ab initio molecular dynamics application, and efforts  ...  Dynamic load balancing was an important performance challenge for this application.  ... 
doi:10.1016/j.future.2004.11.020 fatcat:hjednzjubnea5ngd2vcezftt7a

Page 794 of The Journal of the Operational Research Society Vol. 45, Issue 7 [page]

1994 The Journal of the Operational Research Society  
Instead, Williams allowed collisions to occur in his application of the simulated annealing method to the load balancing of unstructured mesh calculations in an NCUBE/10 multicomputer of 16 processors*  ...  have tried out various sequential versions in the context of static load balancing. The performance of parallel versions is still under investigation.  ... 

Load and Performance Balancing Scheme for Heterogeneous Parallel Processing [chapter]

Tae-Hyung Kim
2004 Lecture Notes in Computer Science  
In this paper, we present a decentralized balancing method, which tries to balance load and performance simultaneously, for parallel loops on computational grids.  ...  Moreover, improvements of basic loop scheduling methods have not dealt effectively with irregularly distributed workloads in parallel loops, which commonly occur in large applications.  ...  These are for global load balancing from the OS's viewpoints. In our scheme, we aim to balance parallel loops in an application.  ... 
doi:10.1007/978-3-540-30497-5_47 fatcat:2j77cosc4veqrlf6l3qdmpd56i

Block size selection of parallel LU and QR on PVP-based and RISC-based supercomputers

Yunquan Zhang, Ying Chen, Yuan Tang
2007 Proceedings of the 2007 Asian technology information program's (ATIP's) 3rd workshop on High performance computing in China solution approaches to impediments for high performance computing - CHINA HPC '07  
In fact, the optimal parallel block size is determined by the processor grid shape and problem size.  ...  In this paper, we proposed a unified framework and tried to address the optimal block size selection problem for parallel blocked LU and QR factorization algorithm used in ScaLAPACK package, since they  ...  Above all, we got the following principles in selecting optimal block size for ScaLAPACK based applications: • For applications using large amount of processors, to split work evenly among processors,  ... 
doi:10.1145/1375783.1375809 dblp:conf/sc/ZhangCT07 fatcat:jtvtw34otvdj5kypfyzcef46ri

Reconfigurable Parallel Sorting and Load Balancing on a Beowulf Cluster: HeteroSort [chapter]

Pamela Yang, Timothy M. Kunau, Bonnie Holte Bennett, Emmett Davis, Bill Wren
2000 Lecture Notes in Computer Science  
By capturing global system knowledge in overlapping microregions of nodes, HeteroSort is useful in data dependent applications such as data information fusion on distributed processors.  ...  HeteroSort load balances and sorts within static or dynamic networks using a conceptual torus mesh. We ported HeteroSort to a 16-node Beowulf cluster with a central switch architecture.  ...  workload distribution as load balancing progresses  ... 
doi:10.1007/3-540-45591-4_118 fatcat:5nsr5ox7qreqbh3i43hmcat4ci

A Case Study of Load Distribution in Parallel View Frustum Culling and Collision Detection [chapter]

Ulf Assarsson, Per Stenström
2001 Lecture Notes in Computer Science  
In this paper, a comparative performance evaluation of a number of load distribution strategies is conducted.  ...  the classical load-balance versus communication tradeoff very challenging.  ...  Acknowledgments We would like to thank ABB Robotics Products, for the financial support of Ulf Assarsson's research.  ... 
doi:10.1007/3-540-44681-8_95 fatcat:krvjjngtbfftpgjaovbx3qnrnm

Iterative Dynamic Load Balancing in Multicomputers

Cheng-Zhong Xu, Francis C. M. Lau
1994 Journal of the Operational Research Society  
CyBenko (1989) Load balancing for distributed memory multiprocessors. J. Parallel and Distributed Computing 7, 279-301. . J. B. Bomttat (1990) Load balancing and poisson equation in a graph.  ...  Gerta (1991) Queueing network models for load balancing in distributed systems. J. Parallel and Distributed Computing 12, 24-38. . G. C. Fox, M. A. Jonnson, G. A. Lyzenca, S. W. Otto, J. K.  ... 
doi:10.1057/jors.1994.122 fatcat:j5kpy55zczctldcnq73jlqu67m

Editorial: enabling technologies for programming extreme scale systems

Ching-Hsien Hsu
2012 Journal of Supercomputing  
efficient, load balancing, parallel computing model, multi-core programming, GPU implementation and optimization, execution on real-world parallel architecture and novel applications associated with this  ...  The emerging multi-core commodity processors and advanced networking technologies are allowing for the design of cost-effective parallel and distributed systems.  ...  definition and proposed a self-adaptive K value selection scheme for optimizing load balancing in large scale network system.  ... 
doi:10.1007/s11227-012-0745-2 fatcat:w74ggqhcibc27llbaq4nqe3oiq

Low-overhead load-balanced scheduling for sparse tensor computations

Muthu Baskaran, Benoit Meister, Richard Lethin
2014 2014 IEEE High Performance Extreme Computing Conference (HPEC)  
Irregular computations over large-scale sparse data are prevalent in critical data applications and they have significant room for improvement on modern computer systems from the aspects of parallelism  ...  We achieve around 4-5x improvement in performance over existing parallel approaches and observe "scalable" parallel performance on modern multicore systems with up to 32 processor cores.  ...  Performing the partitioning along with the fine-grained parallel execution of the original computations helps in achieving a good balanced load distribution. B.  ... 
doi:10.1109/hpec.2014.7041006 dblp:conf/hpec/BaskaranML14 fatcat:g7srlfdtrvgltda4fiqrrsmwbi

An Effective Load Balancing Policy for Geometric-Decaying Algorithms

Joseph Gil, Yossi Matias
1996 Journal of Parallel and Distributed Computing  
We present a more e ective, yet as simple, policy for the utilization of load balancing in geometric decaying algorithms.  ...  A standard scheduling implementation of such algorithms consists of a repeated application of load balancing.  ...  Load balancing Let m independent tasks be distributed among n processors of a pram.  ... 
doi:10.1006/jpdc.1996.0098 fatcat:3bsomsgebzay5celqs6lmznp64

Performance of dynamic load balancing algorithms for unstructured mesh calculations

Roy D. Williams
1991 Concurrency Practice and Experience  
If the mesh is solution-adaptive, i.e. the mesh and hence the load balancing problem change discretely during execution of the code, then it is most efficient to decide the optimal mesh distribution in  ...  If a finite element mesh has a sufficiently regular structure, it is easy to decide in advance how to distribute the mesh among the processors of a distributed-memory parallel processor, but if the mesh  ...  This optimization problem for the mesh distribution is load balancing.  ... 
doi:10.1002/cpe.4330030502 fatcat:iazfpcosnvc6vcmrrv25fzaebi

Dynamic load balancing experiments in a grid

M. Dobber, G. Koole, R. van der Mei
2005 CCGrid 2005. IEEE International Symposium on Cluster Computing and the Grid, 2005.  
in running times of parallel applications in a randomly changing grid environment.  ...  In [4] the impact of fluctuations in processing speeds on running times has been investigated, and it was found that dynamic load balancing methods provide a promising means to deal with the ever-changing  ...  For example, the results in Figure 8 show that the optimal load distribution on the basis of DLB is roughly 12%, 18%, 54% and 16%, for processor 0 to 3, respectively.  ... 
doi:10.1109/ccgrid.2005.1558678 dblp:conf/ccgrid/DobberKM05 fatcat:2esso7pm4bcfbo4hj2ye4hrdfq

Evaluating Performance of OpenMP and MPI on the SGI Origin 2000 with Benchmarks of Realistic Problem Sizes [chapter]

Csaba K. Zoltani, Punyam Satya-narayana, Dixie Hisley
2000 Distributed and Parallel Systems  
Wu, were previously parallelized using OpenMP and message-passing interface (MPI) and run on a 128-processor Silicon Graphics Inc. (SGI) Origin 2000.  ...  The results show that load imbalance and cost of remote accesses are the main factors in limited speedup of the OpenMP versions, whereas communication costs are the single major factor in the performance  ...  Special thanks go to Gagan Agrawal and Lori Pollock of the University of Delaware for their inputs. This work was supported in part by the Department  ... 
doi:10.1007/978-1-4615-4489-0_6 fatcat:wzuennnbwfc3rk25zkl2hu5pvq
« Previous Showing results 1 — 15 out of 28,394 results