Pages that link to "Item:Q2294735"
From MaRDI portal
The following pages link to Scheduling parallelizable jobs online to maximize throughput (Q2294735):
Displaying 9 items.
- Scheduling parallel jobs online with convex and concave parallelizability (Q1743115) (← links)
- Open problems in queueing theory inspired by datacenter computing (Q2052428) (← links)
- Online scheduling of parallelizable jobs in the directed acyclic graphs and speed-up curves models (Q2089685) (← links)
- Online Scheduling of Bounded Length Jobs to Maximize Throughput (Q3558919) (← links)
- Scheduling Parallel DAG Jobs Online to Minimize Average Flow Time (Q4575590) (← links)
- Optimally Handling Commitment Issues in Online Throughput Maximization (Q5874511) (← links)
- Approximation and Online Algorithms (Q5898474) (← links)
- A general framework for handling commitment in online throughput maximization (Q5918914) (← links)
- Maximizing Throughput in Flow Shop Real-Time Scheduling (Q6084409) (← links)