Abstract: An information processing system includes one or more memories, and one or more processors that execute a set of instructions to control adjustment of a resource amount of a processing system configured to execute processing requiring access to a database in response to issuance of an event requiring adjustment of the resource amount of the processing system, wherein, in a case where the database is in an inaccessible state, the resource amount of the processing system is not increased even if a first event requiring an increase of the resource amount of the processing system is issued, and wherein, in a case where the database is in an accessible state, the resource amount of the processing system is increased in response to issuance of the first event.

Abstract: A workspace mesh can be managed. A mesh manager can interface with agents on smart devices to create and update nodes that may form part of a workspace mesh. The mesh manager can also automatically detect when multiple nodes have formed a workspace mesh and then dynamically select and apply mesh policies to the smart devices and peripherals in the workspace mesh. In this way, the workspace mesh can be managed as a single logical unit.

Abstract: Techniques described herein relate to a method for managing a distributed multi-tiered computing (DMC) environment. The method includes identifying, by a local controller associated with an DMC domain, a domain scheduling event associated with a scheduling job; and in response to identifying the domain scheduling event: identifying a candidate list of devices of the DMC domain to schedule tasks associated with the scheduling job based on a location and service level objectives; refining the candidate list of devices based on device configuration requirements, device management requirements, and security requirements to generate a final candidate list; scheduling tasks to devices using the final candidate list; generating scheduling assignments and provisioning command packages based on the scheduled tasks; providing the scheduling assignments and the provision command packages to the devices; and updating a graph based on the scheduling assignments.

Abstract: A system and method for managing queues for persistent storage. In some embodiments, the method includes opening, by a first thread running in a host, a first storage object; and creating, by the host, in a memory of the host, a first block device queue, the first block device queue being dedicated to the first storage object.

Abstract: Provided are a system and method for controlling a workflow across domains on the basis of a hierarchical engine framework. Inventive workflow control makes it possible to configure a flexible hierarchical engine framework and provide a workflow service with low latency. Also, the system and method make it possible to control a workflow by building an engine and a data pipeline across domains.

Abstract: A method of managing CPU cores in a data storage apparatus (DSA) configured to perform both host I/O (Input/Output) processing and background storage processing is provided. The method includes (a) selectively classifying background storage tasks in one of a first classification for longer-running tasks and a second classification for shorter-running tasks; (b) selecting CPU cores that are running fewer than a threshold number of first-classification background tasks to process host I/O requests; and (c) processing the host I/O requests on their selected CPU cores. An apparatus, system, and computer program product for performing a similar method are also provided.

Abstract: The present invention relates to a method, system and computer program product for task failover in an unstable environment, wherein the unstable environment includes a plurality of reclaimable nodes. According to the method, it is monitored if any node of the plurality of reclaimable nodes is to be reclaimed. Whether a task on any node of the plurality of reclaimable nodes is recoverable is determined. Responsive to the task being recoverable, data of the recoverable task is stored. Responsive to a node being reclaimed and the task on the reclaimed node being recoverable, at least one associated task of at least one associated node of the reclaimed node is notified to wait.

Abstract: Provided is an apparatus and method for improving the entry speed of a large-memory consuming application in an electric device which detect an execution of an application, check if the application is a large-memory consuming application which uses a large amount of memory, and if the application is the large-memory consuming application, execute pre-process thread reclaim, select a process corresponding to a reclaiming target among processes currently resident in the memory, reclaim part of the memory being used by the selected process without terminating the selected process, and thereby improve the entry speed of a large-memory consuming application.

Abstract: In one embodiment, a device causes, in accordance with a probing strategy, performance of a probing test by one or more agents in a network and with respect to an online application. The device obtains quality of experience measurements for the online application. The device adjusts, using reinforcement learning, the probing strategy based on how well a predictive model was able to predict the quality of experience measurements given results of the probing test. The device repeats the causing, obtaining, and adjusting steps using the probing strategy adjusted by the device, to find a minimally disruptive probing strategy that provides acceptable performance by the predictive model.

