会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 12. 发明授权
    • System area network of end-to-end context via reliable datagram domains
    • 通过可靠的数据报域,端到端上下文的系统区域网络
    • US06990528B1
    • 2006-01-24
    • US09692354
    • 2000-10-19
    • Danny Marvin NealRenato John RecioSteven Mark Thurber
    • Danny Marvin NealRenato John RecioSteven Mark Thurber
    • G06F15/16
    • G06F3/0659G06F3/0605G06F3/067
    • A method for associating reliable datagram queue pairs with an underlying end-to-end context of a channel adapter is provided. The method comprises storing a reliable datagram domain (RDD) within the context of a reliable datagram queue pair (RD QP). The same RDD is stored within an end-to-end context (EEC). A partitioning key (P—key) is also stored within the EEC. The RDD cannot be accessed by consumer processes. In the case of incoming messages, the P—keys of the incoming data packet and EEC are compared. If P—keys match, then the RDD's of the RD QP and EEC are compared. If the RDD's match, the packet is processed normally. In the case of outgoing messages, the RDD's of the RD QP and EEC are first compared, and if they match, the P—Key of the EEC is inserted into the transport header of the data packet.
    • 提供了一种用于将可靠数据报队列对与信道适配器的底层端到端上下文相关联的方法。 该方法包括在可靠数据报队列对(RD QP)的上下文中存储可靠数据报域(RDD)。 相同的RDD存储在端到端上下文(EEC)中。 分区键(P - 键)也存储在EEC中。 消费者进程无法访问RDD。 在传入消息的情况下,比较输入数据包和EEC的P - 键。 如果P - 键匹配,则比较RD QP和EEC的RDD。 如果RDD匹配,则该分组被正常处理。 在传出消息的情况下,首先比较RD QP和EEC的RDD,如果匹配,则将EEC的密钥插入到数据包的传输报头中。
    • 13. 发明授权
    • Apparatus and method for intersystem lock optimization
    • 用于系统间锁优化的装置和方法
    • US06950945B2
    • 2005-09-27
    • US09886187
    • 2001-06-21
    • Gregory Francis PfisterRenato John RecioNoshir Cavas Wadia
    • Gregory Francis PfisterRenato John RecioNoshir Cavas Wadia
    • G06F9/46H04L29/06H04L29/08G06F11/30G06F12/14H04L9/00H04L9/32
    • G06F9/526H04L29/06H04L67/12
    • An apparatus and method for distributed intersystem lock optimization are provided. With the apparatus and method of the present invention, the time required to obtain an uncontested lock, meaning a lock that no other program or process in the distributed system is simultaneously attempting to acquire, is minimized. The apparatus and method of the present invention increases the speed with which locks are acquired by splitting the process of obtaining a lock into two separate operations: a test for contention, and then if contention exists, a full lock operation. The test for contention is made fast by associating each lock with a memory location, and using an atomic operation or the like, to atomically set the memory location associated with the lock to a different value. If the lock is found to be contested, meaning that another program or process has already locked it, control is turned over to a slower operation than ensures that the lock-requesting program or process will eventually be granted the lock.
    • 提供了一种用于分布式系统间锁优化的装置和方法。 利用本发明的装置和方法,获得无争议锁所需的时间意味着分布式系统中没有其他程序或进程同时尝试获取的锁定被最小化。 本发明的装置和方法通过将获得锁的处理分成两个单独的操作来增加锁获取的速度:竞争测试,然后如果存在争用,则提供完全锁定操作。 通过将每个锁与存储器位置相关联,并且使用原子操作等来将与锁相关联的存储器位置原子地设置为不同的值来快速进行争用测试。 如果锁被发现有争议,意味着另一个程序或进程已经锁定它,则将控制权转换为较慢的操作,而不是确保最终将锁授权程序或进程锁定。
    • 17. 发明授权
    • Method and apparatus for managing data in a distributed buffer system
    • 用于在分布式缓冲系统中管理数据的方法和装置
    • US06832297B2
    • 2004-12-14
    • US09925595
    • 2001-08-09
    • Gregory Francis PfisterRenato John RecioNoshir Cavas Wadia
    • Gregory Francis PfisterRenato John RecioNoshir Cavas Wadia
    • G06F1300
    • G06F12/0817G06F12/0866
    • A method, apparatus, and computer implemented instructions for managing a plurality of caches of data, wherein the data processing system includes a plurality of independent computers. In response to initiating a read operation to read data on a data block, an indication is posted on a directory of data blocks identifying the computer that now holds a copy of that block and a location in the memory of that computer where a flag associated with that block is held. Then in response to initiating a write operation on that data block, messages are sent to all the computers holding that block which resets the said flag, thus informing each computer that the data in that block is no longer valid. These messages are sent using means that perform that flag reset without, in the preferred embodiment, any overhead of interruption of processing on the computers where the flags reside.
    • 一种用于管理多个数据高速缓存的方法,装置和计算机实现的指令,其中所述数据处理系统包括多个独立的计算机。 响应于开始读取操作以读取数据块上的数据,将指示张贴在识别现在保存该块的副本的计算机的数据块的目录上,以及与该计算机的存储器中的相关联的位置 那个街区是举行的。 然后响应于对该数据块发起写入操作,将消息发送到保存该块的所有计算机,该计算机复位所述标志,从而通知每个计算机该块中的数据不再有效。 这些消息是使用执行该标志复位的装置发送的,而在优选实施例中,这些消息在标志驻留在计算机上的处理中断的任何开销。
    • 18. 发明授权
    • Infiniband work and completion queue management via head and tail circular buffers with indirect work queue entries
    • Infiniband通过头尾循环缓冲区进行工作和完成队列管理,间接工作队列条目
    • US06789143B2
    • 2004-09-07
    • US09961922
    • 2001-09-24
    • David F. CraddockThomas Anthony GreggIan David JuddGregory Francis PfisterRenato John RecioDonald William Schmidt
    • David F. CraddockThomas Anthony GreggIan David JuddGregory Francis PfisterRenato John RecioDonald William Schmidt
    • G06F1300
    • G06F9/546
    • A distributed computing system having (host and I/O) end nodes, switches, routers, and links interconnecting these components is provided. The end nodes use send and receive queue pairs to transmit and receive messages. The end nodes use completion queues to inform the end user when a message has been completely sent or received and whether an error occurred during the message transmission or reception process. A mechanism implements these queue pairs and completion queues in hardware. A mechanism for controlling the transfer of work requests from the consumer to the CA hardware and work completions from the CA hardware to the consumer using head and tail pointers that reference circular buffers is also provided. The QPs and CQs do not contain Work Queue Entries and Completion Queue Entries respectively, but instead contain references to these entries. This allows them to be efficient and constant in size, while the Work Queue Entries and Completion Queue Entries themselves can vary in size, for example to include a variable number of data segments. Additionally, several mechanisms are provided to improve the overall efficiency of this process under different memory configurations.
    • 提供了具有(主机和I / O)端节点,交换机,路由器和互连这些组件的链路的分布式计算系统。 终端节点使用发送和接收队列对来发送和接收消息。 终端节点使用完成队列通知终端用户何时完全发送或接收了消息,以及在消息发送或接收过程中是否发生错误。 机制在硬件中实现这些队列对和完成队列。 还提供了一种机制,用于控制从消费者到CA硬件的工作请求的传送以及使用引用循环缓冲区的头和尾指针从CA硬件到消费者的完成。 QP和CQ不分别包含工作队列条目和完成队列条目,而是包含对这些条目的引用。 这允许它们在高度和大小上是恒定的,而工作队列条目和完成队列条目本身可以在大小上变化,例如包括可变数量的数据段。 另外,提供了几种机制以在不同的存储器配置下提高该过程的整体效率。