Name
Abstract | ||
|---|---|---|
We consider a balanced combined application of the known LPGS- and LSGP-partitioning which we call co-partitioning.This approach allows a structural adjustment of the array design as well as a balancing of the size of the local memory and the IO-demand between the processing elements of the co-partitioned array.We determine the size of the LSGP-partitions such that there exists a sequential scheduling within the LSGP-partitions which is free of wait states. We give the proof for the existence of such a scheduling,and we give explicit formulas for the lower and upper bounds of the loops of a for-loop program which represents one of the possible sequential schedulings. |
Year | DOI | Venue |
|---|---|---|
1997 | 10.1109/ASAP.1997.606828 | ASAP |
Keywords | Field | DocType |
local memory,balanced combined application,explicit formula,array design,sequential scheduling,structural adjustment,possible sequential schedulings,for-loop program,co-partitioned array,co-partitioned array architectures,processing element,scheduling algorithm,upper bound,neural networks,difference equations | Existential quantification,Fair-share scheduling,Scheduling (computing),Computer science,Parallel computing,Real-time computing,Rate-monotonic scheduling,Processor scheduling,Round-robin scheduling,Distributed computing | Conference |
ISSN | ISBN | Citations |
1063-6862 | 0-8186-7958-1 | 3 |
PageRank | References | Authors |
0.55 | 9 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Uwe Eckhardt | 1 | 5 | 1.32 |
| Renate Merker | 2 | 159 | 20.59 |