Abstract: A cryptocurrency mining method and a cryptocurrency mining controller device are provided. The method includes: obtaining electricity price information and cryptocurrency price information; determining operation control parameters of the cryptocurrency mining system according to the electricity price information and the cryptocurrency price information; and controlling an operation of a target group of cryptocurrency miners according to the operation control parameters. The operation includes switching between operation states, and the operation states includes at least a running state and an off state.

Abstract: A method of populating page tables of an executing workload during migration of the executing workload from a source host to a destination host includes the steps of: before resuming the workload at the destination host, populating the page tables of the workload at the destination host, wherein the populating comprises inserting mappings from virtual addresses of the workload to physical addresses of system memory of the destination host; and upon completion of populating the page tables, resuming the workload at the destination host.

Abstract: Techniques are provided for adaptive resource allocation for multiple workloads. One method comprises obtaining a dynamic system model based on a relation between an amount of a resource for multiple iterative workloads and a predefined service metric; obtaining an instantaneous value of the predefined service metric; applying to a given controller associated with a given iterative workload of the multiple iterative workloads: (i) the dynamic system model, (ii) an interference effect of one or more additional iterative workloads on the given iterative workload, and (iii) a difference between the instantaneous value and a target value for the predefined service metric. The given controller applies an adjustment to the amount of the resource for the given iterative workload based at least in part on the difference. The resource allocation for the multiple iterative workloads can be performed in a sequence substantially in parallel with an execution of the iterative workloads.

Abstract: A system, device and method for secure message thread communication is provided. The device comprises a communication interface; a display device; and, a controller configured to: generate, at the display device, a plurality of message threads, the plurality of message threads associated with different incident reports; receive multimedia data for transmission in a first message thread of the plurality of message threads; compare the multimedia data with data from the different incident reports; and when an association is determined between the multimedia data and respective data from an incident report associated with a second message thread, of the plurality of message threads: transmit, using the communication interface, the multimedia data in the second message thread, and not the first message thread.

Abstract: Technologies are described for generating, acquiring, transferring, and manipulating sets of interaction representations, where an interaction representation represents user interaction with content on a computer device, typically using a software application. The set can be represented as an interaction representation. To facilitate set creation, including adding items to a set, a request can be sent to an application to provide an interaction representation, such as an interaction representation of a current state of user-content interaction associated with the software application. Sets can be associated with different types, where the set type can determine whether, and what types, of interaction representations can be added to a set. Sets can be associated with expiration events, where the interaction representation for the set, and in some cases the component interaction representations, can be deleted upon the occurrence of the expiration event. In some cases, a set can be designated not to expire.

Abstract: In one embodiment, a method for margin determination for a computing system with a real time operating system and priority preemptive scheduling comprises: scheduling a set of tasks to be executed in one or more partitions, wherein each is assigned a priority, wherein the tasks comprise periodic and/or aperiodic tasks; executing the set of tasks on the computing system within the scheduled periodic time window; introducing an overhead task executed for an execution duration controlled either by the real time operating system or by the overhead task; controlling the overhead task to converge on a point of failure at which a length of the execution duration of the overhead task causes either: 1) a periodic task to fail to execute within a deadline, or 2) time available for the aperiodic tasks to execute to fall below a threshold; and defining a partition margin corresponding to the point of failure.

Abstract: Techniques are disclosed for utilizing directed acyclic graphs for deployment instructions. A computer-implemented method can include various operations. Instructions may be executed by a computing device to perform parses of configuration data associated with a deployment. The computing device may cause a first directed acyclic graph (DAG) to be generated, the first DAG being utilized for deploying a first resource based on the parses. A second DAG may be generated for deploying execution targets based on the parses, the second DAG specifying dependencies between execution targets of the deployment. The computing device may generate a linked list data structure based on the parses and may deploy the computing system by traversal of the linked list data structure.

Abstract: Techniques are provided for allocation of shared computing resources using source code feature extraction and machine learning techniques. An exemplary method comprises obtaining source code for execution in a shared computing environment; extracting a plurality of discriminative features from the source code; obtaining a trained machine learning model; and generating a prediction of an allocation of one or more resources of the shared computing environment needed to satisfy one or more service level agreement requirements for the source code. The generated prediction is optionally adjusted using a statistical analysis of an error curve, based on one or more error boundaries obtained by the trained machine learning model.

