Abstract: A computer-implemented method, system, and computer program product are provided. The approach includes popping a first task from a queue of a garbage collection thread. The approach also includes identifying a second task from the popped first task, where the second task is associated with a bit of a bitmap and the bit is located at a location within the bitmap that has not yet been passed by a finger pointer. The approach also includes pushing the second task to the queue of the garbage collection thread.

Abstract: Embodiments provide data in-flight (DIF) services to software applications such as virtual machines (VMs) at an application level without requiring modification to established storage protocols. In exemplary embodiments, a storage controller transmits an advertisement of one or more data in-flight (DIF) services supported by a storage container of the storage controller. One or more DIF services communication path is created with attributes corresponding to the DIF services supported by the storage container. The storage controller receives, over the DIF services communication path, tagged data that can include data transmitted by a virtual machine (VM) for storage in the storage container.

Abstract: A system and method include classifying and assigning virtual disks accessed from compute only nodes. The method determines, by a management processor of a virtual computing system, characteristics for a plurality of virtual disks hosted on a plurality of hyper converged nodes in a cluster of nodes in the virtual computing system. The method further classifies, by the management processor, each of the plurality of virtual disks based on the determined characteristics and identifies, by the management processor, one of the plurality of virtual disks to host data for a virtual machine on a compute only node based on the classification to spread out input-output demand in the cluster, reducing probability of input-output bottlenecks and increasing cluster-wide storage throughput. The method also assigns, by the management processor, the identified virtual disk to host data for the virtual machine located on the compute only node.

Abstract: Disclosed are various embodiments for separating creation of and executing of updated campaigns in multitenancy environments. For example, an organization can have a hierarchical structure such that a root organization includes multiple sub-organizations. A root organization administrator may create an update campaign for enforcing software policies on devices that are included in the sub-organizations. A sub-organization administrator can approve and define the execution schedule for when the devices included in the sub-organization can execute the update campaign.

Abstract: Methods, systems, and apparatus, including computer programs encoded on computer storage media, for scheduling operations represented as a computational graph on a distributed computing network. A method includes: receiving data representing operations to be executed in order to perform a job on a plurality of hardware accelerators of a plurality of different accelerator types; generating, for the job and from at least the data representing the operations, features that represent a predicted performance for the job on hardware accelerators of the plurality of different accelerator types; generating, from the features, a respective predicted performance metric for the job for each of the plurality of different accelerator types according to a performance objective function; and providing, to a scheduling system, one or more recommendations for scheduling the job on one or more recommended types of hardware accelerators.

Abstract: Performing predictive analysis on running batch jobs is provided. A series of batch end time predictive models is retrieved according to a sequence of milestone jobs in a batch of jobs. Retrieved batch end time predictive models are assembled into an aggregate batch end time predictive model to increase accuracy and stability of an end time prediction of the batch of jobs. The aggregate batch end time predictive model is utilized to predict an end time of the batch of jobs during running of the batch of jobs to form a predicted end time of the batch of jobs.

Abstract: Testing methods and systems are provided for testing a resource manager of an application management system. The testing systems include a load orchestrator configured to obtain an artificial metric that is determined based on a utilization model (e.g., CPU usage, memory allocation, or disk usage, number of webserver sessions). The load orchestrator transmits the artificial metric to applications in a cluster of computing nodes. The applications transmit the artificial metric to the resource manager. In response, the resource manager generates control output for managing applications in the cluster based on the artificial metric (e.g., scaling, load balancing, application placement, failover of applications, or defragmenting data). The utilization model may include executable code for generating artificial metric values. The model may be received as a result of an API call. The load orchestrator may be instantiated in an orchestration framework or in each node of the cluster.

Abstract: A computer-implemented method, according to one embodiment, includes: receiving a data process that includes a plurality of sub-processes. A unique subset of the sub-processes is assigned to each of: a managing thread, and at least one other thread. Moreover, performance characteristics of each of the threads is evaluated while the respective subsets of sub-processes are being performed, and a determination is made as to whether the performance characteristics of each of the threads are substantially equal to the performance characteristics of each of the other threads. In response to determining that performance characteristics of each of the threads are not substantially equal, the subsets of the sub-processes are dynamically adjusted such that the performance characteristics of each of the threads become more equal. Moreover, the adjusted subsets of the sub-processes are reassigned to each of the managing thread and at least one other thread.

Abstract: Techniques for providing high-performance buffer caches for transactional input/output (I/O) systems are disclosed. The techniques include obtaining a first logical creation time of a resource to be acquired by the first transaction during a pre-commit phase of a first transaction with an I/O system. When the first logical creation time exceeds a latest logical creation time from a set of resources previously acquired by the first transaction, the first logical creation time of the resource is compared with an earliest logical termination time from the set of resources. When the first logical creation time of the resource exceeds the earliest logical termination time from the set of resources, a conflict between the resource and the set of resources is detected, and a restart of the first transaction is triggered.

