TOP
Suche auf der Schloss Dagstuhl Webseite
Sie suchen nach Informationen auf den Webseiten der einzelnen Seminare? - Dann:
Nicht fündig geworden? - Einige unserer Dienste laufen auf separaten Webseiten mit jeweils eigener Suche. Bitte beachten Sie folgende Liste:
Schloss Dagstuhl - LZI - Logo
Schloss Dagstuhl Services
Seminare
Innerhalb dieser Seite:
Externe Seiten:
  • DOOR (zum Registrieren eines Dagstuhl Aufenthaltes)
  • DOSA (zum Beantragen künftiger Dagstuhl Seminare oder Dagstuhl Perspektiven Workshops)
Publishing
Innerhalb dieser Seite:
Externe Seiten:
dblp
Innerhalb dieser Seite:
Externe Seiten:
  • die Informatik-Bibliographiedatenbank dblp


Dagstuhl-Seminar 26412

Recent Trends in Perpetual Scheduling

( 04. Oct – 09. Oct, 2026 )

Permalink
Bitte benutzen Sie folgende Kurz-Url zum Verlinken dieser Seite: https://www.dagstuhl.de/26412

Organisatoren
  • Kunal Agrawal (Washington University - St. Louis, US)
  • Akitoshi Kawamura (Kyoto University, JP)
  • Kevin Schewior (Universität Köln, DE)
  • Sebastian Wild (Universität Marburg, DE)

Kontakt

Motivation

A particular type of fundamental scheduling problem has in the past years gained attention from researchers from several different fields. In the most basic version of the problem, the pinwheel scheduling problem, we are given a set of tasks, each of which requires to be scheduled repeatedly with a given minimum frequency. Main questions are (a) under what conditions a perpetual schedule provably exists that respects these frequencies, and (b) how to produce such a schedule efficiently.

Perhaps most notably, the over-30-year-old "Pinwheel density conjecture" was finally proven in 2024. Many questions about its extensions, variants, possible applications, as well as a simplification of the computer-assisted proof, however, remain open.

In this Dagstuhl Seminar, we aim to, for the first time, bring the researchers active in this area together and add researchers from outside whose work has (or may have) connections to the aforementioned types of problems: researchers from the fields of real-time scheduling, complexity theory, and online algorithms. Utilizing the current momentum, we believe that we can solidify and shape a subfield, identify and start working on new directions, and tackle open problems.

Copyright Kunal Agrawal, Akitoshi Kawamura, Kevin Schewior, and Sebastian Wild

LZI Junior Researchers

This seminar qualifies for Dagstuhl's LZI Junior Researchers program. Schloss Dagstuhl wishes to enable the participation of junior scientists with a specialisation fitting for this Dagstuhl Seminar, even if they are not on the radar of the organizers. Applications by outstanding junior scientists are possible until Friday, May 29, 2026.


Teilnehmer

Please log in to DOOR to see more details.

  • Kunal Agrawal
  • Sanjoy Baruah
  • Michael A. Bender
  • Federico Della Croce Di Dojola
  • Pontus Ekberg
  • Hiroshi Fujiwara
  • Leszek A. Gasieniec
  • Svenja M. Griesbach
  • Sungjin Im
  • Tomasz Jurdzinski
  • Sotiris Kanellopoulos
  • Akitoshi Kawamura
  • Ralf Klasing
  • Yusuke Kobayashi
  • Yosuke Kusano
  • John Kuszmaul
  • William Kuszmaul
  • Bingkai Lin
  • Lydia Mirabel Mendoza-Cadena
  • Arturo Merino
  • Tamio-Vesa Nakajima
  • Namrata
  • Mads Anker Nielsen
  • Christos Pergaminelis
  • Tomasz Radzik
  • Kevin Schewior
  • Ben Smith
  • Tami Tamir
  • Martijn van Ee
  • Rob van Stee
  • Sebastian Wild

Klassifikation
  • Data Structures and Algorithms

Schlagworte
  • scheduling
  • frequency requirements
  • approximation algorithms