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

DOI10.1007/s10878-010-9332-8zbMath1236.90051OpenAlexW2033368856MaRDI QIDQ411217

Karine Deschinkel, Sid-Ahmed-Ali Touati, Sébastien Briais

Publication date: 4 April 2012

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-010-9332-8

zbMATH Keywords

cyclic schedulingrepetitive tasksstorage requirement

Mathematics Subject Classification ID

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

Uses Software

• R

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On a graph-theoretical model for cyclic register allocation
• A study of the cyclic scheduling problem on parallel processors
• Finding Minimum-Cost Circulations by Successive Approximation
• The R Book
• On Periodic Register Need in Software Pipelining
• OPTIMAL SOFTWARE PIPELINING UNDER RESOURCE CONSTRAINTS
• Efficient Method for Periodic Task Scheduling with Storage Requirement Minimization

This page was built for publication: SIRALINA: Efficient two-steps heuristic for storage optimisation in single period task scheduling