scheduling processor 中文意思是什麼

scheduling processor 解釋
調度處理機
  • scheduling : 編排；調度
  • processor : n. 1. 〈美國〉農產品加工者；進行初步分類的人。2. （數據等的）分理者；【自動化】信息處理機。
  1. 9 dakai zhu, melhem r, childers b r. scheduling with dynamic voltage speed adjustment using slack reclamation in multi - processor real - time systems. ieee trans. parallel distributed systems, 2003, 14 : 686 - 700

    動態電壓調節是體系結構層的低功耗技術，由於系統運行的能量消耗與運行電壓成平方關系，在運行期間動態改變系統電壓可以極大的降低系統的功耗。
  2. For accomplishing the whole computer integration of the system, the workflow management technology ( or system ) is introduced by this paper to solve highly integrated computer system, including function, info and procedure integration, therefore to accomplice the integrated scheduling management system ; and the software frame of the computer whole integrated system is put forward, based on the technology of the distributing workflow service / workflow processor

    為實現整體集成，本文提出了以工作流管理技術（ workflowmanagementtechnology ）實現水利樞紐信息、功能以及過程集成，從而實現集成化的調度管理；並給出了基於分散式工作流服務工作流機的整體集成實現的軟體框架。
  3. Thread wakes up after its allotted time, the time at which it actually executes its task depends on the jvm s thread scheduling policy, as well as how many other threads are contending for processor time

    線程在分配的時間后喚醒時，它實際執行其任務的時間取決于jvm的線程計劃策略，以及有多少其他線程競爭處理器時間。
  4. The relationship between the performance index and the processor utilization of real - time control tasks in different control phases is analyzed, and a fuzzy feedback scheduling system for real - time control tasks is proposed

    摘要分析了實時控制任務的控制性能在不同控制階段與處理器利用率需求問的關系，提出一種實時控制任務的模糊反饋調度系統。
  5. Because of the np complexity of mapping problem, the thesis studies two - step method : optimal scheduling of data flow graph and optimal processor mapping

    考慮到演算法映射問題的np復雜度和求解時間的指數性增加，本文主要研究兩步規劃方法，即先進行數據流圖的最優規劃，然後進行處理器的映射。
  6. After analyzing the characteristic of the parallel processing system, some problems about design missile - carrying processing system are pointed out ; network in the parallel processing system has become bottleneck and affect the performance of system, so the processing efficiency is analyzed in a multiprocessor system based on cluster - bus and some rules in designing the network in the multiprocessor system are brought out ; genetic algorithm is used for scheduling in the multiprocessor system, and a scheduling algorithm is described to suit arbitrary number of tasks, unequal task processing time, arbitrary precedence relation among tasks and arbitrary number of parallel processor, so that the schedule length will be minimized ; finally, an atr algorithm is mapped to a ring multiprocessor system, and a block diagram using dsp device is constructed. in chapter 4, the study is performed on real - time system hardware realization of atr. tms320c80 is selected as the kernel processor in multiprocessor system

    為此，對一種由常用的dsp晶元組成的多處理器系統的處理器利用率進行了分析，提出了多處理器系統互連網路設計的基本原則；本章使用遺傳演算法作為實現多處理器調度的工具，提出了一種新的任務調度演算法，該演算法主要是為了解決在任務數任意、任務計算時間不相等、任務前趨關系任意、以及任務間存在通信和考慮任務存貯器要求的情況下，如何優化任務在各個處理器上的分配和執行順序，使得多處理器系統總的執行時間最小；最後對一個目標識別演算法進行了硬體實現優化分析，根據分析結果，將演算法映射到由dsp晶元組成的環形網路連接的處理器拓撲結構上，得到了多處理器系統的原理框圖。
  7. Three duplication based task scheduling algorithms are presented. these algorithms have good performance, and its application on a real multi - core and multi - thread processor ( network processor ixp ) are demonstrated. it also show that how a uniform network programming environment could be built through address translation and iterative compilation techniques

    然後結合一種實際的多核多線程處理器（網路處理器ixp ）展開了對任務調度實例化研究，並且運用地址轉換和迭代編譯等技術構建了新型統一網路編程環境，又結合實際網路應用提出了吞吐量與延遲相結合的網路任務調度演算法。
  8. In this paper, we study some multi - processor scheduling problems relate to due dates

    本文主要研究與duedate相關的一些排序問題。
  9. Abstract : the processes concept is introduced in monolithic processor control system. date structure design and system scheduling for using processes scheduling to manage system sources are described in this paper

    文摘:將多進程概念引入8098單片機控制系統中。重點描述了採用進程調度方式管理資源的數據結構設計及系統調度流程。
  10. Theoretical proof and simulation suggests that this constructive function has stronger heuristic power, and has better effectiveness for scheduling dag a task - replication based heuristic static scheduling algorithm is also proposed ( namely processor pre - allocation algorithm for dag tasks, ppa ), utilizing the aforementioned heuristic function aimed at rtrpmt

    通過理論證明與模擬實驗表明：本文構造的啟發函數具有較強的啟發能力，對dag圖的調度具有較優的效果。利用本文所構造的啟發函數，針對相關周期性多任務，提出了一種基於任務復制的啟發式靜態調度演算法（ dag任務圖的處理器預分配演算法ppa ） 。
  11. In the general model there are many factors effecting the algorithm of task matching and scheduling, such as data dependencies among tasks, processor ' s processing speed, topology of network connectivity, communication protocol and bandwidth, volume of transferring data, etc. in each model, we proposed two genetic algorithms for task matching and scheduling, one is for single decomposed task, the other as a cga is for multiple independent tasks

    一般模型中任務分配與調度受到系統多種因素的影響，如任務間的數據邏輯關系、各處理機的計算速度、網路拓撲結構、節點間通信機制以及通信波特率、數據流量大小等等。在考慮上述影響因素的基礎上，分別提出單任務分配與調度的遺傳演算法和獨立多任務分配與調度的共同進化演算法。
  12. 4 he y, cai s. semi - online scheduling with machine cost. journal of computer science and technology, 2002, 17 : 781 - 787. 5 cai s, he y. quasi - online algorithms for scheduling non - increasing processing jobs with processor cost

    對這種情況，如果工件的總加工時間不超過4 ，我們給出了競爭比為1的最優演算法當總加工時間超過4時，我們給出了競爭比為5 4的演算法，並給出問題的下界至少是1 . 0957
  13. The optimal solution to the problem for scheduling on a single processor

    單機排序問題最優解方法
  14. The duty of real - time system is to provide time constraint guarantees for the real - time applications, in other words, it make the applications access to the resources they need timely. many works have devoted into individual resource scheduling ( i. e. processor capability, disk bandwidth and network bandwidth ). obtaining simultaneous and timely access to multiple resource is known to be a np - complete problem

    大量的研究工作集中在單純的網路帶寬、磁盤帶寬和處理器資源各自的調度優化上，而在同一個節點上同時使用多個資源的是比較復雜np完全問題，本文分析了一種在資源預留系統（ resourcekernel ）中解決該問題的途徑，聯合調度服務器（ css ） ，並對其中的關鍵問題? ?伸縮量分配（ slacksharing ）作出了改進，提出了一種基於當前系統負荷的分配演算法。
  15. In studying continuous production processes, we considered the problem of batch processing scheduling where each processor can process a batch of jobs simultaneously ; the batch is delivered to the customer together upon the completion of the batch

    對于連續型生產方式，論文研究了在準時生產（ jit ）模式下分批加工的優化調度問題，優化調度目標為e / t懲罰函數最小。
分享友人
分享到 Line

分享到臉書