Resource-constrained scheduling of partitioned algorithms on processor arrays

DOI10.1016/0167-9260(95)00022-4MaRDI QIDQ3122482zbMATH OpenFDO

Authors Michèle Dion, Tanguy Risset, Yves Robert

Publication date 27 February 1997

Published in Integration (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0167-9260(95)00022-4

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Recommendations

• Partitioning processor arrays under resource constraints
• Partitioning of processor arrays: a piecewise regular approach
• Optimal piecewise linear schedules for LSGP- and LPGS-decomposed array processors via quadratic programming
• scientific article; zbMATH DE number 4133846
• Mapping uniform loop nests onto distributed memory architectures

Cited in

(9)

• Partitioning processor arrays under resource constraints
• Optimization of data exchange in parallel computers with distributed memory
• Efficient Resource Constrained Scheduling Using Parallel Structure-Aware Pruning Techniques
• Parallelization of sequential programs: distribution of arrays among processors and structurization of communications
• Optimal data scheduling for uniform multidimensional applications
• Hybrid algorithms for hardware/software partitioning and scheduling on reconfigurable devices
• scientific article; zbMATH DE number 2086779 (Why is no real title available?)
• Resource-Oriented Partitioning for Multiprocessor Systems with Shared Resources
• Design of processor arrays for reconfigurable architectures

This page was built for publication: Resource-constrained scheduling of partitioned algorithms on processor arrays

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3122482)