34 results about "Time budget" patented technology

A re-programmable non-volatile memory system, such as a flash EEPROM system, having its memory cells grouped into blocks of cells that are simultaneously erasable is operated to perform memory system housekeeping operations in the foreground during execution of a host command, wherein the housekeeping operations are unrelated to execution of the host command. Both one or more such housekeeping operations and execution of the host command are performed within a time budget established for executing that particular command. One such command is to write data being received to the memory. One such housekeeping operation is to level out the wear of the individual blocks that accumulates through repetitive erasing and re-programming.

A re-programmable non-volatile memory system, such as a flash EEPROM system, having its memory cells grouped into blocks of cells that are simultaneously erasable is operated to perform memory system housekeeping operations in the foreground during execution of a host command, wherein the housekeeping operations are unrelated to execution of the host command. Both one or more such housekeeping operations and execution of the host command are performed within a time budget established for executing that particular command. One such command is to write data being received to the memory. One such housekeeping operation is to level out the wear of the individual blocks that accumulates through repetitive erasing and re-programming.

A system is set forth that includes a processor, one or more memory storage units, and software code stored in the one or more memory storage units. The software code is executable by the processor to generate a plurality of adaptive partitions that are each associated with one or more process threads. Each of the plurality of adaptive partitions has one or more corresponding scheduling attributes that are assigned to it. The software code further includes a scheduling system that is executable by the processor for selectively allocating the processor to run the process threads based on a comparison between ordering function values for each adaptive partition. The ordering function value for each adaptive partition is calculated using one or more of the scheduling attributes of the corresponding adaptive partition. The scheduling attributes that may be used to calculate the ordering function value include, for example, 1) the process budget, such as a guaranteed time budget, of the adaptive partition, 2) the critical budget, if any, of the adaptive partition, 3) the rate at which the process threads of an adaptive partition consume processor time, or the like. For each adaptive partition that is associated with a critical thread, a critical ordering function value also may be calculated. The scheduling system may compare the ordering function value with the critical ordering function value of the adaptive partition to determine the proper manner of billing the adaptive partition for the processor allocation used to run its associated critical threads. Methods of implementing various aspects of such a system are also set forth.

A system and method are provided for apportioning additional thread activation time to computer application threads that experience activation time budget overruns. A variable is set to a predetermined system pad time value, and an application thread is activated for an actual activation time. The application thread's actual activation time is compared with its activation time budget. If the actual thread activation time exceeds the thread activation time budget, the system pad time value is adjusted to thereby obtain an updated pad time value. By providing a system pad time that application threads may draw from, the pad time allotted to individual application threads may be reduced when compared to a worst-case scenario.

The invention discloses a 5G terminal universal platform optimization method and a 5G terminal universal platform optimization system based on a general purpose processor (GPP). The method comprises the steps of distributing different priorities to programs of different modules in a base station, wherein the highest priority is distributed to a program related to a control channel and a control processing flow; processing tasks with low priorities after the tasks with the high priorities are completely processed; segmenting the tasks according to the attribute of each task, and distributing the sub-tasks into different threads; distributing a time budget to each sub-task, marking a timestamp for each sub-task in a processing flow, comparing the timestamp of each sub-task with the distributed time budget to decide whether to continue execution or end in advance. The method is high in real-time processing, low in feedback delay, accords with the strict requirements of high instantaneity and low delay in mobile communication, and greatly optimizes an existing universal platform.

In one embodiment of the invention, a method includes reading an automatically generated timing budgeting file, including timing budget information for a plurality of partitions of an integrated circuit design; graphically displaying a time budgeting debug window on a display device; and graphically displaying a timing budget analyzer window on the display device in response to selection of a selected signal path in a path list window pane. The timing budget analyzer window graphically displays timing budgets and timing delays of a selected path for visual comparison. The time budgeting debug window includes a button with a path category menu to display one or more signal paths meeting a selected path category, and a path list window pane to display a list of one or more signal paths through one or more ports of the plurality of partitions in response to the selected path category in the path category menu.

Clocking Chien searching at different frequency than other Reed-Solomon (RS) ECC decoding functions. An efficient implementation allows for a fast clock signal to govern the operation of the more computationally and time-intensive portions of the error correction code (ECC) time budget. For example, at least one module and / or decoding function within the ECC decoding is governed by using a first clock signal, and at least one other module and / or decoding function (or all the other modules and / or decoding functions) is / are governed by using a second clock signal. In one implementation of Reed-Solomon (RS) decoding, the Chien searching function is operated using a faster clock signal than at least one other RS error correction decoding function thereby allowing for a significant reduction in area and power than other architectural trade-offs.

A fuel burner controller and associated method is configured to establish fuel combustion in a fuel burner and to recycle a fuel combustion initiation process when a loss of combustion is detected and a call for heat is asserted. The controller is further configured to limit a number of recycles of the fuel combustion initiation process based on a time budget.

Disclosed are a method and device for distance measurement. A method for optical distance measurement, comprising a creation of at least one frame, including determining 3D information of at least onesubregion of a measuring region. A time budget for creating the frame is split between a first phase for assessing at least one region of interest, and a second phase for determining 3D information from the at least one region of interest. During the first phase a plurality of measuring pulses is emitted by a transmitting unit, and reflected measuring pulses are received by a receiving unit, wherein 2D information of the measuring region is determined, wherein at least one region of interest is assessed from the 2D information. During the second phase a plurality of measuring pulses is emitted by a transmitting unit, and reflected measuring pulses are received by the receiving unit, wherein 3D information of the at least one region of interest is determined as part of the second phase.