Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
MaRDI portal item
Discussion
View source
View history
Purge
English
Log in

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

From MaRDI portal
Publication:5932375
Jump to:navigation, search

DOI10.1023/A:1008114531225zbMath0972.68014OpenAlexW1568663202MaRDI QIDQ5932375

Timothy W. O'Neil, Edwin Hsing-Mean Sha, Zhong Wang

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

schedulingDSP architecturesmemory managementprefetching


Mathematics Subject Classification ID

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








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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:5932375&oldid=12073148"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
This page was last edited on 30 January 2024, at 00:32.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki