Alexander D. Stoyenko. A Real-Time Language with A Schedulability Analyzer. PhD thesis, Computer Systems Research Institute, University of Toronto, December 1987.  Home/Search   Document Not in Database   Summary   Related Articles   Check

.... et al. 1989, Park, Shaw 1990, Harmon, Baker, Whalley 1992, Zhang, Burns, Nicholson 1993, Li, Malik, Wolfe 1995] and they built compiler prototypes to translate high level source programs annotated with path information into code that is both executable and analyzable with respect to its WCET [Stoyenko 1987, Vrchoticky 1994] Despite the existence of the necessary research results in all these areas, there exists no commercial compiler on the market that translates both source code and information about possible execution paths during compilation, this way supporting WCET analysis. Real time system ....

A. Stoyenko. A Real-Time Language With A Schedulability Analyzer. PhD Thesis, Computer Systems Research Institute, University of Toronto, Dec. 1987. Technical Report CSRI-206.

....scheduling policy. To overcome the well known NP completeness trap , as proved by [Gar75] early algorithms were designed for very simple scenarios, such as single processors, with independent tasks [Liu73] or were using naive techniques, such as testing all possible task orderings [Lei80] [Sto87], capable of small task sets only due to combinatorial explosion. Only recently algorithms have been presented that are applicable to reasonably complex application structures, such as semaphores [Sha90] or precedence constraints [Ram90] Scheduling can in principle be done statically, before the ....

A. Stoyenko. A Real-Time Language With A Schedulability Analyzer. PhD Thesis, Computer Systems Research Institute, University of Toronto, Dec. 1987. Technical Report CSRI-206.

....or parallel real time programs to determine one or more program points at which monitoring instrumentation can be placed so that it will be non intrusively absorbed by the application. Extensive research has been carried out in the area of real time languages and their analysis for scheduling [4, 14, 18]. Previous work on timing analysis has mainly concentrated on execution timing analysis. This includes compiler support for computing WET estimates [9, 10, 12] and the run time refinement of WET estimates based upon a combination of compile time information [15, 6] and run time information [3, 5] ....

A. D. Stoyenko, "A Real-Time Language With A Schedulability Analyzer," Ph.D. Thesis, University of Toronto, August 1987.

....able to ensure that a request from the embedding environment will be served within a predefined time frame is of the utmost importance. In multiprogramming environments this requirement can be expressed as schedulability: the ability to find a schedule such that each task will meet its deadline (Stoyenko, 1987). For schedulability analysis, the execution times of tasks must be known in advance. These can only be determined, however, if a system functions predictably. To ensure overall predictability, all the layers of the system design must be predictable, from the processor to the system architecture, ....

Stoyenko, A. (1987). A Real--Time Language With a Schedulability Analyzer. PhD thesis, University of Toronto.

....of temporal behaviour. Being able to assure that a process will be serviced within a predefined time frame is of utmost importance. In multiprogramming environments this condition can be expressed as schedulability: the ability to find a schedule such that each task will meet its deadline [22]. For schedulability analysis, execution times of tasks must be known in advance. These, however, can only be determined if a system functions predictably. To assure overall predictability, all system layers must behave predictably in the temporal sense, from the processor to the system ....

Alexander Stoyenko. A Real-Time Language With A Schedulability Analyzer. PhD thesis, University of Toronto, December 1987.

....the (worst case) execution time of code segments is known. More recently, work by Niehaus [5] on program representation and translation also assumes that the worst case execution time (WCET) of a process can be determined accurately. Some research has been done on the WCET problem. Stoyenko s work [9], on the schedulability analyzer for Real Time Euclid, addressed the problem of worst case timing analysis of tasks by assuming the execution time of each instruction is constant. However, even the hardware builders[4] concede that the exact execution time of a given instruction may vary, ....

Stoyenko, A.D,"A Real-Time Language With A Schedulability Analyzer ", Ph. D. Thesis, University of Toronto, August 1987.

....linear programming problem. The solution of the programming problem yields the MAXT and detailed information about execution paths of maximum cost (see also [12, 16] Several works are related to our research. The approach taken in this paper is mainly influenced by Kligerman and Stoyenko. In [5, 18], they discussed restrictions for programming languages that are necessary to allow for a computation of execution time bounds for real time tasks. Their programming language, called Real Time Euclid, prohibits the use of recursions and goto statements. Loops are restricted to time bounded loops ....

A. Stoyenko. A Real-Time Language With A Schedulability Analyzer. Dissertation, Computer Systems Research Institute, University of Toronto, Canada, Dec. 1987.

....a timing estimation for real time systems since their predictions are usually not guaranteed, or enormous cost is needed. Because of these limitations of the measurementbased approaches, analytical approaches are becoming more popular. There have been several recent studies about this issue [4, 8, 9, 18, 19, 20, 22, 23, 24, 27, 28]. In many of these studies, the assumed machine model is a simple non pipelined processor without cache memory [18, 22, 23, 27] Thus the timing effects of pipelined execution and cache memory are not taken into account. 2.1 Timing analysis of pipelined execution The timing effects of pipelined ....

....of the measurementbased approaches, analytical approaches are becoming more popular. There have been several recent studies about this issue [4, 8, 9, 18, 19, 20, 22, 23, 24, 27, 28] In many of these studies, the assumed machine model is a simple non pipelined processor without cache memory [18, 22, 23, 27]. Thus the timing effects of pipelined execution and cache memory are not taken into account. 2.1 Timing analysis of pipelined execution The timing effects of pipelined execution have been recently studied by Harmon, Baker, and Whalley [9] Harcourt, Mauney, and Cook [8] Narasimhan and Nilsen ....

A. Stoyenko. A Real-Time Language with a Schedulability Analyzer. PhD thesis, University of Toronto, Dec. 1987.

....used to obtain such bounds. Measurement based techniques are, in many cases, inadequate to produce a timing estimation for real time systems since their predictions are usually not guaranteed, or enormous cost is needed. Due to these limitations, analytical approaches are becoming more popular [4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16]. Many of these analytical studies, however, consider a simple machine model, thus largely ignoring the timing effects of pipelined execution and cache memory [8, 12, 13, 15] A. Timing Analysis of Pipelined Execution The timing effects of pipelined execution have been recently studied by Harmon, ....

....cost is needed. Due to these limitations, analytical approaches are becoming more popular [4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16] Many of these analytical studies, however, consider a simple machine model, thus largely ignoring the timing effects of pipelined execution and cache memory [8, 12, 13, 15]. A. Timing Analysis of Pipelined Execution The timing effects of pipelined execution have been recently studied by Harmon, Baker, and Whalley [6] Harcourt, Mauney, and Cook [5] Narasimhan and Nilsen [11] and Choi, Lee, and Kang [4] In these studies, the execution time of a sequence of ....

A. Stoyenko, A Real-Time Language with a Schedulability Analyzer. PhD thesis, University of Toronto, Dec. 1987.

....of all execution paths. The number of the execution paths of a program cannot be bounded unless the iteration count of each loop structure is bounded. All previous studies on bounding WCETs of programs assume that the iteration count of each loop structure in the program being analyzed is bounded [17, 21, 29, 36, 39, 42]. We also make this assumption. There are several approaches that use loop bound information only. Mok and his students [2, 4, 29] analyzed the execution times of assembly language programs generated from the compilation of annotated C programs. They used a graph method to find the worst case ....

Alexander D. Stoyenko. A Real-Time Language with A Schedulability Analyzer. PhD thesis, Computer Systems Research Institute, University of Toronto, December 1987.

....instructions. The detailed analysis for introducing monitoring code can be found elsewhere (Spezialetti and Gupta, 1994) 5. Related Work Extensive research has been carried out in the area of real time languages (Kenny and Lin, 1991, Lee and Gehlot, 1985, Nirkhe, Tripathi, and Agrawala, 1990, Stoyenko, 1987) and their analysis for scheduling (Lin, Natarajan, and Liu, 1987, Lin and Natarajan, 1987, Mok et al. 1989, Pospischil, Puschner, Vrchoticky, and Zainlinger, 1992, Shaw, 1989, Stoyenko, 1987, Xu and Parnas, 1990) Previous work on timing analysis has mainly concentrated on execution timing ....

.... of real time languages (Kenny and Lin, 1991, Lee and Gehlot, 1985, Nirkhe, Tripathi, and Agrawala, 1990, Stoyenko, 1987) and their analysis for scheduling (Lin, Natarajan, and Liu, 1987, Lin and Natarajan, 1987, Mok et al. 1989, Pospischil, Puschner, Vrchoticky, and Zainlinger, 1992, Shaw, 1989, Stoyenko, 1987, Xu and Parnas, 1990) Previous work on timing analysis has mainly concentrated on execution timing analysis. This includes compiler support for computing WCET estimates (Neihaus, 1991, Harmon, Baker, and Whalley, 1992, Hong and Greber, 1993, Nirkhe and Pugh, 1992) and the run time refinement of ....

Stoyenko, A.D., "A Real-Time Language With A Schedulability Analyzer," Ph.D. Thesis, University of Toronto, August, 1987.

....that is updated to reflect exact execution times; we use the same idea initially and then derive running bounds for real time. We have also been influenced by Jahanian and Mok, who argue that the notion of a real time or clock variable cannot be realized correctly because of concurrency problems [13], and by a presentation given by Pnueli, who argues that clock variables are indeed feasible [20] There does not seem to be any literature on how to derive execution time for statements in higher level programming languages. At the machine language level, one can use Knuth s techniques for ....

....1981, pp. 454 501. 11] V.H. Haase, Modular design of real time systems, in System Description Methodologies, D. Teichroew and G. David (eds. Elsevier, Amsterdam, 1985, pp. 91 100. 12] C.A.R. Hoare, An axiomatic basis for computer programming, Commun. ACM, vol. 12, Oct. 1969, pp. 576 580. [13] F. Jahanian and A.K. L. Mok, Safety analysis of timing properties in real time systems, IEEE Trans. Software Eng. vol. SE 12, Sept. 1986, pp. 890 904. 14] E. Kligerman and A.D. Stoyenko, Real time Euclid: a language for reliable real time systems, IEEE Trans. Software Eng. vol. SE 12, ....

