A partial evaluator for the Maruti hard real-time system

Nirkhe, Vivek; Pugh, William

doi:10.1109/real.1991.160359

Cited by 8 publications

(4 citation statements)

References 24 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…A number of other researchers have studied the applicability of partial evaluation to imperative programs. Some recent examples are: Meyer [7], Nirkhe & Pugh [8], and Baier, Gl/ick, & ZSchling [1]. Their methods are more extensive than the ones described here in that they try to maximize the amount of computation performed before run time.…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

Using partial evaluation in support of portability, reusability, and maintainability

Salomon

1996

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Partial evaluation is ordinarily intended to be used to increase program efficiency. This paper shows how partial evaluation can be used in place of a preprocessor phase and of source-code templates (e.g. C++ templates or Ada generics). In this way it can be used to support portability features provided by a preprocessor, and the reusability provided by code templates, but with higher maintainability due to the simpler syntax required. The important mechanisms needed are: annotating variables and functions with an evaluation time, treating declarations as translation-time "executable" statements, treating user-defined types as translation-time variables, giving programmers control over the scope of symbols, and providing translation-time name binding. The effects of these changes on the size and complexity of a compiler are estimated. A translator for a language called "Safer_C" which supports these techniques has been implemented. Important existing C software is analyzed to evaluate the applicability of these techniques in replacing the preprocessor.

show abstract

Section: Related Workmentioning

confidence: 99%

“…Methods for propagating evaluation time through a program appear in the literature (See for instance Meyer [7] or Nirkhe and Pugh [8]), so only the elements unique to Safer_C are emphasized here.…”

Section: Statementsmentioning

confidence: 99%

Using partial evaluation in support of portability, reusability, and maintainability

Salomon

1996

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

“…Assume we successfully have optimized the code of process A, so that its request at time 8 can be initiated at time 7. This will split the busy interval (8,15) into two i n tervals (7,9) and (10,15), as shown in Figure 4 ( b ) . N o w the response time for the request from processes A and B will be faster, due to reduced contention.…”

Section: Multiprocess Safety Analysismentioning

confidence: 99%

“…Note that a busy interval may c o n tain several calls from di erent processes. The start time of an interval is the start time of the earliest request and release time is the sum of the start time and service times of all requests in the that interval (7). Multiprocess Analysis: Finally, m ultiprocess analysis tries to push delays to the end of programs.…”

mentioning

confidence: 99%

Toward compiler optimization of distributed real-time processes

Younis¹,

Marlowe²,

Tsai³

et al.

Proceedings of ICECCS '96: 2nd IEEE International Conference on Engineering of Complex Computer Systems (Held Jointly With 6th

View full text Add to dashboard Cite

Compiler optimization techniques have been applied to facilitate development and performance tuning of non-real-time systems. Unfortunately, regular compiler optimization can complicate the analysis and destroy timing properties of real-time systems. This paper discusses the di culties of performing compiler optimization in distributed r eal-time systems. An algorithm is presented to apply machine-independent compiler optimization safely to distributed r eal-time systems. The algorithm uses resources' busy-idle proles to investigate e ects of optimizing one process on other processes. A r estricted form of resource c ontention is assumed to simplify the analysis.

show abstract