Scheduling and Response-time Analysis of Multicore and Multi-GPU Heterogeneous Systems

preprint OA: closed CC-BY-4.0
📄 Open PDF Full text JSON View at publisher

Abstract

Abstract In this paper, we introduce a novel scheduling approach tailored for real-time tasks executing on heterogeneous computing platforms, which encompass both multi-core processors and multiple identical GPUs. The proposed approach addresses the limitations of traditional scheduling approaches for multi-core and multi-GPU systems, which typically rely on locks or semaphores to manage access to shared GPUs. The proposed approach employs a server task to manage the request to access the GPUs from other tasks. The requesting tasks are suspended on their corresponding cores during the GPU computation, thereby avoiding the limitations of busy waiting and long priority inversions often encountered in traditional lock-based scheduling approaches. The paper also develops the worst-case response-time analysis of tasks that are scheduled using the proposed scheduling approach on these systems. The evaluation results demonstrate the advantages of the proposed scheduling approach over the traditional lock-based approaches, especially in improving the schedulability rate of task sets in multi-core and multi-GPU systems.
Full text 10,459 characters · extracted from preprint-html · click to expand
Scheduling and Response-time Analysis of Multicore and Multi-GPU Heterogeneous Systems | 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 Research Article Scheduling and Response-time Analysis of Multicore and Multi-GPU Heterogeneous Systems Sahar Mobaiyen, Nandinbaatar Tsog, Saad Mubeen, Mikael Sjödin, and 1 more This is a preprint; it has not been peer reviewed by a journal. https://doi.org/ 10.21203/rs.3.rs-4692634/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 In this paper, we introduce a novel scheduling approach tailored for real-time tasks executing on heterogeneous computing platforms, which encompass both multi-core processors and multiple identical GPUs. The proposed approach addresses the limitations of traditional scheduling approaches for multi-core and multi-GPU systems, which typically rely on locks or semaphores to manage access to shared GPUs. The proposed approach employs a server task to manage the request to access the GPUs from other tasks. The requesting tasks are suspended on their corresponding cores during the GPU computation, thereby avoiding the limitations of busy waiting and long priority inversions often encountered in traditional lock-based scheduling approaches. The paper also develops the worst-case response-time analysis of tasks that are scheduled using the proposed scheduling approach on these systems. The evaluation results demonstrate the advantages of the proposed scheduling approach over the traditional lock-based approaches, especially in improving the schedulability rate of task sets in multi-core and multi-GPU systems. Heterogeneous computing response-time analysis multi-GPU systems server-based scheduling 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-4692634","acceptedTermsAndConditions":true,"allowDirectSubmit":true,"archivedVersions":[],"articleType":"Research Article","associatedPublications":[],"authors":[{"id":323557213,"identity":"3f422a54-b28c-408e-9ca7-57137d56dce5","order_by":0,"name":"Sahar Mobaiyen","email":"data:image/png;base64,iVBORw0KGgoAAAANSUhEUgAAAZAAAAAyAQMAAABI0h/eAAAABlBMVEX///8AAABVwtN+AAAACXBIWXMAAA7EAAAOxAGVKw4bAAAA6klEQVRIiWNgGAWjYFACHghlwMDYAKRsGBgOkKgljSQtYHCYsBb59rMHP1cwbJMzZz/cJvFxx/lovhsJzB8+4NFicCYvWfIMw21jy57ENsmZZ27nzryRwCY5A58WhhwDyQaG24kbDiS2SfO23c7dANTCzIPPYf1vjH+CtZx/2Cb9t+0cSAvz5z/4PHMjxwxiyw2gLYxtB0BaGKTx6TC48cbMssEA6JcZD5ste9uSc2eeedgm2YPXYTnGNxsqbsuZ86c/vPGzzS6373jy4Q8/8FkDsQtMskhAeOA4JQ4w44uNUTAKRsEoGMEAAJzAV2ewDbcLAAAAAElFTkSuQmCC","orcid":"","institution":"Mälardalen University","correspondingAuthor":true,"prefix":"","firstName":"Sahar","middleName":"","lastName":"Mobaiyen","suffix":""},{"id":323557214,"identity":"a38ca14a-054f-4090-ab32-8a30b01830d2","order_by":1,"name":"Nandinbaatar Tsog","email":"","orcid":"","institution":"Next generation Space system Technology Research Association (NeSTRA)","correspondingAuthor":false,"prefix":"","firstName":"Nandinbaatar","middleName":"","lastName":"Tsog","suffix":""},{"id":323557215,"identity":"16b25f04-00e5-42ab-9900-38ce9b80b871","order_by":2,"name":"Saad Mubeen","email":"","orcid":"","institution":"Mälardalen University","correspondingAuthor":false,"prefix":"","firstName":"Saad","middleName":"","lastName":"Mubeen","suffix":""},{"id":323557216,"identity":"f69e8cdc-fa7e-4626-8838-c732ded4a664","order_by":3,"name":"Mikael Sjödin","email":"","orcid":"","institution":"Mälardalen University","correspondingAuthor":false,"prefix":"","firstName":"Mikael","middleName":"","lastName":"Sjödin","suffix":""},{"id":323557217,"identity":"8345d963-d7de-4cc6-9b4a-2d1eb765cffe","order_by":4,"name":"Matthias Becker","email":"","orcid":"","institution":"KTH Royal Institute of Technology","correspondingAuthor":false,"prefix":"","firstName":"Matthias","middleName":"","lastName":"Becker","suffix":""}],"badges":[],"createdAt":"2024-07-05 13:41:22","currentVersionCode":1,"declarations":"","doi":"10.21203/rs.3.rs-4692634/v1","doiUrl":"https://doi.org/10.21203/rs.3.rs-4692634/v1","draftVersion":[],"editorialEvents":[],"editorialNote":"","failedWorkflow":false,"files":[{"id":82933962,"identity":"b47013df-677f-4cc3-997e-d8c3f2b5f65c","added_by":"auto","created_at":"2025-05-17 02:31:31","extension":"pdf","order_by":1,"title":"","display":"","copyAsset":false,"role":"manuscript-pdf","size":1465430,"visible":true,"origin":"","legend":"","description":"","filename":"Manuscript.pdf","url":"https://assets-eu.researchsquare.com/files/rs-4692634/v1_covered_c9540c7c-08f0-4952-94fe-7b5aed305d31.pdf"}],"financialInterests":"No competing interests reported.","formattedTitle":"Scheduling and Response-time Analysis of Multicore and Multi-GPU Heterogeneous Systems","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":"Heterogeneous computing, response-time analysis, multi-GPU systems, server-based scheduling","lastPublishedDoi":"10.21203/rs.3.rs-4692634/v1","lastPublishedDoiUrl":"https://doi.org/10.21203/rs.3.rs-4692634/v1","license":{"name":"CC BY 4.0","url":"https://creativecommons.org/licenses/by/4.0/"},"manuscriptAbstract":"In this paper, we introduce a novel scheduling approach tailored for real-time tasks executing on heterogeneous computing platforms, which encompass both multi-core processors and multiple identical GPUs. The proposed approach addresses the limitations of traditional scheduling approaches for multi-core and multi-GPU systems, which typically rely on locks or semaphores to manage access to shared GPUs. The proposed approach employs a server task to manage the request to access the GPUs from other tasks. The requesting tasks are suspended on their corresponding cores during the GPU computation, thereby avoiding the limitations of busy waiting and long priority inversions often encountered in traditional lock-based scheduling approaches. The paper also develops the worst-case response-time analysis of tasks that are scheduled using the proposed scheduling approach on these systems. The evaluation results demonstrate the advantages of the proposed scheduling approach over the traditional lock-based approaches, especially in improving the schedulability rate of task sets in multi-core and multi-GPU systems.","manuscriptTitle":"Scheduling and Response-time Analysis of Multicore and Multi-GPU Heterogeneous Systems","msid":"","msnumber":"","nonDraftVersions":[{"code":1,"date":"2024-07-31 22:10:25","doi":"10.21203/rs.3.rs-4692634/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":"46cff5ee-0280-484d-b2e3-63111b95398e","owner":[],"postedDate":"July 31st, 2024","published":true,"recentEditorialEvents":[],"rejectedJournal":[],"revision":"","amendment":"","status":"posted","subjectAreas":[],"tags":[],"updatedAt":"2025-05-17T02:23:22+00:00","versionOfRecord":[],"versionCreatedAt":"2024-07-31 22:10:25","video":"","vorDoi":"","vorDoiUrl":"","workflowStages":[]},"version":"v1","identity":"rs-4692634","journalConfig":"researchsquare"},"__N_SSP":true},"page":"/article/[identity]/[[...version]]","query":{"redirect":"/article/rs-4692634","identity":"rs-4692634","version":["v1"]},"buildId":"8U1c8b4HqxoKbykW_rLl7","isFallback":false,"isExperimentalCompile":false,"dynamicIds":[84888],"gssp":true,"scriptLoader":[]}

Text is read by the "Ask this paper" AI Q&A widget below. Extraction quality varies by source — PMC NXML preserves structure cleanly, OA-HTML may include some navigation residue, and OA-PDF can have broken hyphenation. The publisher copy (via DOI) is the canonical version.

My notes (saved in your browser only)

Ask this paper AI returns verbatim quotes from the full text · source: preprint-html

Answers must be backed by verbatim quotes from this paper's full text. Hallucinated quotes are dropped automatically; if no verbatim passage answers the question, we say so. How this works

Citation neighborhood (no data yet)

We don't have any in-corpus citations linked to this paper yet. This is a recent paper (2024) — citers typically take a year or two to land, and the OpenAlex reference graph may still be filling in.

Source provenance

europepmc
last seen: 2026-05-20T01:45:00.602351+00:00
unpaywall
last seen: 2026-05-27T02:00:06.600101+00:00
License: CC-BY-4.0