中科微点-全球专利检索

  1. Login
  2. Sign Up

Search Results

9 records (took 0.032 seconds)

    Fault tolerant communication in a distributed system
    5.
    发明授权
    Fault tolerant communication in a distributed system 有权

    公开(公告)号：US10542127B2

    公开(公告)日：2020-01-21

    申请号：US15696874

    申请日：2017-09-06

    Applicant: SAP SE

    Inventor： Jan Stengler ,  Jonathan Dees ,  Martin Weidner

    IPC: H04L12/26 ,  H04L29/14 ,  H04L12/24 ,  H04L29/06 ,  H04L12/703

    Abstract: Disclosed herein are system, method, and computer program product embodiments for fault tolerant communications in a distributed system. An embodiment operates by determining a failure of a first node of a cluster of a plurality of nodes. Prior to the failure, a second node transmitted a first message to the first node. The second node determines content corresponding to the first message. A third node to which to provide the content of the first sub-task is identified. A second message, including content corresponding to the first message, is transmit to the third node.

    Fault Tolerant Communication in a Distributed System
    6.
    发明申请
    Fault Tolerant Communication in a Distributed System 审中-公开

    公开(公告)号：US20190075194A1

    公开(公告)日：2019-03-07

    申请号：US15696874

    申请日：2017-09-06

    Applicant: SAP SE

    Inventor： Jan Stengler ,  Jonathan Dees ,  Martin Weidner

    IPC: H04L29/14 ,  H04L12/24

    CPC classification number: H04L69/40 ,  H04L41/0654 ,  H04L45/28 ,  H04L67/10 ,  H04L69/14

    Abstract: Disclosed herein are system, method, and computer program product embodiments for fault tolerant communications in a distributed system. An embodiment operates by determining a failure of a first node of a cluster of a plurality of nodes. Prior to the failure, a second node transmitted a first message to the first node. The second node determines content corresponding to the first message. A third node to which to provide the content of the first sub-task is identified. A second message, including content corresponding to the first message, is transmit to the third node.

    Cache-Efficient Fragmentation of Data Structures
    7.
    发明申请
    Cache-Efficient Fragmentation of Data Structures 审中-公开

    公开(公告)号：US20180074970A1

    公开(公告)日：2018-03-15

    申请号：US15261859

    申请日：2016-09-09

    Applicant: SAP SE

    Inventor： Francis Gropengiesser ,  Jan-Markus Schwindt ,  Martin Weidner ,  Robert Schneider

    IPC: G06F12/1009 ,  G06F12/0804

    CPC classification number: G06F12/1009 ,  G06F12/0804 ,  G06F12/0868 ,  G06F2212/60

    Abstract: Some embodiments provide a non-transitory machine-readable medium that stores a program. The program receives a request for a logical data structure. In response to the request, the program further identifies a size of a cache memory of the at least one processing unit. The program also determines a size of fragments of memory for the logical data structure based on the size of the cache memory. The program further requests a set of segments of memory. Upon receiving the set of segments of memory, the program also generates a plurality of fragments of memory from the set of segments of memory based on the size of fragments of memory. The program further groups the plurality of fragments of memory into the logical data structure. The plurality of fragments of memory are configured to store data of the logical data structure.

Patent Agency Ranking