Sciweavers

2355 search results - page 109 / 471
» Scheduling in the Z-Polyhedral Model
Sort
View
IANDC
2007
107views more  IANDC 2007»
15 years 5 months ago
Task automata: Schedulability, decidability and undecidability
We present a model, task automata, for real time systems with non-uniformly recurring computation tasks. It is an extended version of timed automata with asynchronous processes th...
Elena Fersman, Pavel Krcál, Paul Pettersson...
CORR
2009
Springer
242views Education» more  CORR 2009»
15 years 3 months ago
Adaptive Scheduling of Data Paths using Uppaal Tiga
Abstract. We apply Uppaal Tiga to automatically compute adaptive scheduling strategies for an industrial case study dealing with a state-of-the-art image processing pipeline of a p...
Israa AlAttili, Fred Houben, Georgeta Igna, Steffe...
INFOCOM
2009
IEEE
16 years 12 days ago
Minimum-Latency Beaconing Schedule in Multihop Wireless Networks
— Minimum-latency beaconing schedule (MLBS) in synchronous multihop wireless networks seeks a schedule for beaconing with the shortest latency. This problem is NP-hard even when ...
Peng-Jun Wan, Xiao-Hua Xu, Lixin Wang, Xiaohua Jia...
156
Voted
ICCAD
1992
IEEE
137views Hardware» more  ICCAD 1992»
15 years 9 months ago
Equivalent design representations and transformations for interactive scheduling
High-level synthesis (HLS) requires more designer interaction to better meet the needs of experienced designers. However, attempts to create a highly interactive synthesis process...
Roger P. Ang, Nikil D. Dutt
DAGSTUHL
2004
15 years 7 months ago
Bus Scheduling for TDL Components
This paper describes a solution for bus scheduling of distributed multi-mode TDL (Timing Definition Language) components. The TDL component model is based on the concept of Logical...
Emilia Farcas, Wolfgang Pree, Josef Templ