Filters








4,109 Hits in 5.7 sec

Quasi-static scheduling of independent tasks for reactive systems

J. Cortadella, A. Kondratyev, L. Lavagno, C. Passerone, Y. Watanabe
2005 IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems  
Quasi-static scheduling of independent tasks for reactive systems. "Lecture notes in computer science", Juny 2002, vol. 2360, p. 80-100.  ...  PN Set of SSS generation Code Failure schedule exists Sequential does not exist check Independence does not exist exists independent dependent ¬Ò Ø ÓÒ ´ÈÐ Ö µº Ì Ö Ó ÔÐ  ... 
doi:10.1109/tcad.2005.852038 fatcat:dgpmhcbk5bggflhsumghvbxoza

Quasi-Static Scheduling of Independent Tasks for Reactive Systems [chapter]

Jordi Cortadella, Alex Kondratyev, Luciano Lavagno, Claudio Passerone, Yosinori Watanabe
2002 Lecture Notes in Computer Science  
This paper presents a synthesis approach for reactive software that is aimed at minimizing the overhead introduced by the operating system and the interaction among the concurrent tasks.  ...  The synthesis of reactive software from a modular concurrent specification model generates a set of concurrent tasks coordinated by an operating system.  ...  Static and Quasi-Static Scheduling Static scheduling techniques solve the problem at compile time.  ... 
doi:10.1007/3-540-48068-4_7 fatcat:wotvu26wa5blxkkoc5ro7efzdm

Synthesis of embedded software using free-choice Petri nets

Marco Sgroi, Luciano Lavagno, Yosinori Watanabe, Alberto Sangiovanni-Vincentelli
1999 Proceedings of the 36th ACM/IEEE conference on Design automation conference - DAC '99  
Finally, we show how to synthesize from a quasi-static schedule a C code implementation that consists of a set of concurrent tasks.  ...  We use Free Choice Petri Nets (FCPNs), as underlying model, and define quasi-static schedulability for FCPNs.  ...  Generating one task for every input with independent firing rate identifies a lower bound in the number of tasks, because transitions with independent firing rate cannot be quasi-statically scheduled together  ... 
doi:10.1145/309847.310073 dblp:conf/dac/SgroiL99 fatcat:edfcroqqjfdu7bycrgblvkhcy4

Formal synthesis and code generation of embedded real-time software

Pao-Ann Hsiung
2001 Proceedings of the ninth international symposium on Hardware/software codesign - CODES '01  
Software code is then generated from a set of quasi-statically and dynamically scheduled TFCPNs.  ...  The synthesis method employs quasi-static data scheduling for satisfying limited embedded memory requirements and uses dynamic realtime scheduling for satisfying hard real-time constraints.  ...  Once all CF components of a TFCPN are scheduled, a valid quasi-static data schedule for the TFCPN can be generated as a set of the finite complete cycles.  ... 
doi:10.1145/371636.371729 dblp:conf/codes/Hsiung01 fatcat:kx2umcji2rdefckah3vnqo2c6i

Well-Behaved Applications Allow for More Efficient Scheduling

H.O. Trutmann
1999 IFAC Proceedings Volumes  
Current trends in embedded applications aim towards implementations with sets of interoperating tasks and elaborate scheduling schemes.  ...  Such implementations do away with complicated run-time scheduling, make better use of the available resources and can be analyzed exhaustively before installation on a target.  ...  Task schedule Output from the processing task is fed to buffers to allow for possible asynchronicities of the output system.  ... 
doi:10.1016/s1474-6670(17)39978-0 fatcat:tjwrkmqo6zazdhfcastlaul3q4

Quasi-Dynamic Scheduling for the Synthesis of Real-Time Embedded Software with Local and Global Deadlines [chapter]

Pao-Ann Hsiung, Cheng-Yi Lin, Trong-Yen Lee
2004 Lecture Notes in Computer Science  
We propose a quasi-dynamic scheduling algorithm for simultaneously guaranteeing both types of deadlines, while satisfying all precedence constraints among subtasks and among tasks.  ...  Corresponding to each of the above issues, we propose a set of solutions in the form of a scheduling method called Quasi-Dynamic Scheduling (QDS), which incorporates the respective solutions as briefly  ...  Basically, quasi-dynamic scheduling is a combination of quasi-static scheduling and dynamic scheduling.  ... 
doi:10.1007/978-3-540-24686-2_14 fatcat:mqljv22cnzcm7gt3hzszqlqhve

Embedded software synthesis and prototyping

Trong-Yen Lee, Pao-Ann Hsiung
2004 IEEE transactions on consumer electronics  
Complex-choice Petri nets are used to model embedded software, which are then synthesized using an extended quasi static scheduling algorithm.  ...  With the integration of computer technology, consumer products, and communication facilities, the software in an embedded system now accounts for as much as 70% of total system functionalities.  ...  Here, we proposed an Extended Quasi-Static Scheduling (EQSS) method for the synthesis of embedded software.  ... 
doi:10.1109/tce.2004.1277888 fatcat:6eu6bhhil5dhfcxoqp2taiei3m

RESS: Real-Time Embedded Software Synthesis and Prototyping Methodology [chapter]

