PROJECT TITLE :

Performability Analysis of k-to-l-Out-of-n Computing Systems Using Binary Decision Diagrams - 2018

ABSTRACT:

Modern computing systems sometimes utilize a large variety of computing nodes to perform coordinated computations in parallel or simultaneously. They will exhibit multiple performance states or levels due to statuses or failures of their consistent nodes. Performability analysis is worried with assessing the probability that the computing system performs at a explicit performance level. In the context of performability analysis, these computing systems can be modeled using k-to-l-out-of-n structures. This Project proposes new analytical ways based on binary call diagrams (BDD) for the performability analysis of enormous computing systems with unrepairable computing nodes. A brand new and efficient BDD algorithm that produces full uses of the special k -to-l-out-of-n structure is 1st proposed for systems with computing node having identical computing powers. New simplification rules are any proposed to generate compact and canonical BDD models for systems with heterogeneous computing nodes characterized by completely different computing powers. Ordering heuristic is additionally explored to any scale back the scale of BDD models. Examples are provided to illustrate the proposed BDD-based performability analysis methodology furthermore its efficiency in analyzing massive-scale computing systems.