Well-balanced designs for data placement

DOI10.1002/JCD.21506zbMATH1336.05018OpenAlexW2140709916MaRDI QIDQ2808799FDOQ2808799

Authors Jean-Claude Bermond, Alain Jean-Marie, Dorian Mazauric, Joseph Yu

Publication date 24 May 2016

Published in Journal of Combinatorial Designs (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/jcd.21506

zbMATH Keywords

Steiner systemsdesignsdata placementdisjoint Steiner triple systems

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Data structures (68P05) Combinatorial aspects of block designs (05B05) Triple systems (05B07)

Recommendations

• Optimal data placements for triple replication in distributed storage systems
• Kirkman systems that attain the upper bound on the minimum block sum, for access balancing in distributed storage
• The existence of well-balanced triple systems
• Access balancing in storage systems by labeling partial Steiner systems
• MaxMinSum Steiner systems for access balancing in distributed storage

Cites work

• scientific article; zbMATH DE number 4037877 (Why is no real title available?)
• scientific article; zbMATH DE number 3392464 (Why is no real title available?)
• A completion of Lu's determination of the spectrum for large sets of disjoint Steiner triple systems
• A new existence proof for large sets of disjoint Steiner triple systems
• Group divisible designs with two associate classes, and quadratic leaves of triple systems
• Neighborhoods in maximum packings of \(2K_n\) and quadratic leaves of triple systems
• New results on large sets of Kirkman triple systems
• On Quadruple Systems
• On large sets of disjoint Steiner triple systems. III
• On large sets of disjoint Steiner triple systems. IV
• Quadratic leaves of maximal partial triple systems
• The existence of well-balanced triple systems
• Towards a Large Set of Steiner Quadruple Systems
• Well-balanced designs for data placement

Cited in

(10)

• The existence of 2-balanced Mendelsohn triple systems
• Well-balanced quadruple systems
• Further study on optimal data placements for triple replication
• Kirkman systems that attain the upper bound on the minimum block sum, for access balancing in distributed storage
• Access balancing in storage systems by labeling partial Steiner systems
• Optimal data placements for triple replication in distributed storage systems
• The existence of well-balanced triple systems
• Well-balanced designs for data placement
• Egalitarian Steiner triple systems for data popularity
• MaxMinSum Steiner systems for access balancing in distributed storage

This page was built for publication: Well-balanced designs for data placement

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