34 results about "List scheduling" patented technology

Disclosed are embodiments of a compiler, methods, and system for resource-aware scheduling of instructions. A list scheduling approach is augmented to take into account resource constraints when determining priority for scheduling of instructions. Other embodiments are also described and claimed.

A list scheduler in a compiler can select from a plurality of alternative instruction sequences for one or more computation performed within an application. A scheduler can initially identify and track one or more computations for which multiple alternative instruction sequences exist. An available instruction list can be populated with the alternative instruction sequences. The list scheduler can access the available instruction list during scheduling of the application. The list scheduler can perform a cost analysis while scheduling the instructions by performing a look ahead. The list scheduler may select alternate instruction sequences for similar computations occurring in different portions of the application based on the cost benefit analysis.

Systems and methods of storage management which are based on a worklist are described. The storage typically although not necessarily includes a faster access part and a slower access part. One of the described methods includes: examining a worklist which schedules at least one modality to perform at least one task; and ensuring that in the faster access part there is available at least some data which based on at least one predetermined rule is deemed likely to be accessed in connection to the at least one task to be performed by the at least one modality scheduled by the worklist. In one application the worklist conforms to a Digital Image Communications in Medicine (DICOM) modality worklist.

The present invention provides system and method for a group priority issue schema for a cascaded pipeline. The system includes a cascaded delayed execution pipeline unit having a plurality of execution pipelines that execute instructions in a common issue group in a delayed manner relative to each other. The system further includes circuitry configured to: (1) receive an issue group of instructions; (2) determine if at least one load instruction is in the issue group, if so scheduling the least one load instruction in a first pipeline based upon a priority list; and (3) schedule execution of the issue group of instructions in the cascaded delayed execution pipeline unit.

A method for more efficiently reclaiming space in a journal is disclosed. In one embodiment, such a method includes identifying a plurality of ranks in a storage system. The method creates a destage wait list for each rank, where the destage wait list identifies metadata tracks to destage from a cache to the corresponding rank. The method dispatches one or more threads for each destage wait list. The threads destage metadata tracks identified in the destage wait lists from the cache to the corresponding ranks. In certain embodiments, the method moves metadata tracks to the destage wait lists only if performing such will not cause occupied space in the journal to fall below a low watermark. Once metadata tracks are destaged from the cache, the method releases, from the journal, entries associated with the destaged metadata tracks. A corresponding system and computer program product are also disclosed.

The invention discloses a simple and effective track privacy protecting method and belongs to the technical field of information safety. The track privacy protecting method is low in calculating cost and high in practicality. The track privacy protecting method is based on the DLS (dynamic list scheduling) algorithm, introduces the definition of side track probability and comprehensively takes single request and continuous request of LBS into consideration, and accordingly can effectively protect the location privacy of users under the condition of single request and effectively protect the track privacy of the users under the condition of continuous request. The track privacy protecting method solves associated privacy safety problems caused by traditional K-anonymity technology applied to the LBS continuous request.

The present invention provides system and method for a group priority issue schema for a cascaded pipeline. The system includes a cascaded delayed execution pipeline unit having a plurality of execution pipelines that execute instructions in a common issue group in a delayed manner relative to each other. The system further includes circuitry configured to: (1) receive an issue group of instructions; (2) determine if at least one load instruction is in the issue group, if so scheduling the least one load instruction in a first pipeline based upon a priority list; and (3) schedule execution of the issue group of instructions in the cascaded delayed execution pipeline unit.

An automatic list scheduling (“ALS”) system monitors usage of calling lists by an administrator where the administrator terminates usage of a calling list based on various measured parameters. The ALS system is configure to learn the conditions associated with the measured parameters and, in one embodiment, recommends to the administrator when to terminate use of a current calling list in favor of another list. A learning mode gathers various samples of the measured parameters associated with calling lists, and analyzes the sample to determine a threshold value. Upon monitoring the measured values for subsequent usage of calling lists, the current measured parameters are compared to the threshold value to determine whether to generate a recommendation to the administrator. In one embodiment, the time zone of the called party and the applicable calling window is used to determine whether the current list can continued to be used.

