Makespan Optimization of Workflow Application based on Bandwidth Allocation Algorithm in Fog-Cloud Environment

preprint OA: closed CC-BY-4.0
📄 Open PDF Full text JSON View at publisher
AI-generated summary by claude@2026-07+body, 2026-07-05

This study proposes a bandwidth-aware workflow allocation algorithm (BW-AWA) to schedule tasks for fog-cloud environments, aiming to minimize total execution time (Makespan) without increasing energy consumption.

One-sentence paraphrase of the abstract; not a substitute for reading it. No clinical advice. How this works

AI-generated deep summary by claude@2026-07, 2026-07-05 · read from full text

This preprint studies bandwidth-aware workflow task allocation for latency-sensitive IoT applications executed in a fog–cloud heterogeneous computing environment, using directed acyclic graph (DAG) scheduling where task dependencies and priority constraints must be respected. The authors propose a bandwidth-aware workflow allocation (BW-AWA) algorithm that selects tasks by priority and assigns them to resources to minimize overall completion time (makespan) without increasing energy consumption, while explicitly accounting for dependency structure in task selection. The approach is evaluated using a road safety case study and compared with well-known scheduling approaches to demonstrate improved makespan performance. This paper does not explicitly discuss endometriosis or adenomyosis; it was included in the corpus via a keyword match in the upstream search index.

Read from the paper's body, not the abstract. Not a substitute for reading the paper. No clinical advice. How this works

Abstract