Abstract: The present disclosure relates to systems and methods for sharing compute resources. The systems and methods may include identifying a plurality of workloads to complete by a deadline. The systems and methods may include generating a performance prediction for each workload of the plurality of workloads. The systems and methods may use the performance prediction to calculate a number of compute resources required for the plurality of workloads to complete by the deadline. The systems and methods may schedule the plurality of workloads across the number of compute resources.

Abstract: According to aspects of the present disclosure, systems, methods and computer program products can be provided for dynamic workload orchestration based on data complexity. Methods, computer program products and/or systems are provided for dynamic workload orchestration that perform the following operations: (i) receiving a workload for orchestration; (ii) computing complexity scores for respective portions of the workload, where the complexity scores are computed based at least on parameters describing data associated with the portions of the workload; and (iii) using an orchestration engine to assign the portions of the workload to corresponding compute resources, based on their respective complexity scores.

Abstract: A security agent configured to initiate a security agent component as a hypervisor for a computing device is described herein. The security agent component may change a value of a processor configuration register, such as a Model Specific Register (MSR), in order to cause system calls to be redirected to the security agent, and may set an intercept for instructions for performing read operations on the processor configuration register so that a process, thread, or component different from the processor of the computing device may receive the original value of the processor configuration register instead of an updated value of the processor configuration register. The security agent component may also be configured to generate interrupts to offload task execution from the hypervisor to a security agent executing as a kernel-level component.

Abstract: An information processing system includes a controller configured to control information of which is notified to a mobile terminal. The controller performs control to cause a notification unit to notify the mobile terminal of first information in a case where the mobile terminal in a first environment has succeeded in authentication with the first authentication method, notify the mobile terminal of the first information and second information in a case where the mobile terminal in a second environment has succeeded in the authentication with the first authentication method, and notify the mobile terminal of the first information and the second information in a case where the mobile terminal in the first environment has succeeded in the authentication with the first authentication method and has further succeeded in authentication with the second authentication method.

Abstract: A method for a first set of processors and a second set of processors comprises, the first set of processors processing a set of queries, as a result of a change in utilization of the first set of processors, processing the set of queries using the second set of processors. The change in processors is independent of a change in storage resources, the storage resources shared by the first set of processors and the second set of processors.

Abstract: A method for accelerating the start time of an application is described herein, comprising receiving application chunk information from a user, wherein playtime information is associated with the application chunk information, wherein the application chunk is a discrete portion of the application and the playtime information is an estimated time for one or more similar users to reach a chosen state or landmark in the application; predicting a download duration from the application chunk information and network information; comparing predicted download duration to stored playtime information associated with a previously received application chunk and the playtime information associated with the application chunk information; and installing the previously received application chunk when the predicted download duration is less than the stored playtime information.

Abstract: Some embodiments provide a hierarchical data service (HDS) that manages many resource clusters that are in a resource cluster hierarchy. In some embodiments, each resource cluster has its own cluster manager, and the cluster managers are in a cluster manager hierarchy that mimics the hierarchy of the resource clusters. In some embodiments, both the resource cluster hierarchy and the cluster manager hierarchy are tree structures, e.g., a directed acyclic graph (DAG) structure that has one root node with multiple other nodes in a hierarchy, with each other node having only one parent node and one or more possible child nodes.

Abstract: Systems and methods for automated server-side reference mapping in a resource registry are disclosed herein. An example system comprises a registry with a unique coordinate system; an automated registry server connected to the registry, configured to receive a resource to be registered in the registry; process the contents of the resource to identify a target reference; search the registry for the target reference using information specific to the target reference; analyze potential candidate matches for the target reference, in a search result of the search; and resolve the target reference based on the analysis of the candidate matches.

Abstract: Content management systems are implemented according to a multitenant architecture by which software and its supporting architecture serves multiple customers of a service. Each tenant may be given a share of the application's data, configuration, user management, and other aspects of the application. Each tenant's data is isolated and typically remains invisible to other tenants so that tenants do not share or see each other's data. Embodiments described herein provide mechanisms by which a tenant can delegate administrator rights to an external user such that the external user can grant other users access to the tenant's content while the tenant controls the level of access that is provided to the external users.

