85 results about "Processor scheduling" patented technology

A scalable shader architecture is disclosed. In accord with that architecture, a shader includes multiple shader pipelines, each of which can perform processing operations on rasterized pixel data. Shader pipelines can be functionally removed as required, thus preventing a defective shader pipeline from causing a chip rejection. The shader includes a shader distributor that processes rasterized pixel data and then selectively distributes the processed rasterized pixel data to the various shader pipelines, beneficially in a manner that balances workloads. A shader collector formats the outputs of the various shader pipelines into proper order to form shaded pixel data. A shader instruction processor (scheduler) programs the individual shader pipelines to perform their intended tasks. Each shader pipeline has a shader gatekeeper that interacts with the shader distributor and with the shader instruction processor such that pixel data that passes through the shader pipelines is controlled and processed as required.

A circuit for selecting one of N requestors in a round-robin fashion is disclosed. The circuit 1-bit left rotatively increments a first addend by a second addend to generate a sum that is ANDed with the inverse of the first addend to generate a 1-hot vector indicating which of the requestors is selected next. The first addend is an N-bit vector where each bit is false if the corresponding requester is requesting access to a shared resource. The second addend is a 1-hot vector indicating the last selected requester. A multithreading microprocessor dispatch scheduler employs the circuit for N concurrent threads each thread having one of P priorities. The dispatch scheduler generates P N-bit 1-hot round-robin bit vectors, and each thread's priority is used to select the appropriate round-robin bit from P vectors for combination with the thread's priority and an issuable bit to create a dispatch level used to select a thread for instruction dispatching.

In one form of the invention, a method for scheduling multiple instruction threads for a processor in an information handling system includes communicating, to processor circuitry by an operating system, a selected schedule of instruction threads for a set of instructions. The processor circuitry switches from executing one of the threads with one of the contexts to executing another of the threads with another of the contexts, responsive to the schedule received from the operating system.

Dispatching of interrupts to a processor is conditionally suppressed, that is, only if an old priority value and a new priority value are either both less than or both greater than a maximum pending priority value. This conditional avoidance of dispatching is preferably implemented by a virtual priority module within a binary translator in a virtualized computer system and relates to interrupts directed to a virtualized processor by a virtualized local APIC.

Aspects of the present invention concern a method and system for scheduling a request for execution on multiple processors. This scheduler divides processes from the request into a set of domains. Instructions in the same domain are capable of executing the instructions associated with the request in a serial manner on a processor without conflicts. A relative processor utilization for each domain in the set of the domains is based upon a workload corresponding to an execution of the request. If there are processors available then the present invention provisions a subset of available processors to fulfill an aggregate processor utilization. The aggregate processor utilization is created from a combination of the relative processor utilization associated with each domain in the set of domains. If processors are not needed then some processors may be shut down. Shutting down processors in accordance with the schedule saves energy without sacrificing performing.

A method of scheduling execution of a plurality of tasks by a processor, the processor having a processor memory, the processor being arranged to load into the processor memory, during execution of a current task, data for a task that is scheduled for execution after the processor has completed the current task, the method comprising the steps of scheduling a next task for execution by the processor after the processor has completed a current task, and determining whether there is a high priority task to be executed by the processor, if there is a high priority task to be executed by the processor: determining whether the processor has begun loading the data for the next task into the processor memory, and if the processor has not begun loading the data for the next task into the processor memory, scheduling the high priority task, instead of the next task, for execution by the processor after the processor has completed the current task.

In one aspect, the invention is a computer program product residing on a computer readable medium having a plurality of instructions stored thereon. The instructions when executed by the processor, cause that processor to schedule a network-based media event; and to invite an attendee to attend the network-based media event. Other aspects of the invention includes a process and a method.

The invention discloses a conversion method of line-course realization and state in the Java operation system, which is characterized by the following: the line course provides an execution path in the Java operation system, which is a basic unit of disposer dispatching; all line-course sharing processes acquire address space and resource in the same process; the line course contains five different states, which can do high effective conversion among states to improve the system property. The invention displays important meaning to the embedded system environment, for Java operation system of embedded system especially.

