551 results about "Dynamic dispatch" patented technology

The invention provides a task-dynamic dispatching method under a distributed computation mode in a cloud computing environment, which comprises the following four steps: 1. a main node receives and analyzes heartbeat information of a subsidiary node; 2. the main node previously distributes the task according to a node state table and a task state table; 3. the subsidiary node demands the task from the main node; and 4. the main node distributes the task to the subsidiary node. The method firstly considers the resource demand of the task and the performance information of the nodes, and dynamically controls the distribution of the task under the condition that the requirement is met, so that the response speed of the work and the resource utilization of the nodes are improved. The method has wide practical value and application prospect in the technical field of the distributed computation in the cloud computing environment.

A method of power system dispatch control solves power system dispatch problems by integrating a larger variety of generation, load and storage assets, including without limitation, combined heat and power (CHP) units, renewable generation with forecasting, controllable loads, electric, thermal and water energy storage. The method employs a predictive algorithm to dynamically schedule different assets in order to achieve global optimization and maintain the system normal operation.

A system and method for efficient dynamic scheduling of tasks. A scheduler within an operating system assigns software threads of program code to computation units. A computation unit may be a microprocessor, a processor core, or a hardware thread in a multi-threaded core. The scheduler receives measured data values from performance monitoring hardware within a processor as the one or more processors execute the software threads. The scheduler may be configured to reassign a first thread assigned to a first computation unit coupled to a first shared resource to a second computation unit coupled to a second shared resource. The scheduler may perform this dynamic reassignment in response to determining from the measured data values a first measured value corresponding to the utilization of the first shared resource exceeds a predetermined threshold and a second measured value corresponding to the utilization of the second shared resource does not exceed the predetermined threshold.

An architecture and related systems for improving the performance of non-blocking data switching systems. In one embodiment, a switching system includes an optical switching core coupled to a plurality of edge units, each of which has a set of ingress ports and a set of egress ports. The switching system also contains a scheduler that maintains two non-blocking data transfer schedules, only one of which is active at a time. Data is transferred through the switching system according to the active schedule. The scheduler monitors the sufficiency of data transferred according to the active schedule and, if the currently active schedule is insufficient, the scheduler recomputes the alternate schedule based on demand data received from the edges/ports and activates the alternate schedule. A timing mechanism is employed to ensure that the changeover to the alternate schedule is essentially simultaneous among the components of the system.

A calendaring method and system providing dynamic scheduling services by synchronizing calendars in a confidential and anonymous manner without the need for sharing calendar content with others. One can divide their calendar into time cubes chronologically, define each time cube according to availability states, allow a user to send data representing an invitation to an event to one or more contacts for approval, and when an invitation of one or more contacts has been approved, opening a secure “private room” in a meeting and event coordinating server adapted for synchronizing between users' calendars in a confidential and anonymous manner. Also a meeting coordinating server adapted for synchronizing between users' calendars via a secure “private room” without using any calendaring content except the availability status of each user, and according to a level of importance, and a dedicated application adapted for running/executing on a user's terminal.

An apparatus and method capable of reducing idle resources in a multicore device and improving the use of available resources in the multicore device are provided. The apparatus includes a static scheduling unit configured to generate one or more task groups, and to allocate the task groups to virtual cores by dividing or combining the tasks included in the task groups based on the execution time estimates of the task groups. The apparatus also includes a dynamic scheduling unit configured to map the virtual cores to physical cores.

The invention relates to a real-time information processing method in bus dynamic dispatching, which is specially used for dynamic dispatching of bus single or area multi-line of the ground. The real-time information comprises vehicle positioning information and passenger flow information; acquiring equipment comprises a GPS vehicle-mounted terminal and an IC card POS machine terminal; a processing method comprises the following steps: acquiring and transmitting real-time information; processing and preprocessing real-time information; carrying out secondary processing to the acquired data; taking relevant technologies of ITS and the computer of the bus vehicle positioning technology, the bus passenger flow acquisition technology, the network communication technology, WebGIS and the like as support, acquiring real-time information of ground bus line operation, carrying out processing on the real-time information, calculating operating state of vehicle delay time, section passenger flow, load factor and the like, and carrying out vehicle bunching recognition; and using a Kalman filtering model to predict the arrival time and delay time of the bus vehicle, and providing decision basis for dynamic dispatching measures.

The invention aims to disclose a method and a system for dynamic scheduling management of virtualized resources in a virtualized desktop system. Compared with the prior art, the system carries out reasonable assignment on a virtual machine according to the resource consumption type of the virtual machine requested by a user, so that the resource demands of the virtual machine can be matched with the capacity of a host machine, the operating performance of the virtual machine is promoted, and the load balance of cluster resources is optimized. In the operating process of the virtual machine, the operating conditions of the virtual machine are monitored in real time, virtual machines which are not even in assignment is rescheduled appropriately, and dynamic load balance of resources is achieved. An appropriate chance to reschedule the virtual machine is selected, the adjustment of the load can not affect normal operation of other parts of the system, while the resource utilization is optimized, the user experience level of the system is promoted, and the purposes of the method and the system are achieved.

The invention provides a device and a method for dynamically scheduling instructions transmitted from an operation queue to a reservation station in a microprocessor. The method comprises the following: a step of writing instructions, which is to set and then write the operand states of the decoded instructions on the basis of data correlation between the decoded instructions to be written into the operation queue and effective instructions in the operation queue, as well as instruction execution results which have been written back and are being written; a step of updating the operand states, which is to update the operand state of each instruction not transmitted on the basis of the data correlation between each instruction not transmitted and the instructions being written back of instruction execution results; a step of judging to-be-transmitted instructions, which is to judge whether the to-be-transmitted instructions with all operands ready exist on the basis of the operand state of each instruction not transmitted; and a step of transmitting instructions, which is to transmit the judged to-be-transmitted instructions to the reservation station when the reservation station has vacancies. Pipeline efficiency can be effectively improved by transmitting the instructions with the operands ready to the reservation station on the basis of the data correlation between the instructions.

A method to dynamically schedule communication between a master and slaves in a variable slave population in a master-slave wireless network. The method includes receiving a first interrogation phase command signal from the master, transmitting a response signal to the master responsive to the first interrogation phase command signal after a current time interval, the current time interval based on a current time slot selection, receiving an acknowledgment list from the master responsive to the transmitted response signal, determining whether the current time slot selection matches a master-filled time slot based on the acknowledgement list, and modifying an affinity value based on the determination.

The invention belongs to the field of cloud computing application, and relates to method for task rely relation description, decoupling, parallel scheduling and the like in cloud service. Rely task relations are provided, and a decoupling parallel scheduling method of rely tasks are constructed. The method comprises first decoupling the task rely relations with incoming degree being zero to construct a set of ready tasks and dynamically describing tasks capable of being scheduled parallelly at a moment; then scheduling the set of the ready tasks in distribution type and multi-target mode according to real time resource access so as to effectively improve schedule parallelism; and during the distribution of the tasks, further considering task execution and expenditure of communication (E/C) between the tasks to determine whether task copy is used to replace rely data transmission so as to reduce the expenditure of communication. The whole scheduling method can schedule a plurality of tasks in the set of the ready tasks in dynamic parallel mode, well considers performance indexes including real time performance, parallelism, expenditure of communication, loading balance performance and the like, and effectively improves integral performance of the system through the dynamic scheduling strategy.

Providing dynamic scheduling services without sharing calendar content, involving retrieving real time availability data and terms applied to calendar time cubes for an invitation to an event with one or more invited users, simultaneously synchronizing between calendars of the invited users in a meeting and event coordinating server to find a combination of common available matching time cubes while considering the terms including arrival time calculations (the common available matching time cubes defined as either “free”, “occupied”, “pending”, ane having a lower level of importance than the event currently created), setting the state of the matched time cubes as occupied at the calendar of each invited user; and rescheduling an event that was previously associated with the sequence of “occupied”, “pending” states with the lower level of importance, the already existing events being automatically subject to changes constantly and immediately.

