Partitioning processor arrays under resource constraints
From MaRDI portal
Recommendations
Cited in
(13)- Resource-Oriented Partitioning for Multiprocessor Systems with Shared Resources
- Partitioning of processor arrays: a piecewise regular approach
- On the complexity of assembly partitioning
- Partitioning a set of vectors with integer coordinates by means of logical hardware
- Optimal allocation of requirements to parallel devices
- Partitioning program to cadres for computers with dynamically reconfigurable pipeline
- Partitioning and scheduling DSP applications with maximal memory access hiding
- Resource-constrained scheduling of partitioned algorithms on processor arrays
- ILP models for the allocation of recurrent workloads upon heterogeneous multiprocessors
- Design of processor arrays for reconfigurable architectures
- Partitioning and Mapping Algorithms into Fixed Size Systolic Arrays
- Design of space-optimal regular arrays for algorithms with linear schedules
- On loop transformations of nested loops with affine dependencies
This page was built for publication: Partitioning processor arrays under resource constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1376400)