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.

In a signal receiving apparatus as, for example, that used in the monitoring in a stolen vehicle transceiver of the presence of sequential transmitted signals specifically requesting that transceiver to respond to enable tracking the vehicle, wherein the receiver is powered by a consumable energy source of predetermined budgeted lifetime and adapted to operate between quiescent energy-saving and energized energy-consuming states for performing such sequential signal monitoring, desired signal identifying and related functions, a method of and apparatus for insuring the availability of energy to be able to perform such functions within said predetermined budgeted life time, that comprises, allocating budget time intervals for periodically operating the receiver intermittently in energized state to enable the performing of such functions as monitoring for such signals; and, in the event of inordinate energy consumption during such operation, that, if continued, would render the operation out of overall allocated time budget, adaptively skipping time intervals with the receiver quiescent, sufficiently to get the operation back on overall time budget.

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 time-partitioned system for accounting for processor time consumed by operating system services provided on behalf of an application runs in a real-time environment. The time utilized by the operating system is treated as application processing time, rather than viewing the resultant processor time consumed as an operating system overhead. Each application consists of one or more threads. A time budget is assigned to each thread and to each interrupt. The processor time consumed by the operating system when executing on behalf of a thread or interrupt is charged back to the application or interrupt as part of the application's time budget. Operating system overheads and processor interrupts are thus accounted for accurately enough to determine a schedule for the applications that is enforceable by the operating system at run time.

A high performance transaction storage and retrieval system supports an enterprise application requiring high volume transaction processing using commodity computers meeting business processing time budget requirements. The transaction storage and retrieval system is coupled to servers. The transaction storage and retrieval system includes input / output processes corresponding respectively to the servers and receiving transaction data from the servers, a memory, coupled to the input / output processes, receiving the transaction data from the input / output processes and storing the transaction data, disk writers coupled to the memory and corresponding respectively to the servers, and subpartition storage, coupled to the disk writers. The disk writers read the transaction data from the memory and store the transaction data in the subpartition storage. The subpartition storage is organized as flat files, each subpartition storage storing data corresponding to a subpartition of the transaction data.

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.

Disclosed is a novel computer implemented system, on demand service, computer program product and a method for fault-localization techniques that apply statistical analyses to execution data gathered from multiple tests. The present invention determines the fault-localization effectiveness of test suites generated according to several test-generation techniques based on combined concrete and symbolic (concolic) execution. These techniques are evaluated by applying the Ochiai fault-localization technique to generated test suites in order to localize 35 faults in four PHPWeb applications. The results show that the test-generation techniques under consideration produce test suites with similar high fault-localization effectiveness, when given a large time budget.

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.

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 method for synthesizing a register transfer level (RTL) based design employs a bottom-up approach to generate a final top-level design. The top-level design is divided into a plurality of sub-modules. Each of the sub-modules is then independently synthesized using an RTL based design approach and independently adapted to conform to timing requirements produced for each of the sub-modules using time budgets that are based on the top-level timing requirements. Once the sub-modules are synthesized and pass individual timing requirements specific for those sub-modules, the sub-modules are integrated to form a top-level design. The top-level design may then be verified for timing requirements and other formal requirements.

System, method, and computer program product are provided for using real-time video analysis, such as augmented reality to provide the user of a mobile device with real-time budgeting and wish lists. Through the use of real-time vision object recognition objects, logos, artwork, products, locations, and other features that can be recognized in the real-time video stream can be matched to data associated with such to provide the user with real-time budget impact and wish list updates based on the products and budget data determined as being the object. In this way, the objects, which may be products and / or budget data in the real-time video stream, may be included into a user's budget and / or wish list, such that the user receives real-time budget and / or wish list updates incorporating product and / or budget data located in a real-time video stream.

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.

The invention discloses a route querying method and device, a storage medium and a processor. The method comprises the following steps: receiving querying conditions including a place of departure, preset consumption time which is the time between the time of departing from the place of departure and the preset end time, and preset consumption cost; querying a target route meeting the querying conditions according to a preset route directed map, wherein the route directed map is used for indicating the time cost from a first place to the second place and the consumed cost; the place of departure includes the first place; the corresponding consumption time of the target route is not greater than the preset consumption time; the corresponding consumption cost of the target route is not greater than the preset consumption cost; outputting the queried target route. With the adoption of the method, the technical problem of failing to query the target route under time budget and cost budget in the prior art can be solved.

Disclosed is a GPP-based 5G terminal common platform optimization method. The method involves: allocating different priorities to programs of different modules in a base station, wherein a program related to a control channel and a control processing flow has the highest priority; processing a task with lower priority after the processing of a task with higher priority is complete; segmenting tasks into a plurality of sub-tasks according to an attribute of each of the tasks, and allocating the plurality of sub-tasks to different threads; and allocating a time budget to each of the sub-tasks, marking each of the sub-tasks with a time stamp in the processing flow, and deciding whether to continue execution or stop in advance according to a comparison result of the time stamp of each of the sub-tasks and the allocated time budget.

The invention relates to a personalized takeover early warning method and system based on dynamic time budget, and the method comprises the steps: enabling the individual feature data of a driver to be fused into the early warning of takeover control, and synthesizing the real-time comprehensive environment state of a vehicle and the real-time takeover reliability of the driver; according to the association relationship between the driver state recovery time and the takeover reliability, the driver perception environment complexity time and the vehicle real-time comprehensive environment state, the operation time of the driver responding to the vehicle driving takeover request and the driver characteristic attribute, the takeover time budget and instability boundary related information, and the driver state recovery time, the vehicle driving takeover request is obtained; and sensing a preset relationship between the environment complexity time and the operation time of the driver by the driver in response to the vehicle driving takeover request, and generating a dynamic takeover time budget and an early warning prompt, so that the early warning prompt meets the personalized takeover early warning requirement of the current driver state, and an effective early warning prompt is sent out. A more suitable take-over time condition is created, and a better early warning effect is obtained.

This document describes systems, methods, and apparatus for determining a time budget for transcoding a video. By calculating and / or monitoring the time budget in accordance with the teachings hereof, a transcoder can assess the effect its transcode duration will have on a client buffer. As a result the transcoder may adjust its processing of the video. The teachings hereof are applicable, without limitation, to the transcoding of live video.

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.

Local Interconnect Network message budget calculation error is reduced by utilizing an eight bit time measurement of the sync byte in the message header. The method determines the header budget separately from the data budget, simplifying the required logic. The sync byte reference time is multiplied by the message data size to determine the data 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.

A circuit analysis tool is provided, enabled as computer software instructions, for budgeting time delays between integrated circuit (IC) modules. The instructions accept a command enabling an IC floor-plan including a first module and a second module. The first module includes a first circuit element having a signal output interface, and an output port. The second module includes an input port, and a second circuit element having a signal input interface. A command is accepted defining a maximum delay value, and a first delay value is estimated between the first circuit element signal output interface and the first module output port. A second delay value is estimated between the second circuit element signal input interface and the second module input port, and a third delay value is estimated between the first module output port and the second module input port. The first, second, and third delay values are summed, creating a time budget estimate. The time budget estimate is approved if it is less than the maximum delay value.

The present invention relates to a budget data processing method and system thereof, wherein the budget data processing method comprises the following steps: receiving a business budget application instruction, the business budget application instruction includes the budget application number; changing the corresponding frozen field in the budget data table, and Set the status of the amount corresponding to the number of budget applications to frozen, and get the frozen budget; receive business reimbursement instructions, which include the number of business reimbursements; when the number of business reimbursements is greater than or equal to the number of budget applications, it will correspond to the frozen budget Set the state of the amount to be unfrozen; when the amount of business reimbursement is less than the amount of budget application, use the amount corresponding to the business reimbursement amount as the amount to be unfrozen in the budget freeze, set the state of the amount to be unfrozen to unfreeze, and get the budget freeze remaining number. The present invention can realize the business association between one budget application and multiple business reimbursements, and prevent the situation that the business has occurred but the budget is insufficient.

