Measuring reactability of persistent computing systems

  • Authors:
  • Takumi Endo;Yuichi Goto;Jingde Cheng

  • Affiliations:
  • Department of Information and Computer Sciences, Saitama University, Saitama, Japan;Department of Information and Computer Sciences, Saitama University, Saitama, Japan;Department of Information and Computer Sciences, Saitama University, Saitama, Japan

  • Venue:
  • SC'07 Proceedings of the 6th international conference on Software composition
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

A persistent computing system is a reactive system that functions continuously anytime without stopping its reactions even when it needs to be maintained, upgraded, or reconfigured, it has some trouble, or it is attacked. However, the requirement that a computing system should run continuously and persistently is never taken into account as an essential and/or general requirement by traditional system design and development methodologies. As a result, there is no clearly defined standard to be used for measuring the reactability of a computing system. This paper proposes the first method to measure the reactability of a persistent computing system in a unified way. The paper introduces the notion of reactive processing path among components and shows that the reactive processing paths can be used to measure the reactability of a persistent computing system.