Pages that link to "Item:Q1911467"
From MaRDI portal
The following pages link to Scheduling tree dags on parallel architectures (Q1911467):
Displaying 22 items.
- On scheduling \textsc{DAGs} for volatile computing platforms: area-maximizing schedules (Q456005) (← links)
- Optimal parallel execution of complete binary trees and grids into most popular interconnection networks (Q672453) (← links)
- Approximating schedules for dynamic process graphs efficiently (Q876729) (← links)
- Pipelining tree-structured algorithms on SIMD architectures (Q911739) (← links)
- Task scheduling with and without communication delays: A unified approach (Q1266702) (← links)
- Competitive implementation of parallel programs (Q1277321) (← links)
- Upper and lower bounds on the makespan of schedules for tree dags on linear arrays (Q1277394) (← links)
- Scheduling inverse trees under the communication model of the LogP-machine (Q1285579) (← links)
- Time-optimal tree computations on sparse meshes (Q1364469) (← links)
- Scheduling problems in a practical allocation model (Q1369746) (← links)
- On multiprocessor system scheduling (Q1383800) (← links)
- Scheduling task-trees with additive scales on parallel/distributed machines (Q1391320) (← links)
- 1-optimality of static BSP computations: Scheduling independent chains as a case study. (Q1401163) (← links)
- Dynamic scheduling of parallel computations (Q1583589) (← links)
- Scheduling DAGs opportunistically: the dream and the reality circa 2016 (Q1693216) (← links)
- On the power of the linear array architecture for performing tree- structured computations (Q1892200) (← links)
- Scheduling tree dags on parallel architectures (Q1911467) (← links)
- Parallel processor scheduling with delay constraints (Q2768351) (← links)
- On scheduling series-parallel DAGs to maximize area (Q2929638) (← links)
- Real-Time Scheduling and Analysis of OpenMP DAG Tasks Supporting Nested Parallelism (Q5126055) (← links)
- Scheduling task-tree with additive scales on parallel/distributed machines (Q6085760) (← links)
- A Bi-Criteria FPTAS for Scheduling with Memory Constraints on Graphs with Bounded Tree-Width (Q6487362) (← links)
