按序存取法 的英文怎麼說

中文拼音 [àncún]
按序存取法 英文
sequential access method
  • : Ⅰ動詞1 (用手或手指壓) press; push down 2 (壓住; 擱下) leave aside; shelve 3 (抑制) restrain...
  • : 動詞1 (存在; 生存) exist; live; survive 2 (儲存; 保存) store; keep 3 (蓄積; 聚集) accumulat...
  • : Ⅰ動詞1 (拿到身邊) take; get; fetch 2 (得到; 招致) aim at; seek 3 (採取; 選取) adopt; assume...
  • : Ⅰ名詞1 (由國家制定或認可的行為規則的總稱) law 2 (方法; 方式) way; method; mode; means 3 (標...
  1. The premise to assure qos is to provide sufficient resource to meet demands. we come up with a method to partition the resources of web cluster for each class with its resource demand and priority requirement taken for granted, where system processing time or average access rates is summed up for each class periodically and resource demands is evaluated with stretch factor as performance metric. also the nodes marked in number will be orderly assigned to the classes ordered in priorities, which helps to maintain data locality and improves memory cache hits

    資源滿足需求是實現服務質量保證的前提,為滿足業務類動態的資源需求,我們提出一種支持業務類優先級和資源需求的資源劃分方,通過周期對業務類請求處理時間或平均訪問率進行統計,以響應擴展因子為質量指標對業務類預期的資源需求作出評估,採主機編號有地分配給優先級排的業務類,減少業務類資源變動和提高主cache命中率。
  2. In acf vtam, the unit of data that is transmitted between an application program and a terminal connected in basic mode

    在虛擬遠程通信高級通信操作程( acf vtam )中,在應用程基本方式連接的終端之間傳輸的數據單位。
  3. In acf / vtam, the unit of data that is transmitted between an application program and a terminal connected in basic mode

    在虛擬遠程通信高級通信操作程( acf vtam )中,在應用程基本方式連接的終端之間傳輸的數據單位。
  4. The main idea of this hybrid algorithm is : at first, all candidates in task collection is lined according to a dispatching rule ( earliest due date, edd ), then this linear queue is divided into some tiers under a criterion that partial order is not allowed to exist in the every tier, many feasible sequences is generated by constructing a neighborhood of a initial sequence in every tier, the allocation of the resources over time is conducted to perform every feasible task sequence, and a set of approximate optimal scheduling schemes is achieved as the precondition of the next tier ’ s disposal in meeting multiple scheduling objectives to obtain the global near - optimal schedule which makes these program run tier by tier until the last task is completed

    該演算照最早完工時間優先( ect )分派規則,先將參加排的工合併成一個串列列,然後照同層內不在偏關系的原則,將其分解為若干個時間上相互銜接的層次,在每個層次內部,通過構造鄰域產生出多個可行列,對每個可行列進行設備配置,採用鄰域搜索演算進行方案的尋優,保留一組滿足評價要求的可行方案作為下一層設備配置的背景環境,通過層層遞進最終獲全局的近似最優解。
分享友人