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.
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.
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.
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.
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.
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:
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:
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:
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.
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.