Abstract: Systems and methods scale an instance group of a computing platform by determining whether to scale up or down the instance group by using historical data from prior jobs wherein the historical data includes one or more of: a data set size used in a prior related job and a code version for a prior related job. The systems and methods also scale the instance group up or down based on the determination. In some examples, systems and methods scale an instance group of a computing platform by determining a job dependency tree for a plurality of related jobs, determining runtime data for each of the jobs in the dependency tree and scaling up or down the instance group based on the determined runtime data.

Abstract: Examples described herein relate to method and system for determining a response time for an action. A request for an action may be communicated from a source entity to a target entity. The action is generated by the source entity and which is to be responded by the target entity. Further, a response time corresponding to the action may be determined based on prior execution experience of one or more jobs associated with the action and a learning rate. Thereafter, the source entity may be allowed to wait for a response corresponding to a completion of the action from the target entity for at least a time duration corresponding to the response time.

Abstract: Methods of secure resource authorization for external identities using remote principal objects are performed by systems and devices. An external entity creates a user group and defines entitlements to an owning entity's secure resource as a set of permissions for the group. An immutable access template with the permissions and an access policy for the secure resource are provided to the owning entity for approval. On approval, a remote principal object is created in the owner directory according to the permissions and access policy. A remote principal that is a group member requests access via an interface to the owner domain using external domain credentials. The identity of the remote principal is verified against the remote principal object by a token service. Verification causes generation and issuance of a token, with the enumerated entitlements, to the remote principal interface affecting a redirect for access to the secure resource.

Abstract: A data storage apparatus includes a storage device; a controller to control data input and output operations of the storage device; and a swap memory provided in an outside of the controller, wherein the controller includes a thread manager to perform a preparation operation on a first thread included in a task in response to a request for processing the task, request the storage device to process the first thread on which the preparation operation has been performed, perform a preparation operation on at least one subsequent thread following the first thread while the storage device processes the first thread, and store context data of the first thread and the at least one subsequent thread in the swap memory, wherein the task includes the first thread and the at least one subsequent thread, and the preparation operation includes an address mapping operation.

Abstract: A device may receive a job request that requests performance of one or more operations by resources of a high-performance computing environment, and may process the job request, with a policy execution model trained with policy parameters, to identify policies to apply during execution of the job request. The device may process the job request, with a forecast object model trained with job data and profile data, to generate a forecast of resources and licenses required from the high-performance computing environment. The device may process the job request, other job requests, the one or more of the policies, and the forecast, with a heuristic model, to determine a schedule for the job request, and may process the schedule and current constraints on the resources and the licenses, with a linear programming model, to determine an optimized schedule for the job request.

Abstract: Entries in a cluster-to-caching agent map table of a data processing network identify one or more caching agents in a caching agent cluster. A snoop filter cache stores coherency information that includes coherency status information and a presence vector, where a bit position in the presence vector is associated with a caching agent cluster in the cluster-to-caching agent map table. In response to a data request, a presence vector in the snoop filter cache is accessed to identify a caching agent cluster and the map table is accessed to identify target caching agents for snoop messages. In order to reduce message traffic, snoop message are sent only to the identified targets.

Abstract: An apparatus and method of performing a time-based operation on a row in a database table includes receiving a function to be applied to a particular row in a table within the database management system. The method may also include, in response to receiving the function, adding a new column to the table. A new cell in the new column includes a timer indicating a time that the processing device will call the function, and the new cell references the function. The method may also include, upon expiration of the timer, determining that the database management system is available for execution of the function, and executing the function on the particular row in the table.

Abstract: The disclosure herein describes automating runbook operations associated with an application within an application host on an application platform. A runbook definition associated with the application is accessed by a processor, wherein the runbook definition includes trigger events and runbook operations associated with the trigger events. A runbook operator is executed on the application platform based on the accessed runbook definition and a runbook sidecar container is added to the application host by the runbook operator, wherein the runbook operator is enabled to perform the runbook operations within the application host via the runbook sidecar container. Based on detecting a trigger event, a runbook operation associated with the detected trigger event is performed by the runbook operator, via the runbook sidecar container, whereby the application is maintained based on performance of the runbook operations from within the application host.

Abstract: An information processing apparatus includes a first integrated circuit including a first controller that processes data acquired from a device and that controls an operation of the device; a second integrated circuit including a second controller with a higher processing speed than a processing speed of the first controller; and a third integrated circuit including a first connection unit connectable to the device. The third integrated circuit includes a second connection unit connectable to the first integrated circuit, a third connection unit connectable to the second integrated circuit, and a setting unit that, when the device is connected to the first connection unit, sets an integrated circuit to be connected, in accordance with a communication speed of the connected device.

Abstract: The present disclosure provides task delegation and cooperation for automated assistants. In one example, a method performed by a processing system that is in communication with a plurality of automated assistants includes receiving, a query indicating a task with which a user desires assistance, parsing the task into a plurality of sub-tasks including a first sub-task and a second sub-task, identifying a first automated assistant of the plurality of automated assistants that is capable of performing the first sub-task and a second automated assistant of the plurality of automated assistants that is capable of performing the second sub-task, and formulating a proposal for responding to the query, wherein the proposal comprises a sequence in which the plurality of sub-tasks is to be performed and a mapping that assigns the first sub-task to the first automated assistant and the second sub-task to the second automated assistant.

Abstract: A method for scheduling tasks includes receiving input that was acquired using one or more data collection devices, and scheduling one or more input tasks on one or more computing resources of a network, predicting one or more first tasks based in part on the input, assigning one or more placeholder tasks for the one or more predicted first tasks to the one or more computing resources based in part on a topology of the network, receiving one or more updates including an attribute of the one or more first tasks to be executed as input tasks are executed, modifying the one or more placeholder tasks based on the attribute of the one or more first tasks to be executed, and scheduling the one or more first tasks on the one or more computing resources by matching the one or more first tasks to the one or more placeholder tasks.

Abstract: A task management platform generates an interactive display tasks based on multi-team activity data of different geographic locations across a plurality of distributed guided user interfaces (GUIs). Additionally the task management platform uses a distributed machine-learning based system to determine a suggested task item for a remote team based on multi-team activity data of different geographic locations.

Abstract: A method and system for processing media content in Moving Picture Experts Group (MPEG) Network Based Media Processing (NBMP) includes receiving, from an NBMP source, a first message including a workflow descriptor document corresponding to a workflow for processing the media content; obtaining, based on the workflow, a task having a task template; obtaining, based on the task, a function having a function template; and managing the processing of the media content by transmitting, to a media processing entity, a second message instructing the media processing entity to perform the function based on the task. The first message, the workflow descriptor document, the task template, the function template, and/or the second message may be used to signal a scheme for processing the media content.

Abstract: In an asymmetric hardware accelerator system, a hardware accelerator configured to handle workloads of a particular type that have a lowest CPU utilization as compared to workloads of other types being handled by other hardware accelerators configured to handle the other types of workloads is identified. A CPU fallback is conducted of workloads of the identified hardware accelerator to the CPU. While the CPU is handling the workloads, firmware of the identified hardware accelerator is upgraded.

Abstract: Example storage systems and methods provide data storage management using a key data store with progress values. A key data store includes a set of key data entries that each include a key value associated with a storage operation and a timestamp corresponding to a creation time of the key data entry. Storage management processes are executed on the set of key data entries and progress values for the storage management processes are tracked using the timestamps of the key data entries to manage the relative progress of the storage management processes.

Abstract: Examples include a method of switching a packet by a virtual switch by receiving a system call to transmit a packet from a first application running in a first container on a first core, determining a destination for the packet, obtaining a buffer in an application memory space of the destination, copying the packet to the destination application memory space, and writing an entry for the packet to a queue assigned to the destination, the destination queue being in a queue manager. The packet may then be obtained by an entity at the destination.

Abstract: Provided are a computer program product, system, and method for selecting a plurality of processing systems to sort a data set. A determination is made of processing systems to perform a sort of records in a data set. The data set is divided into data subsets, each data subset comprising a portion of the records of the data set. Each of the determined processing systems of is notified of a data subset to sort. In response to receiving notification from the determined processing systems that the records in the data subsets have been sorted, the sorted data subsets are merged into a sorted data set comprising the records of the data set sorted.

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: Systems, methods, and devices relating to video encoding for low-concurrency video channels are described herein. A video processing system may receive a manifest request for an encoded video stream associated with a selected channel. Based on the manifest request, the video processing system may request for a real-time linear (RTL) encoder to be started to encode the input compressed video stream for the channel in real-time. Also based on the manifest request, the video processing system may assign a faster-than-real-time (FTRT) encoder from a pool of already-running FTRT encoders to encode the video stream in real-time until the RTL encoder is fully started. The FTRT encoder may encode at a lower quality level to enable expedited real-time encoding. Based on the RTL encoder being fully started, the video processing system may switch the encoding from the FTRT encoder to the RTL encoder. The FTRT encoder may be returned to the FTRT encoder pool.

