Abstract: This technique improves energy efficiency of MapReduce system by using system performance model without changing any component of the MapReduce system. This involves determining presence of any hardware bottleneck in any node of MapReduce system based on a system performance model and if any hardware bottleneck is present in any node, then the maximum bandwidth value of hardware associated with the bottleneck of each node is determined. Thereafter, an energy efficient value of Central Processing Unit (CPU) frequency of each node having the bottleneck is determined by using the system performance model and the maximum bandwidth value of hardware associated with the bottleneck. Further, the CPU frequency of each node having the bottleneck is set at the energy efficient value determined in the earlier step.

Abstract: Methods and apparatus are provided for data operation pre-processing with a probabilistic estimation of operation value. An exemplary method comprises extracting feature values from a data set; identifying a set of operations that previously processed data sets comprising the extracted feature values; determining whether to execute an operation from the set of operations before an explicit request for the execution of the operation based on a probabilistic evaluation of a value of pre-processing the operation; and executing a set of instructions for the operation when it is determined that the operation is to be executed. The set of instructions comprises, e.g., stopping execution of other operations being executed, freeing resources required by the operation, and/or allocating resources required by the operation.

Abstract: A computer-implemented method, a system and a computer program product for processing third party online coupons. According to one embodiment, a third-party online coupon is received. Text is parsed to determine a merchant's website. The third-party online coupon description is parsed to determine a product term. The product term is searched for. The third-party online coupon is tested with a product associated with the product term. The third-party online coupon is determined if valid with the product.

Abstract: An apparatus and a job scheduling method are provided. For example, the apparatus is a multi-core processing apparatus. The apparatus and method minimize performance degradation of a core caused by sharing resources by dynamically managing a maximum number of jobs assigned to each core of the apparatus. The apparatus includes at least one core including an active cycle counting unit configured to store a number of active cycles and a stall cycle counting unit configured to store a number of stall cycles and a job scheduler configured to assign at least one job to each of the at least one core, based on the number of active cycles and the number of stall cycles. When the ratio of the number of stall cycles to a number of active cycles for a core is too great, the job scheduler assigns fewer jobs to that core to improve performance.

Abstract: In some embodiments, techniques include identifying a plurality of tasks associated with an identifier corresponding to an electronic device. A task series is generated so as to include the plurality of tasks, where each task in the series is associated with a performance time. When it is determined that the task has not been completed by the performance time, the task series is updated.

Abstract: Systems and methods for multi-mode radiation hardened multi-core microprocessors are disclosed. In some embodiments, a triplicated circuit includes a first core logic, a second core logic, a third core logic, and bus arbitration and control circuitry. The triplicated circuit is configurable to operate in both a Triple-Modular Redundant (TMR) mode of operation and a multi-threaded mode of operation. In some embodiments, there is essentially no overhead in soft mode and low overhead (power only) in hard mode. In most applications, it is expected that portions of missions require very hard systems (e.g., landing) where a failure is catastrophic. However, other portions require essentially no hardening (digital signal processor and signal processing activities) but much better throughput. Consequently, there is a huge opportunity to develop computer processors with low overhead in soft mode and unprecedented hardness in hard mode.

Abstract: A computing system is provided and includes first and second computing resources defined, during system initialization, as first kernel threads and a second kernel thread with which the first kernel threads are operably associated, a memory manager and a re-prioritization controller. The memory manager is configured to handle a portion of pending input/output (I/O) operations at an interrupt level and to offload a remainder of the pending I/O operations to the first kernel threads according to an offload condition whereby the offloaded I/O operations are queued according to a first scheme. The re-prioritization controller is configured to transfer a portion of the offloaded I/O operations from the first kernel threads to the second kernel thread according to a transfer condition whereby the transferred I/O operations are re-prioritized according to a second scheme.

Abstract: Methods, apparatus, systems and articles of manufacture to distribute a workload for execution are disclosed. An example apparatus includes a workload container interface to access a workload for execution at a remote device, the workload including workload instructions and a specified capability to be met by the remote device. A runtime selector is to select the remote device for execution of the workload based on the specified capability being present in a list of capabilities discovered for the remote device. A workload transmitter to transmit, in response to the selection of the remote device for execution of the workload, the workload to the remote device for execution.

