1693 results about "Completion time" patented technology

A maintenance system for a process plant collects and uses historical data about maintenance orders. The data identifies the maintenance items for completing an order, such as the labor, materials, and maintenance tasks required. The data is historical data developed from actual completed maintenance orders. The system uses archived historical data and estimates various maintenance information, such as estimated cost for completing the maintenance order, and estimated start and completion times. The estimated data may be based on averaged data as a result. This estimated data along with the other maintenance order information may be sent to a scheduler for identifying a priority to the maintenance order and scheduling it accordingly.

A system and method for providing steering control for lane changing and lane centering purposes in an autonomous or semi-autonomous vehicle system. A vehicle vision system calculates roadway lane marking information, such as lateral offset, yaw angle and roadway curvature with respect to the vehicle's centered coordinate system. The roadway is then modeled as a second order polynomial equation. The method then predicts roadway lateral position and yaw angle over a pre-defined lane change completion time using a vehicle dynamic model. The method then compares a predicted vehicle path with a desired vehicle path to generate an error value, and calculates a steering angle command to minimize the error value, where the steering angle command is calculated as a function of vehicle lateral position, vehicle lateral speed, vehicle yaw rate and vehicle yaw angle. The steering angle command is then sent to the vehicle steering system.

Methods, articles of manufacture, and systems for determining a fee to be charged for requests processed in a grid computing environment based. In one embodiment the fee may be determined based on the time it takes to process a request and/or pricing schedules that may vary depending on a variety of pricing criteria. In another embodiment, a completion time criterion that defines a maximum acceptable time to complete a request may be specified. If the amount of time needed to perform the request is less than the maximum acceptable time specified, returning the results may be delayed to avoid providing services valued in excess of what the customer has paid for.

Methods, systems, and implementations are disclosed to schedule a plurality of tasks on one or more processors. The tasks may be part of a larger job based on a user initiated query for information retrieval. One example method of operation may include estimating, based upon historical actual execution times of tasks of a respective corresponding type, an expected execution time for each task of the plurality of tasks. The method may further include scheduling the plurality of tasks for execution on the one or more processors based upon the estimated expected execution time of each task. The scheduling procedure utilized ultimately produces an optimized task execution schedule, and in turn, minimizes the expected job completion time.

A method and system for updating a group of network nodes, such as a group of MFPs, with replacement software in a manner that improves network performance and the predictability of a completion time for installation of the replacement software involves throttling distribution of a software update package to avoid resource oversubscription while time-bounding distribution so that installation of the software update on all of the network nodes can be completed by a certain time and, in some embodiments, further involves determining a start time for distribution of the software update package based at least in part on a scheduled installation time selected by a network administrator, which provides a high degree of confidence that installation of the software update across the entire group of network nodes will be completed around a scheduled time (e.g. during “off hours”) notwithstanding the staggered distribution of the software update package.

A virtual machine manager (VMM) enables provisioning of services to multiple clients via a single data processing system configured as multiple virtual machines. The VMM performs several management functions, including: configuring/assigning each virtual machine (VM) for/to a specific, single client; scheduling the time and order for completing client services via the assigned client VM; instantiating a client VM at a scheduled time and triggering the execution of services tasks required for completing the specific client services on the client VM; monitoring and recording historical information about the actual completion times of services on a client VM; and updating a scheduling order for sequential instantiating of the multiple client VMs and corresponding client services, based on one or more of (i) pre-established time preferences, (ii) priority considerations, and (iii) historical data related to actual completion times of client services at a client VM.

A computer dispatcher connected to one or more respective network buffers has stored file lists that identify one or more of the files in the database that are to be transmitted over networks connected to the respective network buffer. A scheduler(s) schedule one or more portions of one or more of the files to be written to the respective network buffers by defining transmission criteria about each of the files in the file list. These transmission criteria include a quantity to transmit criteria, defining a quantity of one or more of the portions of the respective file to transmit, and one or more release times. The release times define the time at which the respective portion is to be written to the network buffer. The system includes a dispatching process that determines an available space on one or more of the network buffers and a current system time. The dispatching process determines if the system time is greater than or equal to one of the release times and further takes a minimum value of the available space and the quantity of the respective portion. The dispatching process then writes the minimum value of the respective portion to one or more of the network buffers. A feedback mechanism, e.g. a quantity completion measure, is used to estimate a completion time of the writing of the respective portion to the respective network buffer. The scheduler then reschedules one or more of the portions if one or more of the portions can not be scheduled to meet the respective transmission criteria.

