An efficient algorithm for allocating paged, drum-like storage (Q4158467): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(One intermediate revision by one other user not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Record Allocation for Minimizing Expected Retrieval Costs on Drum-Like Storage Devices / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Placement of Records on a Secondary Storage Device to Minimize Access Time / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the Optimality of the Probability Ranking Scheme in Storage Applications / rank | |||
Normal rank |
Revision as of 23:39, 12 June 2024
scientific article; zbMATH DE number 3591367
Language | Label | Description | Also known as |
---|---|---|---|
English | An efficient algorithm for allocating paged, drum-like storage |
scientific article; zbMATH DE number 3591367 |
Statements
An efficient algorithm for allocating paged, drum-like storage (English)
0 references
1978
0 references