-
公开(公告)号：US11861415B1
公开(公告)日：2024-01-02
申请号：US17875690
申请日：2022-07-28
Applicant: SAP SE
Inventor： Peng Ni
IPC: G06F9/50
CPC classification number: G06F9/5083 , G06F9/505 , G06F9/5072 , G06F2209/505
Abstract: Methods, systems, and computer-readable storage media for receiving, by a service mesh provisioned within a container orchestration system, a request from a client, determining, by the service mesh, a load balancing strategy that is to be applied for routing of the request within the heterogeneous cluster, and transmitting, by the service mesh, the request to a service within the heterogenous cluster, the service routing the request to a node for processing based on the load balancing strategy.
-
公开(公告)号：US10360263B2
公开(公告)日：2019-07-23
申请号：US15658674
申请日：2017-07-25
Applicant: SAP SE
IPC: G06F11/36 , G06F16/901 , G06F16/21 , G06F16/18 , G06Q10/06
Abstract: Methods, systems, and computer-readable storage media for receiving data representative of the temporal graph, the data representing vertices, edges between vertices, and temporal features, determining a set of earliest-arrival dependencies, each earliest arrival dependency including an earliest feasible edge between vertices from a list of edges of the temporal graph, providing data representative of an edge-scan-dependency graph (ESD-graph) based on the data representative of the temporal graph, and the set of earliest-arrival dependencies, the ESD-graph including vertices representing edges of the temporal graph, and edges representing earliest-arrival dependencies between vertices, providing data representative of a level-assigned ESD-graph including a level assigned to each vertex of the ESD-graph, and determining earliest-arrival times between a source vertex, and each vertex of the temporal graph by executing a parallel edge scan of the level-assigned ESD-graph.
-
Patent Agency Ranking
公开(公告)号：US12210909B2
公开(公告)日：2025-01-28
申请号：US17488422
申请日：2021-09-29
Applicant: SAP SE
Inventor： Peng Ni
Abstract: Methods, systems, and computer-readable storage media for executing, within the container orchestration system, the application using one or more resource units, each resource unit including an application container and an ancillary container, the ancillary container executing a set of GPU metric exporters, receiving, from the application and for each resource unit, a GPU metric including a GPU utilization associated with a respective resource unit, determining, for each resource unit, a custom GPU metric based on a respective GPU metric, the custom GPU metric aggregating values of the respective GPU metric over a time period, determining, by an autoscaler, an average GPU metric based on one or more custom GPU metrics, and selectively scaling, by the autoscaler, the application within the container orchestration system based on the average GPU metric by adjusting a number of resource units executing the application.
-
公开(公告)号：US09778051B2
公开(公告)日：2017-10-03
申请号：US14840069
申请日：2015-08-31
Applicant: SAP SE
Inventor： Hoang Tam Vo , Peng Ni , Chengbin Yan
CPC classification number: G01C21/3423 , G01C21/3446 , G01C21/3453 , G01C21/3676 , G06Q10/047
Abstract: A route planner for a transportation network is disclosed. The route planner generates k suggested routes based on a user query using a diversified k shortest routes technique. The diversified k shortest routes techniques analyzes a transportation graph and suggests k routes to the user. The diversified k shortest routes can provide a user with options to take the next best route if they miss the optimal one. These options also include other preferences, such as less number of transfers, as long as they are reasonable in terms of total travel time. The suggested routes take into account travel calendars, as well as location-to-location queries which require geocoding and reverse geocoding capabilities. Transfers between different types of transportation services such as train and bus are also supported.
-
公开(公告)号：US09726502B2
公开(公告)日：2017-08-08
申请号：US14840064
申请日：2015-08-31
Applicant: SAP SE
Inventor： Peng Ni , Hoang Tam Vo , Daniel Hermann Richard Dahlmeier , Wentong Cai
CPC classification number: G01C21/20 , G01C21/3446 , G01C21/3453 , G06Q10/04 , G08G1/0125
Abstract: A computer-implemented technology for planning routes is described herein. In accordance with one aspect, travel data of commuters of a transportation network are provided. Continuous distributions of travel time and waiting time are generated from the travel data. The continuous distributions of travel time and waiting time are associated to a transportation graph of the transportation network. The transportation graph includes nodes corresponding to stops of the transportation network and edges interconnecting the nodes. Travel time and waiting time are associated as costs of the edges in the transportation graph. In response to receiving input parameters, expected costs of candidate routes in the transportation graph are determined in accordance with a modified multi criteria shortest path technique. The modified multi criteria shortest path technique invokes a subroutine to retrieve accurate costs of routes based at least on the costs of the edges in the transportation graph. Route recommendations are provided based on the expected costs of the candidate routes.
-
公开(公告)号：US20210034673A1
公开(公告)日：2021-02-04
申请号：US16529952
申请日：2019-08-02
Applicant: SAP SE
Inventor： Peng Ni
IPC: G06F16/901 , G06Q50/00 , G06K9/62
Abstract: Methods, systems, and computer-readable storage media for receiving data representative of time-based snapshots of a time-evolving graph, the data including vertices and edges for each time-based snapshot, for each source vertex in a time-based snapshot: executing a static single-source-shortest-path (SSSP) algorithm to provide a set of distance labels, each distance label including data representative of a distance between the source vertex and a reachable vertex within the time-based snapshot, and determining a total number of reachable vertices from the source vertex within the time-based snapshot and a total distance between the source vertex and the reachable vertices based on the set of distance labels within the time-based snapshot, and providing, for each source vertex, a set of closeness centrality values, each closeness centrality value corresponding to a respective time-based snapshot.
-
公开(公告)号：US20190034553A1
公开(公告)日：2019-01-31
申请号：US15658674
申请日：2017-07-25
Applicant: SAP SE
CPC classification number: G06F16/9024 , G06F11/3608 , G06F16/1858 , G06F16/212 , G06Q10/06
Abstract: Methods, systems, and computer-readable storage media for receiving data representative of the temporal graph, the data representing vertices, edges between vertices, and temporal features, determining a set of earliest-arrival dependencies, each earliest arrival dependency including an earliest feasible edge between vertices from a list of edges of the temporal graph, providing data representative of an edge-scan-dependency graph (ESD-graph) based on the data representative of the temporal graph, and the set of earliest-arrival dependencies, the ESD-graph including vertices representing edges of the temporal graph, and edges representing earliest-arrival dependencies between vertices, providing data representative of a level-assigned ESD-graph including a level assigned to each vertex of the ESD-graph, and determining earliest-arrival times between a source vertex, and each vertex of the temporal graph by executing a parallel edge scan of the level-assigned ESD-graph.
-
-
-
-
-
-
Search Results
7
records
(took 0.015 seconds)
