Efficient algorithms for periodic scheduling
type: Item
instance of: scholarly article
title: Efficient algorithms for periodic scheduling
zbMATH Open document ID: 1072.68013
author: Amotz Bar-Noy
author: Vladimir Dreizin
author: Boaz Patt-Shamir
published in: Computer Networks
publication date: 2004-11-18T00:00:00Z
Mathematics Subject Classification ID: 68M20
Mathematics Subject Classification ID: 68W05
zbMATH DE Number: 2116503
zbMATH Keywords: Periodic scheduling
zbMATH Keywords: Fair scheduling
zbMATH Keywords: Broadcast disks
zbMATH Keywords: Hierarchical round robin
MaRDI profile type: Publication
full work available at URL: j.comnet.2003.12.017
OpenAlex ID: W2151576803
DOI: 10.1016/J.COMNET.2003.12.017
Recommended article: An efficient algorithm for finding ideal schedules
Recommended article: Algorithms and complexity for periodic real-time scheduling
Recommended article: Q5417713
Recommended article: A new algorithm for scheduling periodic, real-time tasks
Recommended article: Effective iterative algorithms in scheduling theory
Recommended article: Optimal scheduling in a periodic environment
Recommended article: Q4859840
Recommended article: Q3425131
Recommended article: Q2734595
Recommended article: General perfectly periodic scheduling
description: scientific article; zbMATH DE number 2116503