版权所有:内蒙古大学图书馆 技术提供:维普资讯• 智图
内蒙古自治区呼和浩特市赛罕区大学西街235号 邮编: 010021
作者机构:CNRSINST NATL POLYTECH GRENOBLELAB TIM3F-38402 ST MARTIN DHERESFRANCE FAC SCI YAOUNDEDEPT MATHSERV INFORMATYAOUNDECAMEROON
出 版 物:《MATHEMATICAL SOCIAL SCIENCES》 (数学社会科学)
年 卷 期:1987年第14卷第1期
页 面:39-49页
核心收录:
学科分类:0201[经济学-理论经济学] 07[理学] 0701[理学-数学] 070101[理学-基础数学]
主 题:Performance pipeline array automata network buffer periodic cycle-time permutation minimum-delay maximum-delay
摘 要: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.