首页> 外国专利> BIPARTITE GRAPHICAL CONNECTION SCHEDULING IN TIME AND SPACE SWITCH FABRICS

BIPARTITE GRAPHICAL CONNECTION SCHEDULING IN TIME AND SPACE SWITCH FABRICS

机译:时间和空间开关结构中的双手图形连接计划

摘要

A method of adding a new connection (c, d) to atime:space:time switch fabric. The fabric has a set I of k input ele-ments, a set M of m switch elements, and a set O of l output elements.Each input element contributes one input to each switch element, andeach output element receives one output from each switch element. Astate S m characterizes the switch elements as a set of ordered pairs (i,j),where (i,j)~ S m if and only if the j th output element is coupled to the i thinput element through one of the switch elements. The range of S m isthe set of outputs of S m such that if j ~ range(S m) then (i,j) ~ S m forsome i ~ I. The domain of S m is the set of inputs of S m such that if i ~domain(S m) then (i,j) ~ S m for some j ~ O. If a switch state S m existswhere c ~ domain(S m) and d ~ range(S m), then the new connection isadded to S m as (c,d). If no such state exists, and if no switch state S mexists wherein c ~ domain(S m), then the method terminates because c isfully allocated. If there is a switch state S m wherein c ~ domain(S m),and if no switch state S n exists wherein d ~ range(S n), then the methodterminates because d is fully allocated. If such a state S n exists, the twostates S m, S n are joined to form a union J with each element (i',j') in Jlabelled u if (i',j') ~ S m, and each element (i',j') in J labelled v if (i',j') ~ S n. The new connection is then added to J as (c, d). A label (u orv) is allocated to the new connection. If new connection's label has notpreviously been allocated to a connection (i', d) ~ J the method termi-nates. Otherwise, the opposite label (v or u) is reallocated to connection(i', d) ~ J. If such opposite label has not previously been allocated to aconnection (i',j') ~ J the method terminates. Otherwise, the originallyselected label (u or v) is reallocated to connection (i',j') ~ J and theprocess repeats until no label conflicts remain. The originally selectedlabel (u or v) is chosen to minimize the number of connections requiringreallocation of labels.
机译:将新连接(c,d)添加到a的方法时间:空间:时间交换结构。该结构的I输入为k个输入元素-一组M个开关元件和一组O个输出元件。每个输入元素为每个开关元素贡献一个输入,并且每个输出元件从每个开关元件接收一个输出。一种状态S m将开关元件表征为一组有序对(i,j),其中(i,j)〜S m当且仅当第j个输出元素耦合到第i个通过开关元件之一输入输入元件。 S m的范围是S m的输出集,如果j〜range(S m)则(i,j)〜S m为S m的域是S m的输入集,如果i〜域(S m),则对于某些j〜O为(i,j)〜S m。如果存在开关状态S m其中c〜domain(S m)和d〜range(S m),则新连接为作为(c,d)加到S m中。如果不存在这种状态,并且如果不存在开关状态S m存在其中c〜domain(S m),则该方法终止,因为c为完全分配。如果存在一个开关状态S m,其中c〜domain(S m),如果不存在开关状态S n,其中d〜range(S n),则该方法由于d已完全分配而终止。如果存在这样的状态S n,则两者状态S m,S n与J中的每个元素(i',j')联合形成联合J标记为u if(i',j')〜S m,J中的每个元素(i',j')标记为v if(i',j')〜S n。然后将新连接作为(c,d)添加到J。标签(u或v)分配给新连接。如果新连接的标签还没有先前已分配给连接(i',d)〜J的方法termi-人。否则,将相反的标签(v或u)重新分配给连接(i',d)〜J。如果以前没有将相反的标签分配给连接(i',j')〜J方法终止。否则,原来选定的标签(u或v)重新分配给连接(i',j')〜J并且重复该过程,直到没有标签冲突为止。最初选择选择标签(u或v)以最大程度地减少所需的连接数标签的重新分配。

著录项

相似文献

  • 专利
  • 外文文献
  • 中文文献
获取专利

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号