Pages that link to "Item:Q1177086"
From MaRDI portal
The following pages link to Scheduling independent jobs on partitionable hypercubes (Q1177086):
Displaying 11 items.
- Fast exact and approximate algorithms for \(k\)-partition and scheduling independent tasks (Q685660) (← links)
- Maximizing the throughput of parallel jobs on hypercubes (Q846023) (← links)
- An \(O(n \log n)\) feasibility algorithm for preemptive scheduling of n independent jobs on a hypercube (Q917300) (← links)
- Preemptive scheduling of independent jobs on a hypercube (Q1111373) (← links)
- Scheduling multiprocessor tasks -- An overview (Q1278297) (← links)
- An approximation scheme for scheduling independent jobs into subcubes of a hypercube of fixed dimension (Q1391539) (← links)
- The master-slave paradigm in parallel computer and industrial settings (Q2564882) (← links)
- A NOTE ON SCHEDULING PARALLEL UNIT JOBS ON HYPERCUBES (Q3634187) (← links)
- Scheduling of Jobs in a Hypercube Processing System (Q4717121) (← links)
- Scheduling DAGs with random parallel tasks on binarily partitionable systems (Q5460650) (← links)
- Walk on the hypercube with minimum similarities (Q6488188) (← links)