Characterizing Data Dependence Constraints for Dynamic Reliability Using n-Queens Attack Domains

Abstract

As data centers attempt to cope with the exponential growth of data, new techniques for intelligent, software-defined data centers SDDC are being developed to confront the scale and pace of changing resources and requirements. For cost-constrained environments, like those increasingly present in scientific research labs, SDDCs also present the possibility to provide better reliability and performability with no additional hardware through the use of dynamic syndrome allocation. To do so the middleware layers of SDDCs must be able to calculate and account for complex dependence relationships to determine an optimal data layout. This challenge is exacerbated by the growth of constraints on the dependence problem when available resources are both large due to a higher number of syndromes that can be stored and small due to the lack of available space for syndrome allocation. We present a quantitative method for characterizing these challenges using an analysis of attack domains for high-dimension variants of the n-queens problem that enables performable solutions via the SMT solver Z3. We demonstrate correctness of our technique, and provide experimental evidence of its efficacy; our implementation is publicly available.