Sciweavers

169 search results - page 20 / 34
» Modeling Complex Flows for Worst-Case Execution Time Analysi...
Sort
View
ICDT
2009
ACM
109views Database» more  ICDT 2009»
16 years 11 days ago
TOP-K projection queries for probabilistic business processes
A Business Process (BP) consists of some business activities undertaken by one or more organizations in pursuit of some business goal. Tools for querying and analyzing BP specific...
Daniel Deutch, Tova Milo
117
Voted
BPM
2007
Springer
201views Business» more  BPM 2007»
15 years 5 months ago
Towards Formal Analysis of Artifact-Centric Business Process Models
Abstract. Business process (BP) modeling is a building block for design and management of business processes. Two fundamental aspects of BP modeling are: a formal framework that we...
Kamal Bhattacharya, Cagdas Evren Gerede, Richard H...
IPPS
1997
IEEE
15 years 3 months ago
Optimal Scheduling for UET-UCT Generalized n-Dimensional Grid Task Graphs
The n-dimensional grid is one of the most representative patterns of data flow in parallel computation. The most frequently used scheduling models for grids is the unit execution ...
Theodore Andronikos, Nectarios Koziris, George K. ...
97
Voted
RTS
2011
123views more  RTS 2011»
14 years 6 months ago
Feasibility analysis under fixed priority scheduling with limited preemptions
—Preemptive scheduling often generates a significant runtime overhead that may increase task worst-case execution times up to 40%, with respect to a fully non preemptive executi...
Gang Yao, Giorgio C. Buttazzo, Marko Bertogna
SAC
2010
ACM
15 years 1 months ago
Reactive parallel processing for synchronous dataflow
The control flow of common processors does not match the specific needs of reactive systems. Key issues for these systems are preemption and concurrency, combined with timing pred...
Claus Traulsen, Reinhard von Hanxleden