The invention discloses a method for judging hot uncomfortableness of broiler chickens according to grooming behavior time distribution. The method is used for establishing a model for judging hot uncomfortableness of the broiler chickens to be tested in a laboratory. The method comprises the following steps that (1) when the environment temperature to be evaluated is reached, the broiler chickens are fed for two hours, and the time for carrying out a grooming behavior of the broiler chickens to be tested in cages in certain time is detected; (2) the percentage of the grooming behavior is calculated, and the model for judging hot uncomfortableness of the broiler chickens to be tested in the laboratory is established; (3) the model is utilized for judging or helping to judge the hot uncomfortableness of the broiler chickens to be tested with the feeding condition of comfort temperature as contrast. The experiments of the method show that the grooming behavior of the broiler chickens under hot stimulation for two hours and the changes of time distribution of the grooming behavior can be measured, the hot uncomfortableness of the broiler chickens is judged accordingly, whether the temperature of the environment where the broiler chickens is located is high or not can be judged in time, and therefore measures can be taken in time to avoid decline of production performance of the broiler chickens due to hot uncomfortableness.

The invention discloses an asymptotic expression entity identification method based on multi-path partitioning. The method comprises the following steps: carrying out multi-path partitioning to obtain intersected blocks, building a block diagram to eliminate block redundancy, initializing block credibility and candidate pair credibility, sequencing candidate pairs according to the credibility, and interpolating the candidate pairs into a candidate queue; then iteratively carrying out the following three steps: (1) processing the candidate pairs in the candidate queue, (2) updating the credibility of part of the candidate pairs according to an identification result, and (3) adjusting the sequence of the candidate queue according to the updated credibility of the candidate pairs, gradually outputting identified repeated data object pairs, and continuously repeating the three steps till the candidate queue is emptied. According to the asymptotic expression entity identification method based on the multi-path partitioning, more repeated data objects can be identified according to a relatively short time budget; the credibility of the candidate pairs is updated by dynamically estimating the redundancy of blocks; by real-time selection of the most possibly matched candidate pairs for identification, high asymptotic property is guaranteed.

Control and monitoring device for actuating means for the opening / closing of operating elements, featuring a mobile contact and a fixed contact, comprising measuring means for the current and voltage of one or more electrical phases and a processing unit equipped with means for performing the following functions: receiving in input from said measuring means signals indicating a succession of moments measured in which the voltage and / or current assumes a desired value; iteratively executing a calculation of the period of succession of moments measured; executing a predictive calculation of a succession of moments in which the current and / or voltage assumes said desired value; calculating, following an operating command, the time window for the opening / closing of said electric operating elements; sending a command to said actuator means on the basis of the time window determined and of the operating times of said electric operating elements; characterised by the fact that said processing unit: executes a first algorithm envisaging normal network operating conditions; executes a second algorithm envisaging non-normal operation of the network; <IMAGE>

A wireless network has a duty-cycle limitation, which defines a total transmission time budget and an average transmission time. A device (100) has a controller (102) for controlling the transmission of data according to the duty-cycle limitation. The controller stores past transmission time usage of the device in sequences of buckets, and determines a bucket budget of transmission time. A basic transmission time budget is assigned which is smaller than the average transmission time of the corresponding time interval, and additional transmission time is allocated to allow for temporally exceeding the average transmission time. The additional transmission time is based on the total transmission time budget and the past transmission time usage of past buckets in combination with the future basic transmission time budget of future buckets, which past, current and future buckets together cover the duty-cycle period. Advantageously, the system enables accommodating temporal fluctuation in data transmission and guarantees a minimum transmission capacity.