Sap Ag

Arne Schwarz

Volker Sauermann

Axel Von Bergen

Wolfgang A Becker

Guenter Zachmann

Bernhard Lokowandt

Axel Bergen

Method and computer system for software tuning. A computer system stores variables () for storing at least one threshold value for at least one parameter (P) influencing the performance of a software application () with regards to a specific task. A threshold evaluator () compares () the at least one threshold value to at least one corresponding current value allowing the software application () to select () an algorithm (A) from a plurality of algorithms (Ato AN) for performing the task in accordance with the result of comparison.

Method and computer system for software tuning

A user interface element for manipulating Boolean expressions includes at least one tab panel element operable to define a term of a Boolean expression with each term including one or more condition statements, and an add tab element operable to add an additional tab panel element. The defined terms of each of the tab panel elements are combined to form the Boolean expression.

Tabstrip user interface element for formulating boolean statements

Methods and computer systems are provided for reducing the runtime of a material requirements planning run. In one embodiment, a computer system loads a plurality of bills of materials into a data structure. The computer system may analyze parent-child relationships between components of the plurality of bills of materials in the data structure and set for each component in the data structure a counter value that indicates the number of parent components for each component. The counter value of a specific child component may be decremented when the planning of a parent component of the specific child component is completed. The computer system may then proceed with the planning of the specific child component if the associated counter value indicates that the planning of all parent components of the specific child component is completed.

Methods and computer systems for reducing runtimes in material requirements planning

Managing a computer system having a plurality of blades by detecting the presence of a new blade in the computer system; installing an operating system on the new blade; configuring the operation system; and copying a service that is running on an earlier detected blade to the new blade. Further features are testing services and operating system on the new blade and cyclically shifting services through the blades.

Managing a computer system with blades

A method for restarting a process running on a first processor includes preparing a second processor, copying process context information to the second processor, starting a second process using the context information on the second processor, and terminating a first process running on the first processor. The second process performs an equivalent function to the first process.

Restarting processes in distributed applications on blade servers

A computer implemented method of retrieving hit count data from data base system comprises the steps of scanning through the bitmap data structure (R) accessing only each Nth machine word (), determining a fuzzy number of hit-relevant bit values of each accessed machine word (), calculating an estimated hit count by multiplying the fuzzy number by N, and outputting the estimated hit count from the data base system.

Computer implemented method for retrieving hit count data from a data base system and according computer program product

A computer implemented method for storing data sets in and retrieving data sets from a data storage system in a given number and sorted by a data attribute of the data set comprises

Computer implemented method and according computer program product for storing data sets in and retrieving data sets from a data storage system

A frame handler for application-level memory management includes an associated block of memory divided into instances such that data elements may be stored in the instances, a data structure identifying the unused instances within the block of memory, and an application interface operable to receive a request for an unused instance from a software application. The frame handler is operable to identify an unused instance in response to a request received by the application interface. In addition, a software application using application-level memory management includes an application-level memory manager operable to allocate a block of memory to store data elements with the block of memory divided into frames and each frame divided into instances, and application code operable to store data elements in instances of a block of memory allocated by the application-level memory manager.

Memory management frame handler

A method for allocating memory in a computer system includes allocating a block of memory from an operating system, dividing the block of memory into frames, and dividing each of the frames into instances such that each of the instances is operable to store data. In addition, a software application using application-level memory management includes an application-level memory manager operable to allocate a block of memory to store data elements with the block of memory divided into frames and each frame divided into instances, and application code operable to store data elements in instances of a block of memory allocated by the application-level memory manager.

Memory management tile optimization

Techniques are described for organizing data in a fast query system. Data structures are provided, where each of the data structures forms part of at least one traversable structure and represents at least a first value of a first attribute of a data record forming a body of data records. Each of at least some of the data structures are associated with at least one other data structure forming part of another traversable structure, where the other data structure represents at least a second value of a second attribute of the data record.

Data organization in a fast query system

Techniques are described for performing logical operations, where the techniques generally involve the use of dynamic flags used as markers to build a result set in response to a search query. The dynamic flags within a result set may be guide elements linked to one another, and to their respective data records and attributes, via pointers. In this case, the groups of guide elements forming result sets may each also be linked to one another via pointers, and may each be associated with a counter for counting a number of guide elements within a corresponding result set. The dynamic flags also may be individual bits within a bitmap, where the bitmap is linked to a particular result set identifier via a pointer, and the individual bitmaps are linked to their corresponding data record(s) via a relative addressing scheme. In this case, a counter also may be used to determine a number of hits within a result set (bitmap), before, during, and after a particular logical operation.

Process for performing logical combinations

A graphical user interface element for modifying parameters of a graphing widget includes a first slider bar with a first slider control operable to adjust a first parameter of a graphing widget, and a second slider bar with a second slider control operable to adjust a second parameter of the graphing widget. The parameters may be modified to adjust the a graphical representation of data displayed by the graphing widget.

Growing community of inventors

Walldorf, Germany

Arne Schwarz