Minimizing Page Fetches for Permuting Information in Two-Level Storage : Part 2. Design of the Algorithm for Arbitrary Permutations

スポンサーリンク

概要

• 論文の詳細を見る

• In light of the generalization of Floyd's model studied in Part 1 of this paper, an algorithm for arbitrary permutations of records between pages of slow memory is constructed. Bounds of page fetches required are estimated; for the extreme case of 'pure' transposition, the algorithm can do with the same number of page fetches as that considered the best possible. Some important applications are discussed.

• 一般社団法人情報処理学会の論文
• 1983-07-20

著者

• Takao Tsuda

  Department Of Information Science Kyoto University

• Nakagawa Ken-ichi

  Department Of Information Science Kyoto University

関連論文

• Minimizing Page Fetches for Permuting Information in Two-Level Storage Part 3. The Paging Model : a Further Improvement on the Floyd Model
• Minimizing Page Fetches for Permuting Information in Two-Level Storage : Part 2. Design of the Algorithm for Arbitrary Permutations
• NK1.1+CD4+CD8+ thymocytes with specific lymphokine secretion

スポンサーリンク