The following pages link to Scheduling Parallel Computations (Q5553092):
Displayed 13 items.
- Self-timed scheduling analysis for real-time applications (Q836417) (← links)
- A general model for cyclic machine scheduling problems (Q955322) (← links)
- A connection between circular colorings and periodic schedules (Q1028150) (← links)
- A survey of scheduling methods for multiprocessor systems (Q1153687) (← links)
- Regularity and firing sequences of computation graphs (Q1159465) (← links)
- Upper and lower bounds for stochastic marked graphs (Q1321817) (← links)
- Min-max functions (Q1338772) (← links)
- The use of a synchronizer yields the maximum computation rate in distributed networks (Q1364128) (← links)
- From max-plus algebra to nonexpansive mappings: A nonlinear theory for discrete event systems. (Q1870590) (← links)
- Minimizing the cycle time of multiple-product processing networks with a fixed operation sequence, setups, and time-window constraints (Q2467264) (← links)
- Marked directed graphs (Q2552879) (← links)
- Dynamic analysis of repetitive decision-free discrete-event processes: The algebra of timed marked graphs and algorithmic issues (Q2639765) (← links)
- On Flows in Stochastic Marked Graphs (Q3416004) (← links)