Abstract Fog computing technology has emerged to handle the large amount of data generated by Internet of Things (IoT) terminals and cope with latency-sensitive application requests by allocating computation and storage resources at the edge of the Internet. In many IoT applications, the data acquisition procedures must apply the Directed Acyclic Graph (DAG) to get real-time results. The principal goal of DAG scheduling is to reduce total completion time without breaking priority constraints by properly allocating tasks to processors and arranging task execution sequencing. In this paper, we propose a bandwidth-aware workflow allocation (BW-AWA) that schedules tasks by priority to the resource that minimizes the total execution time (Makespan) in the entire heterogeneous computing system without affecting the increase in energy consumed. The task selection process needs to consider the dependency between tasks. The proposed approach is tested with a road safety case study, and the results are compared to well-known approaches to demonstrate the effectiveness in reducing the Makespan.
Full text 10,119 characters · extracted from preprint-html · click to expand
Makespan Optimization of Workflow Application based on Bandwidth Allocation Algorithm in Fog-Cloud Environment | 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 Makespan Optimization of Workflow Application based on Bandwidth Allocation Algorithm in Fog-Cloud Environment Bentabet Dougani, Abdeslem Dennai This is a preprint; it has not been peer reviewed by a journal. https://doi.org/ 10.21203/rs.3.rs-1809172/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 Fog computing technology has emerged to handle the large amount of data generated by Internet of Things (IoT) terminals and cope with latency-sensitive application requests by allocating computation and storage resources at the edge of the Internet. In many IoT applications, the data acquisition procedures must apply the Directed Acyclic Graph (DAG) to get real-time results. The principal goal of DAG scheduling is to reduce total completion time without breaking priority constraints by properly allocating tasks to processors and arranging task execution sequencing. In this paper, we propose a bandwidth-aware workflow allocation (BW-AWA) that schedules tasks by priority to the resource that minimizes the total execution time (Makespan) in the entire heterogeneous computing system without affecting the increase in energy consumed. The task selection process needs to consider the dependency between tasks. The proposed approach is tested with a road safety case study, and the results are compared to well-known approaches to demonstrate the effectiveness in reducing the Makespan. Fog Computing IoT List scheduling DAG Makespan 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-1809172","acceptedTermsAndConditions":true,"allowDirectSubmit":true,"archivedVersions":[],"articleType":"Research Article","associatedPublications":[],"authors":[{"id":117906088,"identity":"e98ef9de-4ad5-4151-821a-4f286c852e3f","order_by":0,"name":"Bentabet Dougani","email":"data:image/png;base64,iVBORw0KGgoAAAANSUhEUgAAAZAAAAAyAQMAAABI0h/eAAAABlBMVEX///8AAABVwtN+AAAACXBIWXMAAA7EAAAOxAGVKw4bAAABNElEQVRIiWNgGAWjYDCCA2BSIgFEMgMxDwPzAcYHIAYfYS3MIC0GPAxsCcwGIC1s+LUwwLUwALWwSYCEcGnhO95j/OLnDos8fun+g58LKv7ImLMxH6v8mmMnw8bA/PDRDUwtkmfOmFn2npEolpxzmFl6xhkDHss2trTbstuSgQ5jMzbOwdRicCPHzIC3TSJxw41kBmneNgMeg/s9ZrcltzEDtfCwSePQYvgXqGX/jWTm37z/gFqO8ZgVS26rx6fF+DHYFolkNmneBogWxo/bDuPUInnmWBmzbJtEscSNZDPrGceMgVrYkqUZtx3nYWPG7he+482bP75tq8vjn5H4+HZBjZy9wTHmgx9/bqu252dvfvgYixYggMQCCmDmAZNYlYNlPmAIMf7AqXoUjIJRMApGIAAAqKFfG9foQYgAAAAASUVORK5CYII=","orcid":"","institution":"University of Bechar","correspondingAuthor":true,"prefix":"","firstName":"Bentabet","middleName":"","lastName":"Dougani","suffix":""},{"id":117906089,"identity":"786092c2-c5eb-4546-8f6a-832bb419e97d","order_by":1,"name":"Abdeslem Dennai","email":"","orcid":"","institution":"University of Bechar","correspondingAuthor":false,"prefix":"","firstName":"Abdeslem","middleName":"","lastName":"Dennai","suffix":""}],"badges":[],"createdAt":"2022-06-29 20:14:12","currentVersionCode":1,"declarations":"","doi":"10.21203/rs.3.rs-1809172/v1","doiUrl":"https://doi.org/10.21203/rs.3.rs-1809172/v1","draftVersion":[],"editorialEvents":[],"editorialNote":"","failedWorkflow":false,"files":[{"id":28802596,"identity":"a4280e61-d31c-4c7f-bf4d-d3d1fce36d23","added_by":"auto","created_at":"2022-11-08 12:59:48","extension":"pdf","order_by":10,"title":"","display":"","copyAsset":false,"role":"manuscript-pdf","size":546476,"visible":true,"origin":"","legend":"","description":"","filename":"Manuscript..pdf","url":"https://assets-eu.researchsquare.com/files/rs-1809172/v1_covered.pdf"},{"id":23548137,"identity":"32b12ae9-a11e-4aed-b384-56fbc445da4b","added_by":"auto","created_at":"2022-07-06 18:08:10","extension":"pdf","order_by":10,"title":"","display":"","copyAsset":false,"role":"manuscript-pdf","size":546593,"visible":true,"origin":"","legend":"","description":"","filename":"Manuscript..pdf","url":"https://assets-eu.researchsquare.com/files/rs-1809172/v1_covered.pdf"}],"financialInterests":"No competing interests reported.","formattedTitle":"Makespan Optimization of Workflow Application based on Bandwidth Allocation Algorithm in Fog-Cloud Environment","fulltext":[{"header":"Full Text","content":"This preprint is available for \u003ca href='/article/rs-1809172/latest.pdf' target='_blank'\u003edownload as a PDF\u003c/a\u003e."}],"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":false,"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":"Fog Computing, IoT, List scheduling, DAG,Makespan","lastPublishedDoi":"10.21203/rs.3.rs-1809172/v1","lastPublishedDoiUrl":"https://doi.org/10.21203/rs.3.rs-1809172/v1","license":{"name":"CC BY 4.0","url":"https://creativecommons.org/licenses/by/4.0/"},"manuscriptAbstract":"Fog computing technology has emerged to handle the large amount of data generated by Internet of Things (IoT) terminals and cope with latency-sensitive application requests by allocating computation and storage resources at the edge of the Internet. In many IoT applications, the data acquisition procedures must apply the Directed Acyclic Graph (DAG) to get real-time results. The principal goal of DAG scheduling is to reduce total completion time without breaking priority constraints by properly allocating tasks to processors and arranging task execution sequencing. In this paper, we propose a bandwidth-aware workflow allocation (BW-AWA) that schedules tasks by priority to the resource that minimizes the total execution time (Makespan) in the entire heterogeneous computing system without affecting the increase in energy consumed. The task selection process needs to consider the dependency between tasks. The proposed approach is tested with a road safety case study, and the results are compared to well-known approaches to demonstrate the effectiveness in reducing the Makespan.","manuscriptTitle":"Makespan Optimization of Workflow Application based on Bandwidth Allocation Algorithm in Fog-Cloud Environment","msid":"","msnumber":"","nonDraftVersions":[{"code":1,"date":"2022-07-06 18:08:03","doi":"10.21203/rs.3.rs-1809172/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":"d0b9b2aa-6ba3-4ceb-8863-026e092e2e42","owner":[],"postedDate":"July 6th, 2022","published":true,"recentEditorialEvents":[],"rejectedJournal":[],"revision":"","amendment":"","status":"posted","subjectAreas":[],"tags":[],"updatedAt":"2022-11-08T12:59:38+00:00","versionOfRecord":[],"versionCreatedAt":"2022-07-06 18:08:03","video":"","vorDoi":"","vorDoiUrl":"","workflowStages":[]},"version":"v1","identity":"rs-1809172","journalConfig":"researchsquare"},"__N_SSP":true},"page":"/article/[identity]/[[...version]]","query":{"redirect":"/article/rs-1809172","identity":"rs-1809172","version":["v1"]},"buildId":"J0_U0BvcaRcwD8yVFaRlm","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. The paper's references may be in our DB but unresolved to ``paper_id`` (resolution happens at ingest when the cited DOI matches a row we already have). Run the cross-source citation reconcile pass to retry.

Source provenance

europepmc
last seen: 2026-05-19T01:45:01.086888+00:00
unpaywall
last seen: 2026-05-26T02:00:01.498150+00:00
License: CC-BY-4.0