TY - JOUR
T1 - Performance of a pipeline array of automata with periodic cycle-time
AU - Goles, E.
AU - Sakho, I.
AU - Tchuente, M.
PY - 1987/8
Y1 - 1987/8
N2 - We consider a pipeline array of processors where local communications are based on a producer-consumer mechanism. It is assumed that any processor contains a buffer of size one, and that the cycle-time of any processor is a periodic sequence of period s(j),s(j + 1),...,s(n),...,s(j - 1), where s is a fixed permutation of 1,2,...,n, and j may vary from one processor to another. We give upper and lower bounds for the performance of the system.
AB - We consider a pipeline array of processors where local communications are based on a producer-consumer mechanism. It is assumed that any processor contains a buffer of size one, and that the cycle-time of any processor is a periodic sequence of period s(j),s(j + 1),...,s(n),...,s(j - 1), where s is a fixed permutation of 1,2,...,n, and j may vary from one processor to another. We give upper and lower bounds for the performance of the system.
KW - Performance
KW - automata network
KW - buffer
KW - maximum-delay
KW - minimum-delay
KW - periodic cycle-time
KW - permutation
KW - pipeline array
UR - http://www.scopus.com/inward/record.url?scp=45949122422&partnerID=8YFLogxK
U2 - 10.1016/0165-4896(87)90013-8
DO - 10.1016/0165-4896(87)90013-8
M3 - Article
AN - SCOPUS:45949122422
SN - 0165-4896
VL - 14
SP - 39
EP - 49
JO - Mathematical Social Sciences
JF - Mathematical Social Sciences
IS - 1
ER -