list.iid.ciirc.cvut.cz
Sign In Sign Up
Manage this list Sign In Sign Up

Keyboard Shortcuts

Thread View

  • j: Next unread message
  • k: Previous unread message
  • j a: Jump to all threads
  • j l: Jump to MailingList overview

Scheduling seminar

Thread Start a new thread
Download
Threads by month
  • ----- 2025 -----
  • May
  • April
  • March
  • February
  • January
  • ----- 2024 -----
  • December
  • November
  • October
  • September
  • August
  • July
  • June
  • May
  • April
  • March
  • February
  • January
  • ----- 2023 -----
  • December
  • November
  • October
  • September
  • August
  • July
  • June
  • May
  • April
  • March
  • February
  • January
  • ----- 2022 -----
  • December
  • November
  • October
  • September
  • August
  • July
  • June
  • May
  • April
  • March
  • February
  • January
  • ----- 2021 -----
  • December
  • November
  • October
  • September
  • August
  • July
  • June
  • May
  • April
  • March
schedulingseminar@rtime.felk.cvut.cz

September 2022

  • 1 participants
  • 3 discussions
Alix Munier Kordon (Sorbonne U., LIP6) | September 28 | Synchronous DataFlow: A survival guide
by Zdeněk Hanzálek 26 Sep '22

26 Sep '22
Dear scheduling researcher, We are delighted to announce the talk given by Alix Munier Kordon (Sorbonne U., LIP6). The title is " Synchronous DataFlow: A survival guide ". The seminar will take place on Zoom on Wednesday, September 28 at 13:00 UTC. Join Zoom Meeting https://cesnet.zoom.us/j/95675289257?pwd=bnBHNWJrcmJPTytmMC9xbU5IQ2JXUT09 Meeting ID: 956 7528 9257 Passcode: 105839 You can follow the seminar online or offline on our Youtube channel as well: https://www.youtube.com/channel/UCUoCNnaAfw5NAntItILFn4A The abstract follows. Synchronous Dataflow (SDF in short) were introduced in 1987 by Lee and Messerschmitt to model data exchanges in embedded systems. A SDF is usually defined by a directed graph, where each node is associated to a task that may be executed infinetly often. Each arc represents a buffer between two tasks. Moreover, the number of data samples produced or consumed by each task on each execution is specified a priori. Nowadays, SDF are considered by several scientific communities. It allows for example to model the exchanges for the design of Digital Signal Processings, or in real-time applications to run on a complex architecture. The purpose of this talk is to present a set of mathematical results developed on SDF, and to show how to use them to solve concrete problems posed by their users. We will also do the link with classical cyclic scheduling problems by demonstrating that the buffers can be associated to usual precedence constraints between successive task executions. We will conclude by some challenging open questions. The next talk in our series will be: Greet Vanden Berghe (KU Leuven) | October 12 | Vehicle routing - a focus on heuristic design. For more details, please visit https://schedulingseminar.com/ With kind regards Zdenek, Mike and Guohua -- Zdenek Hanzalek Industrial Informatics Department, Czech Institute of Informatics, Robotics and Cybernetics, Czech Technical University in Prague, Jugoslavskych partyzanu 1580/3, 160 00 Prague 6, Czech Republic https://rtime.ciirc.cvut.cz/~hanzalek/
1 0
0 0
Christos Zacharias (University of Miami) | September 14 | Dynamic Interday and Intraday Scheduling
by Zdeněk Hanzálek 12 Sep '22

12 Sep '22
Dear scheduling researcher, We are delighted to announce the talk given by Christos Zacharias (University of Miami). The title is "Dynamic Interday and Intraday Scheduling". The seminar will take place on Zoom on Wednesday, September 14 at 13:00 UTC. Join Zoom Meeting https://cesnet.zoom.us/j/95721352866?pwd=YXJ0bW9nN09XUldLbk1LbEo0YlN4Zz09 Meeting ID: 957 2135 2866 Passcode: 264401 You can follow the seminar online or offline on our Youtube channel as well: https://www.youtube.com/channel/UCUoCNnaAfw5NAntItILFn4A The abstract follows. The simultaneous consideration of appointment day (interday scheduling) and time of day (intraday scheduling) in dynamic scheduling decisions is a theoretical and practical problem that has remained open. We introduce a novel dynamic programming framework that incorporates jointly these scheduling decisions in two timescales. Our model is designed with the intention of bridging the two streams of literature on interday and intraday scheduling and to leverage their latest theoretical developments in tackling the joint problem. We establish theoretical connections between two recent studies by proving novel theoretical results in discrete convex analysis regarding constrained multimodular function minimization. Grounded on our theory, we develop a practically implementable and computationally tractable scheduling paradigm with performance guarantees. Numerical experiments demonstrate that the optimality gap is less than 1% for practical instances of the problem. The next talk in our series will be: Alix Munier Kordon (Sorbonne U., LIP6) | September 28 | Synchronous DataFlow: A survival guide For more details, please visit https://schedulingseminar.com/ With kind regards Zdenek, Mike and Guohua -- Zdenek Hanzalek Industrial Informatics Department, Czech Institute of Informatics, Robotics and Cybernetics, Czech Technical University in Prague, Jugoslavskych partyzanu 1580/3, 160 00 Prague 6, Czech Republic https://rtime.ciirc.cvut.cz/~hanzalek/
1 0
0 0
Christos Zacharias (University of Miami) | September 14 | Dynamic Interday and Intraday Scheduling
by Zdeněk Hanzálek 07 Sep '22

07 Sep '22
Dear scheduling researcher, We are delighted to announce the talk given by Christos Zacharias (University of Miami). The title is "Dynamic Interday and Intraday Scheduling". The seminar will take place on Zoom on Wednesday, September 14 at 13:00 UTC. Join Zoom Meeting https://cesnet.zoom.us/j/95721352866?pwd=YXJ0bW9nN09XUldLbk1LbEo0YlN4Zz09 Meeting ID: 957 2135 2866 Passcode: 264401 You can follow the seminar online or offline on our Youtube channel as well: https://www.youtube.com/channel/UCUoCNnaAfw5NAntItILFn4A The abstract follows. The simultaneous consideration of appointment day (interday scheduling) and time of day (intraday scheduling) in dynamic scheduling decisions is a theoretical and practical problem that has remained open. We introduce a novel dynamic programming framework that incorporates jointly these scheduling decisions in two timescales. Our model is designed with the intention of bridging the two streams of literature on interday and intraday scheduling and to leverage their latest theoretical developments in tackling the joint problem. We establish theoretical connections between two recent studies by proving novel theoretical results in discrete convex analysis regarding constrained multimodular function minimization. Grounded on our theory, we develop a practically implementable and computationally tractable scheduling paradigm with performance guarantees. Numerical experiments demonstrate that the optimality gap is less than 1% for practical instances of the problem. The next talk in our series will be: Alix Munier Kordon (Sorbonne U., LIP6) | September 28 | Synchronous DataFlow: A survival guide For more details, please visit https://schedulingseminar.com/ With kind regards Zdenek, Mike and Guohua -- Zdenek Hanzalek Industrial Informatics Department, Czech Institute of Informatics, Robotics and Cybernetics, Czech Technical University in Prague, Jugoslavskych partyzanu 1580/3, 160 00 Prague 6, Czech Republic https://rtime.ciirc.cvut.cz/~hanzalek/
1 0
0 0

HyperKitty Powered by HyperKitty version 1.3.12.