Scheduling to minimize staleness and stretch in real-time data warehouses

DOI10.1007/s00224-011-9347-2zbMath1253.68069OpenAlexW2070277413MaRDI QIDQ693761

MohammadHossein Bateni, Lukasz Golab, Howard J. Karloff, Mohammad Taghi Hajiaghayi

Publication date: 10 December 2012

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.173.1662

zbMATH Keywords

competitive analysison-line schedulingdata warehouse maintenance

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Online algorithms; streaming algorithms (68W27)

Related Items (1)

Optimizing the stretch of independent tasks on a cluster: from sequential tasks to moldable tasks

Cites Work

• Unnamed Item
• Server scheduling in the L _p norm

This page was built for publication: Scheduling to minimize staleness and stretch in real-time data warehouses