Server resource balancing using a fixed-sharing strategy

    公开(公告)号:US11126466B2

    公开(公告)日:2021-09-21

    申请号: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.

    Intelligent server task balancing based on server capacity

    公开(公告)号:US11042402B2

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

    申请号:US16286084

    申请日: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 tracking assignments by a dispatcher of tasks to servers in a data structure. The data structure includes at least one entry for each server, with a number of entries per server being based on a capacity of the server. Servers with greater capacity have more entries than servers with lesser capacity. An entry represents either an assignment of a task to a server or an available slot indicating an availability of a server to execute a task. A first server has a lesser capacity than a second server. The tracking of assignment of tasks to servers in the data structure results in more tasks being assigned to the second server than the first server, due to faster task completion by the second server.

    Server resource balancing using a suspend-resume strategy

    公开(公告)号:US10884800B2

    公开(公告)日:2021-01-05

    申请号:US16286148

    申请日: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, by a first dispatcher in a dispatching layer, a first request to run a first task for a first application, the first request including a first application priority. A determination is made that the first application priority is lower than at least one higher application priority of another application. Execution of the first application is suspended based on determining that the first application priority is lower than the at least one higher application priority. An indication that an application having a higher application priority has finished is received. A determination is made that the first application priority is a highest application priority of currently-running applications. The first task for the first application is dispatched to a first application server.

    SERVER RESOURCE BALANCING USING A SUSPEND-RESUME STRATEGY

    公开(公告)号:US20200272510A1

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

    申请号:US16286148

    申请日: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, by a first dispatcher in a dispatching layer, a first request to run a first task for a first application, the first request including a first application priority. A determination is made that the first application priority is lower than at least one higher application priority of another application. Execution of the first application is suspended based on determining that the first application priority is lower than the at least one higher application priority. An indication that an application having a higher application priority has finished is received. A determination is made that the first application priority is a highest application priority of currently-running applications. The first task for the first application is dispatched to a first application server.

    INTELLIGENT SERVER TASK BALANCING BASED ON SERVER CAPACITY

    公开(公告)号:US20200272507A1

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

    申请号:US16286084

    申请日: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 tracking assignments by a dispatcher of tasks to servers in a data structure. The data structure includes at least one entry for each server, with a number of entries per server being based on a capacity of the server. Servers with greater capacity have more entries than servers with lesser capacity. An entry represents either an assignment of a task to a server or an available slot indicating an availability of a server to execute a task. A first server has a lesser capacity than a second server. The tracking of assignment of tasks to servers in the data structure results in more tasks being assigned to the second server than the first server, due to faster task completion by the second server.

    GENERATING METADATA AND VISUALS RELATED TO MINED DATA HABITS
    6.
    发明申请
    GENERATING METADATA AND VISUALS RELATED TO MINED DATA HABITS 审中-公开
    生成与数据资料相关的元数据和视图

    公开(公告)号:US20170039577A1

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

    申请号:US14821476

    申请日:2015-08-07

    Applicant: SAP SE

    CPC classification number: G06Q30/0201 G06F16/26 G06F16/9535

    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.

    Abstract translation: 本公开的方法和系统提供用于选择性地提供挖掘的客户数据习惯作为源数据的技术,以填充客户之旅,作为在用户界面上显示的Sankey图的一部分。 根据以下中的至少一个,选择挖掘的客户数据习惯以包括在客户旅程图中:根据迷你地图的用户选择; 基于来自用户选择的元数据的修改; 根据屏幕尺寸修改可用的用户界面大小; 在客户之旅中承认内容重复; 以及“客户之旅”图中焦点的顺序图案的识别。 在一个实施例中,该方法可以自动地将开采的客户数据习惯提供到预定义的程度。 该方法可以基于用户选择来适应当前提供的矿工客户数据习惯。

    SIMPLIFICATION OF SANKEY DIAGRAM
    7.
    发明申请
    SIMPLIFICATION OF SANKEY DIAGRAM 审中-公开
    SANKEY图的简化

    公开(公告)号:US20170039244A1

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

    申请号:US14821446

    申请日:2015-08-07

    Applicant: SAP SE

    CPC classification number: G06F3/0481 G06F16/904 G06T11/206 G06T2200/24

    Abstract: The present disclosure generally relates to systems and methods for visualizing data. More specifically, the embodiments described herein generally relate to data manipulation algorithm(s) configured to position and/or identify unique node(s) with visualized data. The systems and methods retrieve one or more data structure(s), graphically align nodes having same level values, identify and remove duplicate nodes, and graphically render the data structures(s) as a Sankey diagram.

    Abstract translation: 本公开一般涉及用于可视化数据的系统和方法。 更具体地,本文描述的实施例通常涉及被配置为使用可视化数据定位和/或识别唯一节点的数据操纵算法。 系统和方法检索一个或多个数据结构,以图形方式对齐具有相同级别值的节点,识别和删除重复节点,并将数据结构以图形方式呈现为Sankey图。

    SANKEY DIAGRAM GRAPHICAL USER INTERFACE CUSTOMIZATION
    8.
    发明申请
    SANKEY DIAGRAM GRAPHICAL USER INTERFACE CUSTOMIZATION 审中-公开
    SANKEY图形图形用户界面自定义

    公开(公告)号:US20170039233A1

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

    申请号:US14821332

    申请日:2015-08-07

    Applicant: SAP SE

    Abstract: A system, method, and computer program product for selecting, processing, and visually depicting information in real time using in-memory technology and user-customizable Sankey diagrams in a graphical user interface. Embodiments receive data describing contact interactions with a business establishment, select interactions occurring frequently during a given time span that led to selected target events, and aggregate similar interaction sequences into paths displayed with widths denoting relative flow quantities. Embodiments modify the depicted information according to user customization of the Sankey diagram. Coherent coordination of visual depiction by context, associated algorithms and models, data sources, event types, and various graphical indicia helps provide an intuitive exploratory situational overview and enables user-driven detailed investigations of complex data via manipulations of the Sankey diagrams. Business assessments and properly directed business actions may improve marketing campaign and customer service effectiveness and increase return on investment without requiring extensive user training or database expertise.

    Abstract translation: 用于在图形用户界面中使用内存中技术和用户可定制的Sankey图表来实时选择,处理和可视地描绘信息的系统,方法和计算机程序产品。 实施例接收描述与企业机构的联系交互的数据,选择在导致所选择的目标事件的给定时间段内频繁发生的交互,并将相似的交互序列聚合成以表示相对流量的宽度显示的路径。 实施例根据Sankey图的用户定制来修改所描绘的信息。 通过上下文,相关算法和模型,数据源,事件类型和各种图形标记的视觉描述的相干协调有助于提供直观的探索性情景概述,并通过操纵Sankey图来实现对复杂数据的用户驱动的详细调查。 业务评估和正确导向的业务行动可能会改善营销活动和客户服务有效性,并提高投资回报率,而无需广泛的用户培训或数据库专业知识。

    Resource allocation using application-generated notifications

    公开(公告)号:US11169855B2

    公开(公告)日:2021-11-09

    申请号: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

    公开(公告)号:US10884801B2

    公开(公告)日:2021-01-05

    申请号: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.

Patent Agency Ranking