Choosing an optimum version of main-memory allocation

MaRDI QIDQ918579zbMATH OpenFDO

Authors G. D. Shvidkaya

Publication date 1989

Published in Automation and Remote Control (Search for Journal in Brave)

zbMATH Keywords

allocation problemloss probabilities in queueing systemsmessage flowsprobability of losing a message

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Applications of queueing theory (congestion, allocation, storage, traffic, etc.) (60K30) Theory of data (68P99)

Recommendations

• Choice-memory tradeoff in allocations
• Choice-Memory Tradeoff in Allocations
• Balanced allocation: memory performance tradeoffs
• Optimizing memory allocation for multistage scheduling including setup times
• scientific article; zbMATH DE number 1305512
• OPTVersusLOADin Dynamic Storage Allocation
• OPT versus LOAD in dynamic storage allocation

Cited in

(1)

• Choice-memory tradeoff in allocations

This page was built for publication: Choosing an optimum version of main-memory allocation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q918579)