Patent classifications
G06F2209/484
Dynamic Designation of Instructions as Sensitive for Constraining Instruction Execution
Described herein are systems and methods for dynamic designation of instructions as sensitive. For example, some methods include detecting that a first instruction of a first process has been designated as a sensitive instruction; checking whether a sensitive handling enable indicator in a process state register storing a state of the first process is enabled; responsive to detection of the sensitive instruction and enablement of the sensitive handling enable indicator, invoking a constraint for execution of the first instruction; executing the first instruction subject to the constraint; and executing a second instruction of the first process without the constraint.
Command processing method and server
A command processing method to reduce a system delay and system complexity while ensuring system consistency. A server receives from a client a target request that carries a target command. The server uses a current time as a target timestamp of the target request, adds a local associated command corresponding to the target context number and a local conflicted command corresponding to the target command to a target dependency set, and forwards the target request to a replica server. The server updates the target dependency set according to a feedback from the replica server, and stores an updated target dependency set synchronously with the replica server. And the server determines a target execution sequence of the target command and each command in the updated target dependency set.
Determining a job group status based on a relationship between a generation counter value and a ticket value for scheduling the job group for execution
A job scheduler system includes one or more hardware processors, a memory including a job group queue stored in the memory, and a job scheduler engine configured to create a first job group in the job group queue, the first job group includes a generation counter having an initial value, receive a first request to steal the first job group, determine a state of the first job group based at least in part on the generation counter, the state indicating that the first job group is available to steal, based on the determining the state of the first job group, atomically increment the generation counter, thereby making the first job group unavailable for stealing, and alter an execution order of the first job group ahead of at least one other job group in the job group queue.
User configurable task triggers
Systems and processes for user configurable task triggers are provided. In one example, at least one user input, including a selection of at least one condition of a plurality of conditions and a selection of at least one task of a plurality of tasks, is received. Stored context data corresponding to an electronic device is received. A determination is whether the stored context data indicates an occurrence of the at least one selected condition. In response to determining that the stored context data indicates an occurrence of the at least one selected condition, the at least one selected task associated with the at least one selected condition is performed.
Managing throughput fairness and quality of service in file systems
Embodiments are directed to managing file systems over a network. Jobs may be provided to a storage computer in a file system. Control models may be associated with the jobs. Scores may be generated based on the control models. Each job may be associated with a score provided by its associated control model. And, each job that may be behind its corresponding schedule may be associated with a higher score value than each other job that may be either on its corresponding other schedule or ahead of its corresponding other schedule. Commands may be selected for execution based on the commands being associated with a job that may be associated with the higher score value that may be greater than score values associated with other jobs. The jobs may be ranked based on the updated scores. Subsequent commands may be selected and executed based on the ranking of the jobs.
Dynamic designation of instructions as sensitive for constraining multithreaded execution
Described herein are systems and methods for dynamic designation of instructions as sensitive. For example, some methods include detecting that a first instruction of a first process has been designated as a sensitive instruction; checking whether a sensitive handling enable indicator in a process state register storing a state of the first process is enabled; responsive to detection of the sensitive instruction and enablement of the sensitive handling enable indicator, invoking a constraint for execution of the first instruction; executing the first instruction subject to the constraint; and executing a second instruction of the first process without the constraint.
Low-cost task specific device scheduling system
A low-cost task specific device system for scheduling tasks that are performed by one or more devices is described. After a preceding task is performed, the performance of a successive task is delayed for a task-specific recharge interval associated with the preceding task. The successive task is performed after the task-specific recharge interval has expired.
Method for process management and electronic device
A method for process management in an electronic device is disclosed. The method includes: acquiring a set of association processes corresponding to an application in the electronic device and priority levels of association processes, wherein the set of association processes includes a primary process of the application and at least one secondary process bound to the primary process; acquiring an operation state of the primary process and an operation state of each of the at least one secondary process, respectively; and adjusting a binding state between the primary process and each of the at least one secondary process and performing a priority adjustment for the primary process and each of the at least one secondary process between which are in the adjusted binding state according to the operation state of the primary process and the operation state of each of the at least one secondary process.
Minimizing memory reads and increasing performance by leveraging aligned blob data in a processing unit of a neural network environment
The performance of a neural network (NN) and/or deep neural network (DNN) can be limited by the number of operations being performed as well as management of data among the various memory components of the NN/DNN. By inserting a selected padding in the input data to align the input data in memory, data read/writes can be optimized for processing by the NN/DNN thereby enhancing the overall performance of a NN/DNN. Operatively, an operations controller/iterator can generate one or more instructions that inserts the selected padding into the data. The data padding can be calculated using various characteristics of the input data as well as the NN/DNN as well as characteristics of the cooperating memory components. Padding on the output data can be utilized to support the data alignment at the memory components and the cooperating processing units of the NN/DNN.
Dynamic Command Scheduling for Storage System
The subject technology provides for managing a data storage system. Commands are identified into as a first command type or a second command type. The commands identified as the first command type are assigned to a first queue, and the commands identified as the second command type are assigned to a second queue. After the commands from the first queue and the commands from the second queue are processed based on a scheduling ratio over a predetermined period of time, a write amplification factor, number of host read commands, and number of host write commands during the predetermined period of time are determined. The scheduling ratio is updated based on the write amplification, the number of host read commands, the number of host write commands, and a predetermined scheduling ratio factor. Subsequent commands are processed from the first queue and the second queue based on the updated scheduling ratio.