Sap Se

Sap Ag

Kuck, Harald

Kuck, Norbert

Schmidt, Oliver

Lott, Edgar

Rohland, Hans-Christoph

Edgar Willi Lott

Masoud Aghadavoodi Jolfaei

Alain Gauthier

Oliver Patrick Schmidt

Norbert Kuck

Martin Parent

Helmut Prestel

Frank Radmacher

Ralf Schmelter

Achim Braemer

Arno Hilgenberg

Martin Strassburger

Karsten K Bohlmann

Stefan Bresch

Hans-Christoph Rohland

Harald Kuck

Thorsten Marcus Dunz

Oliver Luik

Martin Zurmuehl

Thomas Gauweiler

Ralf Handl

Brian Craig McKellar

Guenter Zachmann

Andrea Neufeld

Heiko Konrad

Werner Rehm

Harald Evers

Sasan Memar-Zahedani

Manfred Hirsch

Thomas Becker

Steffen Knoeller

Jan Dosert

Brian Craig Mckellar

Oliver Schmidt

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

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

The present disclosure involves systems, software, and computer implemented methods for event processing in background services. One example method includes receiving a request to create a daemon session, the request including at least one parameter. The session is created, including storing the at least one parameter in a memory storage that is configured to survive a restart of the session. A set of messages is received for the session. The messages are stored in a queue that is configured to survive a restart of the session. A determination is made that the session is to be restarted. A restart of the session is initiated, including providing the at least one parameter to the session during the restart of the daemon session and providing unprocessed messages to the session after the session has been restarted, to enable the session to process the unprocessed messages.

Event processing in background services

The disclosure generally describes methods, software, and systems, including a method for updating an application. At least one application instance of an application is managed. Each application instance is associated with a plurality of executing work processes connected with a first database schema. A bridge database schema is generated that is related to the first database schema. The bridge database schema represents a copy of the first database schema and is generated in response to initiation of an update to the application. In response to determining that the generation of the bridge database schema is complete, for each of the plurality of work processes, a commit work action performed by the particular work process is determined. In response to determining performance of the commit work action, the particular work process is connected to the bridge database schema.

Dynamic reconnect of work processes in a zero downtime maintenance procedure

A method may receive a message from a first client associated with a first device type. A first application context associated with a session may be prepared for a response to the message based on the first device type. The response to the message may be prepared and the response may be transmitted to the first client via the session. The first application context associated with the session may be cleansed. Furthermore, the first application context associated with the session may be stored in a pool.

Application based context pooling

In an example embodiment, a request for an enqueue lock for a first piece of data is received from a client application. At an enqueue server separate from an application server instance, a light-weight enqueue session is then created, including generating a light-weight enqueue session identification for the light-weight enqueue session. An enqueue lock for the first piece of data is stored in the light-weight enqueue session. The light-weight enqueue session identification is then sent to the client application. In response to a detection that a session between the client application and the application server instance has been terminated, all enqueue locks in the light-weight enqueue session are deleted and the light-weight enqueue session is deleted.

Light-weight lifecycle management of enqueue locks

The present disclosure relates to a telecommunication method for controlling data access to a telecommunication server, the telecommunication server being connected to at least one first client terminal via at least a digital cellular telecommunication network, wherein the telecommunication server and the first client terminal communicate via a stateless protocol within at least a first communication session, the first client terminal being a battery powered device, the telecommunication server comprising an electronic document, the electronic document having a plurality of input fields for entry of electronic data, wherein a first lock and a session ID are assigned to the electronic document, the session ID being indicative of the first communication session, wherein the first lock is released by the telecommunication server upon ending the first communication session, the telecommunication server comprising multiple applications for accessing the electronic document, the telecommunication server further comprising a session control unit, wherein in a first access mode the session control unit is adapted to control access by the multiple applications to the electronic document using the first lock and the session ID, the method comprising receiving by the telecommunication server a first request from a first user of the first client terminal for accessing the electronic document, the first request being indicative of a first user ID of the first user.

Method for controlling access to electronic documents using locks

A method, a system, and computer-readable medium for processing of data are disclosed. An acknowledgement is received to store business object data. Based on the acknowledgement, an indication that the business object data is stored in a repository is generated. Processing of the business object data to enable storage in the repository continues while generating such indication.

Asynchronous data processing

A system, a method and a computer-program product for exchanging communications between user sessions are provided. A first push channel and a first messaging channel on a first application server for connecting a first client to the first application server are established. The first messaging channel communicates with the first push channel, where both channels form a first session corresponding to the first client. A second push channel and a second messaging channel on a second application server for connecting a second client to the second application server are established. The second messaging channel communicates with the second push channel, where both channels form a second session corresponding to the second client. The first and second application servers communicate on a communication network. Messages are exchanged between the first and second messaging channels to form a connection between the first and second clients.

ABAP channels for event signaling

Methods and systems of monitoring events occurring in a computer system are provided. An event monitoring instruction including a condition is parsed, the event monitoring instruction expressed using syntax defined in source code, the parsing resulting in an event channel to monitor and the condition. Then execution of an application is paused. The event channel is monitored until an event occurs on the event channel. Then an event handler for the event is run in response to the event occurring on the event channel. The condition is evaluated to determine whether the condition is satisfied. Execution of the application is resumed in response to the condition being satisfied.

Programming language conditional event dispatcher

In one embodiment, a method determines a task to execute in a computer processing system. A resource consumption template from a plurality of resource consumption templates is determined for the task. The plurality of resource consumption templates have different priorities. A computer processing system determines resources for the task based on the determined resource consumption template. Also, the computer processing system processes the task using the allocated resources. The processing of the task is prioritized based on the priority of the resource consumption template.

Growing community of inventors

Baden-Württemberg, Germany

Edgar Willi Lott