Optimal loop storage allocation for argument-fetching dataflow machines

DOI10.1007/BF01379405zbMath0804.68016OpenAlexW2083749766MaRDI QIDQ1322508

Qi Ning, Guang R. Gao

Publication date: 5 May 1994

Published in: International Journal of Parallel Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01379405

zbMATH Keywords

polynomial algorithmstorage allocationloop schedulingdataflow architecture

Mathematics Subject Classification ID

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

Related Items (2)

Using timed Petri net to model instruction-level loop scheduling with resource constraints ⋮ Optimal loop storage allocation for argument-fetching dataflow machines

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A new polynomial-time algorithm for linear programming
• A theory of compaction-based parallelization
• Optimal loop storage allocation for argument-fetching dataflow machines
• Postpass Code Optimization of Pipeline Constraints
• Scheduling expressions on a pipelined processor with a maximal delay of one cycle
• Characterization of Totally Unimodular Matrices

This page was built for publication: Optimal loop storage allocation for argument-fetching dataflow machines