Optimal data scheduling for uniform multidimensional applications

DOI10.1109/12.545974MaRDI QIDQ4420793zbMATH OpenOpenAlexFDO

Authors Qingyan Wang, Nelson Luiz Passos, Edwin H.-M. Sha

Publication date 1996

Published in IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/bc0801eeba4714d28b959731f49c5feac79f8604

zbMATH Keywords

digital signal processingmemory hierarchymemory managementpartitioning

Mathematics Subject Classification ID

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

Recommendations

• Mapping uniform loop nests onto distributed memory architectures
• Some efficient solutions to the affine scheduling problem. II: Multidimensional time
• Resource-constrained scheduling of partitioned algorithms on processor arrays
• On the optimality of linear schedules
• Reducing off-chip memory access via stream-conscious tiling on multimedia applications

Cited in

(4)

• Partitioning and scheduling DSP applications with maximal memory access hiding
• scientific article; zbMATH DE number 5985624 (Why is no real title available?)
• Data Center Scheduling, Generalized Flows, and Submodularity
• Reducing off-chip memory access via stream-conscious tiling on multimedia applications

This page was built for publication: Optimal data scheduling for uniform multidimensional applications

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