Abstract: A method for allocating on-chip memory of a neural processing unit is performed by one or more processors, and includes deallocating an allocated chunk in an on-chip memory area, which is finished with the use of the memory, and converting it into a cached chunk, receiving an on-chip memory allocation request for specific data, determining whether there is a cached chunk of one or more cached chunks that is allocable for the specific data, based on a comparison between a size of the specific data and the size of the one or more cached chunks, and based on a result of determining whether there is the cached chunk that is allocable for the specific data, allocating the specific data to a specific cached chunk of the one or more cached chunks, or allocating the specific data to at least a portion of the free chunk.

Abstract: Executing a big data analytics pipeline in a storage system that includes compute resources and shared storage resources, including: receiving, from a data producer, a dataset; storing, within the storage system, the dataset; allocating processing resources to an analytics application; and executing the analytics application on the processing resources, including ingesting the dataset from the storage system.

Abstract: Methods and systems for selecting and executing optimal execution strategies for processes, wherein an optimal execution strategy may be selected from a plurality of execution strategies for example in a look-up table, based on specific process values.

Abstract: A Multi-site Integrated Session-oriented Transaction (MIST) computing system includes a MIST mapper configured to process a compiled distributed compute session request to determine, for each of at least one remote sets of data, whether to process the remote set of data with one of one or more field nodes or with a cloud node based on a cost of transporting the remote set of data from the proximate field node to the cloud node. In response to determining to process the remote set of data with the cloud node, the MIST mapper is configured to output a data retrieval request to the proximate field node. In response to determining to process the remote set of data with the field node, the MIST mapper is configured to output the computation request to the proximate field node.

Abstract: Techniques for tracking a lock involve creating an event comprising object information, and extracting the object information in the event through a thread in a thread pool. Such techniques further involve recording lock information comprising the object information according to a determination that the thread executes a lock operation. Such a lock tracking technique for a threading model can record lock information of an object when a thread performs locking and unlocking, and realize tracking of a lock operation and generating a lock analysis report.

Abstract: A control plane system can be used to manage or generated components in a shared computing resource environment. To generate a modified components, the control plane system can receive receiving configurations of a component. The configurations can include software versions and/or parameters for the component. Using the configurations, the control plane system can generate an image of a modified component, and communicate the image to a master node in the shared computing resource environment. The master node can provides one or more instances of the modified component for use based on the received image.

Abstract: A method may include receiving an indication that a recalculation operation is to be completed for data stored in a data file; determining that a currently assigned number of threads for execution of the recalculation operation is lower than a target number of threads for the recalculation operation; requesting an additional thread for execution of the recalculation operation; beginning execution of the recalculation operation using the currently assigned number of threads; receiving an indication that the additional thread is available for execution of the recalculation operation; updating the currently assigned number of threads to include the additional thread; and continuing execution of the recalculation operation using the updated currently assigned number of threads.

Abstract: Provided is a method for scheduling resource-constrained project by IWO. The method establishes a resource-constrained project scheduling model first, converts the project scheduling issue in actual engineering into the combination and optimization in a mathematical model, then the optimization aims at minimizing the project total duration, while considering the immediate predecessor/successor constraints of the project activities and a variety of renewable resource constraints, to construct project scheduling model, lastly IWO is used to seek the solution for large-scale project scheduling. In the solution process, a right-shift decoding strategy was designed to rectify the ineligible solutions that occurred during the generation of weed seeds, ensure that all solutions are in compliance with the immediate predecessor/successor constraints of the project activities, and improve the efficiency of algorithm. Solution efficiency.

Abstract: A notification of an event associated with a computing instance provided to customers of a computing resource service provider is obtained. Log information associated with the computing instance is obtained from a log of operations of the computing instance, with the log information indicating events associated with the computing instance. Pattern matching on the log information is performed to produce a pattern matching result. The computing instance is determined to be impaired based at least in part on the pattern matching result including indications of impairment. A mitigation operation is performed to the computing instance to mitigate the impairment.

Abstract: Methods and systems for transforming data archives are provided. In one embodiment, a method is provided that includes receiving a data archive and selecting a first data item from among a plurality of data items contained within the data archive. A first data format of the first data item may be identified that specifies a first type of data stored in the first data item and a first data transformation may be selected that corresponds to the first data format. The first type of data may be transformed by the first data transformation to generate a first transformed data item. The first data item may be replaced with the first transformed data item in the data archive and an executable item contained within the data archive may be executed.

Abstract: A computing device and a method for operating the computing device are provided. The computing device includes a task classifying module and a task allocating and managing module. The task classifying module classifies a task scheduled to be processed by a multi-core processor into an expectable task or a normal task. The task allocating and managing module selects one core of the multi-core processor as a target core and allocates the task scheduled to be processed to the target core. In response to the task scheduled to be processed being classified as the normal task, the task allocating and managing module determines whether to allocate the normal task to the target core depending on whether the target core processes a previously allocated expectable task.