V. Nirkhe and W. Pugh. A partial evaluator for the Maruti hard real-time system. The Journal of Real-Time Systems, 5:13-30, 1993.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....loop for i3 in 1. i2 loop for ir in 1. i r 1 loop innermost loop body end loop; is performed exactly i11 il il irl General loops, however, represent a very difficult task. In order to estimate the worst case performance of general loops many methods and tools have been developed, e.g. [2, 5, 6, 7]. In the following we will discuss some of them: In [5] language constructs have been introduced in order to let the program mer integrate knowledge about the actual behavior of algorithms which can not be expressed using standard programming language features. These constructs are scopes, ....

....Real Time Euclid and a corresponding schedulability analyzer are described. The estimation of worst case performance is facilitated by restricting language constructs, e.g. constant loop bounds are required and recursion and dynamic data structures are forbidden. Partial evaluation is used in [6] to estimate the execution time of programs at compile time. This is done by use of compile time variables, i.e. a variable whose value is definitely known at compile time. Taking advantage of these values, programming language constructs can be simplified thereby speeding up the program in most ....

V. Nirkhe and W. Pugh. A partial evaluator for the Maruti hard real-time system. The Journal of Real-Time Systems, 5:13-30, 1993.

....derived (cf. e.g. KU76, KU77] and a large number of algorithms has been developed (cf. e.g. AC76, GW76, HU77, Sre95, SGL98, Tar81a, Tar81b] See [MR90, RP86] for an overview. Worst Case Execution Time (WCET) analysis does not have such a long standing tradition (cf. e.g. CBW96, HS91, ITM90, NP93, Par93, PK89, PS97, Sha89] Designers of real time programming languages usually restrict language features in order to make it possible to guarantee time bounds and introduce new language features to let the programmer add extraneous information on the algorithms which cannot be determined from ....

....that the employed method can be used to determine the exact timing behavior of a program and not only an upper bound of it. This can also be proved for our approach. In addition our symbolic approach can handle formal and generic parameters (cf. Ada95] too. 7. Partial evaluation is used in [NP93] to estimate the execution time of programs at compile time. This is done by use of compile time variables, i.e. a variable whose value is definitely known at compile time. Taking advantage of these values, programming language constructs can be simplified thereby speeding up the program in most ....

Vivek Nirkhe and William Pugh, A partial evaluator for the Maruti hard real-time system, The Journal of Real-Time Systems 5 (1993), 13--30. 1, 2

....Sreedhar et al. 1998; Tarjan, 1981a; Tarjan, 1981b) See (Marlowe and Ryder, 1990; Ryder and Paull, 1986) for an overview. Worst Case Execution Time (WCET) analysis does not have such a long standing tradition (cf. e.g. Chapman et al. 1996; Halang and Stoyenko, 1991; Ishikawa et al. 1990; Nirkhe and Pugh, 1993; Park, 1993; Puschner and Koza, 1989; Puschner and Schedl, 1997; Shaw, 1989) Designers of real time programming languages usually restrict language features in order to make it possible to guarantee time bounds and introduce new language features to let the programmer add extraneous information ....

....that the employed method can be used to determine the exact timing behavior of a program and not only an upper bound of it. This can also be proved for our approach. In addition our symbolic approach can handle formal and generic parameters (cf. Ada, 1995) too. 7. Partial evaluation is used in (Nirkhe and Pugh, 1993) to estimate the execution time of programs at compile time. This is done by use of compile time variables, i.e. a variable whose value is definitely known at compile time. Taking advantage of these values, programming language constructs can be simplified thereby speeding up the program in most ....

