F. Thoen, M. Cornero, G. Goossens, and H. De Man, "Software synthesis for real-time information processing systems," in Proc. Workshop Languages, Compilers, and Tools for Real-Time Systems, 1995, pp. 60--69.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....None of these stud ies considered the effect of the software architecture on en ergy consumption. Our work, on the other hand, provides a systematic framework for harnessing software architectural transformations to minimize energy consumption. IMEC s work on embedded software synthesis [13] considers synthesis of real time multi threaded software based on a multi thread graph (MTG) model. They focus on static scheduling of the threads without the use of an operating system. They do not target energy consumption. Our work also considers multi process embedded software, but emphasizes ....

M. Cornero, F. Thoen, G. Goossens, and F. Curatelit, "Software synthesis for real-time information processing systems," in Code Generation for Embedded Processors, P. Marwedel and G. Goossens, Eds., Chap. 15, pp. 260-296. Kluwer Academic Publishers, Boston, MA, 1994.

....and partial predictability. Only data dependent choices depending on the value of the data or resulting from a reactive, control oriented behavior have to be postponed until run time. Techniques related to quasi static scheduling have been developed using, e.g. constraint graphs [42] [43], dynamic dataflow graphs [44] actors with data dependent execution times [45] free choice Petri nets [46] and FunState models [47] In the following, the latter approach to conflictdependent scheduling of FunState models is sketched. Problems which are typical for the design of complex ....

M. Cornero, F. Thoen, G. Goossens, and F. Curatelli, "Software synthesis for real-time information processing systems," in Code Generation for Embedded Processors, P. Marwedel and G. Goossens, Eds., pp. 260--279. Kluwer Academic Publishers, 1995.

....been proposed. Schedulability can be enhanced by performing dependency analysis and apply code motion when the system is overconstrained by code based constraints [9] Frame Scheduling handles more general types of constraints by verifying that constraints are met in the presence of interrupts [6]. Though not yet mature enough for real time, Java represents a new approach to retargetability through its virtual machine and standardized run time API. Java was originally invented for embedded applications, and it has several attractive features, including built in support for multithreading, ....

M. Cornero, F. Thoen, G. Goossens, and F. Curatelli, "Software Synthesis for Real-Time Information Processing Systems," in P. Marwedel and G. Goossens (ed.), Code Generation for Embedded Processors, Kluwer Academic Publishers, 1995, pp. 260296.

....payload, for example encoded video stream, may have variable rate characteristics. Such an unpredictable behavior may be difficult to model statically even with the help of automated tools. 6 There is criticism of dynamic real time kernel schemes by people propounding static software synthesis [CTGC95], as part of hardware software co design [Gup93] The objections are in terms of the run time and memory overheads to support a general methodology. But even the critics agree that not everything can be done off line, e.g. external events handling) and they generally incorporate some type of ....

M. Cornero, F. Thoen, G. Goossens, F. Curatelli, "Software Synthesis for Real-time Information Processing Systems", in [MG95]

....to ours has been done on using stochastic performance models for the purpose of system synthesis. 1 Finally, a variety of real time systems tools are surveyed in [10] however, most tools tend to be for verification and analysis rather than design synthesis. Existing software synthesis tools[18] tend to be for control type reactive systems. A prototyping and simulation environment for real time systems is described in [6] 3 Tool Description The architecture of our tool, illustrated in Figure 2, consists of the following components: Interactive Graph Editor , Constraints Parser , ....

F. Thoen, M. Cornero, G. Goossens, and H. De Man. Software synthesis for real-time information processing systems. In Proceedings of Workshop on Languages Compilers and Tools for Real-Time Systems, pages 60--69. ACM SIGPLAN, June 1995. Appears as ACM SIGPLAN Notices, 30(11).

....overhead and partial predictability. Only data dependent choices depending on the value of the data or resulting from a reactive, control oriented behavior have to be postponed until run time. Techniques related to quasi static scheduling have been developed using, e.g. constraint graphs [20, 8], dynamic dataflow graphs [5] actors with datadependent execution times [15] free choice Petri nets [32] and FunState models [34] 8.3.1 Conflict Dependent Scheduling Problems which are typical for the design of complex embedded systems are, e.g. different kinds of non determinism such as ....

M. Cornero, F. Thoen, G. Goossens, and F. Curatelli. Software synthesis for realtime information processing systems. In P. Marwedel and G. Goossens, editors, Code Generation for Embedded Processors, pages 260--279. Kluwer Academic Publishers, 1995.

....overhead and partial predictability. Only datadependent choices depending on the value of the data or resulting from a reactive, control oriented behavior have to be postponed until run time. Techniques related to quasi static scheduling have been developed using, e.g. constraint graphs [7, 4], dynamic dataflow graphs [2] actors with data dependent execution times [5] and free choice Petri nets [12] The approach taken in this paper is based on symbolic techniques which use a combination of efficient representations of state spaces and transition models and symbolic model checking ....

....to be associated with intervals rather than single values. In Figure 2a) an example IDD is shown. It represents the Boolean function s(u;v;w) u 3) v 6) u 4) w 7) with u;v;w 2 [0; u 0 v w 1 [4, 0,3] 0,5] 6, S [0,7] 8, a) u v 1 [2,2] 1,1] 0,1] T w w v [2, [3,4] [1,2] 1,4] 4, 0, 0, 2, 0,6] 0,0] 0,5] b) Figure 2: Interval decision diagram and interval mapping diagram. Equivalent to BDDs, IDDs have a reduced and ordered form, providing a canonical representation of a class of Boolean functions which is important with respect to ....

[Article contains additional citation context not shown here]

M. Cornero, F. Thoen, G. Goossens, and F. Curatelli. Software synthesis for real-time information processing systems. In P. Marwedel and G. Goossens, editors, Code Generation for Embedded Processors, pages 260--279. Kluwer Academic Publishers, 1995.

....and partial predictability. Only data dependent choices depending on the value of the data or resulting from a reactive, control oriented behavior have to be postponed until run time. Techniques related to quasi static scheduling have been developed using, e.g. constraint graphs [KD92, CTGC95] dynamic dataflow graphs [Buc93] actors with data dependent execution times [HL97] and freechoice Petri nets [SLWSV98] The approach taken in this report is based on symbolic techniques which use a combination of efficient representations of state spaces and transition models and symbolic ....

....represented as FunState models. The approach based on interval diagram techniques avoids the explicit enumeration of execution paths by using these symbolic techniques. 4. 1 Conflict Dependent Scheduling As mentioned in Section 1, quasi static and related scheduling approaches, e.g. Lee88, CTGC95] try to combine the advantages of static and dynamic scheduling methods. To achieve this, the resolution of data or environment dependent control is done at run time whereas the tasks that need to be executed as a consequence of a run time decision are scheduled statically. The aim is to make ....

M. Cornero, F. Thoen, G. Goossens, and F. Curatelli. Software synthesis for real-time information processing systems. In P. Marwedel and G. Goossens, editors, Code Generation for Embedded Processors, pages 260--279. Kluwer Academic Publishers, 1995.

....capturing the relevant issues of the embedded software and exposing it to analysis. In this article, we propose the multi thread graph (MTG) and put into perspective how it can be used to solve the software scheduling sub task. For an in depth discussion of the complete methodology, we refer to [4][16] The rest of this paper is structured as follows. Section III.introduces the system representation model used, discusses its specific properties and makes a comparison with related work. Section IV.shortly outlines how the model fits in our software scheduling approach. For reasons of ....

....to be interleaved by a small time driven, run time scheduler, which is activated whenever an event occurs (or when an internal synchronization must be performed) The composition order is calculated dynamically, using a pre calculated slack 5 metric, which is update at run time. We refer to [4][16] In figure 5 (d) and (e) the transformation of the specification to the software architecture imposed by the execution model is illustrated, using the blocking execution model for the example. For reasons of clearness, it is split into two sub steps, the first indicating how the outgoing ....

M. Cornero, et al., "Software synthesis for real-time information processing systems," P. Marwedel and G. Goossens (ed.), Code Generation for Embedded Processors, Kluwer, 1995.