Abstract: Systems, apparatuses, and methods for abstracting tasks in virtual memory identifier (VMID) containers are disclosed. A processor coupled to a memory executes a plurality of concurrent tasks including a first task. Responsive to detecting one or more instructions of the first task which correspond to a first operation, the processor retrieves a first identifier (ID) which is used to uniquely identify the first task, wherein the first ID is transparent to the first task. Then, the processor maps the first ID to a second ID and/or a third ID. The processor completes the first operation by using the second ID and/or the third ID to identify the first task to at least a first data structure. In one implementation, the first operation is a memory access operation and the first data structure is a set of page tables. Also, in one implementation, the second ID identifies a first application of the first task and the third ID identifies a first operating system (OS) of the first task.

Abstract: Systems and methods for selecting content based on an event associated with a device identifier are provided. One or more processors can receive a request to serve content. The processors can identify a device identifier associated with the request. The processors can determine, from the device identifier, an event for which to serve content. The processors can determine, from the request, a length of time between a time the request to serve content is received and a time at which the event is scheduled to occur. The processors can select, based on the determined length of time and event parameters associated with the event, content for display and provide the selected content for display at a computing device associated with the device identifier.

Abstract: Recommending analytic tasks based on similarity of datasets is disclosed. One example is a system including a data processor, a matching module, and a recommendation module. The data processor receives an incoming dataset via a processing system, and generates a feature vector for the incoming dataset. The matching module determines similarity measures between the generated feature vector and representative feature vectors for a plurality of datasets in a data repository, and selects at least one dataset of the plurality of datasets based on the similarity measures. The recommendation module identifies at least one analytic task associated with the selected dataset, and recommends, to a computing device via the processing system, the at least one analytic task to be performed on the incoming dataset.

Abstract: A multi-core audio processor includes a plurality of audio processing cores having differing capabilities, a plurality of buffers, wherein each buffer is configured to store a plurality of samples associated with a corresponding audio stream, a deadline scheduler including a plurality of deadline registers configured to store a plurality of deadline values for each audio stream, and a plurality of audio processing core interfaces coupling the plurality of audio processing cores to the deadline scheduler, each of the audio processing core interfaces associated with a corresponding audio processing core. The plurality of deadline values indicate an order of processing of samples stored in the plurality of buffers by the plurality of processing cores.

Abstract: A system includes a memory component and a processing device, operatively coupled with the memory component, to send a read command to the memory component while a program or erase operation being executed by the memory component is suspended. The processing device, operatively coupled with the memory component, can then send an auto resume command to the memory component to automatically resume execution of the program or erase operation after the read command is executed.

Abstract: An example polling computing device includes a processor controlled to: determine an interval time to poll a monitored device in a queue of monitored devices based on a current processing time of a given monitored device being polled, and an average processing time for previously polled monitored devices; adjust a polling rate such that the interval time is between a minimum polling interval target and a maximum polling interval target; poll the monitored devices in the queue according to the polling rate; receive, in response to the poll, from the monitored devices in the queue, current software version indicators of software installed at the monitored devices; and transmit, to a software patch difference device, the current software version indicators, the software patch difference device to determine which of the monitored devices have been updated since a last poll based on the current software version indicators.

Abstract: Using proximity data to update user interfaces for users of a communication platform is described. The communication platform can determine, for a first user of the communication platform, a first location of the first user and for at least a second user of the communication platform, a second location of the second user. Based at least in part on a determination that the first location and the second location satisfy a condition, the communication platform can cause a user interface of the communication platform to be updated, wherein the updated user interface indicates at least one of (i) proximity data associated with the first user and the second user or (ii) context data associated with at least one of the first user or the second user.

