Optimizing resource speed for two-stage real-time tasks

DOI10.1007/S11241-016-9259-YMaRDI QIDQ2362234zbMATH OpenOpenAlexFDO

Authors Alessandra Melani, Renato Mancuso, Daniel Cullina, Marco Caccamo, Lothar Thiele

Publication date 6 July 2017

Published in Real-Time Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s11241-016-9259-y

zbMATH Keywords

co-schedulingenergy savingflow-shop schedulingmulti-resource modelmulti-stage modelpower savingreal-time systemsschedulability analysisspeed optimization

Mathematics Subject Classification ID

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

Recommendations

• Minimization of resource consumption under a given deadline in the two- processor flow-shop scheduling problem
• Energy-efficient real-time scheduling for two-type heterogeneous multiprocessors
• Resource level minimization in the discrete-continuous scheduling
• Power-aware scheduling for makespan and flow
• Optimal Resource Assignment of Preemptive Periodic Tasks on Multiple Processors

Cites work

• A polynomial time approximation scheme for the two-stage multiprocessor flow shop problem
• An algorithm for approximating convex functions by means by first degree splines
• Analysis of Classes of Heuristics for Scheduling a Two-Stage Flow Shop with Parallel Machines at One Stage
• Exact Response Time Analysis for Fixed Priority Memory-Processor Co-Scheduling
• scientific article; zbMATH DE number 1110629 (Why is no real title available?)
• Memory-centric scheduling for multicore hard real-time systems
• On the Calculation of the Piecewise Linear Approximation to a Discrete Function
• On the complexity of speed scaling
• On the Interplay of Voltage/Frequency Scaling and Device Power Management for Frame-Based Real-Time Embedded Applications
• Optimal two- and three-stage production schedules with set-up time included
• Optimizing resource speed for two-stage real-time tasks
• Preemptive scheduling in a two-stage multiprocessor flow shop is NP-hard
• The Complexity of Flowshop and Jobshop Scheduling
• The upper envelope of piecewise linear functions: Algorithms and applications

Cited in

(2)

• Optimizing resource speed for two-stage real-time tasks
• Optimal resource allocation and scheduling for the CELL BE platform

This page was built for publication: Optimizing resource speed for two-stage real-time tasks

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