Abstract: Methods and systems for performing MapReduce optimization for partitioned intermediate output are disclosed. Partitions of a set of input data are provided to a plurality of worker nodes. Each worker node performs a first stage of computation on a respective partition of the input data to produce a respective partition of intermediate output data. Each worker node performs a sort operation on the respective partition of intermediate output data to produce a respective partition of sorted intermediate output data. Each worker node performs a second stage of computation on the respective partition of sorted intermediate output data to produce a respective partition of final output data.

Abstract: To reduce the overall computation time of a batch of queries, multiple query optimization in SQL-on-Hadoop systems groups multiple MapReduce jobs converted from queries into a single one, thus avoiding redundant computations by taking sharing opportunities of data scan, map function and map output. SQL-on-Hadoop converts a query into a DAG of MapReduce jobs and each map function is a part of query plan composed of a sequence of relational operators. As each map function is a part of query plan which is usually complex and heavy, disclosed method creates a cost model to simulate the computation time which takes both I/O cost for reading/writing input file and intermediate data and CPU cost for the computation of map function into consideration. A heuristic algorithm is disclosed to find near-optimal integrated query plan for each group based on an observation that each query plan is locally optimal.

Abstract: A system, method, and computer-readable medium are disclosed for performing a core optimization operation, comprising: enabling all of a plurality of processor cores of a processor; selectively turning off at least one of the plurality of processor cores, the selectively turning off the at least one of the plurality of processor cores being based upon an application to be executed by the processor, the selectively turning off being performed dynamically during runtime of the processor; and, controlling process thread distribution to the plurality of processor cores via an operating system executing on the processor, the process thread distribution not distributing threads to the turned off at least one of the plurality of processor cores.

Abstract: Various systems and methods are provided for accessing and traversing one or more complex data structures and generating a functional user interface that can enable non-technical users to quickly and dynamically edit and generate detailed reports. The user interfaces are interactive such that a user may make selections, provide inputs, and/or manipulate outputs. In response to various user inputs, the system automatically accesses and traverses complex data structures (including, for example, a mathematical graph having nodes and edges), calculates complex data based on the traversals, displays the calculated complex data to the user, and/or enters the calculated complex data into the reports. The reports may be automatically updated based on a context selected by the user, and the system may automatically publish reports in multiple contexts.

Abstract: A system, such as a system of a computing resource service provider, tracks infrastructure-level changes to execution environments caused by or otherwise associated with activity associated with executable code. In one embodiment, the activity is associated with development and/or testing of the executable code, and a monitoring service generates a log of changes to the associated infrastructure caused by the activity over a designated period of time. The log of changes is used to generate a template that in turn causes configuration of a target execution environment in accordance with the monitored changes.

Abstract: The systems and methods described herein can be used to provide virtual service environments. In one embodiment, a virtual service model is generated by detecting one or more transactions, each of which includes a request sent from a requester to a software service and a response sent from the software service to the requester; storing information describing the detected transactions in a virtual service model, where the information describing each transaction includes information identifying a command included in the request and information identifying a response attribute included in the response; and generating information describing an unknown transaction, where the information describing the unknown transaction includes information identifying a first command and information identifying a first response attribute. The first command and the first response attribute are copies of a corresponding command and a corresponding response attribute associated with a corresponding one of the detected transactions.

Abstract: A system and method for planning radar missions. The system includes a processing unit and a display. The method includes estimating the execution time of a plurality of radar tasks to be executed periodically at respective planned repetition rates, and assessing, using rate monotonic scheduling, whether the tasks can be executed at their respective planned repetition rates. The display may be employed to display a graphical representation of a path to be flown repeatedly by the aircraft, and, superimposed on the displayed path, symbols indicating whether at any point on the path the radar will be able to execute each task at its respective planned repetition rate, and whether each of a plurality of areas to be surveyed by the radar, each corresponding to a respective radar task, is in the field of view pattern of the radar.

Abstract: A savepoint is initiated in an in-memory database system that is associated with a plurality of modified pages and comprises a pre-critical phase, a critical phase, and a post-critical phase. Thereafter, as part of the critical phase, a physical page number is assigned to each page in the critical phase. Further, as part of the critical phase, each page assigned a physical page number is individually locked. Subsequently, each page is handed over from a corresponding first thread to a corresponding second thread to copy such page into a corresponding shadow page as part of the post-critical phase.

