会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 1. 发明授权
    • Method and apparatus for grouping data for transfer according to recipient buffer size
    • 用于根据接收者缓冲区大小分组用于传送的数据的方法和装置
    • US06898638B2
    • 2005-05-24
    • US09758737
    • 2001-01-11
    • Giles Roger FrazierGregory Francis PfisterRenato John Recio
    • Giles Roger FrazierGregory Francis PfisterRenato John Recio
    • G06F13/00G06F15/16G06F15/17H04L12/28H04L12/56H04L13/08H04L29/08
    • H04L67/1097H04L47/266H04L47/30
    • A method, apparatus, and computer implemented instructions for transferring data. A request is sent by a requester to a responder. The request includes an amount of available processing space at the requestor. When the request is received from the responder, data is identified using the request. The data is placed into a plurality of subsequences of data packets for transfer to the requester, wherein each packet within the set of subsequences hold data in amount less than or equal to the amount of available space. These subsequences are then sent to the requestor one subsequence at a time. A new subsequence is sent each time the available processing space at the requester becomes free to process data from another subsequence. The requestor receives a subsequence from the plurality of subsequences in response to the request each time the amount of available processing space is free, wherein data within each of the set of subsequences fits within the amount of available processing space.
    • 一种用于传送数据的方法,装置和计算机实现的指令。 请求者向请求者发送请求。 该请求包括请求者可用的处理空间量。 当从响应者接收到请求时,使用该请求来识别数据。 将数据放入数据分组的多个子序列中,以传送到请求者,其中该子序列集合内的每个分组保持小于或等于可用空间量的数据。 然后,这些子序列一次发送到请求者一个子序列。 每当请求者的可用处理空间自由地处理来自另一子序列的数据时,新的子序列被发送。 每当可用处理空间的数量是空闲时,请求者响应于该请求从多个子序列中接收子序列,其中每组子序列中的数据适合可用处理空间的量。
    • 2. 发明授权
    • Systems and arrangements to adjust resource accessibility based upon usage modes
    • 基于使用模式调整资源可访问性的系统和安排
    • US07657945B2
    • 2010-02-02
    • US11070053
    • 2005-03-02
    • Thomas M. BreyGiles Roger FrazierGregory Francis PfisterWilliam J. Rooney
    • Thomas M. BreyGiles Roger FrazierGregory Francis PfisterWilliam J. Rooney
    • G06F7/04H04L9/32
    • H04L63/06H04L9/083H04L63/105
    • Systems and arrangements to adjust resource accessibility based upon usage modes are contemplated. Embodiments may include a supervisor instance such as an operating system that is adapted to select one or more supervisor keys from a set of supervisor keys available to the host node or platform upon which the supervisor instance is operating. The supervisor instance may select the supervisor key(s) based upon an association of the supervisor instance with a usage mode represented by a supervisor key name. In many embodiments, supervisor key names may be associated with resources via with one or more of the supervisor keys based upon the resources needed when operating in the usage modes by a system administrator. Once the supervisor instance is initialized, the supervisor instance may issue client keys that allow access to subsets of the resources available to the supervisor instance based upon usage modes of the clients.
    • 考虑了基于使用模式来调整资源可访问性的系统和布置。 实施例可以包括诸如操作系统的管理程序实例,该操作系统适于从主管节点或平台上可用的一组管理程序密钥选择一个或多个管理程序密钥,主管节点或平台正在其上运行。 主管实例可以基于主管实例与由主管密钥名称表示的使用模式的关联来选择主管密钥。 在许多实施例中,基于由系统管理员在使用模式下操作时所需的资源,管理员密钥名称可以通过一个或多个管理员密钥与资源相关联。 一旦管理程序实例被初始化,管理程序实例可以发布客户端密钥,其允许基于客户端的使用模式来访问可用于管理程序实例的资源的子集。
    • 3. 发明授权
    • Method and apparatus for reliably choosing a master network manager during initialization of a network computing system
    • 在网络计算系统的初始化期间可靠地选择主网络管理器的方法和装置
    • US06941350B1
    • 2005-09-06
    • US09692346
    • 2000-10-19
    • Giles Roger FrazierGregory Francis PfisterSteven Mark ThurberDono Van-Mierop
    • Giles Roger FrazierGregory Francis PfisterSteven Mark ThurberDono Van-Mierop
    • G06F15/16G06F15/173
    • G06F15/17375H04L63/061
    • A method in a node within network computing system for selecting a master network manager, wherein the first node is associated with a first priority. Requests are sent to the network computing system to discover other nodes within the network computing system. A second priority from the request is identified in response to receiving a response to one of the requests from another node within the network computing system. The first node shifts to a standby mode if it discovers a master subnet manager or the second priority is higher than the first priority. The first node shifts to a master mode if a response containing a priority higher than the first priority is absent in responses received by the first node and the first node has completed checking all other nodes in the network computing system. In the case where the priority received is equal, the comparison is further made on the globally unique identifier which is received from the same node, in which case the node with the lowest globally unique identifier wins the arbitration.
    • 网络计算系统内用于选择主网络管理器的节点中的方法,其中所述第一节点与第一优先级相关联。 将请求发送到网络计算系统以发现网络计算系统内的其他节点。 响应于响应于来自网络计算系统内的另一个节点的一个请求的响应来识别来自请求的第二优先级。 如果发现主子网管理器或第二优先级高于第一优先级,则第一节点转移到待机模式。 如果在由第一节点接收的响应中缺少包含高于第一优先级的优先级的响应,则第一节点转移到主模式,并且第一节点已经完成了对网络计算系统中的所有其他节点的检查。 在接收到的优先级相等的情况下,进一步对从同一节点接收到的全局唯一标识符进行比较,在这种情况下,具有最低全局唯一标识符的节点赢得仲裁。
    • 5. 发明授权
    • System and method for simultaneously establishing multiple connections
    • 同时建立多个连接的系统和方法
    • US07165110B2
    • 2007-01-16
    • US09903725
    • 2001-07-12
    • Danny Marvin NealGregory Francis PfisterRenato John Recio
    • Danny Marvin NealGregory Francis PfisterRenato John Recio
    • G06F15/16G06F11/30G06F12/14H04L9/32H04L9/00
    • H04L29/06H04L69/14H04L69/22Y02D50/30
    • A system and method for establishing multiple connections using a private data field of a communication management protocol is provided. With the present invention, a Service ID identifies a specific consumer and the private data field contains a list of connection attributes for each connection that is to be established. An active side requests a connection and the passive side replies to the connection request. The active side sends the passive side a connection establishment request. This connection establishment request includes a Service ID which identifies a passive side process associated with a service. This connection establishment request also includes communication attributes of one or more connected services and datagram services associated with the Service ID. The passive passes the connection request to a process associated with the service. If the passive side process does not wish to carry out the service, a negative reply message is returned to the active side. If the passive side process does wish to carry out the service, a positive reply is returned to the active side and the reply includes the communication attributes for the connection and unreliable services associated with the Service ID used in the connection establishment request.
    • 提供了一种使用通信管理协议的私有数据字段建立多个连接的系统和方法。 利用本发明,服务ID标识特定消费者,并且专用数据字段包含要建立的每个连接的连接属性的列表。 主动端请求连接,被动方回复连接请求。 主动端将被动方发送连接建立请求。 该连接建立请求包括识别与服务相关联的被动侧进程的服务ID。 该连接建立请求还包括与服务ID相关联的一个或多个连接的服务和数据报服务的通信属性。 被动将连接请求传递给与服务关联的进程。 如果被动侧进程不希望执行该服务,则将一个否定的回复消息返回到主动端。 如果被动侧进程确实希望执行该服务,则肯定的答复返回到主动侧,并且回复包括用于连接的通信属性和与在连接建立请求中使用的服务ID相关联的不可靠服务。
    • 7. 发明授权
    • 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.
    • 提供了一种用于分布式系统间锁优化的装置和方法。 利用本发明的装置和方法,获得无争议锁所需的时间意味着分布式系统中没有其他程序或进程同时尝试获取的锁定被最小化。 本发明的装置和方法通过将获得锁的处理分成两个单独的操作来增加锁获取的速度:竞争测试,然后如果存在争用,则提供完全锁定操作。 通过将每个锁与存储器位置相关联,并且使用原子操作等来将与锁相关联的存储器位置原子地设置为不同的值来快速进行争用测试。 如果锁被发现有争议,意味着另一个程序或进程已经锁定它,则将控制权转换为较慢的操作,而不是确保最终将锁授权程序或进程锁定。