On Scheduling Policies for Streams of Structured Jobs

DOI10.1007/978-3-540-85778-5_11zbMATH Open1171.90396OpenAlexW1586190512MaRDI QIDQ3543294FDOQ3543294

Authors: Aldric Degorre, Oded Maler 

Publication date: 2 December 2008

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-85778-5_11

Recommendations

• Extremal scheduling of parallel processing with and without real-time constraints
• Guaranteeing Fair Service to Persistent Dependent Tasks
• A class of scheduling policies for mixed data with renewal arrival processes
• Dynamic on-line task scheduling on parallel processors
• Publication:4886054

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Cites Work

• A theory of timed automata
• Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
• Title not available (Why is that?)
• Title not available (Why is that?)
• Adversarial queuing theory
• On the synthesis of discrete controllers for timed systems
• CONCUR 2005 – Concurrency Theory
• Title not available (Why is that?)
• Timed regular expressions
• Schedulability analysis of fixed-priority systems using timed automata
• Job-shop scheduling using neural networks
• Title not available (Why is that?)
• Title not available (Why is that?)
• A survey of queueing theory

Cited In (2)

• A dynamic priority assignment technique for streams with (m, k)-firm deadlines
• Big-Data Streaming Applications Scheduling Based on Staged Multi-armed Bandits

This page was built for publication: On Scheduling Policies for Streams of Structured Jobs

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