Abstract: A method for designing a system on a target device includes performing a high-level compilation of a computer program language description of the system to generate a hardware description language (HDL) of the system. The high-level compilation performs optimizations in response to profile data obtained from an earlier compilation of the system.

Abstract: A predictive modeling method may include obtaining a fitted, first-order predictive model configured to predict values of output variables based on values of first input variables; and performing a second-order modeling procedure on the fitted, first-order model, which may include: generating input data including observations including observed values of second input variables and predicted values of the output variables; generating training data and testing data from the input data; generating a fitted second-order model of the fitted first-order model by fitting a second-order model to the training data; and testing the fitted, second-order model of the first-order model on the testing data. Each observation of the input data may be generated by (1) obtaining observed values of the second input variables, and (2) applying the first-order predictive model to corresponding observed values of the first input variables to generate the predicted values of the output variables.

Abstract: A method includes receiving from a networked spoke device information describing network flows to and from an application, analyzing the information to characterize the application in at least one dimension selected from the group consisting of bi-directional bandwidth usage, network response times, application response times, a number of idle and active application sessions and a maximum number of concurrent application sessions and transmitting the dimensions to at least one networked spoke device as traffic profile information.

Abstract: Decoupling trace data streams using cache coherence protocol (CCP) data. One or more trace data streams include cache activity trace data and CCP trace data relating to executing a plurality of threads. The cache activity trace data includes inter-thread data dependencies comprising dependent cache activity trace entries, which each record a corresponding memory access by a corresponding thread in reliance on traced CCP dependence between threads. The inter-thread data dependencies are removed to create independent cache activity trace data for each of the plurality of threads that enables each thread to be replayed independently. The removal includes, for each dependent cache activity trace entry (i) identifying a corresponding value of the corresponding memory access by the corresponding thread based on the traced CCP dependence between threads, and (ii) recording the corresponding value of the corresponding memory access on behalf of the corresponding thread.

Abstract: Embodiments for graphical processing unit (GPU) resource sharing in a computing cluster, by a processor device. Resource-specific stages are dynamically generated in a directed acyclic graph (DAG) using a DAG interpreter for a set of tasks by creating equivalence stages in the DAG having an associated inserted set of shuffle stages, the equivalence stages created based on a determined cost of each stage of the set of shuffle stages. Backlog tasks are scheduled and tasks within the set of tasks are shifted among respective stages in the equivalence stages according to the determined cost to avoid overlapping allocation of the GPU resource during central processing unit (CPU) execution of the respective tasks of the set of tasks.

Abstract: Techniques for placing virtual machines based on compliance of device profiles are disclosed. In one embodiment, a list of device profiles may be maintained, with each device profile including details of at least one virtual device and associated capabilities. Further, a device profile from the list of device profiles may be assigned to a virtual machine running on a first host computing system. A virtual device and associated configurations required by the virtual machine may be identified to comply with the device profile. A management operation may be performed to migrate or clone the virtual device and associated configurations from a second host computing system to the first host computing system to support the compliance of the device profile assigned to the virtual machine.

Abstract: A data processing method for a data processing system, comprising: initializing a value of a counter associated with a first entry to indicate a number of destinations of other entries on which the first entry depends; changing the value of the counter in a first direction in response to selecting a first one of the other entries; and changing the value of the counter in a second direction opposite the first direction in response to cancelling a second one of the other entries.

Abstract: A browser system divides content pages into tiles for display on a user device, and updates the tiles that become “damaged” as the result of user interactions or other events. The browser system may decide whether and/or when to update a damaged off-screen tile based on one or more of the following (1) a predicted likelihood that the user will scroll to that tile or that the tile will otherwise become visible on the user device, (2) the cost (in terms of processing resources) of updating the tile, as may be estimated based on the processing resources used to initially generate the tile, (3) a measure of visual impact associated with deferring the update.

Abstract: A communication network allows an end user to dynamically select a user device among user devices associated with the user's subscription as the primary user device by defining a primary capability tag or attribute. Selection of a user device sets the primary capability tag of the selected user device, which is published towards an application server. The application server notifies all other user devices in the group of devices. If a previous user device in the group of user devices was set as the primary user device, then, in response to the notification, the previous user device performs a re-registration with the network removing the previous user device as the primary user device for the services associated with the user subscription. The selected user device also performs a re-registration/registration with the network so all incoming requests for services associated with the user subscription are sent to the selected user device.

