Minimizing average schedule length under memory constraints by optimal partitioning and prefetching

DOI10.1023/A:1008114531225MaRDI QIDQ5932375zbMATH OpenOpenAlexFDO

Authors Zhong Wang, Timothy W. O'Neil, Edwin H.-M. Sha

Publication date 7 May 2001

Published in Journal of VLSI signal processing systems for signal, image and video technology (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/a:1008114531225

zbMATH Keywords

DSP architecturesmemory managementprefetchingscheduling

Mathematics Subject Classification ID

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

Recommendations

• Load-balancing data prefetching techniques
• Effective hardware-based data prefetching for high-performance processors
• Partitioning and scheduling DSP applications with maximal memory access hiding
• scientific article; zbMATH DE number 1753943
• Execution history guided instruction prefetching

Cited in

(5)

• Optimizing memory allocation for multistage scheduling including setup times
• Partitioning and scheduling DSP applications with maximal memory access hiding
• Memory-side prefetching for linked data structures for processor-in-memory systems
• scientific article; zbMATH DE number 1948448 (Why is no real title available?)
• Efficient Method for Periodic Task Scheduling with Storage Requirement Minimization

This page was built for publication: Minimizing average schedule length under memory constraints by optimal partitioning and prefetching

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