A method for dispatching buses in groups for a bus transit system comprising determining a service interval for each trip of the bus transit system, assembling group assignments based on the service interval for each trip, determining a dispatch schedule for each bus based on the service interval and the group assignment, communicating the dispatch schedule to each bus, and communicating group assignment information to each of a plurality of the buses in a group. The group assignment assigns a plurality of the buses into a group on a segment of the trip shared by the plurality of buses such that multiple buses for different trips can dock at a station at the same time like a train to facilitate transferring passengers.

A method, system, and program product that enable dynamic scheduling/arranging of access by multiple users to a single electronic file. A network-database access management utility (NAMU) is provided, which manages/schedules network-level access to the electronic file. NAMU includes an access-request queue that schedules/arranges the user identifier (IDs) for each of multiple users that have requested access to the file while the file was checked out to a previous user. When the first user completes his access to the file and closes the file, an alert is generated for the next user in queue. This alert informs the next user that the first user has closed the file and that he/she may now access the electronic file.

The invention provides a dynamic scheduling method for customized buses and car pooling based on passenger appointments. Adding modifying and deleting orders are completed on a cell phone App, and an order service queue is established on a central platform for orders of all clients based on departure time. Based on the strategy of first come first serve, each order on the front of a queue is processed gradually. A possible path between starting points is calculated with shortest distance algorithm and constraint examination object functions by taking the position information of onboard GPS terminals and all order messages assigned to a customized bus before into consideration. The cost for each customized bus to complete the order is calculated, and the bus with the lowest cost is chosen to complete the order based on the greedy principle. The accessing passenger set of the customized bus is updated. The process is repeated to assign all passenger appointment to buses. Reliable technical support is provided for dynamic scheduling customized buses and car pooling based on passenger appointments.

A self-adaptive selection dynamic production scheduling control system, which is realized via a computer, is characterized in that: the system comprises a system emulator, a learning machine, a decision-making machine, a scheduling rules base, a scheduling knowledge base, a carrier, processing equipments and a buffer station thereof; the buffer station is provided with an optical grating, a sensor and a detection equipment; when a working piece reaches the buffer station and is processed, the learning machine detects the current system status for learning, so as to acquire dynamic scheduling knowledge about the system and update the knowledge in the scheduling knowledge base; when one processing equipment needs to be scheduled, the decision-making machine reads corresponding scheduling knowledge in the scheduling knowledge base according to the detected system status, acquires new scheduling knowledge through continuous interactive learning with the processing system, dynamically selects the scheduling rules based on the status of the processing equipments and the working piece in the system, and chooses the optimized scheduling rules to schedule the processing equipments. The invention can adapt to instable time-varying workshop dynamic production environments, obtain a better working-piece arrangement than prior rule-based scheduling technology, effectively reduce the process waiting time, and improve the fill rate of product delivery time.

A cooperative multithreading architecture includes an instruction cache, capable of providing a micro-VLIW instruction; a first cluster, connects to the instruction cache to fetch the micro-VLIW instruction; and a second cluster, connects to the instruction cache to fetch the micro-VLIW instruction and capable of execution acceleration. The second cluster includes a second front-end module, connects to the instruction cache and capable of requesting and dispatching the micro-VLIW instruction; a helper dynamic scheduler, connects to the second front-end module and capable of dispatching the micro-VLIW instruction; a non-shared data path, connects to the second front-end module and capable of providing a wider data path; and a shared data path, connected to the helper dynamic scheduler and capable of assisting a control part of the non-shared data path. The first cluster and the second cluster carry out execution of the respective micro-instructions in parallel.

