Quantifying the effectiveness of load balance algorithms
Load balance is critical for performance in large parallel applications. An imbalance on
today's fastest supercomputers can force hundreds of thousands of cores to idle, and on …
today's fastest supercomputers can force hundreds of thousands of cores to idle, and on …
Load balancing and job migration techniques in grid: a survey of recent trends
Grid computing has recently become one of the most important research topics in the field of
computing. The Grid computing paradigm has gained popularity due to its capability to offer …
computing. The Grid computing paradigm has gained popularity due to its capability to offer …
[图书][B] Parallel science and engineering applications: The Charm++ approach
This book highlights the use of Charm++ in a wide variety of scientific and engineering
fields. It emphasizes the adaptivity, asynchrony, and message-driven execution of Charm++ …
fields. It emphasizes the adaptivity, asynchrony, and message-driven execution of Charm++ …
A distributed dynamic load balancer for iterative applications
For many applications, computation load varies over time. Such applications require
dynamic load balancing to improve performance. Centralized load balancing schemes …
dynamic load balancing to improve performance. Centralized load balancing schemes …
Using imbalance metrics to optimize task clustering in scientific workflow executions
Scientific workflows can be composed of many fine computational granularity tasks. The
runtime of these tasks may be shorter than the duration of system overheads, for example …
runtime of these tasks may be shorter than the duration of system overheads, for example …
Parallel solvers for mixed integer linear optimization
In this chapter, we provide an overview of the current state of the art with respect to solution
of mixed integer linear optimization problems (MILPs) in parallel. Sequential algorithms for …
of mixed integer linear optimization problems (MILPs) in parallel. Sequential algorithms for …
Work stealing and persistence-based load balancers for iterative overdecomposed applications
Applications often involve iterative execution of identical or slowly evolving calculations.
Such applications require incremental rebalancing to improve load balance across …
Such applications require incremental rebalancing to improve load balance across …
Dynamic load balancing for direct-coupled multiphysics simulations
A Niemöller, M Schlottke-Lakemper, M Meinke… - Computers & …, 2020 - Elsevier
High parallel efficiency for large-scale coupled multiphysics simulations requires the
computational load to be evenly distributed among all compute cores. For complex …
computational load to be evenly distributed among all compute cores. For complex …
Enabling and scaling biomolecular simulations of 100 million atoms on petascale machines with a multicore-optimized message-driven runtime
A 100-million-atom biomolecular simulation with NAMD is one of the three benchmarks for
the NSF-funded sustainable petascale machine. Simulating this large molecular system on a …
the NSF-funded sustainable petascale machine. Simulating this large molecular system on a …
Balanced task clustering in scientific workflows
Scientific workflows can be composed of many fine computational granularity tasks. The
runtime of these tasks may be shorter than the duration of system overheads, for example …
runtime of these tasks may be shorter than the duration of system overheads, for example …