Load Balancing For High Performance Computing Using Quantum Annealing

Load Balancing For High Performance Computing Using Quantum Annealing | Research Square window.SnipcartSettings = { analytics: { enabled: false } }; (function() { var accessVector = localStorage.getItem('access_vector') || ''; window.dataLayer = window.dataLayer || []; if (accessVector) { window.dataLayer.push({ user: { profile: { profileInfo: { snid: accessVector } } } }); } })(); (function(w,d,s,l,i){w[l]=w[l]||[];w[l].push({'gtm.start':new Date().getTime(),event:'gtm.js'});var f=d.getElementsByTagName(s)[0],j=d.createElement(s),dl=l!='dataLayer'?'&l='+l:'';j.async=true;j.src='https://www.googletagmanager.com/gtm.js?id='+i+dl;f.parentNode.insertBefore(j,f);})(window,document,'script','dataLayer','GTM-K279D39R'); Browse Preprints In Review Journals COVID-19 Preprints AJE Video Bytes Research Tools Research Promotion AJE Professional Editing AJE Rubriq About Preprint Platform In Review Editorial Policies Our Team Advisory Board Help Center Sign In Submit a Preprint Cite Share Download PDF Article Load Balancing For High Performance Computing Using Quantum Annealing Omer Rathore, Alastair Basden, Nicholas Chancellor, Halim Kusumaatmaja This is a preprint; it has not been peer reviewed by a journal. https://doi.org/ 10.21203/rs.3.rs-4145412/v1 This work is licensed under a CC BY 4.0 License Status: Posted Version 1 posted You are reading this latest preprint version Abstract With the advent of exascale computing, effective load balancing in massively parallel software applications is critically importantfor leveraging the full potential of high performance computing systems. Load balancing is the distribution of computational workbetween available processors. Here, we investigate the application of quantum annealing to load balance two paradigmaticalgorithms in high performance computing. Namely, adaptive mesh refinement and smoothed particle hydrodynamics arechosen as representative grid and off-grid target applications. While the methodology for obtaining real simulation data topartition is application specific, the proposed balancing protocol itself remains completely general. In a grid based context,quantum annealing is found to outperform classical methods such as the round robin protocol but lacks a decisive advantageover more advanced methods such as steepest descent or simulated annealing despite remaining competitive. The primaryobstacle to scalability is found to be limited coupling on current quantum annealing hardware. However, for the more complexparticle formulation, approached as a multi-objective optimization, quantum annealing solutions are demonstrably Paretodominant to state of the art classical methods across both objectives. This signals a noteworthy advancement in solution qualitywhich can have a large impact on effective CPU usage. Physical sciences/Physics/Fluid dynamics Physical sciences/Physics/Quantum physics Full Text Additional Declarations No competing interests reported. Cite Share Download PDF Status: Posted Version 1 posted You are reading this latest preprint version Research Square lets you share your work early, gain feedback from the community, and start making changes to your manuscript prior to peer review in a journal. As a division of Research Square Company, we’re committed to making research communication faster, fairer, and more useful. We do this by developing innovative software and high quality services for the global research community. Our growing team is made up of researchers and industry professionals working together to solve the most critical problems facing scientific publishing. Also discoverable on Platform About Our Team In Review Editorial Policies Advisory Board Help Center Resources Author Services Accessibility API Access RSS feed Manage Cookie Preferences © Research Square 2026 | ISSN 2693-5015 (online) Privacy Policy Terms of Service Do Not Sell My Personal Information {"props":{"pageProps":{"initialData":{"identity":"rs-4145412","acceptedTermsAndConditions":true,"allowDirectSubmit":true,"archivedVersions":[],"articleType":"Article","associatedPublications":[],"authors":[{"id":288927664,"identity":"b1b2331a-39a9-419c-81ef-904d6363bc82","order_by":0,"name":"Omer Rathore","email":"data:image/png;base64,iVBORw0KGgoAAAANSUhEUgAAAZAAAAAyAQMAAABI0h/eAAAABlBMVEX///8AAABVwtN+AAAACXBIWXMAAA7EAAAOxAGVKw4bAAAA/UlEQVRIiWNgGAWjYDADAxDxgQ3KAAEJAjokQCoZZ5CshZmHGC38YoePfWDcY1dnzt778LFN2eF8c/bTCQw/ahgSZzZg1yI5Oy15BsOzZAnLnuPGxjnnDlvu7MndwNhzjCFxNg5bDG7nGDMwHGCWMLiRxiad23bYwOBA7gYG3gaGxHk4teR/BmqpB2lh/20J0nL+7QbGv3i15DADtRwG28LMCNJyI3cDM8gWXA4D+sWYIeHAcckNZ44xS/acSwdqebvhsMwxCWNc3ueXTn7M8OFANb/B8TbGDz/KrIEOy9348E2NjeyMAzisAYEEdIEDhCNyFIyCUTAKRgE+AAAfillG86D4XQAAAABJRU5ErkJggg==","orcid":"","institution":"Durham University","correspondingAuthor":true,"prefix":"","firstName":"Omer","middleName":"","lastName":"Rathore","suffix":""},{"id":288927665,"identity":"31b98bd5-72e9-4adf-b904-e4414bd0e31b","order_by":1,"name":"Alastair Basden","email":"","orcid":"","institution":"Durham University","correspondingAuthor":false,"prefix":"","firstName":"Alastair","middleName":"","lastName":"Basden","suffix":""},{"id":288927666,"identity":"1717c638-e0b3-4218-a510-3aa864626757","order_by":2,"name":"Nicholas Chancellor","email":"","orcid":"","institution":"Newcastle University","correspondingAuthor":false,"prefix":"","firstName":"Nicholas","middleName":"","lastName":"Chancellor","suffix":""},{"id":288927667,"identity":"aa36d866-962b-4774-bc43-495bbea67d2a","order_by":3,"name":"Halim Kusumaatmaja","email":"","orcid":"","institution":"University of Edinburgh","correspondingAuthor":false,"prefix":"","firstName":"Halim","middleName":"","lastName":"Kusumaatmaja","suffix":""}],"badges":[],"createdAt":"2024-03-21 18:44:38","currentVersionCode":1,"declarations":"","doi":"10.21203/rs.3.rs-4145412/v1","doiUrl":"https://doi.org/10.21203/rs.3.rs-4145412/v1","draftVersion":[],"editorialEvents":[],"editorialNote":"","failedWorkflow":false,"files":[{"id":61135393,"identity":"35f5694e-47ed-470a-a4b7-de8624294afc","added_by":"auto","created_at":"2024-07-26 05:27:32","extension":"pdf","order_by":1,"title":"","display":"","copyAsset":false,"role":"manuscript-pdf","size":741405,"visible":true,"origin":"","legend":"","description":"","filename":"QAFinalsr.pdf","url":"https://assets-eu.researchsquare.com/files/rs-4145412/v1_covered_0e8d6697-dce2-4a7d-bcba-29338110ee81.pdf"}],"financialInterests":"No competing interests reported.","formattedTitle":"Load Balancing For High Performance Computing Using Quantum Annealing","fulltext":[],"fulltextSource":"","fullText":"","funders":[],"hasAdminPriorityOnWorkflow":false,"hasManuscriptDocX":false,"hasOptedInToPreprint":true,"hasPassedJournalQc":"","hasAnyPriority":false,"hideJournal":true,"highlight":"","institution":"","isAcceptedByJournal":false,"isAuthorSuppliedPdf":true,"isDeskRejected":"","isHiddenFromSearch":false,"isInQc":false,"isInWorkflow":false,"isPdf":true,"isPdfUpToDate":true,"isWithdrawnOrRetracted":false,"journal":{"display":true,"email":"[email protected]","identity":"researchsquare","isNatureJournal":false,"hasQc":true,"allowDirectSubmit":true,"externalIdentity":"","sideBox":"","snPcode":"","submissionUrl":"/submission","title":"Research Square","twitterHandle":"researchsquare","acdcEnabled":true,"dfaEnabled":false,"editorialSystem":"","reportingPortfolio":"","inReviewEnabled":false,"inReviewRevisionsEnabled":true},"keywords":"","lastPublishedDoi":"10.21203/rs.3.rs-4145412/v1","lastPublishedDoiUrl":"https://doi.org/10.21203/rs.3.rs-4145412/v1","license":{"name":"CC BY 4.0","url":"https://creativecommons.org/licenses/by/4.0/"},"manuscriptAbstract":"With the advent of exascale computing, effective load balancing in massively parallel software applications is critically importantfor leveraging the full potential of high performance computing systems. Load balancing is the distribution of computational workbetween available processors. Here, we investigate the application of quantum annealing to load balance two paradigmaticalgorithms in high performance computing. Namely, adaptive mesh refinement and smoothed particle hydrodynamics arechosen as representative grid and off-grid target applications. While the methodology for obtaining real simulation data topartition is application specific, the proposed balancing protocol itself remains completely general. In a grid based context,quantum annealing is found to outperform classical methods such as the round robin protocol but lacks a decisive advantageover more advanced methods such as steepest descent or simulated annealing despite remaining competitive. The primaryobstacle to scalability is found to be limited coupling on current quantum annealing hardware. However, for the more complexparticle formulation, approached as a multi-objective optimization, quantum annealing solutions are demonstrably Paretodominant to state of the art classical methods across both objectives. This signals a noteworthy advancement in solution qualitywhich can have a large impact on effective CPU usage.","manuscriptTitle":"Load Balancing For High Performance Computing Using Quantum Annealing","msid":"","msnumber":"","nonDraftVersions":[{"code":1,"date":"2024-04-09 03:37:10","doi":"10.21203/rs.3.rs-4145412/v1","editorialEvents":[{"type":"communityComments","content":0}],"status":"published","journal":{"display":true,"email":"[email protected]","identity":"researchsquare","isNatureJournal":false,"hasQc":true,"allowDirectSubmit":true,"externalIdentity":"","sideBox":"","snPcode":"","submissionUrl":"/submission","title":"Research Square","twitterHandle":"researchsquare","acdcEnabled":true,"dfaEnabled":false,"editorialSystem":"","reportingPortfolio":"","inReviewEnabled":false,"inReviewRevisionsEnabled":true}}],"origin":"","ownerIdentity":"29b364df-af7b-41d5-b80f-b1e8284a5af8","owner":[],"postedDate":"April 9th, 2024","published":true,"recentEditorialEvents":[],"rejectedJournal":[],"revision":"","amendment":"","status":"posted","subjectAreas":[{"id":30421286,"name":"Physical sciences/Physics/Fluid dynamics"},{"id":30421287,"name":"Physical sciences/Physics/Quantum physics"}],"tags":[],"updatedAt":"2024-07-26T05:19:25+00:00","versionOfRecord":[],"versionCreatedAt":"2024-04-09 03:37:10","video":"","vorDoi":"","vorDoiUrl":"","workflowStages":[]},"version":"v1","identity":"rs-4145412","journalConfig":"researchsquare"},"__N_SSP":true},"page":"/article/[identity]/[[...version]]","query":{"redirect":"/article/rs-4145412","identity":"rs-4145412","version":["v1"]},"buildId":"qtupq5eGEP_6zYnWcrvyt","isFallback":false,"isExperimentalCompile":false,"dynamicIds":[84888],"gssp":true,"scriptLoader":[]}