Minimizing average schedule length under memory constraints by optimal partitioning and prefetching (Q5932375)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1596163
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Minimizing average schedule length under memory constraints by optimal partitioning and prefetching |
scientific article; zbMATH DE number 1596163 |
Statements
Minimizing average schedule length under memory constraints by optimal partitioning and prefetching (English)
0 references
7 May 2001
0 references
DSP architectures
0 references
scheduling
0 references
prefetching
0 references
memory management
0 references
0.7137675285339355
0 references
0.7129549384117126
0 references
0.7060748934745789
0 references
0.6986136436462402
0 references
