Continuous Reactability of Persistent Computing Systems

p. 219-229

Abstract

Persistent computing systems are an infrastructure of computing anticipatory systems. The reactability of a persistent computing system, which is how many reactions of the system are active at a certain time, is the most important property to characterize the system. On the other hand, to be anticipatory, the reactability of a computing anticipatory system must be continuous. This paper proposes the first method to measure the continuous reactability of a persistent computing system in a unified way. The continuous reactability of a persistent computing system is a new concept of computing systems, so that it will be raise new research problems of computing anticipatory systems as well as persistent computing systems.

Text

Download Facsimile [PDF, 4.8M]

References

Bibliographical reference

Yuichi Goto, Takumi Endo and Jingde Cheng, « Continuous Reactability of Persistent Computing Systems », CASYS, 20 | 2008, 219-229.

Electronic reference

Yuichi Goto, Takumi Endo and Jingde Cheng, « Continuous Reactability of Persistent Computing Systems », CASYS [Online], 20 | 2008, Online since 03 September 2024, connection on 20 September 2024. URL : http://popups.lib.uliege.be/1373-5411/index.php?id=2899

Authors

Yuichi Goto

Department of Information and Computer Sciences, Saitama University, Saitama,338-8570, Japan

By this author

Takumi Endo

Department of Information and Computer Sciences, Saitama University, Saitama,338-8570, Japan

Jingde Cheng

Department of Information and Computer Sciences, Saitama University, Saitama,338-8570, Japan

By this author

Copyright

CC BY-SA 4.0 Deed