An Improved Energy-Efficient DAG Scheduling Algorithm for Uniform Multiprocessor Systems

preprint OA: closed
Full text JSON View at publisher

Abstract

Abstract A significant number of embedded systems are battery-powered, including smartphones, automotive electronics, and drones. As a result, energy management is crucial in the design and application of embedded systems. With the continuous advancement of technology, the design of embedded systems is becoming increasingly complex. Balancing system performance with efficiency has become a critical challenge. This work addresses the energy-aware scheduling problem for real-time applications with precedence constraints in uniform multiprocessor systems with Dynamic Voltage and Frequency Scaling. We propose an energy-efficient algorithm called the Out-Degree-Based Energy-Efficient Real-Time DAG Scheduler (OERDS). OERDS effectively exploits the out-degree characteristics of tasks and employs a pre-enhancement approach that selects the appropriate execution frequency for each task-processor pair in the systems. We evaluate the performance of the OERDS using real-world benchmark applications. Experimental results demonstrate that OERDS outperforms other approaches in terms of energy efficiency optimization.
Full text 13,171 characters · extracted from preprint-html · click to expand
An Improved Energy-Efficient DAG Scheduling Algorithm for Uniform Multiprocessor 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 An Improved Energy-Efficient DAG Scheduling Algorithm for Uniform Multiprocessor Systems Quan-Huang Zhang, Yi-Wen Zhang This is a preprint; it has not been peer reviewed by a journal. https://doi.org/ 10.21203/rs.3.rs-7457829/v1 This work is licensed under a CC BY 4.0 License Status: Under Review Version 1 posted 18 You are reading this latest preprint version Abstract A significant number of embedded systems are battery-powered, including smartphones, automotive electronics, and drones. As a result, energy management is crucial in the design and application of embedded systems. With the continuous advancement of technology, the design of embedded systems is becoming increasingly complex. Balancing system performance with efficiency has become a critical challenge. This work addresses the energy-aware scheduling problem for real-time applications with precedence constraints in uniform multiprocessor systems with Dynamic Voltage and Frequency Scaling. We propose an energy-efficient algorithm called the Out-Degree-Based Energy-Efficient Real-Time DAG Scheduler (OERDS). OERDS effectively exploits the out-degree characteristics of tasks and employs a pre-enhancement approach that selects the appropriate execution frequency for each task-processor pair in the systems. We evaluate the performance of the OERDS using real-world benchmark applications. Experimental results demonstrate that OERDS outperforms other approaches in terms of energy efficiency optimization. DAG Scheduling Energy-Efficient Uniform Multiprocessor Systems List Scheduling Full Text Additional Declarations No competing interests reported. Cite Share Download PDF Status: Under Review Version 1 posted Editorial decision: Revision requested 15 Nov, 2025 Reviews received at journal 04 Nov, 2025 Reviews received at journal 09 Oct, 2025 Reviews received at journal 07 Oct, 2025 Reviews received at journal 24 Sep, 2025 Reviewers agreed at journal 15 Sep, 2025 Reviews received at journal 11 Sep, 2025 Reviewers agreed at journal 11 Sep, 2025 Reviewers agreed at journal 11 Sep, 2025 Reviewers agreed at journal 11 Sep, 2025 Reviewers agreed at journal 10 Sep, 2025 Reviewers agreed at journal 10 Sep, 2025 Reviewers agreed at journal 09 Sep, 2025 Reviewers agreed at journal 09 Sep, 2025 Reviewers invited by journal 09 Sep, 2025 Editor assigned by journal 26 Aug, 2025 Submission checks completed at journal 26 Aug, 2025 First submitted to journal 25 Aug, 2025 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-7457829","acceptedTermsAndConditions":true,"allowDirectSubmit":false,"archivedVersions":[],"articleType":"Research Article","associatedPublications":[],"authors":[{"id":545601084,"identity":"4eb6ccfe-adbd-4b1c-b1d0-8653f18d1c92","order_by":0,"name":"Quan-Huang Zhang","email":"","orcid":"","institution":"Huaqiao University","correspondingAuthor":false,"prefix":"","firstName":"Quan-Huang","middleName":"","lastName":"Zhang","suffix":""},{"id":545601085,"identity":"61d90499-0f2d-4297-a513-9072d4ff849b","order_by":1,"name":"Yi-Wen Zhang","email":"data:image/png;base64,iVBORw0KGgoAAAANSUhEUgAAAZAAAAAyAQMAAABI0h/eAAAABlBMVEX///8AAABVwtN+AAAACXBIWXMAAA7EAAAOxAGVKw4bAAAAq0lEQVRIiWNgGAWjYHACxscQOoF4LczGJGthkyZNi/yMHLPqgrLDDPzsOQYMP3cQoYURqOX2jHOHGSR73hgw9p4hQguzRO6227xthxkMbuQYMDO2EaGFDailGKTFnmgtPEAtzGBbJIjVIsHz/rM0z7l0HokzzwoO9hKjRb49LfEzT5m1HH978sYHP4nRwiCQACTYGHhA7APEaGBg4D8A1jIKRsEoGAWjADcAAOt+L1/qFuxqAAAAAElFTkSuQmCC","orcid":"","institution":"Huaqiao University","correspondingAuthor":true,"prefix":"","firstName":"Yi-Wen","middleName":"","lastName":"Zhang","suffix":""}],"badges":[],"createdAt":"2025-08-26 02:23:14","currentVersionCode":1,"declarations":"","doi":"10.21203/rs.3.rs-7457829/v1","doiUrl":"https://doi.org/10.21203/rs.3.rs-7457829/v1","draftVersion":[],"editorialEvents":[],"editorialNote":"","failedWorkflow":false,"files":[{"id":98029986,"identity":"600e2ecd-58d0-412a-a234-1271c95ccfe4","added_by":"auto","created_at":"2025-12-12 04:02:40","extension":"json","order_by":0,"title":"","display":"","copyAsset":false,"role":"acdc-reference","size":3766,"visible":true,"origin":"","legend":"","description":"","filename":"197d2bff550c40d2a22dceec874594c8.json","url":"https://assets-eu.researchsquare.com/files/rs-7457829/v1/ff23cea79ad7d7561173fff2.json"},{"id":98427643,"identity":"7586872a-f9da-4a9b-9e45-0e24e482b2ec","added_by":"auto","created_at":"2025-12-17 16:40:56","extension":"pdf","order_by":1,"title":"","display":"","copyAsset":false,"role":"manuscript-pdf","size":1650734,"visible":true,"origin":"","legend":"","description":"","filename":"manuscript.pdf","url":"https://assets-eu.researchsquare.com/files/rs-7457829/v1_covered_af62b7ad-fd5b-4d1d-968f-f2aa666b237e.pdf"}],"financialInterests":"No competing interests reported.","formattedTitle":"An Improved Energy-Efficient DAG Scheduling Algorithm for Uniform Multiprocessor Systems","fulltext":[],"fulltextSource":"","fullText":"","funders":[],"hasAdminPriorityOnWorkflow":false,"hasManuscriptDocX":false,"hasOptedInToPreprint":true,"hasPassedJournalQc":"","hasAnyPriority":true,"hideJournal":false,"highlight":"","institution":"","isAcceptedByJournal":true,"isAuthorSuppliedPdf":true,"isDeskRejected":"","isHiddenFromSearch":false,"isInQc":false,"isInWorkflow":false,"isPdf":true,"isPdfUpToDate":true,"isWithdrawnOrRetracted":false,"journal":{"display":true,"email":"[email protected]","identity":"the-journal-of-supercomputing","isNatureJournal":false,"hasQc":true,"allowDirectSubmit":false,"externalIdentity":"","sideBox":"Learn more about [The Journal of Supercomputing](https://www.springer.com/journal/11227)","snPcode":"11227","submissionUrl":"https://submission.nature.com/new-submission/11227/3","title":"The Journal of Supercomputing","twitterHandle":"","acdcEnabled":true,"dfaEnabled":true,"editorialSystem":"stoa","reportingPortfolio":"Springer Hybrid","inReviewEnabled":true,"inReviewRevisionsEnabled":false},"keywords":"DAG Scheduling, Energy-Efficient, Uniform Multiprocessor Systems, List Scheduling","lastPublishedDoi":"10.21203/rs.3.rs-7457829/v1","lastPublishedDoiUrl":"https://doi.org/10.21203/rs.3.rs-7457829/v1","license":{"name":"CC BY 4.0","url":"https://creativecommons.org/licenses/by/4.0/"},"manuscriptAbstract":"A significant number of embedded systems are battery-powered, including smartphones, automotive electronics, and drones. As a result, energy management is crucial in the design and application of embedded systems. With the continuous advancement of technology, the design of embedded systems is becoming increasingly complex. Balancing system performance with efficiency has become a critical challenge. This work addresses the energy-aware scheduling problem for real-time applications with precedence constraints in uniform multiprocessor systems with Dynamic Voltage and Frequency Scaling. We propose an energy-efficient algorithm called the Out-Degree-Based Energy-Efficient Real-Time DAG Scheduler (OERDS). OERDS effectively exploits the out-degree characteristics of tasks and employs a pre-enhancement approach that selects the appropriate execution frequency for each task-processor pair in the systems. We evaluate the performance of the OERDS using real-world benchmark applications. Experimental results demonstrate that OERDS outperforms other approaches in terms of energy efficiency optimization.","manuscriptTitle":"An Improved Energy-Efficient DAG Scheduling Algorithm for Uniform Multiprocessor Systems","msid":"","msnumber":"","nonDraftVersions":[{"code":1,"date":"2025-12-12 04:02:36","doi":"10.21203/rs.3.rs-7457829/v1","editorialEvents":[{"type":"communityComments","content":0},{"type":"decision","content":"Revision requested","date":"2025-11-15T17:23:32+00:00","index":"","fulltext":""},{"type":"editorInvitedReview","content":"","date":"2025-11-04T14:25:33+00:00","index":"hide","fulltext":""},{"type":"editorInvitedReview","content":"","date":"2025-10-09T05:19:55+00:00","index":"hide","fulltext":""},{"type":"editorInvitedReview","content":"","date":"2025-10-07T15:00:34+00:00","index":"hide","fulltext":""},{"type":"editorInvitedReview","content":"","date":"2025-09-24T08:14:38+00:00","index":"hide","fulltext":""},{"type":"reviewerAgreed","content":"11050557652001825528240805626340373002","date":"2025-09-15T12:28:01+00:00","index":"hide","fulltext":""},{"type":"editorInvitedReview","content":"","date":"2025-09-11T16:18:33+00:00","index":"hide","fulltext":""},{"type":"reviewerAgreed","content":"284164839231326027324732144107450879806","date":"2025-09-11T12:05:19+00:00","index":"hide","fulltext":""},{"type":"reviewerAgreed","content":"79848623569593990722806492962041201542","date":"2025-09-11T10:44:04+00:00","index":"hide","fulltext":""},{"type":"reviewerAgreed","content":"72584423042252935293843327543353472390","date":"2025-09-11T09:10:36+00:00","index":"hide","fulltext":""},{"type":"reviewerAgreed","content":"170090092640323960440645545482832240322","date":"2025-09-10T07:37:53+00:00","index":"hide","fulltext":""},{"type":"reviewerAgreed","content":"181465892113008039668851963258666094435","date":"2025-09-10T06:46:02+00:00","index":"hide","fulltext":""},{"type":"reviewerAgreed","content":"336149859464803729348535652682590679982","date":"2025-09-09T19:23:00+00:00","index":"hide","fulltext":""},{"type":"reviewerAgreed","content":"236639093604140615716761504763490163332","date":"2025-09-09T16:01:56+00:00","index":"hide","fulltext":""},{"type":"reviewersInvited","content":"","date":"2025-09-09T11:31:35+00:00","index":"","fulltext":""},{"type":"editorAssigned","content":"","date":"2025-08-26T11:57:06+00:00","index":"","fulltext":""},{"type":"checksComplete","content":"","date":"2025-08-26T05:03:06+00:00","index":"","fulltext":""},{"type":"submitted","content":"The Journal of Supercomputing","date":"2025-08-26T02:17:57+00:00","index":"","fulltext":""}],"status":"published","journal":{"display":true,"email":"[email protected]","identity":"the-journal-of-supercomputing","isNatureJournal":false,"hasQc":true,"allowDirectSubmit":false,"externalIdentity":"","sideBox":"Learn more about [The Journal of Supercomputing](https://www.springer.com/journal/11227)","snPcode":"11227","submissionUrl":"https://submission.nature.com/new-submission/11227/3","title":"The Journal of Supercomputing","twitterHandle":"","acdcEnabled":true,"dfaEnabled":true,"editorialSystem":"stoa","reportingPortfolio":"Springer Hybrid","inReviewEnabled":true,"inReviewRevisionsEnabled":false}}],"origin":"","ownerIdentity":"915a8500-eb18-4bb1-a479-ed1897f30b1d","owner":[],"postedDate":"December 12th, 2025","published":true,"recentEditorialEvents":[],"rejectedJournal":[],"revision":"","amendment":"","status":"under-review","subjectAreas":[],"tags":[],"updatedAt":"2026-02-10T16:24:44+00:00","versionOfRecord":[],"versionCreatedAt":"2025-12-12 04:02:36","video":"","vorDoi":"","vorDoiUrl":"","workflowStages":[]},"version":"v1","identity":"rs-7457829","journalConfig":"researchsquare"},"__N_SSP":true},"page":"/article/[identity]/[[...version]]","query":{"redirect":"/article/rs-7457829","identity":"rs-7457829","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 (2025) — 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