Access Balancing in Storage Systems by Labeling Partial Steiner Systems

Chee, Yeow Meng; Colbourn, Charles J.; Dau, Son Hoang; Gabrys, Ryan; Ling, Alan C. H.; Lusi, Dylan; Milenković, Olgica

doi:10.1109/isit44484.2020.9174154

Cited by 3 publications

(2 citation statements)

References 30 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…) points. While these two approaches lead to Steiner triple systems whose double independence numbers are near 2 3 v and 3 4 v, our main theorem shows that it can be substantially larger, and determines the maximum double independence number exactly: We establish that the quantities given in Theorem 1.4 are upper bounds in Section 2.…”

Section: Author Manuscriptmentioning

confidence: 83%

“…When D = (V, B) is a point-labelled S(t, k, v), the block sum sum(B) is Σ x∈B x when B ∈ B. Metrics for D to address access balancing are introduced in [5] and studied in [2]; of particular importance is the difference sum or DiffSum, DiffSum(D), defined as max B∈B sum(B) − min B∈B sum(B). The double independence number of a Steiner system relates to the DiffSum of any of its point labellings:…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

On the maximum double independence number of Steiner triple systems

Lusi

Colbourn

2020

J of Combinatorial Designs

View full text Add to dashboard Cite

The maximum independence number of Steiner triple systems of order v is well-known. Motivated by questions of access balancing in storage systems, we determine the maximum total cardinality of a pair of disjoint independent sets of Steiner triple systems of order v for all admissible orders. Upper bounds for α d,maxHaddad and Rödl [10, Proposition 1.2] establish that α d,max (v) ≤ 4 5 v + 1 = 4v+5 5

show abstract

Section: Author Manuscriptmentioning

confidence: 83%

Section: Introductionmentioning

confidence: 99%