Load Balancing For High Performance Computing Using Quantum Annealing:Smoothed Particle Hydrodynamic

  • 📰 hackernoon
  • ⏱ Reading Time:
  • 75 sec. here
  • 3 min. at publisher
  • 📊 Quality Score:
  • News: 33%
  • Publisher: 51%

Technology Technology Headlines News

Technology Technology Latest News,Technology Technology Headlines

Exploring quantum annealing's efficacy in load balancing for high-performance computing with grid-based and off-grid simulations on quantum hardware.

Authors: Omer Rathore, Department of Physics, Durham University; Alastair Basden, Department of Physics, Durham University; Nicholas Chancellor, Department of Physics, Durham University and School of Computing, Newcastle University; Halim Kusumaatmaja, Department of Physics, Durham University and Institute for Multiscale Thermofluids, School of Engineering, The University of Edinburgh.

relies on task based parallelism in order to optimise shared-memory performance within each individual node as its backbone. This can then be readily generalised to create a work allocation across multiple, distributed memory nodes using graph partitioning algorithms. In summary, the domain is initially divided into a set of cells, with each cell containing a collection of particles such that if two particles interact they are either in the same cell or at most neighbouring cells.

relies on the graph partitioning software METIS. This paper is available on arxiv under CC BY 4.0 DEED license. Authors: Omer Rathore, Department of Physics, Durham University; Alastair Basden, Department of Physics, Durham University; Nicholas Chancellor, Department of Physics, Durham University and School of Computing, Newcastle University; Halim Kusumaatmaja, Department of Physics, Durham University and Institute for Multiscale Thermofluids, School of Engineering, The University of Edinburgh.

relies on task based parallelism in order to optimise shared-memory performance within each individual node as its backbone. This can then be readily generalised to create a work allocation across multiple, distributed memory nodes using graph partitioning algorithms. In summary, the domain is initially divided into a set of cells, with each cell containing a collection of particles such that if two particles interact they are either in the same cell or at most neighbouring cells.

 

Thank you for your comment. Your comment will be published after being reviewed.
Please try again later.
We have summarized this news so that you can read it quickly. If you are interested in the news, you can read the full text here. Read more:

 /  🏆 532. in TECHNOLOGY

Technology Technology Latest News, Technology Technology Headlines

Similar News:You can also read news stories similar to this one that we have collected from other news sources.

AI experimentation is high risk, high reward for low-profile political campaignsTynin Fries joined The Denver Post in 2018 as an intern. Then, she joined the team as a Digital Strategist and was promoted to Deputy Director of Audience in 2022. She is a proud ASU Cronkite alumna (godevs)! In between producing news and writing stories, Tynin is out exploring all that Colorado has to offer.
Source: denverpost - 🏆 13. / 72 Read more »

AI experimentation is high risk, high reward for low-profile political campaignsText, photos, videos and audio created using artificial intelligence are increasingly making their way into campaigns for state and local office
Source: ABC - 🏆 471. / 51 Read more »

AI experimentation is high risk, high reward for low-profile political campaignsText, photos, videos and audio created using artificial intelligence are increasingly making their way into campaigns for state and local office.
Source: ksatnews - 🏆 442. / 53 Read more »

AI experimentation is high risk, high reward for low-profile political campaignsText, photos, videos and audio created using artificial intelligence are increasingly making their way into campaigns for state and local office.
Source: KPRC2 - 🏆 80. / 68 Read more »