The invention discloses a method for changing the operation state of a mobile terminal, and a mobile terminal. The method comprises the following steps: the mobile terminal sensing a physical state change mode of itself; and according to the physical state change mode, obtaining from a preset database a corresponding mobile terminal operation state value, and correspondingly changing the current operation state of the mobile terminal. According the invention, the operation states of mobile terminals, such as a normal communication state, a muting state, a flight state, a busy line state, a call conversion state, a short message sending state, an address list scheduling state and the like, can be changed simply by changing the physical states of such mobile terminals as a mobile phone and the like, including overturning, shaking and a shacking frequency. Besides, the response is fast, and the operation is convenient, time-saving and labor-saving.

The invention discloses a short wave OFDM (orthogonal frequency division multiplexing) channel estimating method in narrow band interference. The method includes the steps: firstly, estimating an initial estimation value of a pilot frequency in a channel by the aid of an LS (list scheduling) algorithm, then performing a primary noise filtration for the initial estimation value by the aid of DFT (discrete Fourier transformation) channel estimation algorithm principle, namely, the length of a circulation prefix code is larger than channel impact response, filtering noise except a circulation prefix by the aid of a method that an estimation value larger than the length of the circulation prefix code is reset zero, finally, performing a secondary noise filtration for the initial estimation value by leading in a threshold value, acquiring a final estimation value at the pilot frequency by performing zero setting for signals smaller than the threshold value and keeping invariable for the portions larger than the threshold value, then performing interpolation for pilot frequency estimation according to interpolation modes to obtain estimation of the whole channel, and performing DFT for channel estimation of a time domain to obtain channel estimation of a frequency domain. The channel estimation perform is improved, the pilot frequency is of a comb-like pilot frequency structure, and rapid fading of short wave signals is effectively restrained.

A list scheduler in a compiler can select from a plurality of alternative instruction sequences for one or more computation performed within an application. A scheduler can initially identify and track one or more computations for which multiple alternative instruction sequences exist. An available instruction list can be populated with the alternative instruction sequences. The list scheduler can access the available instruction list during scheduling of the application. The list scheduler can perform a cost analysis while scheduling the instructions by performing a look ahead. The list scheduler may select alternate instruction sequences for similar computations occurring in different portions of the application based on the cost benefit analysis.

The invention provides a task scheduling execution method and device, and the method comprises the steps: obtaining a to-be-executed first task list every first preset duration; determining a second task list preferentially executed in the first task list according to a depth-first search algorithm; and scheduling execution resources to execute the tasks in the second task list. According to the embodiment of the invention, the method comprises the steps: obtaining a to-be-executed first task list every first preset duration; according to the method, the second task list which is executed preferentially is determined according to the depth-first search algorithm, and the execution resources are scheduled preferentially to execute the determined second task list, so that core emergency tasks with high execution priorities of the execution resources can be scheduled preferentially in the high-concurrency time period of the tasks, and the timeliness of task scheduling execution is improved.

The embodiment of the invention discloses a task scheduling method and device. According to the task scheduling method and device, tasks are completed effectively, and at the same time, the purpose of reducing power consumption is taken into account. The task scheduling method includes the steps: obtaining tasks to be processed, determining priorities of the tasks to be processed by the adoption of a list scheduling dependency algorithm, and ranking the tasks to be processed according to a priority sequence from high to low; according to an energy-saving scheduling dependency algorithm, determining priorities of virtual machines, and ranking the virtual machines according to a priority sequence from high to low, wherein the priorities of the virtual machines take the processing speeds of the virtual machines into account; according to the sequence of the tasks to be processed and the sequence of the virtual machines, sequentially obtaining execution time of the tasks to be processed in each virtual machine, determining virtual machines in which the execution time of the tasks to be processed is smaller than or equal to a threshold value, and using the determined virtual machines as alternative virtual machines; selecting one from the alternative virtual machines as a virtual machine corresponding to the tasks to be processed.

Disclosed are embodiments of a compiler, methods, and system for resource-aware scheduling of instructions. A list scheduling approach is augmented to take into account resource constraints when determining priority for scheduling of instructions. Other embodiments are also described and claimed.

The invention relates to an instruction list scheduling method and device, computer equipment and a storage medium. The method comprises the steps of analyzing a data dependency relationship of a to-be-scheduled instruction to obtain all selection nodes for performing instruction selection each time in an instruction scheduling process, and determining instructions of each order in a scheduled instruction list according to an evaluation result of the selection nodes corresponding to each order. The method can ensure that the selected instruction is the optimal result of the current state whenthe instruction is selected each time, the scheduled instruction list is obtained by using the optimal results, the arrangement among the instructions is more compact, and the execution time of the instruction sequence in the original instruction list can be shortened conveniently.

The invention relates to a QR (quick response) decomposition based orthogonal frequency division multiplexing (OFDM) system channel estimation method. Channel estimation (CE) is a key technology in the OFDM communication system, and CE accuracy directly influences the system communication performance. The invention provides a QR decomposition based channel impact response (CIR) update algorithm. The CIR update algorithm comprises a first step of determining the position of a pilot subcarrier by a list scheduling (LS) algorithm, and acquiring the channel estimation value of the pilot position by a pilot; a second step of reducing noise effect outside an L point by using a discrete fourier transform (DFT) time domain channel estimation algorithm and the characteristic that channel time domain impact response energy mainly focuses on the L point; and a third step of updating the CIR in the L point by using the time domain channel estimation algorithm based on QR decomposition, so as to further lower noise effect in the L point and improve CE accuracy. Under the circumstance of different Doppler frequency shift coefficients, compared with conventional DFT algorithms and linear interpolation algorithms, the improved algorithm lowers the error rate by (1-1.5) dB and improves the performance of the OFDM communication system.

The invention discloses a resource scheduling method, a resource scheduling system, equipment and a computer readable storage medium, and the resource scheduling method comprises the steps: obtaining a scheduling object from a scheduling queue; when the scheduling object is a user-defined resource, disassembling the user-defined resource according to the current resource state, and obtaining a scheduling unit list, wherein the scheduling unit list comprises a first scheduling unit used for forming the user-defined resource; and sequentially scheduling the first scheduling units in the scheduling unit list. The method is suitable for a Kubernetes scheduling platform, if a scheduling object is CRD during scheduling, the CRD is disassembled according to a current resource state to obtain a scheduling unit list, the scheduling unit list comprises a Pod set, so that the Kubernetes scheduling platform can perform atomic scheduling on all Pods according to the scheduling unit list, all the Pods are scheduled in sequence according to a queue, insertion of other Pods is avoided, therefore, the CRD can be reasonably scheduled, the scheduling efficiency is high, and the Kubernetes scheduling platform can be compatible with various service scenes.

The invention discloses an iterative static task list scheduling algorithm for a multi-processor system. The algorithm is characterized by being executed by the following steps: 1, setting an initial value of a current optimal task priority sequence, and taking a corresponding static list scheduling length as an initial value of a current optimal scheduling length; 2, obtaining a new task priority sequence from the current optimal task priority sequence, and if the corresponding static list scheduling length is less than the current optimal scheduling length, updating the current optimal scheduling length and the current optimal task priority sequence; 3, repeatedly executing the step 2 until the frequency of execution reaches a specified upper limit; 4, executing the steps 1 to 3 for each optimal task priority sequence; and 4, selecting a minimum value from all optimal scheduling lengths as a final scheduling result. According to the algorithm, the scheduling length is further reduced on the basis of a conventional static task list scheduling algorithm, so that the application execution efficiency is effectively improved.

