A Formal Model for Real-Time Parallel Computation
The imposition of real-time constraints on a parallel computing environment--- specifically high-performance, cluster-computing systems--- introduces a variety of challenges with respect to the formal verification of the system's timing properties. In this paper, we briefly motivate the need for such a system, and we introduce an automaton-based method for performing such formal verification. We define the concept of a consistent parallel timing system: a hybrid system consisting of a set of timed automata (specifically, timed Buechi automata as well as a timed variant of standard finite automata), intended to model the timing properties of a well-behaved real-time parallel system. Finally, we give a brief case study to demonstrate the concepts in the paper: a parallel matrix multiplication kernel which operates within provable upper time bounds. We give the algorithm used, a corresponding consistent parallel timing system, and empirical results showing that the system operates under the specified timing constraints.
- Research Organization:
- Pacific Northwest National Lab. (PNNL), Richland, WA (United States)
- Sponsoring Organization:
- USDOE
- DOE Contract Number:
- AC05-76RL01830
- OSTI ID:
- 1092033
- Report Number(s):
- PNNL-SA-90719
- Resource Relation:
- Conference: First International Workshop on Formal Techniques for Safety-Critical Systems, November 12, 2012, Kyoto, Japan. Electronic Proceedings in Theoretical Computer Science (EPTCS), 105:39-55
- Country of Publication:
- United States
- Language:
- English
Similar Records
Paradigms for the specification, design, and verification of real time distributed systems
Designing Secure and Resilient Cyber-Physical Systems Using Formal Models