Trong-Yen Lee, Pao-Ann Hsiung, I-Mu Wu, Feng-Shi Su
2004 Lecture Notes in Computer Science  
Time Complex-choice Petri Nets are used to model realtime embedded software, which are then synthesized using a time extended quasi static scheduling algorithm.  ...  The final generated C code is prototyped on an emulation platform, which consists of an 89C51 microcontroller for executing the software, an FPGA chip for programming the hardware for different applications  ...  Here, we use a previously proposed Time Extended Quasi-Static Scheduling (TEQSS) method for the synthesis of real-time embedded software.  ... 
doi:10.1007/978-3-540-24686-2_33 fatcat:r5dsjnz5rfhexb57faslqpzwge

Collaborative memory management for reactive sensor/actor systems

Marcel Baunach
2010 IEEE Local Computer Network Conference  
We present the novel CoMem approach for maintaining high reactivity and efficient memory usage within such systems.  ...  Using preemptive task systems is one way to retain acceptable reactivity within highly dynamic environments.  ...  The test beds and the integration of our novel concept into the real-time operating system SmartOS showed, that the effective use of preemptive tasks for creating reactive systems is even feasible on small  ... 
doi:10.1109/lcn.2010.5735840 dblp:conf/lcn/Baunach10 fatcat:hj6j7m62cjfuzi3c3hbiqy6roa

Scheduling hardware/software systems using symbolic techniques

Karsten Strehl, Lothar Thiele, Dirk Ziegenbein, Rolf Ernst, Jürgen Teich
1999 Proceedings of the seventh international workshop on Hardware/software codesign - CODES '99  
In this paper, a scheduling method for heterogeneous embedded systems is developed.  ...  FunState and Scheduling Mainly in the fields of embedded systems and communication electronics, common forms of representation for mixed control/data-oriented systems have gained in importance.  ...  An approach for symbolic scheduling of mixed hardware/software systems has been presented. It is based on a FunState model of the system and the scheduling constraints.  ... 
doi:10.1145/301177.301523 dblp:conf/codes/StrehlTZET99 fatcat:u5m25wjvezeunpq3zxdorlw7om

Formal Synthesis of Real-Time Embedded Software by Time-Memory Scheduling of Colored Time Petri Nets1 1This work was partially supported by research project grant NSC-90-2215-E-194-009 from the National Science Council, Taiwan, ROC

Pao-Ann Hsiung, Chuen-Hau Gau
2002 Electronical Notes in Theoretical Computer Science  
of colored tokens in the system description to model different memory usages by data-types, and (3) by proposing an extended algorithm to schedule the enhanced system model and generate static code.  ...  With the computerization of most daily-life human amenities such as home appliances, the software in a real-time embedded system now accounts for as much as 70% of a system design.  ...  A quasi-static scheduling algorithm was proposed by Sgroi et al. for a class of Petri nets called Free-Choice Petri Nets (FCPN) [21] .  ... 
doi:10.1016/s1571-0661(04)80474-2 fatcat:3vxacwiltfbshd36qy4d3ga26a

Embedded UML

Grant Martin, Luciano Lavagno, Jean Louis-Guerin
2001 Proceedings of the ninth international symposium on Hardware/software codesign - CODES '01  
Embedded UML first selects from among the competing real-time UML proposals, the set of ideas which best allow specification and analysis of mixed HW-SW systems.  ...  In this paper, we present a proposal for a UML profile called 'Embedded UML'.  ...  If both are implemented as software on the same processor, then a static or quasi-static scheduling algorithm can be used to merge both into a single task, and a shared circular buffer is the best implementation  ... 
doi:10.1145/371636.371660 dblp:conf/codes/MartinLL01 fatcat:of4rfctsmrfldje6m55mkoi3ku

Flexible Hierarchical System of Automatic Voltage Control

Aleksandr Domyshev, Alexey Osak, Kirill Zamula, C. Rehtanz, N. Voropai
2019 EPJ Web of Conferences  
The subsystem for optimal control of voltage and reactive power of EPS is developed. The proposed solution uses state of art methods for state estimation, forecasting and dynamic optimization.  ...  The proposed methodology is designed for use in a real power system for automatic voltage control.  ...  For testing and debugging of the optimal control subsystem, the complex provides a subsystem of quasi-dynamic modeling of system behavior.  ... 
doi:10.1051/epjconf/201921701002 fatcat:o6nfdp66n5hptg5lafkxxba7rm

Distributed scheduling: a review of concepts and applications

Ayşegül Toptal, Ihsan Sabuncuoglu
2009 International Journal of Production Research  
Distributed scheduling (DS) is an approach that enables local decision makers to create schedules that consider local objectives and constraints within the boundaries of the overall system objectives.  ...  While we propose a comprehensive taxonomy that accounts for many factors related to distributed scheduling, we also analyse the body of research in which the scheduling aspect is rigorously discussed.  ...  Hadavi et al. (1992) present a system called REDS. In addition to performing as a predictive scheduler, this system is particularly designed for reactive scheduling.  ... 
doi:10.1080/00207540903121065 fatcat:pl5bdx3cdjembbvzp5bdogdzyy

CoMem: collaborative memory management for real-time operation within reactive sensor/actor networks

Marcel Baunach
2011 Real-time systems  
Preemptive task systems are one way to retain good reactivity within dynamic environments.  ...  We present our novel CoMem approach for high reactivity and efficient memory usage in such systems.  ...  Similar to the CPU scheduler in preemptive kernels, hint handlers allow to operate literally non-pre-emptive resources in a quasi-preemptive way (→Fig. 1b).  ... 
doi:10.1007/s11241-011-9136-7 fatcat:u3pa2xbdw5gthazjadqde35fdi
« Previous Showing results 1 — 15 out of 4,109 results