The invention relates to a continuous microfluid biochip advanced comprehensive design method based on a particle swarm algorithm. The continuous microfluid biochip advanced comprehensive design method comprises the following steps of S1, initializing a particle swarm according to a time sequence diagram and given assembly types and number; s2, using a list scheduling algorithm for each particle, and further obtaining a scheduling solution of each particle; s3, calculating a fitness function value of the particle according to the binding and scheduling solution; and S4, iteratively updating the particles according to the individual historical optimal solution and the global historical optimal solution, and obtaining an optimal binding and scheduling scheme if the current number of iterations reaches an iteration threshold. According to the invention, on the premise of not sacrificing the execution time of the biochemical reaction, a binding and scheduling scheme which needs a smaller number of flow channel intersection points can be obtained.

Systems, methods, and computer products for evaluating robustness of a list scheduling framework. Exemplary embodiments include a method for evaluating the robustness of a list scheduling framework, the method including identifying a set of compiler benchmarks known to be sensitive to an instruction scheduler, running the set of benchmarks against a heuristic under test, H and collect an execution time Exec(H[G]), where G is a directed a-cyclical graph, running the set of benchmarks against a plurality of random heuristics Hrand[G]i, and collect a plurality of respective execution times Exec(Hrand[G])i, computing a robustness of the list scheduling framework, and checking robustness check it against a pre-determined threshold.

The invention discloses an MPSoC task scheduling, modeling and assessing method under process variations on the basis of UPPAAL-SMC. The MPSoC task scheduling, modeling and assessing method includes the following steps: generating a task allocation and scheduling example for a task set according to task scheduling strategy; conducting modeling on tasks, PE and power consumption on the premise of considering process variations to form a task model, a PE model and a power consumption model, and conducting background allocation to perform model transformation on the task allocation and scheduling example by aid of a list scheduling and the branch and cut algorithm; achieving constraint query by aid of stochastic modeling, generating statistic data through UPPAAL-SMC and getting the performance yield of the task allocation and scheduling example; comparing different performance yield of the task allocation and scheduling examples generated by different task scheduling strategies of the same MPSoC framework or different MPSoC frameworks, and assessing the task scheduling strategies to determine the MPSoC framework with superior performance. MPSoC designers can select between TAS strategies and the MPSoC frameworks with help of the MPSoC task scheduling, modeling and assessing method so as to obtain the optimum combination.

Batch job data staging combining synchronous / asynchronous staging. In pre-processing, a stage-in source file, and a target file for stage-out, in permanent storage, are identified using a batch script. From data amounts, time for stage-in / stage-out to / from temporary storage are estimated. Stage-in is based on the time, stage-out being asynchronous, and each asynchronous staging is classified short / long term depending on the time, each staging being recorded in a table. If a source file is modified, incremental staging is added to the table. With a staging list scheduling for batch jobs stage-in is performed, monitoring progress in the table, and resources may be allocated for the jobs nodes without waiting for stage-in to complete. The job generates results in the temporary storage, and using post-processing, stage-out transfers results to the target file in permanent storage.

Systems, methods, and computer products for evaluating robustness of a list scheduling framework. Exemplary embodiments include a method for evaluating the robustness of a list scheduling framework, the method including identifying a set of compiler benchmarks known to be sensitive to an instruction scheduler, running the set of benchmarks against a heuristic under test, H and collect an execution time Exec(H[G]), where G is a directed a-cyclical graph, running the set of benchmarks against a plurality of random heuristics Hrand[G]i, and collect a plurality of respective execution times Exec(Hrand[G])i, computing a robustness of the list scheduling framework, and checking robustness check it against a pre-determined threshold.

An automatic list scheduling (“ALS”) system monitors usage of calling lists by an administrator where the administrator terminates usage of a calling list based on various measured parameters. The ALS system is configure to learn the conditions associated with the measured parameters and, in one embodiment, recommends to the administrator when to terminate use of a current calling list in favor of another list. A learning mode gathers various samples of the measured parameters associated with calling lists, and analyzes the sample to determine a threshold value. Upon monitoring the measured values for subsequent usage of calling lists, the current measured parameters are compared to the threshold value to determine whether to generate a recommendation to the administrator. In one embodiment, the time zone of the called party and the applicable calling window is used to determine whether the current list can continued to be used.

The invention discloses a Peer table scheduling method applied to a peer-to-peer (P2P) system. The Peer table scheduling method comprises that a Tracker server receives state information and Peer table request information sent from a terminal, wherein the state information comprises request level information; the request level of the terminal is confirmed according to the request level information; a relevant Peer table is scheduled according to the confirmed request level; and the scheduled Peer table is sent back to the terminal. The invention further discloses a relevant system, the terminal and the server.

The embodiment of the invention provides a batch job scheduling system, method and apparatus and a storage medium, and relates to the field of batch job scheduling. The system comprises: a first scheduling device, wherein the first scheduling device is used for respectively scheduling job execution programs on each business system to execute batch jobs according to a batch job list of each business system; and multiple second scheduling devices, which are respectively deployed on various service systems, wherein each second scheduling device is used for obtaining a batch job list of a currentservice system from the first scheduling device, and when the first scheduling device breaks down, a job execution program on a current business system is scheduled to execute batch jobs according toa batch job list of the current business system, and the current business system is a business system where the second scheduling device is located. Through the batch job scheduling system provided bythe embodiment of the invention, the problem that batch job scheduling cannot be executed when a centralized job scheduling device fails can be solved, and the fault influence is reduced.

The invention discloses a network management system and method for a controlled multicast system based on multicast conversion. The system comprises a network management configuration module, a forwarding list scheduling module, a gateway communication module and a historical record operation module. The method comprises the following steps: S1, reading the configuration information in a configuration file provided by a network manager; S2, starting a scheduling algorithm and waiting for registration application of each translation gateway; S3, receiving the registration applications of the translation gateways, querying topology configuration and channel configuration of the translation gateways in a gateway topology database according to the registration applications of the translation gateways, and generating a forwarding list for the translation gateways; and S4, acquiring running state information and flow statistical information from each translation gateway periodically and carrying out the corresponding processing. According to the invention, the configuration, scheduling, management and monitoring of the translation gateways under one framework are realized and the multicast services are extended to different multicast networks, so that the translation gateways can work cooperatively.

The invention provides a fragment scheduling method based on a WRR algorithm in a graphics processor, which solves the problem of low dyeing balance of a fragment stainer, and adopts the main technical scheme that S1, weight matching is performed on a plurality of channels in a pixel scanning module through the WRR algorithm; s2, a scheduling module sequentially schedules a plurality of data fragments generated by scanning of a pixel scanning module to a fragment stainer according to the weights corresponding to the channels, scheduling is determined to be finished according to the fragment number corresponding to the weights or the empty state in the channels, and the fragment number is related to the processor number and the processor thread count in single fragment dyeing; s3, the scheduling module repeats the S2 until all the pixel scanning modules finish scheduling, and meanwhile, the fragment stainer id and the scheduling fragment number of each round corresponding to the finished scheduling are serially connected into a list; and S4, the scheduling module sequentially selects the fragment stainer with the minimum id to dye the scheduled fragments, reads the dyeing completion information of the fragment stainer according to the first-in first-out principle in the list in the step S3, and schedules the dyeing completion information to the pixel processing module again.

The invention discloses an iterative static task list scheduling algorithm for a multi-processor system. The algorithm is characterized by being executed by the following steps: 1, setting an initial value of a current optimal task priority sequence, and taking a corresponding static list scheduling length as an initial value of a current optimal scheduling length; 2, obtaining a new task priority sequence from the current optimal task priority sequence, and if the corresponding static list scheduling length is less than the current optimal scheduling length, updating the current optimal scheduling length and the current optimal task priority sequence; 3, repeatedly executing the step 2 until the frequency of execution reaches a specified upper limit; 4, executing the steps 1 to 3 for each optimal task priority sequence; and 4, selecting a minimum value from all optimal scheduling lengths as a final scheduling result. According to the algorithm, the scheduling length is further reduced on the basis of a conventional static task list scheduling algorithm, so that the application execution efficiency is effectively improved.