Abstract: An information processing system includes: a memory to store, for each one of a plurality of applications for providing a specific application, flow information defining a series of processes to be executed on electronic data to provide the specific service of the application; and application state information indicating whether the application is available; and circuitry to: in response to a request from the electronic device, control a display of the electronic device to display a screen for allowing selection of one or more of the plurality of applications whose application state information indicates that the application is available, and in response to reception of a selection of one of the one or more applications that are selectable, control the electronic device to execute the series of processes on the electronic data according to the flow information of the selected application.

Abstract: A computing resource associated with a user is scheduled to undergo a transition. Prior to the scheduled transition, the computing resource is placed in a pending state. The user is notified that the computing resource is scheduled to undergo the transition. In response to an input received from the user, the computing resource is allowed to undergo the transition when the input indicates that the transition can proceed.

Abstract: A memory device receiving a host instruction generated by a host includes a flash memory array and a controller. The controller translates the host instruction into operation instructions, queues the operation instructions in a major command queue, and performs an operation on the flash memory array according to the operation instructions. When an error occurs during execution of the operation commands, the controller performs an error-handling process, queues operation commands related to the error-handling process in an auxiliary command queue, sequentially executes the operation commands in the auxiliary command queue, and stops executing the major command queue.

Abstract: A method of scheduling tasks within a GPU or other highly parallel processing unit is described which is both age-aware and wakeup event driven. Tasks which are received are added to an age-based task queue. Wakeup event bits for task types, or combinations of task types and data groups, are set in response to completion of a task dependency and these wakeup event bits are used to select an oldest task from the queue that satisfies predefined criteria.

Abstract: Decoupling trace data streams using cache coherence protocol (CCP) data. One or more trace data streams include cache activity trace data and CCP trace data relating to executing a plurality of threads. The cache activity trace data includes inter-thread data dependencies comprising dependent cache activity trace entries, which each record a corresponding memory access by a corresponding thread in reliance on traced CCP dependence between threads. The inter-thread data dependencies are removed to create independent cache activity trace data for each of the plurality of threads that enables each thread to be replayed independently. The removal includes, for each dependent cache activity trace entry (i) identifying a corresponding value of the corresponding memory access by the corresponding thread based on the traced CCP dependence between threads, and (ii) recording the corresponding value of the corresponding memory access on behalf of the corresponding thread.

Abstract: Methods and systems for providing assistance in scheduling a plurality of tasks pertaining to a project are described. The method may include obtaining information pertaining to each of the plurality of tasks associated with the project for scheduling execution of the plurality of tasks. Further, the method may include computing a certainty index and a controllability index for each of the plurality of tasks. The certainty index and the controllability index is computed based on corresponding certainty scores and controllability scores determined for each of the plurality of tasks. The method also includes distributing the plurality of tasks into quadrants based on a threshold value determined for the certainty index and the controllability index. In addition, the method may include generating a sequence of execution of the plurality of tasks of the project based on the division of the tasks.

Abstract: One embodiment of the present invention is a computer-implemented method for scheduling a thread group for execution on a processing engine that includes identifying a first thread group included in a first set of thread groups that can be issued for execution on the processing engine, where the first thread group includes one or more threads. The method also includes transferring the first thread group from the first set of thread groups to a second set of thread groups, allocating hardware resources to the first thread group, and selecting the first thread group from the second set of thread groups for execution on the processing engine. One advantage of the disclosed technique is that a scheduler only allocates limited hardware resources to thread groups that are, in fact, ready to be issued for execution, thereby conserving those resources in a manner that is generally more efficient than conventional techniques.

Abstract: A data processing device is provided that includes a plurality of hardware data processing nodes, wherein each hardware data processing node is configured to execute a task, and a hardware thread scheduler coupled to the plurality of hardware data processing nodes, the hardware thread scheduler configurable to concurrently execute a first thread of tasks and a second thread of tasks on the plurality of hardware data processing nodes.

Abstract: Recovery of a database system can be initiated by taking the database system offline. Thereafter, recovery operations specified by a redo log of the database system are replayed. During the replaying, updates to pages implicated by the recovery operations are blocked. In parallel, modified pages are flushed to physical disk storage. The database is later brought online after all of the recovery operations are replayed.