The invention provides a task scheduling device in a multimode distributive system. The task scheduling device comprises a new task pool, a task filter, a task filtering pool and a task dispatcher, wherein the new task pool is used for storing new tasks, and the new tasks at least comprise new tasks in which task marks are added; the task filter is used for filtering out tasks with empty marks from the new tasks stored in the new task pool; the task filtering pool is used for storing the tasks with empty marks, filtered by the task filter; and the task dispatcher is used for predicting a model according to task completion time by aiming at each task stored in the task filtering pool so as to predict the completion time for executing the task on each processing node in the node processing set, and allocating the task to the processing node with shortest predicted completion time.

An intermittent risk exposure liability insurance method comprising the steps of: establishing an Internet business site enabled for communication with insurers and insureds through Internet service providers; enrolling the insureds in intermittent risk exposure liability insurance policies, the policies providing for a variable insurance premium rate depending upon an intermittent use of an insured article; logging start and completion times of each intermittent use of the insured article on the Internet business site by the insured; verifying start and completion times of use of the insured article in accordance with the logged start and completion times; and applying and billing premium insurance rates in accordance with the verified and logged start and completion times of use.

A method for resource management in grid computing systems includes defining user's demands on execution of a task as SLA (Service Level Agreements) information; monitoring states of resources in a grid to store the states as resource state information; calculating for each resource in the grid, based on the resource state information, an expected completion time of the task and an expected profit to be obtained by completing the task; creating an available resource cluster by using the expected execution time and the expected profit; and determining, if the SLA information is satisfied by the available resource cluster, a task processing policy for executing the task by using at least one resource in the available resource cluster. The available resource cluster is a set of resources having the expected completion time within a deadline of the task and the expected profit being positive.

A system for processing a computational task is presented. The system includes a plurality of nodes operationally coupled to one another via one or more networks. The plurality of nodes includes a base node including a processing subsystem configured to receive the computational task, select a subset of available nodes from the plurality of nodes based upon a present status, processing capability, distance, network throughput, range, resources, features, or combinations thereof of the plurality of nodes, divide the computational task into a plurality of sub-tasks, distribute the plurality of sub-tasks among the subset of available nodes based upon a number of nodes in the subset of available nodes, completion time period allowed for the plurality of sub-tasks, a distribution criteria, level of security required for the completion of the plurality of sub-tasks, resources available with the subset of available nodes, processing capability of the subset of available nodes, range of the subset of available nodes, features in the subset of available nodes, reliability of the subset of available nodes, trust in the subset of available nodes, the current load on the subset of available nodes, domain of the plurality of sub-tasks, or combinations thereof, receive sub-solutions corresponding to the plurality of sub-tasks from the subset of available nodes in a desired time period, and reassemble the sub-solutions to determine a solution corresponding to the computational task.

A casing mandrel for an independent screwed wellhead includes a pin thread adapted for engagement with a box thread of a well stimulation tool lockdown nut for securing the well stimulation tool against the casing mandrel top end. A well stimulation tool and a tubing head spool for use with the casing mandrel are also provided. Safety of well stimulation procedures is thereby improved and well completion time is significantly reduced.

Method, apparatus and systems for predicting the cooking time of an item food includes predicting the cooking time based on the rate of change of the internal temperature of the food item. The apparatus includes a processor that implements the calculations and the system may include the apparatus along with a temperature sensor.

The present disclosure describes a dynamic queueing and management system. The system utilizes the desired completion time in determining where to place new orders into the queue of orders to be fulfilled. If the desired completion time changes, the position of the corresponding order is adjusted within the queue. In some embodiments, the desired completion time is determined based on the location of the customer, either within the store or en route to the store. The queueing and management system may also separate the order input function from the order fulfillment and delivery functions. This may optimize each part of the process and allow faster service.

The present invention includes a method and system to facilitate managing of local and remote resources. The invention facilitates access to a resource engine, for the automatic grading, tracking, scoring, and assigning of resources based on the resource's skills and skill sets. The invention also facilitates the automatic grading, tracking, scoring, and assigning of tasks and/or applications based on the skills and skill sets needed to perform the tasks and/or applications. The invention uses one or more engines to combine relationships for resources, tasks, skills and time entry to determine expected completion times and efficiencies. The engine may include grading and scoring a resource's skills sets, dividing applications into various tasks, determining the desired resource skills sets to complete the tasks, and matching a resource's skills sets with the desired skills sets for the tasks.