Methods and apparatus are disclosed for workflow scheduling. A workflow scheduling system, such as a computer system, is used to coordinate and schedule tasks in complex scheduling environments. The system accepts incoming orders and dynamically schedules them according to the constraints of the resources required for the order and any constraints of the orders themselves.

The invention discloses a communication connectivity analysis method for bus dynamic scheduling under an internet of vehicles environment, and the method is a method for analyzing the intra-area wireless communication connectivity under the situation of bus dynamic scheduling of a vehicle ad hoc networks (VANET). The method comprises steps of firstly determining elements participating in the bus dynamic scheduling under the internet of vehicles environment; determining a communication method adopted among the elements of the bus dynamic scheduling; classifying a communication structure in the bus dynamic scheduling process into a route-vehicle communication system and a vehicle-vehicle communication system so as to analyze the basic structural characteristics of the communication connectivity in the scheduling process; and finally under the limitation of relevant proposal condition, calculating a wireless communication connectivity probability of the bus dynamic scheduling within a given regional range to obtain the connectivity of the intra-area wireless communication.

A method for enabling a first software program using a first binary specification in a first execution environment to employ a limited functionality of a second software program using a second binary specification in a second execution environment first creates a bridge in the first execution environment. Using the bridge, a proxy wrapping an interface to the limited functionality of the second software program in the second execution environment is created in the first execution environment. The proxy is used to access the limited functionality of the second software program in the second execution environment.

One embodiment of the present invention sets forth a technique for dynamically scheduling and managing compute tasks with different execution priority levels. The scheduling circuitry organizes the compute tasks into groups based on priority levels. The compute tasks may then be selected for execution using different scheduling schemes, such as round-robin, priority, and partitioned priority. Each group is maintained as a linked list of pointers to compute tasks that are encoded as queue metadata (QMD) stored in memory. A QMD encapsulates the state needed to execute a compute task. When a task is selected for execution by the scheduling circuitry, the QMD is removed for a group and transferred to a table of active compute tasks. Compute tasks are then selected from the active task table for execution by a streaming multiprocessor.

The invention discloses a dynamic migration method of video tasks in an edge computing environment. Multiple ECNs (Edge Compute Nodes) are selected in an ECN cluster under the edge environment to runa task scheduling migration scheduler to be responsible for distribution and scheduling work of the tasks, and the other ECNs in the cluster undertake task migration work and provide computing resources. The computing task migration scheduler executes task migration decision in each scheduling cycle to determine whether the tasks are executed locally in the ECNs or migrated to a data center, and tasks needing to be migrated to the data center are directly sent to a task execution unit of the remote-end data center through an ECN transmission unit for analysis processing. According to the method, the tasks are dynamically scheduled and processed on the basis of meeting network bandwidth and calculation costs, goals of reducing transmission time delay of edge data and improving task analysisprocessing speed are achieved, thus low delay time and high response of a task migration process are effectively guaranteed, and video service experience of users is improved while higher video service quality is realized.

The invention discloses a remote software upgrade method for clustered mobile terminals. The method comprises steps that: step 1, condition information data of the mobile terminals is acquired by an upgrade server in real time from a business server; step 2, dynamic strategy analysis on the condition information data is carried out by the upgrade server; step 3, upgrade request configuration information is issued by the business server to the mobile terminals according to the analysis result of the upgrade server; and step 4, the preferable mobile terminal registers the upgrade server to download an upgrade file according to the upgrade request configuration information, upgrade updating on self software is carried out, and the upgrade file is updated to surrounding mobile terminals through a short distance wireless communication network. According to the method, characteristics of slow speed of long distance mobile communication and fast speed of short distance wireless communication are utilized, real-time dynamic strategy analysis in combination with the condition information data of the mobile terminals is carried out, downloading strategy is dynamically adjusted in real time during a downloading process, and scientific dynamic scheduling and reasonable distribution are realized. The remote software upgrade method is applied to rapid reliable upgrade of mobile terminal software.