Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Optimal storage allocation for serial files

From MaRDI portal
Publication:4174721
Jump to:navigation, search

DOI10.1145/359060.359077zbMath0393.68024OpenAlexW1964377723MaRDI QIDQ4174721

Haim Mendelson, Uri Yechiali, Joseph S. Pliskin

Publication date: 1979

Published in: Communications of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/359060.359077

zbMATH Keywords

Storage AllocationSerial Files


Mathematics Subject Classification ID

Data structures (68P05) Theory of operating systems (68N25)


Related Items

The generalized Banach match-box problem: Application in disc storage management, Max-min resource allocation, Damage models for multi-component systems, A nonlinear minimax allocation problem with multiple knapsack constraints, On approximate jumbled pattern matching in strings, Solving knapsack sharing problems with general tradeoff functions



Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4174721&oldid=18001281"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 6 February 2024, at 12:50.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki