Sap Se

Sap Ag

Alain Gauthier

Mohannad El-Jayousi

Roy Ghorayeb

Xuebo Liang

Vincent LaVoie

Rolan Abdukalykov

Wanling Zhang

Edgar Willi Lott

Martin Parent

Farid Toubal-Seghir

Ghufran Iftikhar

James Zdralek

Rischa Poncik

Isabelle Thore

Roman Sauber

Jonathan Viau

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.

Server resource balancing using a dynamic-sharing strategy

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.

Resource allocation using application-generated notifications

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 fixed-sharing strategy

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.

Intelligent server task balancing based on server capacity

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

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.

Server resource orchestration based on application priority

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.

Sankey diagram graphical user interface customization

Methods and systems of the present disclosure provide techniques for analyzing behavior of and triggering action for a definable group. In an embodiment, a method may identify a group based on a Sankey diagram. For example, a group may include those users belonging to a journey or path of the Sankey diagram. The method may analyze behavior of the group, e.g., whether a group characteristic meets a pre-definable condition. The method may perform an action for the group. In an embodiment, the method may automatically identify group members and/or automatically perform at least one action for the group members based on satisfaction of the pre-definable condition.

Building business objects based on Sankey diagram

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.

Rendering details from user selections of mined data habits

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.

Generating metadata and visuals related to mined data habits

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.

Business object attachments and expiring URLs

A computing server is described that can transform hierarchical data structures (for example, tree structures, which are also referred to as trees) storing data into multidimensional linked lists and an in-memory computing array (also referred to herein as a computing array). The computing array can include pointers to nodes of the multidimensional linked lists. The storage of data in the form of multidimensional linked lists and computing arrays can enable the computing server to quickly retrieve data values from the data stored in the hierarchical data structures without parsing the hierarchical data structures. Related apparatuses, systems, techniques, and articles are also described.

Generation and search of multidimensional linked lists and computing array

A reference point on a graphical user interface may be determined. The reference point may be represented by a plurality of coordinates. The graphical user interface may be divided into tile map entities. Information about the tile map entities may be stored into a cache. The stored information may include an origin and dimensions of each tile map entity, and the origin may be represented relative to the reference point. Information needed to position a business object visual representation may be retrieved from the cache. The business object visual representation may be drawn on the graphical user interface based on the retrieved information needed to position the business object visual representation.

Business object representations and detail boxes display

Scale(s) on one or more axes may be displayed. The scale(s) may present a range of values associated with at least one business object attribute. Visual representation(s) of business object(s) may be displayed. The visual representation(s) may be positioned relative to the scale(s). Detail boxes corresponding to each visually represented business object may be displayed. Each detail box may present information about a corresponding business object. All detail boxes may be displayed. Information presented by the detail box(es) may be an image and/or text. The information presented by the detail box(es) may be interactive. Displaying or not displaying the detail box(es) may be toggled. The visual representation(s) of the business object(s) may be repositioned based on the toggling.

Business object detail display

Example systems and methods of providing an indicator of execution progress of a computer task are presented. In one example, a command to perform a computer task is received. The command is compared to a log of commands for computer tasks previously performed on the computer system and their associated execution times. At least one execution time is retrieved from the log based on the comparison. An indicator indicating an estimated execution time for the computer task is provided for presentation to a user of the computer system based on the at least one retrieved execution time.

Growing community of inventors

Montreal, Canada

Alain Gauthier