In a wireless communication system where packet transmission begins after a preparation process is performed between a source and a destination, the source stores, in a header of a preparation packet, first duration information corresponding to an end of a first response packet sent from the destination and second duration information corresponding to an end of a second response packet sent from the destination. A neighboring station having received the preparation packet sets a first NAV relating to a scheduled reception completion time of the first response packet based on the first duration information and a second NAV relating to a scheduled reception completion time of the second response packet based on the second duration information and ignores the second NAV when no packet transmission is detected within the first NAV period or within a predetermined time after the scheduled reception completion time of the first response packet.

Embodiments of the present invention are directed to novel techniques for showing the progress of an automated computer process, particularly through a graphical user interface (GUI). Graphical status displays are employed which show graphical time-based information, such as rate and estimated time to completion, as well as a completion portion of an automated computer process. A remaining time indicator can be shown as a time scale for the graphical completion indicator. Instantaneous and historical rate information may be graphically displayed in various novel displays.

Methods and systems for managing data loads on a cluster of processors that implement an iterative procedure through parallel processing of data for the procedure are disclosed. One method includes monitoring, for at least one iteration of the procedure, completion times of a plurality of different processing phases that are undergone by each of the processors in a given iteration. The method further includes determining whether a load imbalance factor threshold is exceeded in the given iteration based on the completion times for the given iteration. In addition, the data is repartitioned by reassigning the data to the processors based on predicted dependencies between assigned data units of the data and completion times of a plurality of the processers for at least two of the phases. Further, the parallel processing is implemented on the cluster of processors in accordance with the reassignment.

A method for profiling performance of a system includes steps of: monitoring execution of the system at multiple points during the system's operation; analyzing results derived from the monitoring in order to provide analyzed results; reconfiguring the monitoring non-uniformly according to the analyzed results; and repeatedly performing iterations of the above steps until a particular event occurs. The iterations may be terminated upon: reaching a specified level of analysis precision, determining a source of one or more performance bottlenecks, determining a source of unexpectedly high output or low completion time, completing a predefined number of iterations, reaching an endpoint of an application, or having performed iterations for a specified period of time.

A task effort estimator may determine a probability distribution of an estimated effort needed to complete unfinished tasks in a project based on one or more of a set of completed tasks belonging to a project and attributes associated with the completed tasks belonging to the project, a set of completed tasks not belonging to the project and attributes associated with the completed tasks not belonging to the project, or the combination of both. A project completion predictor may determine a probability distribution of completion time for the project based on the probability distribution of an estimated effort needed to complete the unfinished tasks in the project, and one or more resource and scheduling constraints associated with the project.

A development management system and method are disclosed for providing substantially real-time monitoring of the progress of a product development and a projection of completion of the project based on objective criteria, which can be plotted against the planned time to completion and budget for a project. The principle of the development management system and method as applied to a software product development is to perform detailed and empirically sound measurements of the source code, changes being made in code, defect measurements, and productivity measurements to build a highly accurate measurement of a project's status and velocity. The development management system and method also provide a real-time view, at a highly granular level, into the status and velocity of the project to enable projection of when the project will finish, what budget will be expected, and how each milestone of the project is progressing.

Embodiments disclosed herein seamlessly integrate several components into a comprehensive collusion detection and traffic quality prediction system, including a strong modeling module for processing historical click data and transforming potential collusions hidden therein into solvable graph partitioning (network) and/or vector space clustering (pattern) models, a scalable and robust toolkit comprising a plurality of graph partitioning and clustering heuristics for analyzing and generating high density subgraphs and high dimensional clusters or groups, and a post processing module for extracting entities from the subgraphs and clusters and placing them on global block lists. Entities thus listed can be blocked from client networks in real time. As such, high traffic quality can be predicted. A job scheduler may schedule individual jobs from the modeling module based on the number of available resources in a distributed computing environment to minimize completion time while balancing load.

A charging system for a battery pack, including a charging station transferring energy to the battery pack at a maximum fast charge rate in a first operational mode and transferring energy to the battery pack at a slower charge rate in a second operational mode; a data collection system acquiring data indicating a state of charge of the battery pack and one or more desired charge optimization parameters; and a station control, responsive to the data and to the desired charge optimization parameters, automatically establishing a charging profile for the battery pack to assert a control signal and operate the charging station in the second operational mode whenever the charging station is able to transfer sufficient energy to the battery pack at the slower charge rate to meet an SOC target and a charge completion time target.

When path status information is updated, the time at which the update is effective is recorded. A packet arrival time in each path is predicted based on new status information and data transmission history after the effective time. The packet is transmitted to the path that provides a fastest packet arrival time. This reflects the path status available from the reception side on the data transmitted in past, so that an actual data arrival time, an arrival time close to a reception completion time, or a reception completion time can be predicted.