[Article contains additional citation context not shown here]

A. Stoyenko, "A Real-Time Language with a Schedulability Analyzer," Ph.D. Dissertation, Tech. Report #CSRI-206, Computer Systems Research Institute, Univ. of Toronto, Dec. 1987.

....systems that use modern RISC style microprocessors. Our particular focus is on how the timing tool addresses the issues resulting from advanced features of these microprocessors such as pipelined execution and cache memory. There have been various approaches to predicting program execution times [2, 5, 8, 9, 11, 12]. However, their machine models were mostly CISC style processors rather than RISC style microprocessors. This work was supported in part by ADD (Contract ADD91 4 4) and KOSEF (Grant KOSEF 93 01 00 10) This paper is organized as follows. Section 2 presents the overview of the timing tool. In ....

A. Stoyenko. A Real-Time Language with a Schedulability Analyzer. PhD thesis, University of Toronto, Dec. 1987.

....exact knowledge about the timing behavior of the real time tasks involved. In order to guarantee that a real time task can be finished before the expiration of its specified deadline, the maximum execution time (MAXT) or a reasonable upper bound have to be known in advance, i.e. before run time. [Kli86,Pus89,Sha89,Sto87] present concepts on how MAXT can be calculated and which restrictions have to be imposed on programming languages for critical real time systems (e.g. bounded loops) This report suggests how these concepts could be effectively integrated into the design process of a real time system. The major ....

A. Stoyenko. A Real-Time Language With A Schedulability Analyzer. PhD Thesis, Computer Systems Research Institute, University of Toronto, Dec. 1987. Technical Report CSRI-206.

....component (task) must be predictable if one is to build reliable deterministic real time systems. Much of the research in hard real time scheduling theory assumes that the execution time of each task is constant, and available a priori (e.g. Liu and Layland [12] Mok [15] Stoyenko s work [22] on the schedulability analyzer for Real Time Euclid addressed the problem of worst case timing analysis of a task, by assuming the execution time of each instruction is constant. However, the hardware builders [17] concede that the exact execution time of a given instruction may vary, depending ....

Stoyenko, A. D. 1987. A Real-Time Language With A Schedulability Analyzer, Ph. D. Thesis, Department of Computer Science, University of Toronto, Toronto, Canada. Micro-analysis 67078 106795 Timing Technique Table Lookup 46074 124129 Instruction Counting 210133 231143 Logic Analyzer 103120 103254 Worst case Best case Execution Cycles

....since even with small variations, experiments have shown that within a basic block, instruction execution times tend to average out. The analysis and transformation engine uses the intermediate code and control structures extracted during compilation to perform schedulability analysis ( 19] [20]) and code transformations. We are interested in two types of transformations. First, we consider optimizing transformations, for example removing invariant form a loop. Such transformations always improve the average execution time and do not extend the WCET, if we consider the process in ....

A. Stoyenko, A Real-Time Language with A Schedulability Analyzer, Ph.D. Thesis, Department of Computer Science, University of Toronto, 1987.

....misses[4] Capacity misses are due to finite cache size. Conflict misses, on the other hand, are caused by a limited set associativity. These types of cache misses cannot be avoided if the cache has a limited size and or set associativity. There have been many attempts to predict the WCETs of tasks[2, 12, 14, 15, 18, 19]. However, most of them have not addressed the issues resulting from intra interference in caches. One notable exception is the static cache simulation approach that statically predicts hits or misses of instruction references using data flow analysis[13] In this approach, instructions are ....

A. Stoyenko. A Real-Time Language with a Schedulability Analyzer. PhD thesis, University of Toronto, Dec. 1987.

....Second, resultant changes in the execution behavior of other processes must be analyzed. This analysis checks adherence of processes to their critical timing constraints under all possible execution orders compatible with the scheduling discipline in use. Such analysis, introduced by Stoyenko [19, 20, 21] and commonly referred to as schedulability analysis, must be applied even in the absence of optimization. However, finding precise solutions considering contention and branching is, in general, an NP complete problem, and it can add significantly to the cost of program compilation. The ....

A. Stoyenko, A Real-Time Language with A Schedulability Analyzer, Ph.D. Thesis, Department of Computer Science, University of Toronto, 1987.

No context found.

Alexander D. Stoyenko. A Real-Time Language with A Schedulability Analyzer. PhD thesis, Computer Systems Research Institute, University of Toronto, December 1987.

No context found.

A. Stoyenko, "A Real-Time Language with a Schedulability Analyzer", Ph. D. Thesis TR CSRI-206, Computer Systems Research Institute, University of Toronto, Dec. 1987.

No context found.

A. D. Stoyenko, "A Real-Time Language With A Schedulability Analyzer", Ph. D. Thesis, University of Toronto, August 1987. 20

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