Abstract: The present disclosure discloses a method and apparatus for monitoring application service, an electronic device, and a non-transitory readable storage medium.

Abstract: A uniform enclave interface is provided for creating and operating enclaves across multiple different types of backends and system configurations. For instance, an enclave manager may be created in an untrusted environment of a host computing device. The enclave manager may include instructions for creating one or more enclaves. An enclave may be generated in memory of the host computing device using the enclave manager. One or more enclave clients of the enclave may be generated by the enclave manager such that the enclave clients configured to provide one or more entry points into the enclave. One or more trusted application instances may be created in the enclave.

Abstract: A system comprises an executable graph-based model. The executable graph-based model comprises a first overlay node. The first overlay node comprises processing logic that is operable to interact with one or more associated nodes of the executable graph-based model. Further, the executable graph-based model comprises a first node that has the first overlay node associated therewith. The system further comprises a processing unit configured to receive a first stimulus associated with the first overlay node and, in response to the first stimulus being received, cause execution of said processing logic of the first overlay node. Execution of said processing logic of the first overlay node is based on the first node.

Abstract: When a cooperation source user name corresponding to identification information of a user included in a received request is included in a cooperation destination system user information, a cooperation destination system converts the identification information of the user included in the request into a user ID corresponding to the cooperation source user name in a cooperation destination system user information. The cooperation destination system processes the request based on the user ID and determines whether or not a cooperation source user name corresponding to the user ID is included in the cooperation destination system user information. In a case where the cooperation source user name corresponding to the user ID is included in the cooperation destination system user information, the cooperation destination system converts the user ID into a cooperation source user name corresponding to the user ID in the cooperation destination system user information.

Abstract: A system and a method are disclosed for automatic content upload and process. The system retrieves a set of files from a source location based on instructions received from a client device of a user. The system then classifies the set of files into a plurality of categories corresponding to a sequence of one or more services configured to process or store files. The system then generates a data structure storing key values, where the key values are derived based on respective processing of subsets of files. Responsive to receiving an input to execute logic relating to the set of files, the system determines that the input is associated with one or more of the key values, retrieves the one or more of the key values, and executing the logic using the one or more retrieved key values.

Abstract: A system comprises an executable graph-based model. The executable graph-based model comprises a first overlay node. The first overlay node comprises processing logic that is operable to interact with one or more associated nodes of the executable graph-based model. Further, the executable graph-based model comprises a first node that has the first overlay node associated therewith. The system further comprises a processing unit configured to receive a first stimulus associated with the first overlay node and, in response to the first stimulus being received, cause execution of said processing logic of the first overlay node. Execution of said processing logic of the first overlay node is based on the first node.

Abstract: Methods and systems for managing a queue are disclosed. In one aspect, an example method can comprise accessing at least a portion of a queue comprising a plurality of tasks. Each task of the plurality of tasks can be associated with a property, and the property associated with each task can comprise a respective value. An exclusion value can be determined based on a distribution of the respective values. A group of tasks that comprises respective values of the property that do not match the exclusion value can be selected from the queue, and the selected group of tasks can be processed.

Abstract: A process operating system includes a process control platform, a process operation platform and an endpoint task robot. The process control platform is configured to receive operation information, extract a task from the operation information using a semantic analysis method, and publish the task. The process operation platform is configured to receive the task and store the task in a task queue. After receiving the task, the process operating platform defines a processing flow based on the task, and sorts the order of the task in the task queue. The endpoint task robot is configured to automatically obtain the task from the process operation platform, executes the task according to the processing flow. It then writes the execution result into the log queue and transmits the execution result to the process control platform.

Abstract: The present disclosure describes methods, computer-readable media, and apparatuses for operating neural networks. For example, a first apparatus may receive a set of sparse weight vectors. The first apparatus may compress the set of sparse weight vectors to produce a compressed set of sparse weight vectors. The first apparatus may operate a neural network based on the compressed set of sparse weight vectors. In another example, a second apparatus may receive a set of sparse weight vectors. The second apparatus may perform a sparse computation based on the set of sparse weight vectors, and the performance of the sparse computation may produce one or more partial sums. The second apparatus may operate a neural network based at least in part on the one or more partial sums.

