会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 1. 发明公开
    • Programmable skew-tolerant array processor architecture
    • Feldrechner-Architektur的Programmierbareschrägverzerrungstolerante。
    • EP0295409A2
    • 1988-12-21
    • EP88107075.9
    • 1988-05-03
    • International Business Machines Corporation
    • Hsu, YarsunLi, Hungwen
    • G06F15/06G06F13/42
    • G06F15/8023G06F1/04G06F1/08G06F1/10
    • Using a variable-duration clock, together with programmable duration definition means to alter the clock waveform (8) within strict rules, permits the programmer to arrange appropriately short durations for short data transfers, and to arrange appropriately longer durations for longer data transfers in an array processor of myriad processing elements. There is no need to allow sufficient time in every clock cycle for worst case data transfer between remote processing elements (3).
      The clock waveform has three recognizable edges (A,B,C) regardless of loss of sharpness during its travel to the various processing elements. The convention that three skew-sensitive activities, READ, WRITE and OPERAND SUPPLY conform to respectively assigned edges as follows:
      A = READ;
      B = OPERAND SUPPLY;
      C = WRITE (Read next)
      The processing elements synchronize with the clock waveform, which is optimized for the instructions of the program being executed. There is no time wasted allowing for worst case data transfers possible in certain instructions but not possible in other instructions.
    • 使用可变持续时间时钟以及可编程持续时间定义装置在严格规则内改变时钟波形(8),允许编程人员为短时间数据传输安排适当的短持续时间,并为更长时间的数据传输安排适当更长的持续时间 数组处理器的无数处理元素。 在每个时钟周期内,不需要足够的时间来处理远程处理元件(3)之间的最差情况数据传输。 时钟波形具有三个可识别的边缘(A,B,C),而不管其行进到各种处理元件时是否有锐度损失。 三种偏移敏感活动(READ,WRITE和OPERAND SUPPLY)分别符合分配边的惯例如下:A = READ; B =操作供应 C = WRITE(读下一个)处理元件与时钟波形同步,该时钟波形针对正在执行的程序的指令进行了优化。 没有时间浪费,允许在某些指令中可能发生最坏情况的数据传输,但在其他指令中不可行。
    • 3. 发明公开
    • Single-fifo high speed combining switch
    • 单FIFO高速组合开关
    • EP0379709A3
    • 1992-04-08
    • EP89123610.1
    • 1989-12-21
    • International Business Machines Corporation
    • Hsu, Yarsun
    • G06F7/22G06F5/06G06F13/16
    • G06F7/22G06F5/06G06F13/1631
    • A combining switch 10 includes a two input multiplexer 12 which receives I and J inputs from data processors and directs one of the incoming messages, if there are no contentions or congestions at a switch output port 14 and a Queue FIFO 16 is empty, directly to the output port 14 for transmission to one of a plurality of memory modules. If the output port 14 is busy and the Queue 16 is empty the incoming message is routed to the Queue FIFO 16 for storage. If the Queue FIFO 16 is not empty the incoming message is first compared by a comparator 20 to all existing messages stored in the Queue FIFO 16 to determine if the incoming message is destined for a memory address which already has a queued message. If no match is determined by comparator 20 the incoming message is routed to the Queue FIFO 16 for storage. If comparator 20 determines that the memory address and operation type of the incoming message matches that of a message already stored in the Queue FIFO 16 both the incoming message and the queued message are applied to a message combining ALU 26. The ALU 26 generates a combined message which is stored at the same Queue 16 location as the queued message which generated a comparison match with the incoming message.
    • 10. 发明公开
    • Single-fifo high speed combining switch
    • Hochgeschwindigkeits-Kombinierschalter mit Einzelfifo。
    • EP0379709A2
    • 1990-08-01
    • EP89123610.1
    • 1989-12-21
    • International Business Machines Corporation
    • Hsu, Yarsun
    • G06F7/22G06F5/06G06F13/16
    • G06F7/22G06F5/06G06F13/1631
    • A combining switch 10 includes a two input multiplexer 12 which receives I and J inputs from data processors and directs one of the incoming messages, if there are no contentions or congestions at a switch output port 14 and a Queue FIFO 16 is empty, directly to the output port 14 for transmission to one of a plurality of memory modules. If the output port 14 is busy and the Queue 16 is empty the incoming message is routed to the Queue FIFO 16 for storage. If the Queue FIFO 16 is not empty the incoming message is first compared by a comparator 20 to all existing messages stored in the Queue FIFO 16 to determine if the incoming message is destined for a memory address which already has a queued message. If no match is determined by comparator 20 the incoming message is routed to the Queue FIFO 16 for storage. If comparator 20 determines that the memory address and operation type of the incoming message matches that of a message already stored in the Queue FIFO 16 both the incoming message and the queued message are applied to a message combining ALU 26. The ALU 26 generates a combined message which is stored at the same Queue 16 location as the queued message which generated a comparison match with the incoming message.
    • 组合开关10包括两个输入多路复用器12,其从数据处理器接收I和J个输入并引导输入消息中的一个,如果在交换机输出端口14和队列FIFO 16为空时没有争用或拥塞,直接到 输出端口14,用于传输到多个存储器模块之一。 如果输出端口14正忙,并且队列16为空,则传入的消息被路由到队列FIFO 16用于存储。 如果队列FIFO 16不是空的,则输入消息首先由比较器20与存储在队列FIFO 16中的所有现有消息进行比较,以确定输入消息是否发往具有排队消息的存储器地址。 如果由比较器20确定不匹配,则输入消息被路由到队列FIFO 16用于存储。 如果比较器20确定输入消息的存储器地址和操作类型与已经存储在队列FIFO 16中的消息的存储器地址和操作类型相匹配,则进入消息和排队消息都被应用于组合ALU26的消息。ALU 26产生组合 消息被存储在与排队的消息相同的队列16位置处,其产生与传入消息的比较匹配。