A disc drive with a control processor programmed with an execution time dependent command schedule optimization method to effect data throughput with a host device. The disc drive includes a head disc assembly executing commands scheduled by the control processor. The control processor selects and schedules a next optimum command from among commands analyzed by the control processor during a time the head disc assembly is executing a current command. The steps utilized by the control processor to select and schedule the next optimum command include executing a first command with the head disc assembly, determining a computation time for a second command, storing the computation time as a computation time estimate, and using the stored computation time estimate to determine the number of commands in a command queue for analysis to provide a level of command schedule optimization commensurate with the available time.

In one aspect, method is provided for controlling a display device, comprising: displaying, on a touchscreen display, a first window executing a first application and a second window executing a second application; receiving, at the touchscreen display, a first command input to the first window and a second command input to the second window; determining whether the first command and the second command are received simultaneously; dispatching, by a processor, the first command; and dispatching, by the processor, the second command.

Embodiments of the invention provide a thread scheduling method and device, electronic equipment and a storage medium. The method comprises the steps of acquiring a pairing relation between each thread in a target virtual machine process and each local thread in an operating system; and according to the pairing relation, binding each thread to a corresponding processor in a target processor set, so that each thread is dispatched by the corresponding processor. According to the technical scheme, the phenomenon that time slices of the same processor are scrambled for when multiple threads are executed is avoided; the problem that multi-thread task queuing is blocked due to excessive service threads of the same processor and overlong service time of real-time threads is solved; the executiontime delay of other threads is shortened; and the real-time performance of thread execution is improved.

The invention provides a method for realizing threads and switching thread states for an embedded SRAM operating system, for the operating system is located in the SRAM, and the resources are limited, using the thread as the foundation of controlling the operating system, where a process is composed of threads, each of which is an executing path in the process, and each process is allowed to comprise plural parallel executing paths, namely multithreading. And the thread is a basic unit for the system to make processor control, and all threads in the same process share main memory space and resources obtained by the process, and the thread has seven different states and can make high-efficiency switching between states, and fully use the characters of SRAM and having special significance in processing system resources by embedded SRAM operating system.

The described embodiments include a processor that executes a vector instruction. In the described embodiments, while dispatching instructions at runtime, the processor encounters a dependency-checking instruction. Upon determining that a result of the dependency-checking instruction is predictable, the processor dispatches a prediction micro-operation associated with the dependency-checking instruction, wherein the prediction micro-operation generates a predicted result vector for the dependency-checking instruction. The processor then executes the prediction micro-operation to generate the predicted result vector. In the described embodiments, when executing the prediction micro-operation to generate the predicted result vector, if a predicate vector is received, for each element of the predicted result vector for which the predicate vector is active, otherwise, for each element of the predicted result vector, the processor sets the element to zero.

The invention is applicable to the technical field of communications, and provides a processor scheduling method and system. The method comprises the steps of receiving a thread priority or time slice modification instruction; modifying the priority or time slice of a thread and acquiring a thread with the highest priority in the ready state; and when a thread under a running state currently exits a kernel exclusive area, executing the thread with the highest priority in the ready state in a processor according to the length of the time slice. The processor scheduling method provided by the invention combines a priority enforcement mechanism and a round-robin mechanism; a priority preemption mechanism is adopted between threads of different priorities, and the round-robin mechanism is adopted between threads of the same priority; since a scheduling mechanism is based on threads, switching between threads consumes a very small amount of resources, therefore, the switching efficiency of occupying a CPU between threads of different priorities and the same priority is improved, the fairness of occupying processor resources between the threads is considered, and the system real-time performance is high.

The invention provides a real-time processing method of multiple video data on multi-GPU (multiple graphics processing unit) platform; the method mainly comprises the steps of 1, establishing a layered parallel structure based on task processors; 2, initializing the task processors in the layered parallel structure, and receiving monitoring video data and processing the monitoring video data in real time by each task processor; 3, carrying out environment monitoring, calculating task queue health level, task cache region health level and health level of each GPU according to the results of environment monitoring; 4, scheduling the task processors and distributing tasks according to the task queue health level, the cache region health level and the health level of each GPU; 5, repeating the steps 3 and 4 regularly so that balanced load is maintained among the GPUs. A complete parallel scheduling and data management scheme is designed for the real-time processing of multiple video multiple tasks on the multi-GPU platform, the great calculating capacity of a multi-GPU processor can be utilized efficiently, and calculating speed is increased greatly.

