loading...
Scheduling in Co-Partitioned Array Architectures
Zurich, SWITZERLAND July 14-July 16
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ASAP.1997.6068281997 IEEE International Conference on ...
 This Article 
 
Buy PURCHASE ARTICLE: $19
PDF
HTML
Buy IEEE Xplore Subscribers
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
ASCII Text
x 
 
Uwe Eckhardt, Renate Merker, "Scheduling in Co-Partitioned Array Architectures," Application-Specific Systems, Architectures and Processors, IEEE International Conference on, pp. 219, 1997 IEEE International Conference on Application-Specific Systems, Architectures and Processors (ASAP'97), 1997.
 
 
BibTex
x
 
@article{ 10.1109/ASAP.1997.606828,
author = {Uwe Eckhardt and Renate Merker},
title = {Scheduling in Co-Partitioned Array Architectures},
journal ={Application-Specific Systems, Architectures and Processors, IEEE International Conference on},
volume = {0},
year = {1997},
issn = {1063-6862},
pages = {219},
doi = {http://doi.ieeecomputersociety.org/10.1109/ASAP.1997.606828},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Application-Specific Systems, Architectures and Processors, IEEE International Conference on
TI - Scheduling in Co-Partitioned Array Architectures
SN - 1063-6862
SP
EP
A1 - Uwe Eckhardt,
A1 - Renate Merker,
PY - 1997
VL - 0
JA - Application-Specific Systems, Architectures and Processors, IEEE International Conference on
ER -
 
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.
Citation:
Uwe Eckhardt, Renate Merker, "Scheduling in Co-Partitioned Array Architectures," asap, pp.219, 1997 IEEE International Conference on Application-Specific Systems, Architectures and Processors (ASAP'97), 1997
Usage of this product signifies your acceptance of the Terms of Use.