Abstract: A system architecture for linking one or more derived objects to existing data objects in a data structure can be organized in a variety of forms. A method for establishing the architecture may include linking first and second data objects, linking first and second data objects. The first and second data objects may be associated with corresponding first and second pluralities of properties. The method may include receiving a first user limitation associated with at least one of the first or second pluralities of properties and receiving a second user limitation associated with at least one of the first or second pluralities of properties. The method can include deriving a conclusion object comprising a third plurality of properties comprising a subset of one or more of the first or second pluralities of properties and linking the conclusion object to the first and second data objects.

Abstract: A graphics processing unit (GPU) or other apparatus includes a plurality of shader engines. The apparatus also includes a first front end (FE) circuit and one or more second FE circuits. The first FE circuit is configured to schedule geometry workloads for the plurality of shader engines in a first mode. The first FE circuit is configured to schedule geometry workloads for a first subset of the plurality of shader engines and the one or more second FE circuits are configured to schedule geometry workloads for a second subset of the plurality of shader engines in a second mode. In some cases, a partition switch is configured to selectively connect the first FE circuit or the one or more second FE circuits to the second subset of the plurality of shader engines depending on whether the apparatus is in the first mode or the second mode.

Abstract: A method for partitioning executable operations for a reconfigurable computing system includes receiving a set of expressions comprising a plurality of operations and dependencies for those operations, partitioning the plurality of operations into selected executable partitions wherein each selected executable partition conforms to resource constraints for a reconfigurable unit of the reconfigurable computing system. Partitioning the plurality of operations into selected executable partitions may include seeding a candidate partition with an operation, recursively generating an additional candidate partition for each operation adjacent to the candidate partition whose dependent operations are already within the candidate partition or a previously selected partition, and selecting a best candidate partition based on resource cost. A corresponding system and computer-readable medium are also disclosed herein.

Abstract: In various examples disclosed herein, provided is a method and system for cross-validating files to facilitate code generation. The system can perform the cross-validation in phases of disparate files to enable the interoperability of the files. The files can include representations of tasks that are organized differently and differ in format and semantics. The method and system described herein can perform syntax and semantic validation on the files to check for errors, and then identify terms and names identified in the tasks associated with the files along with signatures (e.g., schemas for data models or function signatures for function invocations) associated with the names. After error checking is complete, and after the names and signatures are identified, the names and signatures in the respective files can be cross-validated to find matching tasks, and code is generated that utilizes the cross-validated and matching tasks.

Abstract: A fork support is provided for duplicating an application running inside an enclave entity. In this regard, a request to duplicate an application running inside a first enclave may be received by one or more processors of a host computing device of the first enclave. A snapshot of the first enclave including the application may be generated. The snapshot may be encrypted with a snapshot key and copied to untrusted memory of the host. A second enclave may be generated. The snapshot key may be sent from the first enclave to the second enclave through a secure communication channel. The encrypted snapshot may be copied from the untrusted memory of the host into the second enclave. The encrypted snapshot may be decrypted inside the second enclave with the snapshot key.

Abstract: Systems and methods which facilitate management of functionality provided with respect to data objects in a multiuser environment are described. Embodiments are adapted to provide concurrency with respect to the data of the data objects in the multiuser environments, such as through the use of channel grouping techniques for providing various data communications. Additionally or alternatively, embodiments are adapted to implement data object assignments for facilitating management functionality available with respect to the multiuser environment, such as through the use of data object assignment containers created for storage of instances of assigned data objects. Through pre-creation of data object assignments to assignees, multiple users of a multiuser environment are enabled to utilize the functionality provided with respect to data objects without duplication of tasks and/or undesired conflicts between the users.

