SERVER RESOURCE BALANCING USING A FIXED-SHARING STRATEGY

    公开(公告)号:US20200272523A1

    公开(公告)日:2020-08-27

    申请号:US16286073

    申请日:2019-02-26

    Applicant: SAP SE

    Abstract: The present disclosure involves systems, software, and computer implemented methods for resource allocation and management. One example method includes receiving, in a dispatching layer, a request to run a first task for a first application, the request including a first application priority. At least one second application priority of at least one currently running application is identified. A maximum number of allowable parallel tasks per application is determined. Application priority weights are assigned to each of the first application priority and the at least one second application priority. A number of parallel tasks for the first application and the at least one currently running application are determined based on the maximum number of allowable parallel tasks per application and the assigned application priority weights. A first number of parallel tasks are assigned to the first application. The first application is executed using the assigned first number of parallel tasks.

    SERVER RESOURCE BALANCING USING A DYNAMIC-SHARING STRATEGY

    公开(公告)号:US20200272522A1

    公开(公告)日:2020-08-27

    申请号:US16286051

    申请日:2019-02-26

    Applicant: SAP SE

    Abstract: The present disclosure involves systems, software, and computer implemented methods for resource allocation and management. One example method includes receiving a request, including a first application priority, to run a task for an application. At least one second application priority is identified. A maximum number of parallel tasks per application priority is determined. Application priority weights are assigned to the first application priority and the second application priorities. Application priority divisors are determined, for the first application priority and the second application priorities, based on a respective application priority weight and a number of currently running applications of a respective application priority. A number of parallel tasks for the first application and other applications are determined based on the maximum number of allowable parallel tasks per application, an overall divisor, and a respective application priority weight. A number of parallel tasks are assigned to the first application.

    Rendering details from user selections of mined data habits

    公开(公告)号:US10586241B2

    公开(公告)日:2020-03-10

    申请号:US14821465

    申请日:2015-08-07

    Applicant: SAP SE

    Abstract: Methods and systems of the present disclosure provide techniques for selecting displayed data in a Customer Journey diagram as eligible for one of presentation of contextual data and analysis. The methods may further include analysis or presentation of the selected displayed data in a manner that maximizes the comprehensibility of the data. The techniques for selecting displayed data as eligible for presentation or analysis include at least one of: increasing the visibility of a selected path; selecting, or multi-selecting, paths and/or Nodes for analysis; rendering contextual data from a Customer Journey diagram according to a point of click; providing additional methods for presentation of contextual data or action options; providing granular drilling information regarding a Customer Journey on demand; and dynamically adjusting a point of focus according to a diagram selection.

    Business object attachments and expiring URLs

    公开(公告)号:US09854052B2

    公开(公告)日:2017-12-26

    申请号:US14040067

    申请日:2013-09-27

    Applicant: SAP SE

    CPC classification number: H04L67/2842 G06F17/30902 H04L51/08

    Abstract: A computer implemented method may include requesting details of an object and attachments associated with the object. The attachment details for each attachment may include an attachment name and an attachment ID. In response to a selection of an attachment associated with the object, a determination may be made as to whether a cache already includes the selected attachment. If the cache includes the selected attachment, the selected attachment may be retrieved from the attachment cache. If the cache does not include the selected attachment, the attachment may be downloaded using an attachment URL. The attachment URL may be requested and generated based on the attachment ID. The downloaded attachment may also be stored in the attachment cache.

    Server resource balancing using a dynamic-sharing strategy

    公开(公告)号:US11307898B2

    公开(公告)日:2022-04-19

    申请号:US16286051

    申请日:2019-02-26

    Applicant: SAP SE

    Abstract: The present disclosure involves systems, software, and computer implemented methods for resource allocation and management. One example method includes receiving a request, including a first application priority, to run a task for an application. At least one second application priority is identified. A maximum number of parallel tasks per application priority is determined. Application priority weights are assigned to the first application priority and the second application priorities. Application priority divisors are determined, for the first application priority and the second application priorities, based on a respective application priority weight and a number of currently running applications of a respective application priority. A number of parallel tasks for the first application and other applications are determined based on the maximum number of allowable parallel tasks per application, an overall divisor, and a respective application priority weight. A number of parallel tasks are assigned to the first application.

    Resource Allocation Using Application-Generated Notifications

    公开(公告)号:US20210165689A1

    公开(公告)日:2021-06-03

    申请号:US16701800

    申请日:2019-12-03

    Applicant: SAP SE

    Inventor: Alain Gauthier

    Abstract: Systems, methods, and computer program products are described herein for proactively allocating resources of a computing infrastructure having a plurality of namespaces. Data having process information for executing an application task on a namespace of the computing infrastructure is received. The process information defines process loads associated with the application task. A number of application servers for executing the application task are determined based on the process loads. Application servers are allocated to the namespace based on the determined number of application servers for execution of the application task. The receiving, the determining, and the allocating occur prior to execution of the application task.

    SERVER RESOURCE ORCHESTRATION BASED ON APPLICATION PRIORITY

    公开(公告)号:US20200272511A1

    公开(公告)日:2020-08-27

    申请号:US16286163

    申请日:2019-02-26

    Applicant: SAP SE

    Abstract: The present disclosure involves systems, software, and computer implemented methods for resource allocation and management. One example method includes receiving a request to run a first task for a first application, the request including a first application priority. At least one second application priority of at least one currently running application is identified. A dispatching algorithm is executed, to dispatch the first task to a first application server based on the first application priority and the at least one second application priority. Destination information is returned, in response to the request, for the first application server, for execution of the first task for the first application, at the first application server, using the first resources.

    Generating metadata and visuals related to mined data habits

    公开(公告)号:US10467634B2

    公开(公告)日:2019-11-05

    申请号:US14821476

    申请日:2015-08-07

    Applicant: SAP SE

    Abstract: Methods and systems of the present disclosure provide techniques for selectively providing mined customer data habits as source data to populate a Customer Journey as part of a Sankey diagram displayed on a User Interface. The mined customer data habits are selected for inclusion in the Customer Journey diagram according to at least one of: a user selection according to a mini-map; a modification based on metadata from a user selection; a modification of the available User Interface size according to a screen size; a recognition of content repetition in the Customer Journey; and an identification of sequential patterns as focus points in the Customer Journey diagram. In an embodiment, the method may automatically provide mined customer data habits to a predefined extent. The method may adapt a currently supplied miner customer data habit based on a user selection.

    RENDERING DETAILS FROM USER SELECTIONS OF MINED DATA HABITS
    20.
    发明申请
    RENDERING DETAILS FROM USER SELECTIONS OF MINED DATA HABITS 审中-公开
    从用户选择的数据资料中提取详细信息

    公开(公告)号:US20170039576A1

    公开(公告)日:2017-02-09

    申请号:US14821465

    申请日:2015-08-07

    Applicant: SAP SE

    Abstract: Methods and systems of the present disclosure provide techniques for selecting displayed data in a Customer Journey diagram as eligible for one of presentation of contextual data and analysis. The methods may further include analysis or presentation of the selected displayed data in a manner that maximizes the comprehensibility of the data. The techniques for selecting displayed data as eligible for presentation or analysis include at least one of: increasing the visibility of a selected path; selecting, or multi-selecting, paths and/or Nodes for analysis; rendering contextual data from a Customer Journey diagram according to a point of click; providing additional methods for presentation of contextual data or action options; providing granular drilling information regarding a Customer Journey on demand; and dynamically adjusting a point of focus according to a diagram selection.

    Abstract translation: 本公开的方法和系统提供了用于在客户旅程图中选择显示数据的技术,用于呈现上下文数据和分析之一。 所述方法还可以包括以最大化数据的可理解性的方式分析或呈现所选择的显示数据。 用于选择显示数据作为呈现或分析的技术包括以下中的至少一个:增加所选路径的可视性; 选择或多选路径和/或节点进行分析; 根据点击,从客户旅程图中呈现上下文数据; 提供用于呈现上下文数据或行动选项的其他方法; 提供有关客户之旅的细粒度钻井信息; 并根据图选择动态调整焦点。

Patent Agency Ranking