Scheduling Parallel Computations

DOI10.1145/321479.321485MaRDI QIDQ5553092zbMATH OpenOpenAlexFDO

Authors Raymond Reiter

Publication date 1968

Published in Journal of the ACM (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/321479.321485

zbMATH Keywords

numerical analysis

Cited in

(13)

• Self-timed scheduling analysis for real-time applications
• Upper and lower bounds for stochastic marked graphs
• Dynamic analysis of repetitive decision-free discrete-event processes: The algebra of timed marked graphs and algorithmic issues
• On Flows in Stochastic Marked Graphs
• A survey of scheduling methods for multiprocessor systems
• Regularity and firing sequences of computation graphs
• Min-max functions
• A connection between circular colorings and periodic schedules
• From max-plus algebra to nonexpansive mappings: A nonlinear theory for discrete event systems.
• Marked directed graphs
• A general model for cyclic machine scheduling problems
• Minimizing the cycle time of multiple-product processing networks with a fixed operation sequence, setups, and time-window constraints
• The use of a synchronizer yields the maximum computation rate in distributed networks

This page was built for publication: Scheduling Parallel Computations

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