https://www.mdu.se/

mdu.sePublications
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Taming Tardiness on Parallel Machines: Online Scheduling with Limited Job Information
Mälardalen University, School of Innovation, Design and Engineering, Embedded Systems.
Mälardalen University, Department of Computer Science and Electronics. Mälardalen University, Department of Computer Science and Engineering. Mälardalen University, School of Innovation, Design and Engineering, Embedded Systems. Mälardalen University, School of Innovation, Design and Engineering, Embedded Systems.ORCID iD: 0000-0001-6132-7945
Mälardalen University, School of Innovation, Design and Engineering, Embedded Systems.ORCID iD: 0000-0002-1364-8127
Mälardalen University, School of Innovation, Design and Engineering, Embedded Systems. Mälardalen University, School of Innovation, Design and Engineering, Embedded Systems.ORCID iD: 0000-0003-3242-6113
2024 (English)Report (Other academic)
Abstract [en]

We consider the problem of scheduling $n$ jobs on $m geq 2$ parallel machines in online settings with the objective of minimizing total tardiness. Since no bounded competitive algorithms exist to minimize the general problem of weighted total tardiness of the form $sum w_j T_j$, we consider an objective of the form $sum w_j (T_j+d_j)$, where $w_j, T_j$, and $d_j$ are the weight, tardiness, and deadline of each job, respectively and develop competitive algorithms dependent on jobs' processing times.

Place, publisher, year, edition, pages
Mälardalen Real-Time Research Centre, Mälardalen University , 2024.
National Category
Computer Sciences
Research subject
Computer Science
Identifiers
URN: urn:nbn:se:mdh:diva-68593ISRN: MDH-MRTC-352/2024-1-SEOAI: oai:DiVA.org:mdh-68593DiVA, id: diva2:1903577
Available from: 2024-10-04 Created: 2024-10-04 Last updated: 2025-01-07Bibliographically approved
In thesis
1. Scheduling and Dispatching Strategies for Real-Time Applications in Multi-Server Systems
Open this publication in new window or tab >>Scheduling and Dispatching Strategies for Real-Time Applications in Multi-Server Systems
2024 (English)Doctoral thesis, comprehensive summary (Other academic)
Abstract [en]

Real-time systems such as industrial robots and automated guided vehicles integrate a wide range of algorithms with varying levels of timing requirements to achieve their functional behavior. Historically, in certain systems, these algorithms were deployed on dedicated single-core hardware platforms that exchanged information over a real-time network, while more recent designs have adapted an integrated architecture where these algorithms are executed on an embedded multi-core hardware platform. The advantages provided by cloud and fog architectures for non-real-time applications have prompted discussions around the possibility of achieving similar advantages for systems such as industrial robot controllers by moving from an embedded architecture to a cloud and fog native architecture. This thesis addresses a subset of challenges related to scheduling to facilitate this transition and presents three main contributions aimed at improving online scheduling methodologies in multi-server systems for applications with real-time requirements. First, an approach based on minimum parallelism reservations is proposed for scheduling sequential tasks in hierarchical multi-server systems with clairvoyant inputs, ensuring adherence to hard real-time requirements. Second, a framework is introduced that utilizes estimated processing times to enhance average throughput in distributed multi-queue multi-server systems while managing tasks with stochastic inputs and firm real-time requirements, thereby improving resource utilization. Finally, competitive algorithms are proposed that leverage estimated processing times to minimize average (modified) tardiness in centralized single-queue multi-server systems, addressing the scheduling of sequential tasks with arbitrary arrivals and soft real-time requirements. Collectively, these contributions establish a robust foundation for improving the performance of real-time systems operating in increasingly complex environments characterized by dynamic workloads and varying resource availability.

Place, publisher, year, edition, pages
Västerås: Mälardalen University, 2024
Series
Mälardalen University Press Dissertations, ISSN 1651-4238 ; 420
National Category
Computer Sciences
Research subject
Computer Science
Identifiers
urn:nbn:se:mdh:diva-68594 (URN)978-91-7485-683-5 (ISBN)
Public defence
2024-11-05, Kappa, Mälardalens universitet, Västerås, 13:15 (English)
Opponent
Supervisors
Available from: 2024-10-08 Created: 2024-10-04 Last updated: 2024-10-16Bibliographically approved

Open Access in DiVA

No full text in DiVA

Other links

http://www.es.mdu.se/publications/7033-

Authority records

Salman Shaik, MohammedNolte, ThomasPapadopoulos, AlessandroMubeen, Saad

Search in DiVA

By author/editor
Salman Shaik, MohammedNolte, ThomasPapadopoulos, AlessandroMubeen, Saad
By organisation
Embedded SystemsDepartment of Computer Science and ElectronicsDepartment of Computer Science and EngineeringEmbedded Systems
Computer Sciences

Search outside of DiVA

GoogleGoogle Scholar

urn-nbn

Altmetric score

urn-nbn
Total: 100 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf