| 1. |
- Belwal, Chaitanya, et al.
(author)
-
Release Offset Bounds for Response Time Analysis of P-FRP using Exhaustive Enumeration
- 2011
-
In: 2011 IEEE 10th International Conference on Trust, Security and Privacy in Computing and Communications (TrustCom). - Piscataway, N.J. : IEEE Press. - 9781457721359 ; , s. 950-957
-
Conference paper (peer-reviewed)abstract
- Functional*Reactive Programming (FRP) is a declarative approach to modeling and building reactive systems. Priority-based FRP (P-FRP) is a formalism of FRP that guarantees real-time response. Unlike the classical preemptive model1 of real-time systems, preempted tasks in PFRP are aborted and have to restart when higher priority tasks have completed. Due to this abort-restart of nature of preemption, there is no single critical instant of release that leads to Worst-Case Response Time (WCRT) of lower priority P-FRP tasks. At this time, the only method for determining the WCRT is through an exhaustive enumeration of all release offsets of higher priority tasks between the release and deadline of the lower priority task. This makes the computational cost of WCRT dependent on the deadline of a task, and when such deadlines are large the computational costs of this technique make it infeasible even for small task sets. In this paper, we show that the release offsets of higher priority tasks have a lower and upper bound and present techniques to derive these bounds. By enumerating only those release offsets while lie within our derived bounds the number of release scenarios that have to be enumerated is significantly reduced. This leads to lower computational costs and makes determination of the WCRT in P-FRP a practically feasible proposition. © 2011 IEEE.
|
|
| 2. |
- Belwal, Chaitanya, et al.
(author)
-
Timing Analysis of the Priority based FRP System
- 2008
-
In: Proceedings Work-In-Progress Session of the 14th Real-Time and Embedded Technology and Applications Symposium. - Lincoln, NE : University of Nebraska–Lincoln, Computer Science and Engineering. ; , s. 89-92
-
Conference paper (peer-reviewed)abstract
- Kaiabachev, Taha, Zhu [1] have presented a declarative programming paradigm called Functional Reactive Programming, which is based on behaviors and events. An improved system called P-FRP uses fixed priority scheduling for tasks. The system allows for the currently executing lower priority tasks to be rolled back to restoring the original state and allowing a higher priority task to run. These aborted tasks will restart again when no tasks of higher priority are in the queue. Since P-FRP has many applications in the real time domain it is critical to understand the time bound in which the tasks which have been aborted are guaranteed to run, and if the task set is schedulable. In this paper we provide an analysis of the unique execution paradigm of the P-FRP system and study the timing bounds using different constraint variables.1. R. Kaiabachev, W. Taha, A. Zhu, E-FRP with priorities, In the Proceedings of the 7th ACM & IEEE international conference on Embedded software, Pages: 221 - 230, 2007.
|
|
| 3. |
- Benaissa, Zine El-Abidine, et al.
(author)
-
Logical Modalities and Multi-Stage Programming
- 1999
-
Conference paper (peer-reviewed)abstract
- Multi-stage programming is a method for improving the performance of programs through the introduction of controlled program specialization. This paper makes a case for multi-stage programming with open code and closed values. We argue that a simple language exploiting interactions between two logical modalities is well suited for multi-stage programming, and report the results from our study of categorical models for multi-stage languages.
|
|
| 4. |
- Brauner, Paul, et al.
(author)
-
Globally Parallel, Locally Sequential : A Preliminary Proposal for Acumen Objects
- 2010
-
In: POOSC'10, Proceedings of the 9th Workshop on Parallel/High-Performance Object-Oriented Scientific Computing. - New York, NY : ACM Press. - 9781450305464
-
Conference paper (peer-reviewed)abstract
- An important and resource-intensive class of computation codes consists of simulators for physical systems. Today, most simulation codes are written in general-purpose imperative languages such as C or FORTRAN. Unfortunately, such languages encourage the programmer to focus her attention on details of how the computation is performed, rather than on the system being modeled.This paper reports the design and implementation of a novel notion of an object for a physical modeling language called Acumen. A key idea underlying the language's design is encouraging a programming style that enables a "globally parallel, locally imperative" view of the world. The language is also being designed to preserve deterministic execution even when the underlying computation is performed on a highly parallel platform. Our main observation with the initial study is that extensive and continual experimental evaluation is crucial for keeping the language design process informed about bottlenecks for parallel execution.
|
|
| 5. |
- Bruneau, Julien, et al.
(author)
-
Preliminary Results in Virtual Testing for Smart Building
- 2010
-
In: Proceedings of MOBIQUITOUS 2010, 7th International ICST Conference on Mobile and Ubiquitous Systems. ; , s. 2-
-
Conference paper (peer-reviewed)abstract
- Smart buildings promise to revolutionize the way we live. Applications ranging from climate control to fire management can have significant impact on the quality and cost of these services. However, a smart building and any technology with direct effect on the safety of its occupants must undergo extensive testing. Virtual testing by means of computer simulation can significantly reduce the cost of testing and, as a result, accelerate the development of novel applications. Unfortunately, building physically-accurate simulation codes can be labor intensive. To address this problem, we propose a framework for rapid, physically-accurate virtual testing of smart building systems. The proposed framework supports analytical modeling and simulation of both a discrete distributed system as well as the physical environment that hosts it.
|
|
| 6. |
- Bruneau, Julien, et al.
(author)
-
Preliminary results in virtual testing for smart buildings
- 2012
-
In: Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering. - Heidelberg : Springer Berlin/Heidelberg. - 1867-8211 .- 1867-822X. ; 73, s. 347-349
-
Journal article (peer-reviewed)abstract
- Smart buildings promise to revolutionize the way we live. Applications ranging from climate control to fire management can have significant impact on the quality and cost of these services. However, a smart building and any technology with direct effect on the safety of its occupants must undergo extensive testing. Virtual testing by means of computer simulation can significantly reduce the cost of testing and, as a result, accelerate the development of novel applications. Unfortunately, building physically-accurate simulation codes can be labor intensive. To address this problem, we propose a framework for rapid, physically-accurate virtual testing of smart building systems. The proposed framework supports analytical modeling and simulation of both a discrete distributed system as well as the physical environment that hosts it. © 2012 Springer-Verlag Berlin Heidelberg.
|
|
| 7. |
- Bruneau, Julien, et al.
(author)
-
Virtual Testing for Smart Buildings
- 2012
-
In: 2012 Eighth International Conference on Intelligent Environments. - Piscataway, N.J. : IEEE Press. - 9781467320931 - 9780769547411 ; , s. 282-289
-
Conference paper (peer-reviewed)abstract
- Smart buildings promise to revolutionize the way we live. Applications ranging from climate control to fire management can have significant impact on the quality and cost of these services. However, smart buildings and any technology with direct effect on human safety and life mustundergo extensive testing. Virtual testing by means of computer simulation can significantly reduce the cost of testing and, as a result, accelerate the development of novel applications. Unfortunately, building physically-accurate simulation codes can be labor intensive.To address this problem, we propose a framework for rapid, physically-accurate virtual testing. The proposed framework supports analytical modeling of both a discrete distributed system as well as the physical environment that hosts it. The discrete models supported are accurate enough to allow the automatic generation of a dedicated programming framework that will help the developer in the implementation of these systems. The physical environment models supported are equational specifications that are accurate enough to produce running simulation codes. Combined, these two frameworks enable simulating both active systems and physical environments. These simulations can be used to monitor the behavior and gather statistics about the performance of an application in the context of precise virtual experiments. To illustrate the approach, we present models of Heating, Ventilating and Air-Conditioning (HVAC) systems. Using these models, we construct virtual experiments that illustrate how the approach can be used to optimize energy and cost of climate control for a building. © 2012 IEEE.
|
|
| 8. |
- Calcagno, Cristiano, et al.
(author)
-
Closed Types as a Simple Approach to Safe Imperative Multi-Stage Programming
- 2000
-
In: Automata, Languages and Programming. - Heidelberg : Springer. - 9783540677154 - 9783540450221 ; , s. 25-36
-
Conference paper (peer-reviewed)abstract
- Safely adding computational effects to a multi-stage language has been an open problem. In previous work, a closed type constructor was used to provide a safe mechanism for executing dynamically generated code. This paper proposes a general notion of closed type as a simple approach to safely introducing computational effects into multi-stage languages. We demonstrate this approach formally in a core language called Mini-MLref BN. This core language combines safely multi-stage constructs and ML-style references. In addition to incorporating state, Mini-ML ref BN also embodies a number of technical improvements over previously proposed core languages for multi-stage programming.
|
|
| 9. |
- Calcagno, Cristiano, et al.
(author)
-
Implementing Multi-stage Languages Using ASTs, Gensym, and Reflection
- 2003
-
In: Generative Programming and Component Engineering. - Heidelberg : Springer Berlin/Heidelberg. - 9783540201021 - 9783540398158 ; , s. 57-76
-
Conference paper (peer-reviewed)abstract
- The paper addresses theoretical and practical aspects of implementing multi-stage languages using abstract syntax trees (ASTs), gensym, and reflection. We present an operational account of the correctness of this approach, and report on our experience with a bytecode compiler called MetaOCaml that is based on this strategy. Current performance measurements reveal interesting characteristics of the underlying OCaml compiler, and illustrate why this strategy can be particularly useful for implementing domain-specific languages in a typed, functional setting. © Springer-Verlag Berlin Heidelberg 2003.
|
|
| 10. |
- Calcagno, Cristiano, et al.
(author)
-
ML-like Inference for Classifiers
- 2004
-
In: Programming Languages and Systems. - Heidelberg : Springer Berlin/Heidelberg. - 9783540213130 - 9783540247258 ; , s. 79-93
-
Conference paper (peer-reviewed)abstract
- Environment classifiers were proposed as a new approach to typing multi-stage languages. Safety was established in the simply-typed and let-polymorphic settings. While the motivation for classifiers was the feasibility of inference, this was in fact not established. This paper starts with the observation that inference for the full classifier-based system fails. We then identify a subset of the original system for which inference is possible. This subset, which uses implicit classifiers, retains significant expressivity (e.g. it can embed the calculi of Davies and Pfenning) and eliminates the need for classifier names in terms. Implicit classifiers were implemented in MetaOCaml, and no changes were needed to make an existing test suite acceptable by the new type checker. © Springer-Verlag 2004.
|
|
