Patents by Inventor Tobias Scheuer
Tobias Scheuer has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).
-
Patent number: 11882008Abstract: Systems and methods include establishment of a first database session with a first database user, determine first session variable values associated with the first database session, the first session variable values including a first tenant value, determine a first workload class based on the first tenant value and on zero or more of the other first session variable values, the first workload class including first parameter values specifying first resource consumption limits, and manage resource consumption of the first database session based on the first parameter values.Type: GrantFiled: December 8, 2022Date of Patent: January 23, 2024Assignee: SAP SEInventors: Ruediger Karl, Norman May, Jaeyoung Choi, Hyogi Jung, Tobias Scheuer, Robin Joy, Patrick Voelker
-
Patent number: 11481298Abstract: Processor(s) of a sampling profiler can identify an activity of multiple activities serviced by a central processing unit (CPU). Each activity can be performed by computing thread(s) of multiple computing threads executing various subroutines of a computer program. The processor(s) can set a target representing a total number of computing threads required to work simultaneously for a maximal use of the CPU. The processor(s) can determine a number of busy computing threads that are performing the activity by using the CPU. The processor(s) can calculate a number of wasted computing threads that are not performing the activity and not using the CPU by computing a difference between the target and the number of busy threads. The processor(s) can compute a CPU time usage for the activity by multiplying time duration of the activity by a value obtained by dividing the number of wasted threads by the number of busy threads.Type: GrantFiled: March 13, 2015Date of Patent: October 25, 2022Assignee: SAP SEInventor: Tobias Scheuer
-
Patent number: 11429388Abstract: Aspects of the current subject matter are directed to an approach in which a parallel load operation of file ID mapping containers is accomplished at start and/or restart of a database system. Parallel load operation of file ID mapping and/or large binary object (LOB) file ID mapping is done among a plurality of scanning engines into a plurality of data buffers that are associated with each of the plurality of scanning engines. Each scanning engine operates on a certain path of a page chain of a page structure including the mapping, causing the page chain to be split among scanning engines to process maps. Contents of the data buffers are pushed to mapping engines via a queue. The mapping engines load the file ID mapping and the LOB file ID mapping into maps for in-system access.Type: GrantFiled: May 26, 2020Date of Patent: August 30, 2022Assignee: SAP SEInventors: Dirk Thomsen, Thorsten Glebe, Tobias Scheuer, Werner Thesing, Johannes Gloeckle
-
Patent number: 11275721Abstract: Techniques and solutions are provided for performing adaptive database table placement in a non-uniform memory access (NUMA) architecture. The adaptive table placement can occur in response to changing workloads on the NUMA nodes. For example, if a particular NUMA node is saturated, a database table may be moved from the memory of the saturated NUMA node to the memory of another NUMA node that is underutilized. In some cases, an entire database table is moved, while in other cases the database table is partitioned and only part of the table is moved.Type: GrantFiled: July 17, 2015Date of Patent: March 15, 2022Assignee: SAP SEInventors: Tobias Scheuer, Iraklis Psaroudakis, Abdelkader Sellami, Norman May, Anastasia Ailamaki
-
Publication number: 20210373893Abstract: Aspects of the current subject matter are directed to an approach in which a parallel load operation of file ID mapping containers is accomplished at start and/or restart of a database system. Parallel load operation of file ID mapping and/or large binary object (LOB) file ID mapping is done among a plurality of scanning engines into a plurality of data buffers that are associated with each of the plurality of scanning engines. Each scanning engine operates on a certain path of a page chain of a page structure including the mapping, causing the page chain to be split among scanning engines to process maps. Contents of the data buffers are pushed to mapping engines via a queue. The mapping engines load the file ID mapping and the LOB file ID mapping into maps for in-system access.Type: ApplicationFiled: May 26, 2020Publication date: December 2, 2021Inventors: Dirk Thomsen, Thorsten Glebe, Tobias Scheuer, Werner Thesing, Johannes Gloeckle
-
Patent number: 11042527Abstract: Systems and methods are described herein for system critical phase lock job inhibitors. Acquisition of a consistent change exclusive lock is initiated. A job request having a scope object is received. Execution of the job request and generation of a replacement job associated with the job request is prohibited based on the scope object indicating that the job requires consistent change access during the consistent change exclusive lock.Type: GrantFiled: May 15, 2018Date of Patent: June 22, 2021Assignee: SAP SEInventors: Tobias Scheuer, Dirk Thomsen
-
Patent number: 10884796Abstract: Systems and methods are described herein for job execution using system critical threads. An in-memory database system having pages loaded into a memory and having associated physical disk storage generates a safety critical thread pool. The safety critical thread pool has one or more safety critical threads associated with flushing the pages to the physical disk storage. Execution of the one or more safety critical threads is initiated within the safety critical thread pool. A job request to access data stored within the physical disk storage is received. Utilization levels of the one or more safety critical threads are monitored. Execution of the job request is permitted based on the utilization levels associated with the one or more safety critical threads.Type: GrantFiled: May 3, 2018Date of Patent: January 5, 2021Assignee: SAP SEInventors: Tobias Scheuer, Dirk Thomsen
-
Patent number: 10545789Abstract: Systems and method for a task scheduler with dynamic adjustment of concurrency levels and task granularity are disclosed for improved execution of highly concurrent analytical and transactional systems. The task scheduler can avoid both over commitment and underutilization of computing resources by monitoring and controlling the number of active worker threads. The number of active worker threads can be adapted to avoid underutilization of computing resources by giving the OS control of additional worker threads processing blocked application tasks. The task scheduler can dynamically determine a number of parallel operations for a particular task based on the number of available threads. The number of available worker threads can be determined based on the average availability of worker threads in the recent history of the application. Based on the number of available worker threads, the partitionable operation can be partitioned into a number of sub operations and executed in parallel.Type: GrantFiled: April 25, 2018Date of Patent: January 28, 2020Assignee: SAP SEInventors: Anastasia Ailamaki, Tobias Scheuer, Iraklis Psaroudakis, Norman May
-
Publication number: 20190354615Abstract: Systems and methods are described herein for system critical phase lock job inhibitors. Acquisition of a consistent change exclusive lock is initiated. A job request having a scope object is received. Execution of the job request and generation of a replacement job associated with the job request is prohibited based on the scope object indicating that the job requires consistent change access during the consistent change exclusive lock.Type: ApplicationFiled: May 15, 2018Publication date: November 21, 2019Inventors: Tobias Scheuer, Dirk Thomsen
-
Publication number: 20190340017Abstract: Systems and methods are described herein for job execution using system critical threads. An in-memory database system having pages loaded into a memory and having associated physical disk storage generates a safety critical thread pool. The safety critical thread pool has one or more safety critical threads associated with flushing the pages to the physical disk storage. Execution of the one or more safety critical threads is initiated within the safety critical thread pool. A job request to access data stored within the physical disk storage is received. Utilization levels of the one or more safety critical threads are monitored. Execution of the job request is permitted based on the utilization levels associated with the one or more safety critical threads.Type: ApplicationFiled: May 3, 2018Publication date: November 7, 2019Inventors: Tobias Scheuer, Dirk Thomsen
-
Patent number: 10459760Abstract: Scheduling jobs from an application based on a job concurrency hint. The job concurrency hint providing an indication of the number and/or size of the jobs that can be handled by the job scheduler. The scheduling of the jobs based on the job concurrency hint including selecting the number and/or size of the jobs to pass to the job scheduler for execution by a thread in a core of a processor.Type: GrantFiled: July 8, 2016Date of Patent: October 29, 2019Assignee: SAP SEInventor: Tobias Scheuer
-
Patent number: 10108524Abstract: Computing threads can be sampled such that the samples hit each activity with a probability proportional to a time period of that activity. Therefore, the sampling can advantageously account for all activities, including activities that are smaller than the applicable sampling interval.Type: GrantFiled: April 17, 2017Date of Patent: October 23, 2018Assignee: SAP SEInventors: Tobias Scheuer, Daniel Booss
-
Publication number: 20180246755Abstract: Systems and method for a task scheduler with dynamic adjustment of concurrency levels and task granularity are disclosed for improved execution of highly concurrent analytical and transactional systems. The task scheduler can avoid both over commitment and underutilization of computing resources by monitoring and controlling the number of active worker threads. The number of active worker threads can be adapted to avoid underutilization of computing resources by giving the OS control of additional worker threads processing blocked application tasks. The task scheduler can dynamically determine a number of parallel operations for a particular task based on the number of available threads. The number of available worker threads can be determined based on the average availability of worker threads in the recent history of the application. Based on the number of available worker threads, the partitionable operation can be partitioned into a number of sub operations and executed in parallel.Type: ApplicationFiled: April 25, 2018Publication date: August 30, 2018Inventors: Anastasia Ailamaki, Tobias Scheuer, Iraklis Psaroudakis, Norman May
-
Patent number: 9983903Abstract: Systems and method for a task scheduler with dynamic adjustment of concurrency levels and task granularity are disclosed for improved execution of highly concurrent analytical and transactional systems. The task scheduler can avoid both over commitment and underutilization of computing resources by monitoring and controlling the number of active worker threads. The number of active worker threads can be adapted to avoid underutilization of computing resources by giving the OS control of additional worker threads processing blocked application tasks. The task scheduler can dynamically determine a number of parallel operations for a particular task based on the number of available threads. The number of available worker threads can be determined based on the average availability of worker threads in the recent history of the application. Based on the number of available worker threads, the partitionable operation can be partitioned into a number of sub operations and executed in parallel.Type: GrantFiled: April 1, 2016Date of Patent: May 29, 2018Assignee: SAP SEInventors: Anastasia Ailamaki, Tobias Scheuer, Iraklis Psaroudakis, Norman May
-
Publication number: 20180011737Abstract: Scheduling jobs from an application based on a job concurrency hint. The job concurrency hint providing an indication of the number and/or size of the jobs that can be handled by the job scheduler. The scheduling of the jobs based on the job concurrency hint including selecting the number and/or size of the jobs to pass to the job scheduler for execution by a thread in a core of a processor.Type: ApplicationFiled: July 8, 2016Publication date: January 11, 2018Inventor: Tobias Scheuer
-
Patent number: 9740525Abstract: In a computing system having a multiple central processing unit (CPU) cores the task scheduler can be configured to generate one or more priority value lists of elements, with each priority value list comprising elements having the same priority value. The priority queue of a task scheduler can be populated by links to priority value lists that are arranged in order of priority. Worker threads can access an input SIAO and determine the maximum priority of any element in the input SIAO. If the input SIAO has an element with higher priority than the priority queue of the task scheduler then the worker thread can cause the task associated with that element to be processed, otherwise the worker thread can cause all of the elements of the SIAO to be put into the priority value lists linked to by the elements in the priority queue.Type: GrantFiled: November 18, 2015Date of Patent: August 22, 2017Assignee: SAP SEInventor: Tobias Scheuer
-
Publication number: 20170220446Abstract: Computing threads can be sampled such that the samples hit each activity with a probability proportional to a time period of that activity. Therefore, the sampling can advantageously account for all activities, including activities that are smaller than the applicable sampling interval.Type: ApplicationFiled: April 17, 2017Publication date: August 3, 2017Inventors: Tobias Scheuer, Daniel Booss
-
Publication number: 20170139745Abstract: In a computing system having a multiple central processing unit (CPU) cores the task scheduler can be configured to generate one or more priority value lists of elements, with each priority value list comprising elements having the same priority value. The priority queue of a task scheduler can be populated by links to priority value lists that are arranged in order of priority. Worker threads can access an input SIAO and determine the maximum priority of any element in the input SIAO. If the input SIAO has an element with higher priority than the priority queue of the task scheduler then the worker thread can cause the task associated with that element to be processed, otherwise the worker thread can cause all of the elements of the SIAO to be put into the priority value lists linked to by the elements in the priority queue.Type: ApplicationFiled: November 18, 2015Publication date: May 18, 2017Inventor: TOBIAS SCHEUER
-
Patent number: 9632902Abstract: Computing threads can be sampled such that the samples hit each activity with a probability proportional to a time period of that activity. Therefore, the sampling can advantageously account for all activities, including activities that are smaller than the applicable sampling interval.Type: GrantFiled: March 17, 2015Date of Patent: April 25, 2017Assignee: SAP SEInventors: Tobias Scheuer, Daniel Booss
-
Publication number: 20170017674Abstract: Techniques and solutions are provided for performing adaptive database table placement in a non-uniform memory access (NUMA) architecture. The adaptive table placement can occur in response to changing workloads on the NUMA nodes. For example, if a particular NUMA node is saturated, a database table may be moved from the memory of the saturated NUMA node to the memory of another NUMA node that is underutilized. In some cases, an entire database table is moved, while in other cases the database table is partitioned and only part of the table is moved.Type: ApplicationFiled: July 17, 2015Publication date: January 19, 2017Inventors: Tobias Scheuer, Iraklis Psaroudakis, Abdelkader Sellami, Norman May, Anastasia Ailamaki