Efficient Method for Periodic Task Scheduling with Storage Requirement Minimization

DOI10.1007/978-3-540-85097-7_41MaRDI QIDQ5505681zbMATH OpenOpenAlexFDO

Authors Karine Deschinkel, Sid-Ahmed-Ali Touati

Publication date 27 January 2009

Published in Combinatorial Optimization and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-85097-7_41

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Integer programming (90C10) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Periodic scheduling for cache-miss minimisation
• Efficient algorithms for periodic scheduling
• Space-efficient scheduling of stochastically generated tasks
• Space-efficient scheduling of stochastically generated tasks
• Scheduling periodic tasks on uniform multiprocessors
• A new algorithm for scheduling periodic, real-time tasks
• Scheduling periodic tasks in a hard real-time environment
• Minimizing average schedule length under memory constraints by optimal partitioning and prefetching
• SIRALINA: Efficient two-steps heuristic for storage optimisation in single period task scheduling

Cites work

• A study of the cyclic scheduling problem on parallel processors
• scientific article; zbMATH DE number 4083375 (Why is no real title available?)
• scientific article; zbMATH DE number 3231692 (Why is no real title available?)
• Optimal software pipelining under resource constraints

Cited in

(1)

• SIRALINA: Efficient two-steps heuristic for storage optimisation in single period task scheduling

This page was built for publication: Efficient Method for Periodic Task Scheduling with Storage Requirement Minimization

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