Nirkhe, V. and W. Pugh: 1993, `A Partial Evaluator for the Maruti Hard Real-Time System'. The Journal of Real-Time Systems 5, 13--30.

....is trivial. For example the loop body of the loop for i in 1. N loop loop body end loop; is performed exactly N times. General loops, however, represent a very difficult task. In order to estimate the worst case performance of general loops many methods and tools have been developed, e.g. [HS91, PK89, NP93, Par93]. Most researchers, however, try to ease the task of estimating the number of general loop iterations by forbidding general loops, i.e. by forcing the user to supply constant upper bounds for the number of iterations. Another approach is to let the user specify a time bound within the loop has to ....

V. Nirkhe and W. Pugh. A partial evaluator for the Maruti hard real-time system. The Journal of Real-Time Systems, 5:13--30, 1993.

....X i 1 =1 i 1 X i 2 =1 i 2 X i 3 =1 Delta Delta Delta i r Gamma1 X i r =1 1 = N r Gamma 1 r times. General loops, however, represent a very difficult task. In order to estimate the worst case performance of general loops many methods and tools have been developed, e.g. [2, 5, 6, 7]. In the following we will discuss some of them: ffl In [5] language constructs have been introduced in order to let the programmer integrate knowledge about the actual behavior of algorithms which can not be expressed using standard programming language features. These constructs are scopes, ....

....Real Time Euclid and a corresponding schedulability analyzer are described. The estimation of worst case performance is facilitated by restricting language constructs, e.g. constant loop bounds are required and recursion and dynamic data structures are forbidden. ffl Partial evaluation is used in [6] to estimate the execution time of programs at compile time. This is done by use of compile time variables, i.e. a variable whose value is definitely known at compile time. Taking advantage of these values, programming language constructs can be simplified thereby speeding up the program in most ....

V. Nirkhe and W. Pugh. A partial evaluator for the Maruti hard real-time system. The Journal of Real-Time Systems, 5:13--30, 1993.

....execution orders in case of communicating processes, especially when requests occur in conditionally executed code. As a result, schedulability analysis can either be (1) exact and efficient analysis of single process or multiple processes of simple form, or with highly constrained interactions [12, 14, 15, 26], 2) highly imprecise though efficient analysis of multiple process programs [9] or (3) nearly exact though highly inefficient analysis of some multiple processes [19, 21] To combat some sources of combinatorial explosion, there has been work to reduce the cost of precise schedulability ....

V. Nirkhe, W. Pugh, A partial evaluator for the Maruti Hard-Real-Time System, Real-Time Systems, 5 (1), pp. 13--30, March 1993.

....Program timing and program profiling has been the subject of many recent studies. Park and Shaw [39] developed a tool based on the concept of timing schema that accepts a program and bounds for each loop, and produces predictions for best and worst case execution times. Nirkhe and Pugh [37] developed a technique, based on partial evaluation, which accurately estimates the execution time of general real time programs employing high level constructs. Some very recent studies have been conducted on scheduling algorithms when there is no information available to the scheduler before the ....

Nirkhe, V., and Pugh, W. A partial evaluator for the maruti hard real-time system. Proc. of the IEEE Real-Time Systems Symposium, San Antonio, Texas, Dec. 1991.

....under Mach. 22 Their ability to predict the actual execution behavior of a computation is thus limited by the predictability of Mach s support. The predictability of application programs is improved using an interesting application of partial evaluation to simplify the code being analyzed [62]. One drawback to the method is that it can greatly increase the size of the executable since a single routine may spawn several specialized versions. Maruti assumes an approach to real time scheduling that is the closest to that of the Spring project of all current efforts discussed here. They ....

....the properties required on the programmer. Since all process interactions take place through messages, resource contention and analysis of resource use is irrelevant. It is worth mentioning again the portion of the Maruti system associated with execution time prediction. The partial evaluation [62] and use of code motion during compilation [31] both assume one or more of the methods of determining WCET for specific code segments already discussed [1, 65] However, the use of partial evaluation produces a specialized version of a procedure whose WCET will often be lower than that of the more ....

[Article contains additional citation context not shown here]

Nirkhe, V. and Pugh, W. A Partial Evaluator for the Maruti Hard Real-Time System. In Proceedings of the IEEE Real-Time Systems Symposium. IEEE, December 1991.

....to derive execution time for statements in higher level programming languages. At the machine language level, one can use Knuth s techniques for conventional sequential programs [15] An interesting attempt at designing a language with deterministic timing predictability is the ESTEREL project [4]; in ESTEREL, instructions take zero time except for Sec. 16.2 A Simple Logic for Handling Time 376 those that deal explicitly with time and external events. Other than ESTEREL, it appears that predictability has not received much attention. In fact, part of the motivation for our research has ....

....realtime languages such as Ada, do not provide these timing bounds. An important but reasonable question is: Does the sequence int delay(3) int delay(2) produce the same result as the single statement int delay(5) and what exactly is the result (This particular problem is presented in [4], where it is indeed handled precisely in their interesting, but quite different, ESTEREL language. Consider first some possible realizations of get time under our initial architectural assumptions (Section 16.2.2) Because computer time is maintained by a separate processor, its value ct will be ....

[Article contains additional citation context not shown here]

V. Nirkhe and W. Pugh, "A Partial Evaluator for the Maruti Hard Real-Time System," Proc. of the 12th IEEE Real-Time Systems Symp., Dec. 1991, pp. 64-73.

No context found.

V. Nirkhe, W. Pugh, "A Partial Evaluator for Maruti Hard Real-Time Systems", Real-Time Systems Symposium, 1991.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC