schedule n. 1.目錄。 2.表(格);清單,明細(xì)表。 3.〔美國(guó)〕程序表,計(jì)劃表;進(jìn)度表;時(shí)間表。 4. 〔美國(guó)〕預(yù)定日期,預(yù)定計(jì)劃。 a schedule of prices 定價(jià)表。 a train schedule 火車時(shí)刻表。 a design schedule 設(shè)計(jì)計(jì)算表,進(jìn)度表。 according to schedule 按照預(yù)定計(jì)劃[時(shí)間表]。 behind [ahead of] schedule (time) 比預(yù)定時(shí)間晚[早]。 file [give in] one's schedule (宣布)破產(chǎn)。 on schedule (time) 1. 按時(shí)間表,準(zhǔn)時(shí)。 2. 按照預(yù)定計(jì)劃。 vt. 1. 為…作目錄。 2.將…列表,把…記入表格。 3.將…列入程序表[計(jì)劃表,進(jìn)度表];為…規(guī)定時(shí)間表[進(jìn)度計(jì)劃]。 4.排定,安排。 Supper is scheduled for six o'clock. 晚餐預(yù)定六時(shí)開始。 be scheduled to (sail today) 預(yù)定(本日開船)。 scheduled time (火車等的)時(shí)刻表,預(yù)定時(shí)間。
Associating sequential and concurrent schedules , by administering chemotherapy before or after concurrent chemoradiation , has been re - cently investigated , but the best sequence remains a matter of controversy 最近有人研究在放化療并用之前或之后用續(xù)貫化療和并行化療,但是最好的次序仍在爭(zhēng)論中。
Based on the analysis on the concurrent processing performance requirements of monitoring system , a priority queuing algorithm is proposed to realize the concurrent scheduling of vehicle monitoring system with the algorithm implementation scheme given 在對(duì)監(jiān)控中心并發(fā)處理的性能要求進(jìn)行分析的基礎(chǔ)上,提出了優(yōu)先數(shù)事件隊(duì)列算法來實(shí)現(xiàn)車輛監(jiān)控中心的并發(fā)調(diào)度機(jī)制,并給出了算法實(shí)現(xiàn)。
To verify the feasibility of the architecture and investigate its applicability , according to the three basic concepts for holonic manufacturing control : " hierarchy in distributed systems " , " distribution of decision power " and " concurrent scheduling and schedule execution " , this dissertation presents a holonic manufacturing control architecture and an interaction mechanism that combine the best of hierarchical and heterarchical control 為了驗(yàn)證hms - ra體系結(jié)構(gòu)的可應(yīng)用性,本文進(jìn)一步基于“分布式系統(tǒng)中的遞階結(jié)構(gòu)” 、 “分布式?jīng)Q策能力”和“并行的調(diào)度與調(diào)度執(zhí)行”這三個(gè)有關(guān)合弄制造控制的基本概念,深入研究了合弄制造的控制結(jié)構(gòu)和制造合弄間的交互機(jī)制,以便將遞階制造控制和分布式制造控制的優(yōu)點(diǎn)結(jié)合起來。
We analysis the conflict , convert channel and starvation problems of concurrent schedule based on strict - 2pl locking protocal which applies nhstm model , then present a concurrent scheduling algorithm making use of buffer and point p . also , we proved the concurrent schedule algorithm is serializable . at the same time , we introduce the key technical used in nhsdb concurrency control mechanism , and give the implementation details 我們對(duì)應(yīng)用nhstm模型的,通過應(yīng)用嚴(yán)格兩段鎖協(xié)議實(shí)施的并發(fā)調(diào)度中,可能存在的并發(fā)沖突,隱通道和饑餓問題進(jìn)行分析,在此基礎(chǔ)上提出了一種利用緩沖和p點(diǎn)的并發(fā)調(diào)度算法,并給出了該算法的并發(fā)調(diào)度正確性證明,解決多級(jí)安全條件下的隱通道和饑餓問題。