Abstract: Techniques for subtask assignment for an artificial intelligence (AI) task are described, and may be implemented to leverage a local set of devices to distribute portions of an AI task between the devices. Generally, the described techniques enable AI task allocation based on a variety of factors, such as device capabilities, device availability, task complexity, and so forth.

Abstract: It is determined that a workflow comprising inter-resource requests of a distributed application is to be initiated. In response to detecting, at a first resource during execution of the workflow, that a triggering condition for retrying a request is met, and that a workflow-level retry budget of the workflow indicates that a retry is permitted, the retry is attempted and the budget is modified to indicate that the retry has been attempted. In response to detecting, at another resource, that a triggering condition for retrying another request is met, and that the workflow-level retry budget of the workflow indicates that a retry is not permitted, an indication that the workflow has failed is generated.

Abstract: Embodiments of the present application provide a phased streaming system and process using a dynamic video game client. The dynamic video game client can utilize a state stream game engine in combination with a game application streaming service to provide users with the ability to begin playing games quickly on a huge range of devices.

Abstract: Techniques for calculating and using a request cost index for throttling application programming interface (API) requests to execute operations in a provider network. The techniques encompass the step receiving a request to execute an operation at an API service in the provider network. Further steps include determining to execute the operation based on a request rate limiting algorithm, executing the operation to yield an operation result, and sending the operation result. Additional steps include calculating a request cost index that reflects an amount of computing resources utilized by executing the operation, determining an adjustment amount for a state variable of the request rate limiting algorithm based on the calculated request cost index, and adjusting (e.g., lowering) the state variable by the adjustment amount. Other (e.g., subsequent) requests to execute queries received at the API service that are metered by the state variable can be throttled by the API service.

Abstract: Provided are a computer program product, system, and method to determine whether a holding of a lock to the resource by a first task satisfies a condition and whether the lock is swappable. The lock is released from the first task and granted to a second task waiting in a queue for the lock in response to determining that the holding of the lock satisfies the condition and that the lock is swappable. The first task is indicated in the queue waiting for the lock in response to granting the lock to the second task.

Abstract: Systems and methods for controlling access to services. Methods may comprise receiving, from a first client of a plurality of clients, a first request to access a first service of a plurality of services. The first service may be associated with a first bulkhead. A first count of concurrent active requests to the first service via the first bulkhead may be determined. If the first count is equal to a first bulkhead maximum value, access to the first service via the first bulkhead may consequently be refused. A second count of concurrent active requests via a shared burst bulkhead may be determined. The second count may correspond to concurrent active requests to any of the plurality of services via the shared burst bulkhead. If the second count is less than a shared burst maximum value, the first request to the first service may be routed via the shared burst bulkhead.

Abstract: An electronic device includes a memory configured to store one or more applications, and at least one processor configured to control the electronic device. The processor may identify a target model file based on a neural network and associated with a target application among the one or more applications, determine a target initialization time of the target model file among a plurality of preset initialization times, and initialize the target model file at the target initialization time. In addition, various example embodiments may be implemented.

Abstract: Techniques are disclosed for storing and retrieving large amounts of data in a non-relational database using sort keys. A server computer system may receive a request for raw data specifying a start timestamp and an end timestamp. The server determines a start key and an end key for performing a query on a distributed non-relational database storing key-value pairs, where the determining is based on the start timestamp and the end timestamp. The server may compare the start key and the end key to a sort key included in row keys of key-value pairs stored in the non-relational database. Based on the comparing, the server retrieves one or more rows of raw data from the non-relational database. The server generates a graphical representation of the one or more rows of raw data retrieved from the non-relational database. The disclosed techniques may advantageously improve the efficiency of a database management system.

Abstract: A method for implementing collective communication, a computer device, and a communication system are provided, to resolve problems of high communication latency and resource consumption in the conventional technology. The method includes: identifying a work request having no communication dependency, and when forwarding work requests, directly forwarding the work request identified as having no communication dependency, and forwarding, after queue management, a work request that is not identified as having no communication dependency. According to the application, communication latency caused when the work request having no communication dependency is managed by using a queue can be avoided, and resource consumption caused by performing related management can be reduced, to improve overall communication performance of collective communication.

Abstract: Methods and systems for providing improved and interactive product documentations are provided. In one embodiment, a method is provided that includes providing a documentation page to a computing device. The documentation page may include an identifier of a data environment associated with the documentation page. A request may be received to display the data environment and data associated with the data environment may be retrieved from a database associated with the computing device. The data environment may be created based on the retrieved data and provided to the computing device for display.

Abstract: The embodiments of the present invention provide a dynamic production scheduling method, apparatus and electronic device based on deep reinforcement learning, which relate to the technical field of Industrial Internet of Things, and can reduce the overall processing time of jobs on the basis of not exceeding the processing capacity of production device.

Abstract: Proposed is a system for executing a task of an operating system for a vehicle, the system including: a task information extracting unit which, when an event signal is received from an application, extracts task information related to the event signal from a pre-prepared event chain table; an execution cycle setting unit which sets a task execution cycle by using the extracted task information; a task executing unit which executes any one task among a plurality of tasks according to the task execution cycle; and a waiting time providing unit which provides a task waiting time to the task executing unit so as to wait for execution of a next task when the execution of the one task is completed.

Abstract: Methods, apparatus, systems, and articles of manufacture are disclosed to steal work in heterogeneous computing systems. An apparatus includes load balancing circuitry to obtain tasks from a workload by encoding minimum and maximum index ranges of a data parallel operation, allocate a first task from the workload to a first work queue based on a first capability of first computation circuitry, the first computation circuitry to process the first task in the first work queue, and allocate a second task from the workload to a second work queue, second computation circuitry to process the second task in the second work queue. The apparatus further includes first work stealer logic to steal the second task from the second work queue using an atomic operation to access the second work queue.

Abstract: Techniques are described for ensuring end-to-end fair-share resource utilization during cross-region replication. In certain embodiments, a fair-share architecture is used for communication among pipeline stages performing a cross-region replication between different cloud infrastructure regions. Cross-region replication-related jobs are distributed evenly from a pipeline stage into a temporary buffer in the fair-share architecture, and then further distributed evenly form the fair-share architecture to parallel running threads of next pipeline stage for execute. Techniques for static and dynamic resource allocations are also disclosed.

Abstract: A systolic array includes a plurality of basic computation units arranged in a matrix. A basic computation includes a feature input register configured to store first feature data, a result buffer configured to store first temporary data, a comparator connected to the feature input register and the result buffer, and a control register connected to the feature input register, the result buffer, and the comparator. The comparator is configured to compare the first feature data input with the first temporary data successively. The control register is configured to control the first feature data of the feature input register and the first temporary data to be input to the comparator, output a comparison result to the result buffer and a feature input register of a next basic computation unit, and after sorting, output the first temporary data last stored in the result buffer as a first data result.

Abstract: A system, method and computer program product to synchronize processing across multiple lanes. In a system, a synchronizing interface network controller (SINC) communicates with a plurality of processors. Each processor executes an application having thread(s) of operation. Each processor notifies the SINC when a specific thread is ready to perform a respective operation. The SINC releases the processors to perform the respective operation upon being notified by all processors that the specific thread is ready to perform the respective operation. Each processor is configured to monitor for the release of the processors and to also determine whether sufficient time remains within a time window to perform the respective operation. If insufficient time remains, a processor notifies the SINC that the specific thread is no longer ready to perform the respective operation. If the processors are released by the SINC while sufficient time remains, each processor performs the respective operation.

Abstract: A system-on-chip includes a processor, a memory and a memory interface coupled to the processor and to the memory. The processor, in operation, generates memory access requests. The memory includes one or more physical banks divided into a succession of sectors, each sector having a size equal to a smallest erasable size of the memory. The memory interface, in operation, responds to receiving memory configuration information by storing logical memory bank configuration information in the one or more configuration registers, the logical memory bank configuration information assigning each sector of the one or more physical banks of the memory to a respective logical memory bank of one or more logical memory banks. The memory interface, in operation, controls access to the memory by the processor based on the logical memory bank configuration information stored in the one or more configuration registers.