Sciweavers

874 search results - page 70 / 175
» Predicting the Running Times of Parallel Programs by Simulat...
Sort
View
CONCUR
2005
Springer
15 years 3 months ago
A New Modality for Almost Everywhere Properties in Timed Automata
The context of this study is timed temporal logics for timed automata. In this paper, we propose an extension of the classical logic TCTL with a new Until modality, called “Until...
Houda Bel Mokadem, Béatrice Bérard, ...
PPAM
2007
Springer
15 years 3 months ago
An Extensible Timing Infrastructure for Adaptive Large-Scale Applications
Real-time access to accurate and reliable timing information is necessary to profile scientific applications, and crucial as simulations become increasingly complex, adaptive, an...
Dylan Stark, Gabrielle Allen, Tom Goodale, Thomas ...
HYBRID
2000
Springer
15 years 1 months ago
Decidability and Complexity Results for Timed Automata and Semi-linear Hybrid Automata
Abstract. We define a new class of hybrid automata for which reachability is decidable--a proper superclass of the initialized rectangular hybrid automata--by taking parallel compo...
Joseph S. Miller
SC
1995
ACM
15 years 1 months ago
I/O Limitations in Parallel Molecular Dynamics
Abstract We discuss data production rates and their impact on the performance of scientific applications using parallel computers. On one hand, too high rates of data production c...
Terry W. Clark, L. Ridgway Scott, Stanislaw Wloked...
HPDC
1993
IEEE
15 years 1 months ago
Supporting Heterogeneity and Distribution in the Numerical Propulsion System
The Numerical Propulsion System Simulation (NPSS) project has been initiated by NASA to explore the use of computer simulation in the development of new aircraft propulsion techno...
Patrick T. Homer, Richard D. Schlichting