Filters








4,108 Hits in 3.6 sec

Quasi-static scheduling for concurrent architectures

J. Cortadella, A. Kondratyev, L. Lavagno, Y. Watanabe
Third International Conference on Application of Concurrency to System Design, 2003. Proceedings.  
We show how the notion of projections of a schedule for the complete system onto the components implemented on separate resources is essential to define the correctness of the partitioned schedule.  ...  concurrent execution resources.  ...  This body of work is known as Quasi-Static Scheduling (QSS) [2, 12, 13, 3, 14] .  ... 
doi:10.1109/csd.2003.1207697 dblp:conf/acsd/CortadellaKLW03 fatcat:se2s3tfpozeghidegxw5w4vy2m

A structural approach to quasi-static schedulability analysis of communicating concurrent programs

Cong Liu, Alex Kondratyev, Yosinori Watanabe, Alberto Sangiovanni-Vincentelli
2005 Proceedings of the 5th ACM international conference on Embedded software - EMSOFT '05  
We describe a system as a set of communicating concurrent programs. Quasi-static scheduling compiles the concurrent programs into a sequential one.  ...  Our approach prove unschedulability typically within a second for Petri nets generated from industrial JPEG and MPEG codecs, while the scheduler fails to terminate within 24 hours.  ...  For the rest of paper, we use the term "schedule" to refer to a quasi-static schedule.  ... 
doi:10.1145/1086228.1086231 dblp:conf/emsoft/LiuKWS05 fatcat:6rl4slmgjbbmlhpif27bnmfpxu

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.  ...  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 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

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  
We use Free Choice Petri Nets (FCPNs), as underlying model, and define quasi-static schedulability for FCPNs.  ...  The proposed algorithm is complete, in that it can solve QSS for any FCPN that is quasi-statically schedulable.  ...  Static and quasi-static scheduling generates sequential code and can statically allocate communication buffers.  ... 
doi:10.1145/309847.310073 dblp:conf/dac/SgroiL99 fatcat:edfcroqqjfdu7bycrgblvkhcy4

Extended quasi-static scheduling for formal synthesis and code generation of embedded software

Feng-Shi Su, Pao-Ann Hsiung
2002 Proceedings of the tenth international symposium on Hardware/software codesign - CODES '02  
Enhancing recent advances in this research, we propose an Extended Quasi-Static Scheduling (EQSS) method for formally synthesizing and automatically generating code for embedded software, using the Complex-Choice  ...  The requirements of an embedded software are specified by a set of CCPN, which is scheduled using EQSS such that the schedules satisfy limited embedded memory requirements and task precedence constraints  ...  Extended Quasi-Static Scheduling To handle complex choices that may occur in a CCPN, we propose the Extended Quasi-Static Scheduling (EQSS) method.  ... 
doi:10.1145/774789.774832 dblp:conf/codes/SuH02 fatcat:pkfng2ujjrcrdo5ifc7dgt5ooi

Extended quasi-static scheduling for formal synthesis and code generation of embedded software

Feng-Shi Su, Pao-Ann Hsiung
2002 Proceedings of the tenth international symposium on Hardware/software codesign - CODES '02  
Enhancing recent advances in this research, we propose an Extended Quasi-Static Scheduling (EQSS) method for formally synthesizing and automatically generating code for embedded software, using the Complex-Choice  ...  The requirements of an embedded software are specified by a set of CCPN, which is scheduled using EQSS such that the schedules satisfy limited embedded memory requirements and task precedence constraints  ...  Extended Quasi-Static Scheduling To handle complex choices that may occur in a CCPN, we propose the Extended Quasi-Static Scheduling (EQSS) method.  ... 
doi:10.1145/774827.774832 fatcat:ak5dcjyoufg45gkffroo7733gm

Synthesis of real-time embedded software with local and global deadlines

Pao-Ann Hsiung, Cheng-Yi Lin
2003 Proceedings of the 1st IEEE/ACM/IFIP international conference on Hardware/software codesign & system synthesis - CODES+ISSS '03  
We propose a quasi-dynamic scheduling algorithm for simultaneously guaranteeing both local and global deadlines, while satisfying all precedence constraints among subtasks and among tasks.  ...  Application examples, including a driver for the Master/Slave role switch in Bluetooth wireless communication devices, are given to illustrate the feasibility of the scheduling algorithm.  ...  A quasi-static scheduling (QSS) algorithm was proposed for Free-Choice Petri Nets (FCPN) [17] . A necessary and sufficient condition was given for a FCPN to be schedulable.  ... 
doi:10.1145/944678.944679 fatcat:cehvmud2abgwnp2gmo3qfbuapq

Synthesis of real-time embedded software with local and global deadlines

Pao-Ann Hsiung, Cheng-Yi Lin
2003 Proceedings of the 1st IEEE/ACM/IFIP international conference on Hardware/software codesign & system synthesis - CODES+ISSS '03  
We propose a quasi-dynamic scheduling algorithm for simultaneously guaranteeing both local and global deadlines, while satisfying all precedence constraints among subtasks and among tasks.  ...  Application examples, including a driver for the Master/Slave role switch in Bluetooth wireless communication devices, are given to illustrate the feasibility of the scheduling algorithm.  ...  A quasi-static scheduling (QSS) algorithm was proposed for Free-Choice Petri Nets (FCPN) [17] . A necessary and sufficient condition was given for a FCPN to be schedulable.  ... 
doi:10.1145/944645.944679 dblp:conf/codes/HsiungL03 fatcat:6p5lqajt5na53nq36g67rr4woe

A compilation flow for parametric dataflow

Mickaël Dardaillon, Kevin Marquet, Tanguy Risset, Jérôme Martin, Henri-Pierre Charles
2014 Proceedings of the 2014 International Conference on Compilers, Architecture and Synthesis for Embedded Systems - CASES '14  
This paper gives an overview of this flow, with a specific focus on scheduling.  ...  High level models such as Synchronous dataflow (SDF) have been privileged candidates for dealing with this complexity.  ...  Refining Quasi-Static Schedules The quasi-static schedule formalism was obtained by adding the production and consumption of parameters in the scheduling.  ... 
doi:10.1145/2656106.2656110 dblp:conf/cases/DardaillonMRMC14 fatcat:2mgcsosqlzejpdtvwyru5jasbm

A New Compilation Flow for Software-Defined Radio Applications on Heterogeneous MPSoCs

Mickaël Dardaillon, Kevin Marquet, Tanguy Risset, Jérôme Martin, Henri-Pierre Charles
2016 ACM Transactions on Architecture and Code Optimization (TACO)  
Refining Quasi-Static Schedules The quasi-static schedule formalism was obtained by adding the production and consumption of parameters in the scheduling.  ...  A quasi-static iteration vector is therefore a repetition of quasi-static schedules of each actor possibly interleaved with production and consumption of parameters.  ... 
doi:10.1145/2910583 fatcat:zvgvyrsahrbjlkretgonnbnbk4

Analysis of quasi-static scheduling techniques in a virtualized reconfigurable machine

Yury Markovskiy, Eylon Caspi, Randy Huang, Joseph Yeh, Michael Chu, John Wawrzynek, André DeHon
2002 Proceedings of the 2002 ACM/SIGDA tenth international symposium on Field-programmable gate arrays - FPGA '02  
We describe a quasistatic scheduling strategy that retains the full semantic power of the dynamic SCORE flow graph while taking advantage of static scheduling techniques at program load time to hoist most  ...  of the computational work out of the inner scheduling loops.  ...  Scheduling SCORE for a hybrid reconfigurable architecture differs in two key ways from scheduling SDF for microprocessors.  ... 
doi:10.1145/503074.503077 fatcat:adijrjtgtbhe3crc6a3kffvkzu

Analysis of quasi-static scheduling techniques in a virtualized reconfigurable machine

Yury Markovskiy, Eylon Caspi, Randy Huang, Joseph Yeh, Michael Chu, John Wawrzynek, André DeHon
2002 Proceedings of the 2002 ACM/SIGDA tenth international symposium on Field-programmable gate arrays - FPGA '02  
We describe a quasistatic scheduling strategy that retains the full semantic power of the dynamic SCORE flow graph while taking advantage of static scheduling techniques at program load time to hoist most  ...  of the computational work out of the inner scheduling loops.  ...  Scheduling SCORE for a hybrid reconfigurable architecture differs in two key ways from scheduling SDF for microprocessors.  ... 
doi:10.1145/503048.503077 dblp:conf/fpga/MarkovskiyCHYCWD02 fatcat:ef5vtzgprzbb5bkwo4uctqvff4

Asynchrnous Architecture for Sensor Network Nodes [chapter]

Aurélien Buhrig, Marc Renaudin, Dominique Barthel
2006 IFIP International Federation for Information Processing  
The software part that is executed on an asynchronous processor is then scheduled using a quasi-static scheduling and operates in an event-driven way with reactive hardware through an interface controller  ...  We present an asynchronous software and hardware architecture specifically suited for wireless sensor network nodes.  ...  In our case, we have chosen to implement a static scheduling to cope with this problem.  ... 
doi:10.1007/0-387-31173-4_30 fatcat:gter464f7rfm3bbyd7swclkbkq

Architectural support for the orchestration of fine-grained multiprocessing for portable streaming applications

Jani Boutellier, Alessandro Cevrero, Philip Brisk, Paolo Ienne
2009 2009 IEEE Workshop on Signal Processing Systems  
To avoid overhead, static multiprocessor schedules are preferable for orchestrating fine-grained accelerators.  ...  Run-time scheduling for fine-grained accelerators solves the utilization problem, but easily produces significant overhead.  ...  Experiment 1, fully static schedule 141 Mcycles Experiment 1, quasi-static schedule 47 Mcycles Experiment 2, fully static schedule 1.13 Mcycles Experiment 2, quasi-static schedule 0.78 Mcycles  ... 
doi:10.1109/sips.2009.5336235 dblp:conf/sips/BoutellierCBI09 fatcat:r5m6lkqmnjgxdf5myha356mohy
« Previous Showing results 1 — 15 out of 4,108 results