Scaling priority queue for task scheduling

    公开(公告)号:US09740525B2

    公开(公告)日:2017-08-22

    申请号:US14945262

    申请日:2015-11-18

    Applicant: SAP SE

    Inventor: Tobias Scheuer

    CPC classification number: G06F9/4881

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

    FLEXIBLE LIMITERS FOR MANAGING RESOURCE DISTRIBUTION

    公开(公告)号:US20240427630A1

    公开(公告)日:2024-12-26

    申请号:US18338623

    申请日:2023-06-21

    Applicant: SAP SE

    Abstract: The present disclosure relates to computer-implemented methods, software, and systems for flexibly managing limits for execution of jobs in parallel threads provided by a system. A request for the execution of a first statement at one or more threads associated with parallel processing at the system is received. A first snapshot object of an initial hierarchy of workload classes is obtained. The first snapshot object includes pointers to limiters defined for the workload classes and statements within the initial hierarchy. Each limiter defines an allowable number of threads for parallel execution of jobs. A modification to the hierarchy of workload classes is performed during runtime of the one or more jobs. A second snapshot object of a modified hierarchy of the workload classes. The execution of one or more created jobs is completed based on complying with limits as aggregately calculated for the first statement.

    Parallel load of mapping containers for database system start and restart operations

    公开(公告)号:US11429388B2

    公开(公告)日:2022-08-30

    申请号:US16883241

    申请日:2020-05-26

    Applicant: SAP SE

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

    Optimizing job execution in parallel processing with improved job scheduling using job currency hints

    公开(公告)号:US10459760B2

    公开(公告)日:2019-10-29

    申请号:US15206186

    申请日:2016-07-08

    Applicant: SAP SE

    Inventor: Tobias Scheuer

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

    ADAPTIVE TABLE PLACEMENT IN NUMA ARCHITECTURES
    6.
    发明申请
    ADAPTIVE TABLE PLACEMENT IN NUMA ARCHITECTURES 审中-公开
    NUMA建筑中的自适应桌布置

    公开(公告)号:US20170017674A1

    公开(公告)日:2017-01-19

    申请号:US14802580

    申请日:2015-07-17

    Applicant: SAP SE

    CPC classification number: G06F16/2282

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

    Abstract translation: 提供了技术和解决方案,用于在非均匀存储器访问(NUMA)架构中执行自适应数据库表放置。 自适应表放置可以响应于NUMA节点上的工作负载变化而发生。 例如,如果特定的NUMA节点饱和,则数据库表可以从饱和NUMA节点的存储器移动到未充分利用的另一个NUMA节点的存储器。 在某些情况下,整个数据库表被移动,而在其他情况下,数据库表被分区,只有表的一部分被移动。

    PARALLEL LOAD OF MAPPING CONTAINERS FOR DATABASE SYSTEM START AND RESTART OPERATIONS

    公开(公告)号:US20210373893A1

    公开(公告)日:2021-12-02

    申请号:US16883241

    申请日:2020-05-26

    Applicant: SAP SE

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

    Savepoint critical phase lock job inhibitor

    公开(公告)号:US11042527B2

    公开(公告)日:2021-06-22

    申请号:US15980525

    申请日:2018-05-15

    Applicant: SAP SE

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

    Job Execution Using System Critical Threads
    9.
    发明申请

    公开(公告)号:US20190340017A1

    公开(公告)日:2019-11-07

    申请号:US15970730

    申请日:2018-05-03

    Applicant: SAP SE

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

    OPTIMIZING JOB EXECUTION IN PARALLEL PROCESSING

    公开(公告)号:US20180011737A1

    公开(公告)日:2018-01-11

    申请号:US15206186

    申请日:2016-07-08

    Applicant: SAP SE

    Inventor: Tobias Scheuer

    CPC classification number: G06F9/4881

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

Patent Agency Ranking