Temporal Reasoning about Resources for Deadline Assurance in Distributed Systems

In an open distributed system, computations can be carried out without statically owned resources, harnessing the collective compute power of the resources connected by the Internet. However, realizing this potential requires efficient and scalable resource discovery, coordination and control, which...

Full description

Saved in:
Bibliographic Details
Published in2010 IEEE 30th International Conference on Distributed Computing Systems Workshops pp. 13 - 20
Main Authors Xinghui Zhao, Jamali, N
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.06.2010
Subjects
Actors
Availability
Bounded Resources
Cognition
Computational modeling
CyberOrgs
Deadline Assurance
Distributed Systems
Equations
Planning
ROTA
Semantics
Silicon
Temporal Reasoning
Online AccessGet full text

Cover

More Information
Summary:In an open distributed system, computations can be carried out without statically owned resources, harnessing the collective compute power of the resources connected by the Internet. However, realizing this potential requires efficient and scalable resource discovery, coordination and control, which present challenges in a dynamic, open environment. We present ROTA, a resource-oriented temporal logic, which addresses these challenges by enabling computations to reason about future availability of resources. In ROTA, computational resources are defined over time and space, and represented using resource terms, which specify key attributes of resources. Syntax and semantics of ROTA are described. Theorems are derived to illustrate how the logic can be used to express resource properties of the system in time and space, track resource utilization, and calculate future availability of resources. Particularly, at any time, given a computation, it is possible to evaluate whether its deadline constraint can be assured by the available resources.
ISBN:9781424474714
142447471X
ISSN:1545-0678
2332-5666
DOI:10.1109/ICDCSW.2010.31