16,801 Hits in 5.6 sec

Scheduling partially ordered tasks with probabilistic execution times

K. M. Chandy, P. F. Reynolds
1975 Proceedings of the fifth symposium on Operating systems principles - SOSP '75  
We study bounds on completion times and the applicability of optimal deterministic schedules to probabilistic models.  ...  A time sharing system simulation shows that multi-tasking could reduce response times and that response time is insensitive to multi-tasking scheduling disciplines.  ...  A substantial amount of literature exists on the scheduling of partially ordered tasks with fixed execution times given two or more processors [I] .  ... 
doi:10.1145/800213.806534 dblp:conf/sosp/ChandyR75 fatcat:lgmb6hrmknf5la2e22a4xr7pei

Probabilistic Performance Modelling when Using Partial Reconfiguration to Accelerate Streaming Applications with Non-deterministic Task Scheduling [chapter]

Bruno da Silva, An Braeken, Abdellah Touhafi
2019 Lecture Notes in Computer Science  
In this paper, a probabilistic approach is used to estimate the acceleration of streaming applications with unknown task schedule thanks to the application of partial reconfiguration.  ...  -Non-priority tasks: The tasks can be executed without a priority order. -Non-data dependencies between tasks: The tasks in the same execution are not data dependent.  ... 
doi:10.1007/978-3-030-17227-5_7 fatcat:xx6bqmeg7zgmrbbf2wba6rwdve

Probabilistic analysis for mixed criticality systems using fixed priority preemptive scheduling

Dorin Maxim, Robert I. Davis, Liliana Cucu-Grosjean, Arvind Easwaran
2017 Proceedings of the 25th International Conference on Real-Time Networks and Systems - RTNS '17  
Further, we provide an alternative analysis (in Section 4.4) and show how support for LO-criticality tasks can be improved via increased execution time budgets (in Section 4.6).  ...  is paper introduces probabilistic analysis for xed priority preemptive scheduling of mixed criticality systems on a uniprocessor using the Adaptive Mixed Criticality (AMC) and Static Mixed Criticality  ...  Acknowledgements e research in this paper was partially funded by the EUROSTARS RETINA Project, the FR BGLE funded Departs project, the FR LEOC Capacites project, the FR FUI Waruna project, the ESPRC grant  ... 
doi:10.1145/3139258.3139276 dblp:conf/rtns/MaximDCE17 fatcat:d7sht3f6y5hh3fuhsztiqtfvqu

Probabilistic schedulability analysis for fixed priority mixed criticality real-time systems

Yasmina Abdeddaim, Dorin Maxim
2017 Design, Automation & Test in Europe Conference & Exhibition (DATE), 2017  
ACKNOWLEDGEMENTS This work was partially supported by the EU funded FP7 Integrated Project PROXIMA (611085), the FR BGLE funded Departs project (O16526-405635), the FR LEOC Capacites project, and the FR  ...  probability mass functions p ≤L h Table I EXAMPLE I OF A TASK-SET WITH PROBABILISTIC WORST CASE EXECUTION TIMES DISTRIBUTIONS.  ...  The next step towards an exact probabilistic analysis was made by [5] with the introduction of the Stochastic Time Demand Analysis (STDA) for tasks that have probabilistic execution times, computing  ... 
doi:10.23919/date.2017.7927056 dblp:conf/date/AbdeddaimM17 fatcat:oh4zspbpgvbsle7rzabx3gdynu

Towards optimal priority assignment for probabilistic CAN-based systems

Dorin Maxim, Liliana Cucu-Grosjean
2010 2010 IEEE International Workshop on Factory Communication Systems Proceedings  
In this paper we investigate the problem of optimal priority assignment in fixed priority pre-emptive single processor systems where tasks have probabilistic execution times.  ...  The first two algorithms are inspired by Audsley's algorithm which is a greedy (lowest priority first) approach that is optimal in the case of tasks with deterministic execution times.  ...  Acknowledgements This work was partially funded by the UK EPSRC funded Tempo project (EP/G055548/1) and the EU funded ArtistDesign Network of Excellence.  ... 
doi:10.1109/wfcs.2010.5548602 fatcat:jdo3aio5hffvlodr6nplwn62b4

Measurement-based real-time analysis of robotic software architectures

Nicolas Gobillot, Fabrice Guet, David Doose, Christophe Grand, Charles Lesire, Luca Santinelli
2016 2016 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS)  
We illustrate this process on the architecture developed for the autonomous navigation of a partially known area by a mobile robot. • We use a more detailed model of the task behavior; for that purpose  ...  , we rely on component-based models using the MAUVE language [11] , and on a schedulability analysis that takes such models into account [12] . • We estimate WCET of tasks from actual measurements, then  ...  They eventually use the Cheddar tool [10] to simulate the scheduling of tasks in order to evaluate the schedulability of the architecture.  ... 
doi:10.1109/iros.2016.7759509 dblp:conf/iros/GobillotGDGLS16 fatcat:q56cio57evdx5oils42tlwyvrq

Incorporating Probabilistic Optimizations for Resource Provisioning of Data Processing Workflows

Amelie Chi Zhou, Yao Xiao, Bingsheng He, Shadi Ibrahim, Reynold Cheng
2019 Proceedings of the 48th International Conference on Parallel Processing - ICPP 2019  
reduce the overhead of probabilistic optimization.  ...  Specifically, we model system variations as time-dependent random variables and take their probability distributions as optimization input.  ...  We denote the execution time of task i on instance type j using r.v. T i j with a probability distribution f T i j (t). We denote the workflow execution time (i.e., makespan) with r.v.  ... 
doi:10.1145/3337821.3337847 dblp:conf/icpp/ZhouXHIC19 fatcat:zuvyr26dfje4rlnliag7cb35wq

Probabilistic loop scheduling for applications with uncertain execution time

S. Tongsima, E.H.-M. Sha, C. Chantrapornchai, D.R. Surma, N.L. Passos
2000 IEEE transactions on computers  
A set of edges represents the dependencies between tasks. In this research, we study scheduling and optimization algorithms taking into account the probabilistic execution times.  ...  The relationship between these tasks can be represented as a data-flow graph where each node models the task associated with a probabilistic computation time.  ...  Acknowledgment The research was partially supported by U.S. National Science Foundation Career Grant MIP 95-01006.  ... 
doi:10.1109/12.822565 fatcat:mhwvd2ylqvbk5f5g7xnkoivqta

EDF Schedulability Analysis on Mixed-Criticality Systems with Permitted Failure Probability

Zhishan Guo, Luca Santinelli, Kecheng Yang
2015 2015 IEEE 21st International Conference on Embedded and Real-Time Computing Systems and Applications  
In this paper, the mixed-criticality task model with multiple worst case execution time (WCET) estimations is extended to incorporate such system-level certification restrictions.  ...  The scheduling objective is to determine a run-time scheduling strategy which ensures that (i) all jobs of all tasks complete by their deadlines if each job completes upon executing for no more than its  ...  Lehoczky [19] proposes the first schedulability analysis of task systems with probabilistic execution times.  ... 
doi:10.1109/rtcsa.2015.8 dblp:conf/rtcsa/GuoSY15 fatcat:kilppnooxfcz3jp7tmvbeioa7e

Flexible Framework for Statistical Schedulability Analysis of Probabilistic Sporadic Tasks

Abdeldjalil Boudjadar, Jin Hyun Kim, Alexandre David, Kim G. Larsen Marius Mikucionis, Ulrik Nyman, Arne Skou, Insup Lee, Linh Thi Xuan Phan
2015 2015 IEEE 18th International Symposium on Real-Time Distributed Computing  
The analysis of probabilistic schedulability explores all possible combinations of the probabilities of task attributes, which can easily lead to exponential computation time [24] .  ...  In this paper, we present a flexible schedulability analysis framework for periodic and sporadic tasks having probabilistic attributes where the computation time scales linearly in the size of analyzed  ...  Probabilistic Tasks and Analysis Analytical approaches for the response time and schedulability analysis of tasks having a probabilistic execution time have been defined in [1] , [13] among many others  ... 
doi:10.1109/isorc.2015.21 dblp:conf/isorc/BoudjadarKDLMNS15 fatcat:uzwgaddppreg3dufw7ygm3hn2a

A review of priority assignment in real-time systems

Robert I. Davis, Liliana Cucu-Grosjean, Marko Bertogna, Alan Burns
2016 Journal of systems architecture  
The review covers priority assignment in a wide variety of settings including: mixed-criticality systems, systems with deferred pre-emption, and probabilistic real-time systems with worstcase execution  ...  Since then, huge progress has been made in the field of real-time scheduling with more complex models and schedulability analysis techniques developed to better represent and analyse real systems.  ...  ACKNOWLEDGEMENTS This work was partially funded by the UK EPSRC MCC project (EP/K011626/1), the French BGLE Departs and LEOC Capacites projects, the EU FP7 grants P-SOCRATES (611016) and PROXIMA (611085  ... 
doi:10.1016/j.sysarc.2016.04.002 fatcat:ziodjnqp7jby5pskfspogugd4u

Modeling and Analysis of Power-Aware Systems [chapter]

Oleg Sokolsky, Anna Philippou, Insup Lee, Kyriakos Christou
2003 Lecture Notes in Computer Science  
This paper describes the modeling and analysis techniques, and illustrates them with examples, including a dynamic voltage-scaling algorithm.  ...  The paper describes a formal approach for designing and reasoning about power-constrained, timed systems.  ...  We model the probabilistic nature of task execution time in the system by employing probabilistic resources.  ... 
doi:10.1007/3-540-36577-x_29 fatcat:isibreypv5hi7cw2u6xnejaenq

Mapping DSP applications onto self-timed multiprocessors

S.S. Bhattacharyya, N. Bambha, M. Khandelia, V. Kianzad
2001 Conference Record of Thirty-Fifth Asilomar Conference on Signals, Systems and Computers (Cat.No.01CH37256)  
Self-timed scheduling is an attractive implementation style for multiprocessor DSP systems due to its ability to exploit predictability in application behavior, its avoidance of over-constrained synchronization  ...  However, analysis and optimization of self-timed systems under real-time constraints is challenging due to the complex, irregular dynamics of self-timed operation.  ...  In self-timed scheduling, each processor executes the tasks assigned to it in a fixed order that is specified at compile time.  ... 
doi:10.1109/acssc.2001.986965 fatcat:vlwdmst5ebbqrhc2vzkyscspou

On Optimal Scheduling under Uncertainty [chapter]

Yasmina Abdeddaïm, Eugene Asarin, Oded Maler
2003 Lecture Notes in Computer Science  
In this work we treat the problem of scheduling under two types of temporal uncertainty, setbased and probabilistic.  ...  For the former we define appropriate optimality criteria and develop an algorithm for finding optimal scheduling strategies using a backward reachability algorithm for timed automata.  ...  We construct for every task p with D(p) = [l, u] a 3-state timed automaton A D (Figure 2-(a) ) with a waiting state p, an active state p where the task is executing and a final state p.  ... 
doi:10.1007/3-540-36577-x_17 fatcat:4366g6p7szbd5bmz32fqcqdzfa

Time-Bounded Statistical Analysis of Resource-Constrained Business Processes with Distributed Probabilistic Systems [chapter]

Ratul Saha, Madhavan Mukund, R. P. Jagadeesh Chandra Bose
2016 Lecture Notes in Computer Science  
Our model, Distributed Probabilistic Systems (DPS), incorporates a set of probabilistic agents communicating among each other in fixed-duration real-time.  ...  Formal modeling of such business processes with resource constraints and multiple instances is hard because of the interplay among stochastic behavior, concurrency, real-time and resource contention.  ...  We ensure that the probability of Type-I error and Type-II error of verifying this property is less than 0.01 with indifference region (0.99 ± 0.005).  ... 
doi:10.1007/978-3-319-47677-3_19 fatcat:5o7febgpi5eerbr33jionoyiky
« Previous Showing results 1 — 15 out of 16,801 results