Abstract: A switch identification method in by a computer includes sending a first packet to a first virtual switch emulating a first physical switch, and identifying a second virtual switch that is an allocation destination to which the first virtual switch allocates the first packet, and referring, to a storage unit that stores a switch correspondence information that associates a second physical switch that is an allocation destination of the first physical switch with the second virtual switch, and identifying the second physical switch that is the allocation destination to which the first physical switch allocates a second packet emulated by the first packet.

Abstract: A processor includes a plurality of cores configured to perform operations independently, a memory, and a control circuit electrically connected to the plurality of cores and the memory. The control circuit is configured to acquire one or more instructions associated with a task, store data corresponding to the task based on the one or more instructions, transmit the instructions to the at least some cores, check one or more cores that have responded to the instructions among the at least some cores, prevent the task from being allocated to the cores except for one core if the task is allocated to the one core, and allocate the task to one of the cores, the allocation of the task including changing state information associated with the allocation and setting other cores not allocated the task among the plurality of cores not to access the data corresponding to the task.

Abstract: A data processing system with technology for dynamically grouping threads includes a machine-readable medium and first and second cores, each with multiple logical processors (LPs). The system also comprises an operating system which, when executed, enables the system to select an LP to receive a new low-priority thread and to assign the new low-priority thread to the selected LP. The operation of selecting an LP to receive the new low-priority thread comprises, when the first core has multiple idle LPs, automatically determining whether the second core has an idle LP and a busy LP that is executing a current low-priority thread. In response to determining that the second core has an idle LP and a busy LP that is executing a current low-priority thread, the system automatically selects the idle LP in the second core to receive the new low-priority thread. Other embodiments are described and claimed.

Abstract: Accurate time estimates for operations performed on an SDDC are disclosed. The method includes receiving information about a job performed on an SDDC from at least one of a plurality of different reporting SDDC's, the information including a description of the SDDC, a description of the job performed on the SDDC, and a plurality of time stamps, each time stamp indicative of an operation performed on the SDDC in order to complete the job. The information is stored in a database in a granular time-based data set. When a request for a time estimate for a yet-to-be-performed job is received from at least a second SDDC (the request including a description of the SDDC), the stored information is used in conjunction with the description of the second SDDC to generate a time estimate for the yet-to-be-performed job.

Abstract: An arithmetic device includes storage, a controller, and operation circuitry. The storage stores therein P-dimensional input vectors, P×N-dimensional matrixes, N-dimensional intermediate value vectors, and N-dimensional output vectors, and is capable of executing, in parallel, two or more of reading processing of the input vector, reading processing of the matrix, reading processing of the intermediate value vector, and writing processing of the output vector. The controller sets read timings of a first input vector, a first matrix, and a first intermediate value vector, and write timing of a first output vector, in operation processing including a D-dimensional processing loop. The operation circuitry calculates product of the first input vector and the first matrix, calculates sum of the product and the first intermediate value vector, and stores the sum as the first output vector in the storage.

Abstract: A workload/processor resource scheduling system is coupled to a processing system. The workload/processor resource scheduling system monitors a performance of first workload(s) by the processing system according to a workload/processor resource schedule, and identifies a correlation between the performance of the first workload(s) according to the workload/processor resource schedule, and an operating level of a processing system operating parameter for the processing system when performing the first workload(s) according to the workload/processor resource schedule. Based on the correlation, the workload/processor resource schedule and the processing system operating parameter are linked.

Abstract: Systems and methods for distributed storage and processing systems using storage controllers for load sharing are described. A host processor may receive a function request that corresponds to a plurality of compute tasks, such as map compute tasks targeting data in local storage. The host processor may fetch the data from local storage devices through storage controllers. At least one storage controller, such as a non-volatile memory express (NVMe) interface controller, may be configured to execute overflow tasks for the function request. Another storage controller may be configured for executing other processing and management activities, such as reduce compute tasks.

Abstract: A server includes a field programmable gate array (FPGA) partitioned into a set of partial reconfiguration (PR) slots and a memory that supports a set of logical buffers. A deterministic application request module (DARM) receives application requests to allocate the set of reconfiguration slots to one or more tenants and the one or more tenants configure the allocated reconfiguration slot to perform tasks. The DARM stores data associated with the application request in a first logical buffer from the set of logical buffers. A reconfiguration slot scheduling (RSS) module identifies a first reconfiguration slot from the set of reconfiguration slots and associates the first reconfiguration slot with the first logical buffer. A reconfiguration slot initialization (RSI) module reconfigures the first reconfiguration slot to perform the tasks based on the data stored in the first logical buffer.