A virtual functional unit design is presented that is employed in a statically scheduled VLIW processor. ''Virtual'' views of the function unit appear to the processor scheduler that exceed the number of physical instantiations of the functional unit. As a result, significant processor performance improvements can be achieved for those types of functional units that are too difficult or too costly to physically duplicate. By providing different virtual views to the different clusters of a VLIW processor, the compiler/scheduler can generate more efficient code for the processor, than a processor without virtual views and the physical unit restricted to a subset of the processor's clusters. The compiler/scheduler guarantees that the restrictions with respect to scheduling of operations for functional units with multiple virtual views is met. NON-clustered processors also benefit from virtual views. By providing multiple virtual views in multiple issue slots of a physical function unit, the compiler/scheduler has more freedom to schedule operations for the functional unit.

In an approach for parallelizing document processing in an information handling system, a processor receives a document, wherein the document includes text content. A processor extracts information from the text content, utilizing natural language processing and semantic analysis, to form tokenized semantic partitions, comprising a plurality of sub-documents. A processor schedules a plurality of concurrently executing threads to process the plurality of sub-documents.

The embodiment of the invention discloses a method for scheduling a processor and a terminal. The method comprises the steps of firstly monitoring whether the terminal receives an operational event or not in real time; determining an application program to which the operational event belongs when the operational event is received; judging whether the application program is in a default list or not; if so, assigning a task corresponding to the operational event to a high performance processor; and if not, assigning the task corresponding to the operational event to a low power consumption processor. According to the method for scheduling the processor and the terminal, the power consumption of a system can be reduced.

The invention discloses a method and device for generating a processor scheduling policy in a multi-core system and a scheduling system. The generating method comprises the steps that receiving and statistics are carried out on application characteristics generated by real-time operating of an application program in processors of the multi-core system, and an original scheduling policy is generated according to a statistical result of the application characteristics generated by real-time operating of the application program; the original scheduling policy corresponding the application program is adjusted according to the current operating conditions of different processors in the multi-core system; according to a received scheduling request, the adjusted original scheduling policy is issued, and according to the adjusted original scheduling policy, the processor corresponding to the adjusted original scheduling policy is selected from the processors of the multi-core system to operate the application program. The type of the application program does not need to be marked, the optimal scheduling mode of different application programs can be determined, and the situation that the optimal scheduling mode of the application programs is hard to determine due to the wide program representation types in the prior art is avoided.

The described embodiments provide a processor that executes vector instructions. In the described embodiments, while dispatching instructions at runtime, the processor encounters a predicate-generating instruction. Upon determining that a result of the predicate-generating instruction is predictable, the processor dispatches a prediction micro-operation associated with the predicate-generating instruction, wherein the prediction micro-operation generates a predicted result vector for the predicate-generating instruction. The processor then executes the prediction micro-operation to generate the predicted result vector. In the described embodiments, when executing the prediction micro-operation to generate the predicted result vector, if the predicate vector is received, for each element of the predicted result vector for which the predicate vector is active, otherwise, for each element of the predicted result vector, generating the predicted result vector comprises setting the element of the predicted result vector to true.

Multiple coprocessor scheduling of parallel processing steps control with bit arithmetic using a bitmask for each data block buffer indicating next processing step and a bitmask of processing steps with available coprocessors. ANDs of the bitmasks for the buffers with the bitmask of processing steps determines processing steps to run. This allows for parallel processing on the data blocks in the various buffers.

A method of scheduling a plurality of instructions for a processor comprises the steps of: establishing a functional unit resource table comprising a plurality of columns, each of which corresponds to one of a plurality of operation cycles of the processor and comprises a plurality of fields, each of which indicates a functional unit of the processor; establishing a ping-pong resource table comprising a plurality of columns, each of which corresponds to one of the plurality of operation cycles of the processor and comprises a plurality of fields, each of which indicates a read port or a write port of a register bank of the processor; and allotting the plurality of instructions to the plurality of operation cycles of the processor and registering the functional units and the ports of the register banks corresponding to the allotted instructions on the functional unit resource table and the ping-pong resource table.