Fast and Effective Multiframe-Task Parameter Assignment Via Concave Approximations of Demand

DOI10.4230/LIPICS.ECRTS.2019.20MaRDI QIDQ5089126zbMATH OpenOpenAlexFDO

Authors Bo Peng, Nathan Fisher, Thidapat Chantem

Publication date 18 July 2022

Full work available at URL https://drops.dagstuhl.de/opus/volltexte/2019/10757/pdf/LIPIcs-ECRTS-2019-20.pdf

zbMATH Keywords

concave approximationgeneralized multiframe task model (GMF)generalized multiframe task model with parameter adaptation (GMF-PA)linear programmingmixed-integer linear programmingself-suspending tasksuniprocessor scheduling

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Recommendations

• Fast multiple-splitting algorithms for convex optimization
• An algorithm for approximate multiparametric convex programming
• Fast Consensus by the Alternating Direction Multipliers Method
• scientific article; zbMATH DE number 2128203
• Efficient approximation algorithms for multi-objective constraint optimization
• A non-monotone frame-based direct search conjugate gradient method
• ADMM for multiaffine constrained optimization
• scientific article; zbMATH DE number 1046042

Cites work

• Dynamic- and static-priority scheduling of recurring real-time tasks
• Graph-based models for real-time workload: a survey
• Measuring the performance of schedulability tests
• Parameter adaptation for generalized multiframe tasks: schedulability analysis, case study, and applications to self-suspending tasks
• The Complexity of Flowshop and Jobshop Scheduling

Cited in

(1)

• scientific article; zbMATH DE number 7087306 (Why is no real title available?)

This page was built for publication: Fast and Effective Multiframe-Task Parameter Assignment Via Concave Approximations of Demand

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5089126)