会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 5. 发明授权
    • System and method for avoiding deadlock
    • 避免死锁的系统和方法
    • US07203775B2
    • 2007-04-10
    • US10337833
    • 2003-01-07
    • Stephen R. Van DorenGregory E. Tierney
    • Stephen R. Van DorenGregory E. Tierney
    • G06F3/00
    • G06F9/524
    • A system and method avoids deadlock, such as circular routing deadlock, in a computer system by providing a virtual buffer at main memory. The computer system has an interconnection network that couples a plurality of processors having access to main memory. The interconnection network includes one or more routing agents each having at least one buffer for storing packets that are to be forwarded. When the routing agent's buffer becomes full, thereby preventing it from accepting any additional packets, the routing agent transfers at least one packet into the virtual buffer. By transferring a packet out of the buffer, the routing agent frees up space allowing it to accept a new packet. If the newly accepted packet also results in the buffer becoming full, another packet is transferred into the virtual buffer. This process is repeated until the deadlock condition is resolved. Packets are then retrieved from the virtual buffer.
    • 系统和方法通过在主存储器中提供虚拟缓冲区来避免计算机系统中的死循环,例如循环路由死锁。 计算机系统具有将具有访问主存储器的多个处理器耦合的互连网络。 互连网络包括一个或多个路由代理,每个路由代理具有至少一个用于存储要转发的分组的缓冲器。 当路由代理的缓冲区变满时,路由代理将至少一个数据包传输到虚拟缓冲区中。 通过将数据包从缓冲区传送出去,路由代理释放了允许它接受新数据包的空间。 如果新接受的分组也导致缓冲区变满,则另一分组被传送到虚拟缓冲器中。 重复该过程,直到死锁状态得到解决。 然后从虚拟缓冲区中检索数据包。
    • 9. 发明授权
    • Channel-based late race resolution mechanism for a computer system
    • 基于通道的晚期种族解决机制的计算机系统
    • US07000080B2
    • 2006-02-14
    • US10263836
    • 2002-10-03
    • Stephen R. Van DorenGregory E. Tierney
    • Stephen R. Van DorenGregory E. Tierney
    • G06F12/00
    • G06F12/0828G06F12/0813G06F12/082
    • A channel-based mechanism resolves race conditions in a computer system between a first processor writing modified data back to memory and a second processor trying to obtain a copy of the modified data. In addition to a Q0 channel for carrying requests for data, a Q1 channel for carrying probes in response to Q0 requests, and a Q2 channel for carrying responses to Q0 requests, a new channel, the QWB channel, which has a higher priority than Q1 but lower than Q2, is also defined. When a forwarded Read command from the second processor results in a miss at the first processor's cache, because the requested memory block was written back to memory, a Loop command is issued to memory by the first processor on the QWB virtual channel. In response to the Loop command, memory sends the written back version of the memory block to the second processor.
    • 基于频道的机制解决计算机系统中的第一处理器将修改后的数据写回存储器和尝试获得修改的数据的副本的第二处理器之间的竞争条件。 除了用于携带对数据的请求的Q 0信道之外,还具有用于响应于Q 0请求携带探针的Q 1信道和用于对Q 0请求进行响应的Q 2信道,具有 优先于Q 1但低于Q 2的优先级也被定义。 当来自第二处理器的转发的Read命令导致第一处理器的高速缓存中的未命中时,由于所请求的存储器块被写回存储器,所以QWB虚拟通道上的第一处理器向存储器发出一个循环命令。 响应于循环命令,存储器将存储器块的写回版本发送到第二处理器。