Abstract: A plurality of virtual files are instantiated in a columnar database. The columnar database includes a columnar data store that persists tables of data contained therein to the plurality of virtual files. Each virtual file is stored in physical data storage and a portion of the virtual file can be cached transiently in a persistence layer intermediate the columnar data store and the physical data storage. The virtual files each comprise a database object for storing data records. Operation are processed, in the columnar database, using the virtual files such that changes to virtual files resulting from the operations of one transaction are isolated from changes on the same virtual files resulting from the operations of other transactions. Related apparatus, systems, techniques and articles are also described.

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

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

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

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

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

Abstract: A plurality of virtual files are instantiated in a columnar database. The columnar database includes a columnar data store that persists tables of data contained therein to the plurality of virtual files. Each virtual file is stored in physical data storage and a portion of the virtual file can be cached transiently in a persistence layer intermediate the columnar data store and the physical data storage. The virtual files each comprise a database object for storing data records. Operation are processed, in the columnar database, using the virtual files such that changes to virtual files resulting from the operations of one transaction are isolated from changes on the same virtual files resulting from the operations of other transactions. Related apparatus, systems, techniques and articles are also described.

Abstract: A method for providing a planning framework for use in managing a project to be planned in a supply chain, comprising providing a first software layer for storing and manipulating planning data relative to the planning project; providing a second software layer for communicating with the first software layer, the second layer arranged for pre processing, preparing and post processing a predetermined planning method. By such a multilayered framework, the invention is able to execute a planning algorithms to solve multi-level planning problems, wherein generic modules can be executed as fast modules in an environment that is highly optimized in terms of load on time and system resources and specifically adapted modules are embodying a particular planning strategy that can operate on a different level that is highly flexible.

Abstract: During execution of a program, an error is detected which results in the program reverting to a predefined state prior to the detected error. In some variations, the predefined state is a rollback point. Thereafter, one or more analysis tools are automatically activated that can characterize performance of the program and the execution of the program is recommenced until the error is detected. The analysis tools can then provide information useful for analyzing the cause of the error such as a trace log.

Abstract: A system may associate a first activity of a group of activities with a first resource, a first start time on the first resource, and a first end time on the first resource, associate a second activity of the group of activities with a second resource, a second start time on the second resource, and a second end time on the second resource, and resolve a maximum constraint of the first activity and a maximum constraint of the second activity after the association of the first activity with the first resource and the association of the second activity with the second resource.

Abstract: A system may associate a first activity of a group of activities with a first resource, a first start time on the first resource, and a first end time on the first resource, associate a second activity of the group of activities with a second resource, a second start time on the second resource, and a second end time on the second resource, and resolve a maximum constraint of the first activity and a maximum constraint of the second activity after the association of the first activity with the first resource and the association of the second activity with the second resource.

Abstract: During execution of a program, an error is detected which results in the program reverting to a predefined state prior to the detected error. In some variations, the predefined state is a rollback point. Thereafter, one or more analysis tools are automatically activated that can characterize performance of the program and the execution of the program is recommenced until the error is detected. The analysis tools can then provide information useful for analyzing the cause of the error such as a trace log.

Abstract: A system and method are described for performing bucket-oriented capacity checks on resources to determine whether activities can be processed prior to a desired delivery date.

Abstract: A method for providing a planning framework for use in managing a project to be planned in a supply chain, comprising providing a first software layer for storing and manipulating planning data relative to the planning project; providing a second software layer for communicating with the first software layer, the second layer arranged for pre processing, preparing and post processing a predetermined planning method. By such a multilayered framework, the invention is able to execute a planning algorithms to solve multi-level planning problems, wherein generic modules can be executed as fast modules in an environment that is highly optimized in terms of load on time and system resources and specifically adapted modules are embodying a particular planning strategy that can operate on a different level that is highly flexible.

Abstract: Disclosed is a mechanism to control telecommunication connections via digital switching networks like the ISDN. Frequently observed scenarios are a caller who is connected to an answering machine, although he intended to talk to a human individual, or where a node is shared by more than one individual and the caller wants to talk to a definite person likewise. Subscriber information is interchanged between a calling device and a called device before setting up the connection which is utilized to inform the caller about the device type at the called side or to inform the called side about the desired person. In the ISDN, a called device sends an ALERTING message to a switching center before accepting the connection. The switching center forwards a part of that message to the calling device which includes the so-called USER—USER Information Element (UUIE). In that USER—USER IE, an information like “UNDER THE CALLED NUMBER AN ANSWERING MACHINE IS BECOMING ACTIVE” can be coded.

Abstract: In a process and a system for automatic, computer-system-supported optimization and the search for a state x dependent on at least one parameter P, for which f(x) as a measure of the quality of x assumes an extremum, an initial solution, i.e. a state x, is found as an initial state and a further state y different from x is found by means of an elementary change in an individual parameter P from x. If the result of a comparison of the target function values f(x) and f(y) is that f(y) is poorer than f(x) by more than a threshold value T, y is rejected, x is retained and a fresh adjacent state of x is found. If f(y) is at least as great as f(x)-T, there is a transition to state y. The threshold T is successively reduced to zero.