Abstract: A data processing system includes a power manager for providing a power event depth signal in response to a power event request signal. A plurality of real-time clients is coupled to the power manager. Each real-time client includes a client buffer that has a plurality of entries for storing data. The real-time client also includes a register for storing a watermark threshold for the client buffer, as well as logic for providing an allow signal when a number of valid entries in the client buffer exceeds the watermark threshold. A power management state machine is coupled to each of the plurality of real-time clients. The power management state machine provides a power event start signal in response to all of the plurality of real-time clients providing respective allow signals.

Abstract: A technique for efficient time-division of resources in a virtualized accelerated processing device (“APD”) is provided. In a virtualization scheme implemented on the APD, different virtual machines are assigned different “time-slices” in which to use the APD. When a time-slice expires, the APD performs a virtualization context switch by stopping operations for a current virtual machine (“VM”) and starting operations for another VM. Typically, each VM is assigned a fixed length of time, after which a virtualization context switch is performed. This fixed length of time can lead to inefficiencies. Therefore, in some situations, in response to a VM having no more work to perform on the APD and the APD being idle, a virtualization context switch is performed “early.” This virtualization context switch is “early” in the sense that the virtualization context switch is performed before the fixed length of time for the time-slice expires.

Abstract: One or more embodiments may provide a method for performing a replay. The method includes initiating execution of a program, the program having a plurality of sets of instructions, and each set of instructions has a number of chunks of instructions. The method also includes intercepting, by a virtual machine unit executing on a processor, an instruction of a chunk of the number of chunks before execution. The method further includes determining, by a replay module executing on the processor, whether the chunk is an active chunk, and responsive to the chunk being the active chunk, executing the instruction.

Abstract: Systems, methods, and apparatuses relating to configurable network-based dataflow operator circuits are described. In one embodiment, a processor includes a spatial array of processing elements, and a packet switched communications network to route data within the spatial array between processing elements according to a dataflow graph to perform a first dataflow operation of the dataflow graph, wherein the packet switched communications network further comprises a plurality of network dataflow endpoint circuits to perform a second dataflow operation of the dataflow graph.

Abstract: Methods and systems of detection of presence in and delivery to location are provided. A method detects a presence of a mobile device within a perimeter of a geographic region. The method searches a database to determine whether the first mobile device is associated with any existing account. Responsive to determining that the mobile device is associated with a first account, the method searches the database to determine whether there is any pending task associated with the first account. Responsive to determining that there is a pending task associated with the first account, the method transmits a first message indicating the detection of presence of the mobile device associated with the first account. The method determines that the mobile device is at least approximately at a first location of a plurality of predefined locations within the perimeter. The method transmits information associated with the first location to the computing device.

Abstract: A system includes a scheduling unit for scheduling jobs to resources, and a library unit having a machine map of the system and a global status map of interconnections of resources. The library unit determines a free map of resources to execute the job to be scheduled, the free map indicating the interconnection of resources to which the job in a current scheduling cycle can be scheduled. A monitoring unit dispatches a job to the resources in the free map which match the resource mapping requirements of the job and fall within the free map.

Abstract: An approach is provided for generating a volatility index for weather data. The approach involves retrieving weather data collected from one or more weather sensors over a temporal domain, a spatial domain, or a combination thereof. The one or more weather sensors provide the weather data for at least one geographic point. The approach also involves processing the weather data to determine volatility data for at least one weather attribute, wherein the volatility data represents how much the at least one weather attribute changes over the temporal domain, the spatial domain, or a combination thereof. The approach further involves generating a volatility index to represent the volatility data.

Abstract: The disclosed technology includes techniques for preserving battery life of a mobile device by monitoring a mobile device to determine a state of inactivity. A state of inactivity may be determined if the screen of the mobile device is off and the mobile device remains stationary for a period of time. Battery life may be preserved by placing the mobile device and/or a mobile application of the mobile device into an idle state for successive idle periods separated by maintenance periods. When in an idle state, the mobile device and/or a mobile application of the mobile device may be prevented from utilizing various features or functions of the mobile device that may tend to drain the battery. The mobile device and/or mobile application may be granted temporary access to the various features and functions during the maintenance periods to temporarily allow the mobile device and/or mobile application to perform updates.

