会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 4. 发明授权
    • Method for data delivery in a network
    • 网络中数据传送的方法
    • US08997115B2
    • 2015-03-31
    • US12192622
    • 2008-08-15
    • Daniel N. BauerLuis Garces-EriceJohn G. RooneyPaolo Scotton
    • Daniel N. BauerLuis Garces-EriceJohn G. RooneyPaolo Scotton
    • G06F13/00G01R31/08G06F9/54
    • H04L49/9063G06F9/544G06F9/545H04L69/08
    • A method for transmitting data between a sender queue of a sender intermediate layer of a protocol stack and a receiver queue of a receiver intermediate layer of the protocol stack implemented with a sliding window protocol. The method includes receiving a data message or a collection of data messages from a sender messaging layer; tagging the data message or the collection of data messages with a unique identifier; writing the data message or the collection of data messages tagged with the unique identifier as a data window in the sender queue; transmitting a front data window of the sender queue to the receiver queue; receiving a single receipt-acknowledgement message after the receiver transport layer has received all of the front data window; and receiving a commit-acknowledgement message after the receiver messaging layer has read from the receiver intermediate layer all of the front data window.
    • 一种用于在协议栈的发送器中间层的发送器队列与用滑动窗口协议实现的协议栈的接收器中间层的接收器队列之间传送数据的方法。 该方法包括从发送者消息层接收数据消息或数据消息的集合; 使用唯一标识符标记数据消息或数据消息的集合; 将所述数据消息或者以所述唯一标识符标记的数据消息的集合写入所述发送者队列中的数据窗口; 将发送方队列的前端数据窗口发送到接收者队列; 在接收器传输层已经接收到所有前端数据窗口之后接收单个接收确认消息; 并且在接收器消息层从所有前端数据窗口的接收器中间层读取之后接收提交确认消息。
    • 5. 发明申请
    • METHOD FOR DATA DELIVERY IN A NETWORK
    • 网络中数据传送的方法
    • US20090064177A1
    • 2009-03-05
    • US12192622
    • 2008-08-15
    • Daniel N. BauerLuis Garces-EriceJohn G. RooneyPaolo Scotton
    • Daniel N. BauerLuis Garces-EriceJohn G. RooneyPaolo Scotton
    • G06F9/46
    • H04L49/9063G06F9/544G06F9/545H04L69/08
    • The present invention relates to a method of delivering data from a sender application to at least one receiver application that are arranged in a protocol stack comprising: underlying the sender application a sender messaging layer and a sender transport layer, and underlying the receiver application, a receiver messaging layer and a receiver transport layer, wherein the sender transport layer and the receiver transport layer are coupled by way of a network layer, the method comprising the steps of: incorporating a sender intermediate layer between the sender messaging layer and the sender transport layer and a receiver intermediate layer between the receiver messaging layer and the receiver transport layer; configuring the interface characteristics of the intermediate layers to be the same as for their corresponding transport layers; creating a sender queue in a non-volatile data storage component of the sender intermediate layer and a receiver queue in a non-volatile data storage component of the receiver intermediate layer, storing the data to be sent from the sender application to the receiver application in the sender queue, and transmitting the data stored in the sender queue to the receiver queue via the sender transport layer and the receiver transport layer.
    • 本发明涉及一种将数据从发送方应用程序传送到布置在协议栈中的至少一个接收方应用程序的方法,包括:在发送方应用程序下方,发送方消息层和发送方传输层,以及接收方应用程序的底层, 接收器消息层和接收机传输层,其中所述发送器传输层和所述接收机传输层通过网络层耦合,所述方法包括以下步骤:在所述发送者消息层和所述发送者传输层之间结合发送方中间层 以及接收机消息传送层和接收机传输层之间的接收机中间层; 将中间层的界面特性配置为与其相应的传输层相同; 在发送器中间层的非易失性数据存储部件中创建发送者队列,以及在接收器中间层的非易失性数据存储部件中接收队列,将要从发送方应用程序发送的数据存储到接收方应用程序 发送方队列,并通过发送方传输层和接收方传输层将存储在发送方队列中的数据发送到接收方队列。
    • 8. 发明申请
    • DISTRIBUTED SERVER ELECTION WITH IMPERFECT CLOCK SYNCHRONIZATION
    • 分布式服务器选择与不正确的时钟同步
    • US20100211696A1
    • 2010-08-19
    • US12372048
    • 2009-02-17
    • Daniel N. BauerLuis Garces-EriceUrs Hunkeler
    • Daniel N. BauerLuis Garces-EriceUrs Hunkeler
    • G06F15/173G06F1/08
    • H04L67/1095G06Q10/06H04L41/0886H04L63/10H04L67/1008
    • Embodiments of the invention provide a method, system, and computer program product for selecting a server as a selected server for performing a specified function in a distributed computing system. In one embodiment, the method comprises identifying a group of servers in the system; and choosing as the selected server the server that has been in the system the longest. In one embodiment, each of the servers in the group has a respective contention period, during which the server sends a contention message, and the selected server is chosen using these contention messages. The servers in the group may have imperfect clock synchronization. In this case, the contention periods of the servers is kept greater than the maximum difference between the server clocks. The invention may be used to select a name server, or to select a server for another service.
    • 本发明的实施例提供了一种用于选择服务器作为在分布式计算系统中执行指定功能的选定服务器的方法,系统和计算机程序产品。 在一个实施例中,该方法包括识别系统中的一组服务器; 并选择系统中最长的服务器作为所选服务器。 在一个实施例中,组中的每个服务器具有相应的竞争时段,服务器在此期间发送争用消息,并且使用这些争用消息选择所选择的服务器。 组中的服务器可能具有不完美的时钟同步。 在这种情况下,服务器的争用周期保持大于服务器时钟之间的最大差异。 本发明可以用于选择名称服务器,或者为另一服务选择服务器。
    • 9. 发明申请
    • PRACTICAL CONTENTION-FREE DISTRIBUTED WEIGHTED FAIR-SHARE SCHEDULER
    • 实用无限制分配加权公平分配器
    • US20100211954A1
    • 2010-08-19
    • US12372056
    • 2009-02-17
    • Daniel N. BauerKristijan DragicevicLuis Garces-Erice
    • Daniel N. BauerKristijan DragicevicLuis Garces-Erice
    • G06F9/46
    • G06F9/4881G06F2209/483
    • Embodiments of the invention provide a method, system and computer program product for scheduling tasks in a computer system. In an embodiment, the method comprises receiving a multitude of sets of tasks, and placing the tasks in one or more task queues. The tasks are taken from the one or more task queues and placed in a priority queue according to a first rule. The tasks in the priority queue are assigned to a multitude of working threads according to a second rule based, in part, on share values given to the tasks. In an embodiment, the tasks of each of the sets are placed in a respective one task queue; and all of the tasks in the priority queue from each of the task queues, are assigned as a group to one of the working threads.
    • 本发明的实施例提供了一种用于在计算机系统中调度任务的方法,系统和计算机程序产品。 在一个实施例中,该方法包括接收多组任务,并将任务放置在一个或多个任务队列中。 这些任务取自一个或多个任务队列,并根据第一个规则放置在优先级队列中。 优先级队列中的任务根据第二规则分配给多个工作线程,部分基于给定给任务的共享值。 在一个实施例中,每个集合的任务被放置在相应的一个任务队列中; 并且来自每个任务队列的优先级队列中的所有任务被分配为一个工作线程。
    • 10. 发明授权
    • Distributed server election with imperfect clock synchronization
    • 具有不完美时钟同步的分布式服务器选举
    • US09325789B2
    • 2016-04-26
    • US12372048
    • 2009-02-17
    • Daniel N. BauerLuis Garcés-EriceUrs Hunkeler
    • Daniel N. BauerLuis Garcés-EriceUrs Hunkeler
    • G06F15/16H04L29/08G06Q10/06H04L29/06H04L12/24
    • H04L67/1095G06Q10/06H04L41/0886H04L63/10H04L67/1008
    • Embodiments of the invention provide a method, system, and computer program product for selecting a server as a selected server for performing a specified function in a distributed computing system. In one embodiment, the method comprises identifying a group of servers in the system; and choosing as the selected server the server that has been in the system the longest. In one embodiment, each of the servers in the group has a respective contention period, during which the server sends a contention message, and the selected server is chosen using these contention messages. The servers in the group may have imperfect clock synchronization. In this case, the contention periods of the servers is kept greater than the maximum difference between the server clocks. The invention may be used to select a name server, or to select a server for another service.
    • 本发明的实施例提供了一种用于选择服务器作为在分布式计算系统中执行指定功能的选定服务器的方法,系统和计算机程序产品。 在一个实施例中,该方法包括识别系统中的一组服务器; 并选择系统中最长的服务器作为所选服务器。 在一个实施例中,组中的每个服务器具有相应的竞争时段,服务器在此期间发送争用消息,并且使用这些争用消息选择所选择的服务器。 组中的服务器可能具有不完美的时钟同步。 在这种情况下,服务器的争用周期保持大于服务器时钟之间的最大差异。 本发明可以用于选择名称服务器,或者为另一服务选择服务器。