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/