Abstract: Time to live (“TTL”) values are determined based on one or more factors. The TTL values may be included in responses to requests for resources, thereby affecting the frequency of subsequent requests. This dynamic determination of TTL values may provide resilience to system load, for example by using longer TTL values when the system is under greater load in order to reduce the rate at which subsequent requests are received. A dynamic TTL service may calculate a TTL value based on one or more factors, such as overall system load, resource load, hardware load, and/or software load. In various embodiments, a dynamic TTL service may act natively within a service, within a system framework, as a proxy, as a cluster, and/or as a broker.

Abstract: Methods, systems, and apparatus, including computer programs encoded on computer storage media, for dynamic graph performance monitoring. One of the methods includes receiving input data by the data processing system, the input data provided by an application executing on the data processing system. The method includes determining a characteristic of the input data. The method includes identifying, by the application, a dynamic component from multiple available dynamic components based on the determined characteristic, the multiple available dynamic components being stored in a data storage system. The method includes processing the input data using the identified dynamic component. The method also includes determining one or more performance metrics associated with the processing.

Abstract: The techniques disclosed herein provide a dynamically configurable cluster of storage devices. In some configurations, the dynamically configurable cluster is associated with a fault domain. The cluster may include a plurality of computing devices that each include at least a storage device. The plurality of storage devices in the cluster may be configured to support a plurality of workloads coupled to the dynamically configurable cluster. The plurality of storage devices in the dynamically configurable cluster may be allocated to one or more of the plurality of workloads based on metadata identified resiliency requirements, performance requirements, and/or cost factors linked to the one or more of the plurality of workloads.

Abstract: Systems for distributed resource management. A method for deploying two or more computing workloads across heterogeneous computing systems commences upon establishing network communications between an on-premises computing system and a cloud computing system. Resource data corresponding to the on-premises resources and the cloud resources are collected continuously and saved as a time series history of observations. Upon a user request or other event, workload placement planning commences. A set of workload placement plans are generated, which workload placement plans are then evaluated in accordance with one or more quantitative objectives. Scheduling commands to carry out the workload placement plans are generated. A first portion of the scheduling commands is executed at the cloud computing system, and another portion of the scheduling commands is executed at the on-premises computing system.

Abstract: Systems, methods, and apparatuses relating to a configurable spatial accelerator are described. In an embodiment, a processor includes a plurality of processing elements; and an interconnect network between the plurality of processing elements to receive an input of a dataflow graph comprising a plurality of nodes, wherein the dataflow graph is to be overlaid into the interconnect network and the plurality of processing elements with each node represented as a dataflow operator in the plurality of processing elements, and the plurality of processing elements are to perform an atomic operation when an incoming operand set arrives at the plurality of processing elements.

Abstract: Power consumption in a microprocessor platform is managed by setting a peak power level for power consumed by a multi-core microprocessor platform executing multi-threaded applications. The multi-core microprocessor platform contains a plurality of physical cores, and each physical core is configurable into a plurality of logical cores. A simultaneous multithreading level in at least one physical core is adjusted by changing the number of logical cores on that physical core in response to a power consumption level of the multi-core microprocessor platform exceeding the peak power level. Performance and power data based on simultaneous multi-threading levels are used in selecting the physical core to be adjusted.

Abstract: Systems and methods provide an extensible, multi-stage, realtime application program processing load adaptive, manycore data processing architecture shared dynamically among instances of parallelized and pipelined application software programs, according to processing load variations of said programs and their tasks and instances, as well as contractual policies. The invented techniques provide, at the same time, both application software development productivity, through presenting for software a simple, virtual static view of the actually dynamically allocated and assigned processing hardware resources, together with high program runtime performance, through scalable pipelined and parallelized program execution with minimized overhead, as well as high resource efficiency, through adaptively optimized processing resource allocation.

Abstract: The present invention provides a system capable of properly controlling the switching of the operation state of each of a plurality of arithmetic processing resources according to an increase or a decrease in an arithmetic processing load. A distributed processing control system 10 includes a load estimation unit 11 that estimates an estimation arithmetic processing load at a first point of time in a future from a reference point of time, and a state control unit 12 that starts the processing for switching the operation state of an arithmetic processing resource Sj so as to satisfy a first condition, in which the estimated arithmetic processing load is included in a predetermined range of an estimation processing capacity of the arithmetic processing resource Sj expected to be activated at the first point of time.