Pages that link to "Item:Q5315235"
From MaRDI portal
The following pages link to Structural Information and Communication Complexity (Q5315235):
Displaying 21 items.
- On-line hierarchical job scheduling on grids with admissible allocation (Q600844) (← links)
- Improved online algorithms for parallel job scheduling and strip packing (Q627112) (← links)
- On-line scheduling mesh jobs with dependencies (Q870843) (← links)
- Online scheduling of parallel jobs on two machines is 2-competitive (Q924886) (← links)
- On-line scheduling of parallel jobs in a list (Q954256) (← links)
- On-line scheduling of parallel jobs on two machines (Q954945) (← links)
- Dynamic scheduling on parallel machines (Q1331960) (← links)
- On-line scheduling of jobs with fixed start and end times (Q1331962) (← links)
- Optimal on-line scheduling of parallel jobs with dependencies (Q1383801) (← links)
- On an on-line scheduling problem for parallel jobs (Q1603586) (← links)
- Scheduling parallel jobs online with convex and concave parallelizability (Q1743115) (← links)
- Online C-benevolent job scheduling on multiple machines (Q1744621) (← links)
- Online scheduling of parallel programs on heterogeneous systems with applications to Cilk (Q1849575) (← links)
- Scheduling parallelizable jobs online to maximize throughput (Q2294735) (← links)
- A system-centric metric for the evaluation of online job schedules (Q2434258) (← links)
- Bin packing problems with rejection penalties and their dual problems (Q2495654) (← links)
- Online Scheduling of Equal-Length Jobs on Parallel Machines (Q3527232) (← links)
- Scheduling Parallel DAG Jobs Online to Minimize Average Flow Time (Q4575590) (← links)
- Online Scheduling on a CPU-GPU Cluster (Q4922108) (← links)
- Online Algorithm for Parallel Job Scheduling and Strip Packing (Q5443373) (← links)
- Running a job on a collection of partly available machines, with on-line restarts (Q5941748) (← links)