Optimal Storage Allocation for Serial Files

Haim Mendelson; Joseph S. Pliskin; Uri Yechiali

doi:10.1145/359060.359077

Optimal Storage Allocation for Serial Files

Haim Mendelson, Joseph S. Pliskin, Uri Yechiali

School of Mathematical Sciences

Tel Aviv University

Research output: Contribution to journal › Article › peer-review

11 Scopus citations

Abstract

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.

Original language	English
Pages (from-to)	124-130
Number of pages	7
Journal	Communications of the ACM
Volume	22
Issue number	2
DOIs	https://doi.org/10.1145/359060.359077
State	Published - 1 Feb 1979

Keywords

partitioned dataset
reorganization
serial files
storage allocation

Access to Document

10.1145/359060.359077

Cite this

@article{37e7e49e9fe442cd88bb245377c0149f,

title = "Optimal Storage Allocation for Serial Files",

abstract = "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.",

keywords = "partitioned dataset, reorganization, serial files, storage allocation",

author = "Haim Mendelson and Pliskin, {Joseph S.} and Uri Yechiali",

year = "1979",

month = feb,

day = "1",

doi = "10.1145/359060.359077",

language = "אנגלית",

volume = "22",

pages = "124--130",

journal = "Communications of the ACM",

issn = "0001-0782",

publisher = "Association for Computing Machinery (ACM)",

number = "2",

}

TY - JOUR

T1 - Optimal Storage Allocation for Serial Files

AU - Mendelson, Haim

AU - Pliskin, Joseph S.

AU - Yechiali, Uri

PY - 1979/2/1

Y1 - 1979/2/1

N2 - 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.

AB - 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.

KW - partitioned dataset

KW - reorganization

KW - serial files

KW - storage allocation

UR - http://www.scopus.com/inward/record.url?scp=0018434175&partnerID=8YFLogxK

U2 - 10.1145/359060.359077

DO - 10.1145/359060.359077

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:0018434175

SN - 0001-0782

VL - 22

SP - 124

EP - 130

JO - Communications of the ACM

JF - Communications of the ACM

IS - 2

ER -

Optimal Storage Allocation for Serial Files

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this