OPTIMAL STORAGE ALLOCATION FOR SERIAL FILES

被引：11

作者：

MENDELSON, H ^{[1
]}

PLISKIN, JS ^{[1
]}

YECHIALI, U ^{[1
]}

机构：

[1] TEL AVIV UNIV,FAC MANAGEMENT,TEL AVIV,ISRAEL

来源：

COMMUNICATIONS OF THE ACM | 1979年 / 22卷 / 02期

关键词：

partitioned dataset; reorganization; serial files; storage allocation;

D O I：

10.1145/359060.359077

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

A computer system uses several serial files. The files reside on a direct-access storage device in which storage space is limited. Records are added to the files either by jobs in batch processing mode, or by on-line transactions. Each transaction (or job) generates a demand vector which designates the space required in each file for record addition. Whenever one file runs out of space, the system must be reorganized. This paper considers several criteria for best allocating storage space to the files. © 1979, ACM. All rights reserved.

引用

页码：124 / 130

页数：7

共 7 条

[1] OPTIMAL REORGANIZATION OF DISTRIBUTED SPACE DISK FILES [J].