Abstract: An information processing device includes: a plurality of threads, each of the plurality of threads being configured to process any of a plurality of tasks, the plurality of tasks being obtained by dividing a job; and a control circuit configured to execute processing when designating a next task in scheduling for the plurality of threads, the processing including inquiring of an assignment destination thread out of the plurality of threads as to whether the next task is to be completed by a scheduled time, and preferentially assigning a task supposed to be completed by the scheduled time in the assignment destination thread, as the next task from among the plurality of tasks.

Abstract: Computing systems, for example, multi-tenant systems deploy software artifacts in data centers created in a cloud platform using a cloud platform infrastructure language that is cloud platform independent. The system allows users to specify a system configuration freeze for a time interval for services running in a datacenter configured on a cloud platform. During the system freeze, changes to the system are prohibited or put on hold. The system generates pipelines for modifying system configuration of services. A pipeline includes a change stage for making a change associated with a service and a pre-change stage for acquiring a lock. If the system receives a request for performing system freeze of a datacenter entity, the system acquires locks on services of the datacenter entity. As a result, execution of pipelines configured to change the system configuration of the services is put on hold.

Abstract: A method for handling a relative priority based scheduling procedure in an electronic device. The method includes receiving at least one task, from an application, to access a first core from a plurality of cores in the electronic device. Further, the method includes determining a relative priority with at least one second core from the plurality of cores in the electronic device based on the at least one task. Further, the method includes scheduling the at least one task in the first core from the plurality of cores in the electronic device based on the relative priority.

Abstract: A non-transitory computer-readable recording medium storing a data transformation program that causes a processor to execute a process. The process includes generating a plurality of first programs, each of the first programs transforming first input data and outputting first output data, contents of the transforming by the plurality of the first programs being different from each other, and among a plurality of pieces of a second input data different from the first input data, outputting the second input data that maximizes an entropy of a plurality of pieces of second output data, where each of the first programs transforms the second input data to the second output data.

Abstract: Disclosed herein are systems and methods for correcting distortion in a camera lens. The methods can include receiving at least one image of a calibration object, in which the image is captured via the camera lens and the lens has lens distortion. The methods can further include fitting a plurality of geodesics in the image; determining at least one connection equation for the plurality of geodesics; and determining a metric based on the connection equation, the metric comprising a first distorted radial coordinate. The methods can further include determining an undistorted radial coordinate based on the first distorted radial coordinate; determining a second distorted radial coordinate as a function of the undistorted radial coordinate; inverting the undistorted radial coordinate; and generating an undistorted image based on the inverted undistorted radial coordinate.

Abstract: An advertising system has limited computing resources to spend evaluating advertisements of advertisers to determine a “best” advertisement to serve to users of a social networking system. The computing resources are allocated (e.g., by varying the number of advertisements that are considered for presentation to a user) based on the neediness of the user and/or the advertiser on a per impression basis. The neediness of a user may be determined by grouping users into groups and determining a yield curve of expected revenue per computing resource used. Then, the revenue may be maximized across impression opportunities for multiple users. The neediness of an advertiser may be determined by biasing the selection of one advertiser's advertisements over another advertiser's advertisements based on an expected revenue, an expected number of interactions of the advertisement, or otherwise maximizing a satisfaction coefficient for the advertiser.

Abstract: A method and apparatus that schedules and manages a background task for device is described. In an exemplary embodiment, the device registers the background task, where the registering includes storing execution criteria for the background task. The execution criteria indicates a criterion for launching the background task and the execution criteria based on a component status of the device. The device further monitors the running state of the device for an occurrence of the execution criteria. If the execution criteria occurs, the device determines an available headroom with the device in order to perform the background task and launches the background task if the background task importance is greater than the available device headroom, where the background task importance is a measure of how important it is for the device to run the background task.

Abstract: A method for rapid data analysis includes receiving and interpreting a first query operating on a first dataset partitioned into shards by a first field; collecting a first data sample from a first set of data shards; calculating a first result to the first query based on analysis of the first data sample; and partitioning a second dataset into shards by a second field based on the first result.