Pages that link to "Item:Q1328131"
From MaRDI portal
The following pages link to Efficient algorithms for mapping and partitioning a class of parallel computations (Q1328131):
Displaying 14 items.
- Parallel partitioning for distributed systems using sequential assignment (Q362566) (← links)
- Layouts for improved hierarchical parallel computations (Q405569) (← links)
- Improved schemes for mapping arbitrary algorithms onto processor meshes (Q671303) (← links)
- Optimal partitioning and granularity of uniform task graphs (Q756400) (← links)
- A parallelization of adaptive task partitioning algorithms (Q1106613) (← links)
- Mapping a chain task to chained processors (Q1205718) (← links)
- Cluster partitioning approaches to mapping parallel programs onto a hypercube (Q1262751) (← links)
- Partitioning multiple-chain-like task across a host-satellite system (Q1313732) (← links)
- Optimal use of mixed task and data parallelism for pipelined computations (Q1974676) (← links)
- Partitionability of \(k\)-extra-stage omega networks and an optimal task migration algorithm (Q1974678) (← links)
- A Multistage Linear Array Assignment Problem (Q3210145) (← links)
- Partitioning and Mapping Algorithms into Fixed Size Systolic Arrays (Q3698306) (← links)
- (Q4892320) (← links)
- (Q5143658) (← links)
