Scheduling jobs on grid processors

DOI10.1007/s00453-008-9257-0zbMath1203.68027OpenAlexW1999166105MaRDI QIDQ973018

Joan. Boyar, Lene Monrad Favrholdt

Publication date: 28 May 2010

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-008-9257-0

zbMATH Keywords

on-line algorithmsfirst-fit-decreasingGrid scheduling problemZhang's bin packing problem

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Online algorithms; streaming algorithms (68W27)

Related Items (5)

Relative Worst-Order Analysis: A Survey ⋮ Online variable-sized bin packing with conflicts ⋮ A new variable-sized bin packing problem ⋮ Tight Bounds for Restricted Grid Scheduling ⋮ Bounds for Scheduling Jobs on Grid Processors

Cites Work

• Unnamed Item
• Unnamed Item
• A new version of on-line variable-sized bin packing
• The relative worst-order ratio applied to paging
• Competitive snoopy caching
• Fast algorithms for bin packing
• Separating online scheduling algorithms with the relative worst order ratio
• Bounds for Scheduling Jobs on Grid Processors
• A simple on-line bin-packing algorithm
• Algorithm Theory - SWAT 2004

This page was built for publication: Scheduling jobs on grid processors