WEKO3
アイテム
Minimizing Page Fetches for Permuting Information in Two-Level Storage : Part 2. Design of the Algorithm for Arbitrary Permutations
https://ipsj.ixsq.nii.ac.jp/records/59924
https://ipsj.ixsq.nii.ac.jp/records/59924cb6beb1f-c856-406b-bea0-addcfa9a50fa
| 名前 / ファイル | ライセンス | アクション |
|---|---|---|
IPSJ-JIP0602004.pdf (900.8 kB)
|
Copyright (c) 1983 by the Information Processing Society of Japan
|
|
| オープンアクセス | ||
| Item type | JInfP(1) | |||||||
|---|---|---|---|---|---|---|---|---|
| 公開日 | 1983-07-20 | |||||||
| タイトル | ||||||||
| タイトル | Minimizing Page Fetches for Permuting Information in Two-Level Storage : Part 2. Design of the Algorithm for Arbitrary Permutations | |||||||
| タイトル | ||||||||
| 言語 | en | |||||||
| タイトル | Minimizing Page Fetches for Permuting Information in Two-Level Storage : Part 2. Design of the Algorithm for Arbitrary Permutations | |||||||
| 言語 | ||||||||
| 言語 | eng | |||||||
| 資源タイプ | ||||||||
| 資源タイプ識別子 | http://purl.org/coar/resource_type/c_6501 | |||||||
| 資源タイプ | journal article | |||||||
| 著者所属 | ||||||||
| Department of Information Science Kyoto University | ||||||||
| 著者所属 | ||||||||
| Department of Information Science Kyoto University | ||||||||
| 著者所属(英) | ||||||||
| en | ||||||||
| Department of Information Science, Kyoto University | ||||||||
| 著者所属(英) | ||||||||
| en | ||||||||
| Department of Information Science, Kyoto University | ||||||||
| 著者名 |
Tsuda, Takao
× Tsuda, Takao
|
|||||||
| 著者名(英) |
Tsuda, Takao
× Tsuda, Takao
|
|||||||
| 論文抄録 | ||||||||
| 内容記述タイプ | Other | |||||||
| 内容記述 | 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. | |||||||
| 論文抄録(英) | ||||||||
| 内容記述タイプ | Other | |||||||
| 内容記述 | 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. | |||||||
| 書誌レコードID | ||||||||
| 収録物識別子タイプ | NCID | |||||||
| 収録物識別子 | AA00700121 | |||||||
| 書誌情報 |
Journal of Information Processing 巻 6, 号 2, p. 78-86, 発行日 1983-07-20 |
|||||||
| ISSN | ||||||||
| 収録物識別子タイプ | ISSN | |||||||
| 収録物識別子 | 1882-6652 | |||||||
| 出版者 | ||||||||
| 言語 | ja | |||||||
| 出版者 | 情報処理学会 | |||||||