....to provide an environment suitable for running programs on processors. For chip level integration, storage requirements for current operating systems do not allow this solution. The knowledge about application programs is exploited in an IMEC approach for avoiding those bulky operating systems [8]. Real time response Systems on a chip have to guarantee a certain real time response to external events. The issue of specifying, analyzing and checking timing constraints is covered, for example, in books by Ku, De Micheli and Gupta [19, 13] and papers by Boriello [4] and by Li, Malik, Wolfe ....

M. Cornero, F. Thoen, G. Goossens, and F. Curatelli. Software synthesis for real-time information processing systems. in: P. Marwedel, G. Goossens (ed.): Code Generation for Embedded Processors, Kluwer, 1995.

....minimum of all thread slacks, i.e. the remaining time between the end of the thread and its timing constraint, of all the succeeding threads in the static schedule. The frame slack derived at compile time, is used and updated at run time. For a more formally description of this model, we refer to [3]. 3.2 Script Figure 3 gives an overview of the proposed approach. From the concurrent process specification, the different program threads are extracted and the non deterministic timing delay is isolated in event nodes. During this step, a code generator can provide a static estimate of the ....

M. Cornero, et al., "Software Synthesis for Real-Time Information Processing Systems," Code Generation for Embedded Processors, Kluwer, 1995.

No context found.

M. Cornero, F. Thoen, G. Goossens, and H. De Man, "Software synthesis for real-time information processing systems," in Code Generation for Embedded Processors, P. Marwedel and G. Goossens, Eds. Boston: Kluwer, 1995, pp. 260--296.

....the DSP signals and external events. In case of hardware implementation, this requires the synthesis of a run time control shell around the implementations of the SDF blocks. In case of software implementation on programmable DSP processors one can use the concept of real time software synthesis [9, 10, 44]. The run time scheduling, based on the occurrence of the events thus makes use of all the static information and is more efficient than using a real time operating system. CAD systems for DSP such as DSP Station of Mentor Graphics [39] PTOLEMY [5] GRAPE II [21] COSSAP and ALTA [34] all allow ....

M. Cornero, F. Thoen, G. Goossens, and H. De Man. Software synthesis for realtime information processing systems. In P. Marwedel and G. Goossens, editors, Code Generation for Embedded Processors, pages 260 -- 296. Kluwer Academic Publishers, Boston, 1995.

....addition, care must be taken to ensure a correct communication of data between processes. Current research in the field of run time kernels is focussing on these issues [27] Recent publications in the CAD community have considered the problem of automatic synthesis of application specific kernels [9, 10, 31, 11]. By statically compiling a kernel that exploits the information about the application at hand, more efficient communication and context switching mechanisms can be incorporated. By means of a static timing analysis, the timing constraints can already be checked at compile time. 8. Conclusions ....

M. Cornero, F. Thoen, G. Goossens, and F. Curatelli. Software synthesis for realtime information processing systems. In Code generation for embedded processors, pp. 260--279, Kluwer Acad. Publ., Boston, 1995.

....threads in the static schedule. The frame slack derived at compile time, is used and updated at run time. The static scheduling algorithm can be driven by optimizing this frame slack, because it allows more frame interleaving at run time. For a more formally description of this model, we refer to [3]. 3.2 Script Figure 3 gives an overview of the proposed approach. From the concurrent process specification, the different program threads are extracted and the nondeterministic timing delay is isolated in event nodes. During this step, a code generator can provide a static estimate of the ....

M. Cornero, F. Thoen, G. Goossens, "Software Synthesis for Real-Time Information Processing Systems," to appear in Proceedings of 1st Workshop on Code Generation for Embedded Processors, Dagstuhl (Germany), Aug. 31 - Sept. 2, 1994, Kluwer.

No context found.

F. Thoen, M. Cornero, G. Goossens, and H. De Man, "Software synthesis for real-time information processing systems," in Proc. Workshop Languages, Compilers, and Tools for Real-Time Systems, 1995, pp. 60--69.

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