A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2003; you can also visit the original URL.
The file type is application/pdf.
Filters
Memory and time-efficient schedulability analysis of task sets with stochastic execution time
Proceedings 13th Euromicro Conference on Real-Time Systems
Preserved Fulltext
This paper presents an efficient way to analyse the performance of task sets, where the task execution time is specified as a generalized continuous probability distribution. ...
An algorithm to construct the underlying stochastic process in a memory and time efficient way is presented. ...
The stochastic process is constructed and analysed in a memory-and time-efficient way making the method applicable to large task sets. ...
doi:10.1109/emrts.2001.933991
dblp:conf/ecrts/ManolacheEP01
fatcat:lqtui2icfzbi3onkm7msthlxk4
Efficient Stochastic Analysis of Real-Time Systems via Random Sampling
2010
2010 22nd Euromicro Conference on Real-Time Systems
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
This paper provides a stochastic approach to the analysis of real-time systems under preemptive priority-driven scheduling. ...
However, the proposed analysis is significantly less pessimistic than the classical worst-case deterministic analysis. In addition, it could be tuned according to the memory and time availability. ...
However, in more complex cases, the worst-case execution time is the most efficient. Moreover, the complete stochastic analysis is the least efficient. ...
doi:10.1109/ecrts.2010.29
dblp:conf/ecrts/RefaatH10
fatcat:yzcy33ibkbgftgknm6eui6xtny
Parallel program performance prediction using deterministic task graph analysis
2004
ACM Transactions on Computer Systems
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2014; you can also visit the original URL.
The file type is application/pdf.
First, an experimental evaluation shows that our analysis technique is accurate and efficient for a variety of shared-memory programs, including programs with large and/or complex task graphs, sophisticated ...
In contrast to previous models, we use a solution technique based on a modified critical path analysis of program execution time that incorporates both a precise analysis of task scheduling and a mean ...
Second, the model assumes that task execution times are deterministic quantities, which permits an efficient and straightforward solution based on critical path analysis, modified to account for task scheduling ...
doi:10.1145/966785.966788
fatcat:z4ojdrx6infnvaj4zgkcljzne4
Schedulability analysis of applications with stochastic task execution times
2004
ACM Transactions on Embedded Computing Systems
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2015; you can also visit the original URL.
The file type is application/pdf.
Our goal is to keep the analysis cost low, in terms of required analysis time and memory, while considering as general classes of target application models as possible. ...
Considering such a model with specified task execution time probability distribution functions, an important performance indicator of the system is the expected deadline miss ratio of the tasks and of ...
Abeni and Buttazzo's work [Abeni and Butazzo 1999] addresses both scheduling and performance analysis of tasks with stochastic parameters. ...
doi:10.1145/1027794.1027797
fatcat:ppf6rssdbrdetnml3ia4ppbgl4
Stochastic Allocation and Scheduling for Conditional Task Graphs in MPSoCs
[chapter]
2006
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2015; you can also visit the original URL.
The file type is application/pdf.
Given a conditional task graph characterizing a target application and a target architecture with alternative memory and computation resources, we compute an allocation and schedule minimizing the expected ...
This paper describes a complete and efficient solution to the stochastic allocation and scheduling for Multi-Processor System-on-Chip (MPSoC). ...
The task graph is annotated with computation (e.g., execution time), communication (e.g., number of bits to be communicated between tasks), storage (e.g., size of data and instruction memory required to ...
doi:10.1007/11889205_23
fatcat:ih2mnmff5jgu7n3morrofk5hxq
State of the art - optimization techniques in cloud environment
2018
International Journal of Engineering & Technology
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
It determines the various tasks that are to be executed in parallel and the efficient resource to carry out the tasks. ...
Its main objectives being: Scalability, High availability of resources and to reduce the overhead incurred. Scheduling is the method of determining the order by which the jobs have to be executed. ...
The proposed HJSA (Hierarchical Job Scheduling Algorithm) achieves efficient cost, execution time and throughput. ...
doi:10.14419/ijet.v7i2.33.13854
fatcat:tah3ax6voff45e3niqvnvam3h4
Formalizing Software Architectures for Embedded Systems
[chapter]
2001
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
of traditional stochastic performance models • limited resource sharing with deterministic tasks • often averages, not distributions Result: analytic models for response time distributions of slack-scheduled ...
timeline control during recovery testing A blend of testing and formal analysis all possible sequences verified for a fixed set of applications set of applications selected to achieve full model coverage ...
doi:10.1007/3-540-45449-7_31
fatcat:cnixxfci7rda7e5vb5r4ucykda
Communication-aware stochastic allocation and scheduling framework for conditional task graphs in multi-processor systems-on-chip
2007
Proceedings of the 7th ACM & IEEE international conference on Embedded software - EMSOFT '07
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2010; you can also visit the original URL.
The file type is application/pdf.
The problem of allocating and scheduling conditional task graphs on processors in a distributed real-time system is NP-hard. ...
For the first, we propose an exact analytic formulation of the stochastic objective function based on the task graph analysis, while for the scheduling part we extend the timetable constraint for conditional ...
The approximation is based on the Conditional Task Graph analysis for identifying two data structures: the activation set of a node and the coexistence set of two nodes. ...
doi:10.1145/1289927.1289940
dblp:conf/emsoft/DolifLRMB07
fatcat:ioplqa6fbzchzordv3goiaa5ae
Guest Editorial Special Section on Real-Time Applications and Tools Design
2010
IEEE Transactions on Industrial Informatics
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
The proposed algorithm leverages a novel efficient encoding of the scheduling feasibility region to find the task implementation of function blocks with minimum additional functional delays within timing ...
The first paper, entitled "Optimization-Based Dynamic Reconfiguration of Real-Time Schedulers With Support for Stochastic Processor Consumption," proposes scheduling mechanisms to maximize the overall ...
The proposed algorithm leverages a novel efficient encoding of the scheduling feasibility region to find the task implementation of function blocks with minimum additional functional delays within timing ...
doi:10.1109/tii.2010.2074990
fatcat:3tmpql562zdqvky6jwl3kiv5ka
Towards Understanding Uncertainty in Cloud Computing Resource Provisioning
2015
Procedia Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
The vast majority of the research efforts in scheduling assumes complete information about the scheduling problem and a static deterministic execution environment. ...
We also discuss potentials of these approaches for scheduling cloud computing activities under uncertainty, and address methods for mitigating job execution time uncertainty in the resource provisioning ...
Resource Provisioning A key dimension of scheduling policies concerns with how to map a set of tasks to a set of resources. Typically, there are two ways: static scheduling and dynamic scheduling. ...
doi:10.1016/j.procs.2015.05.387
fatcat:slgh4s5c75efrgkprepjpkcqdq
A Model-Based Framework for the Specification and Analysis of Hierarchical Scheduling Systems
[chapter]
2016
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
In a series of recent work, we have shown that schedulability analysis of CPS could be performed with a model-based approach and extensions of verification tools such as UPPAAL. ...
In this paper, we go one step further and show how our formalism can be extended to account for stochastic information, such as sporadic tasks whose attributes depend on the hardware domain. ...
This stochastic feature is of interest to model the variation of execution time with respect to the computation logics and the capability of the execution environments (CPU, memory, I/O and caches, etc ...
doi:10.1007/978-3-319-45943-1_9
fatcat:4zfi3rf5ebd5rdtsydmckeapye
SimDVS: An Integrated Simulation Environment for Performance Evaluation of Dynamic Voltage Scaling Algorithms
[chapter]
2003
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Using SimDVS, we compare the energy efficiency of the intra-task DVS algorithm and inter-task DVS algorithms, and evaluate various heuristics for a hybrid DVS approach. ...
We also show that more efficient DVS algorithms may incur higher system overheads, degrading the overall energy efficiency of the DVS algorithms. ...
Task Set Specification The energy-efficiency of DVS algorithms can be affected by the characteristics of a given task set such as the number of tasks, the task execution time distributions, and the worst ...
doi:10.1007/3-540-36612-1_10
fatcat:hdb2ima2yvd3vei3yrflz2fism
A Primarily Survey on Energy Efficiency in Cloud and Distributed Computing Systems
[article]
2012
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Other Versions
A survey of available techniques in hardware to reduce energy consumption ...
supply voltage (resulting from static timing analysis of previous segments and based on worse-case execution time of the task) is assigned for each segment. ...
task set and meeting all real-time deadlines. ...
arXiv:1210.4690v2
fatcat:lw3g75tmtfforo3shuid4cbp3q
Schedulability analysis of multiprocessor real-time applications with stochastic task execution times
2002
Computer-Aided Design (ICCAD), IEEE International Conference on
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2004; you can also visit the original URL.
The file type is application/pdf.
This paper presents an approach to the analysis of task sets implemented on multiprocessor systems, when the task execution times are specified as generalized probability distributions. ...
Several experiments investigate the impact of various parameters on complexity, in terms of time and memory, as well as the trade-offs regarding the accuracy of generated results. ...
Leung and Whitehead [14] showed that the schedulability analysis is an NP-complete problem in the case of fixed task execution times and more than two processors. ...
doi:10.1145/774572.774675
dblp:conf/iccad/ManolacheEP02
fatcat:zygxjz6fqna75in5vydyh4nxda
Model-Driven Design-Space Exploration for Embedded Systems: The Octopus Toolset
[chapter]
2010
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
different application domains and easy reuse of tools across domains. ...
This paper introduces the Octopus Design-Space Exploration (DSE) toolset that aims to leverage existing modeling, analysis, and DSE tools to support model-driven DSE for embedded systems. ...
To maximize scheduling freedom, we remove task priorities and revert back to task-based memory allocation (which is more efficient than object-based allocation). ...
doi:10.1007/978-3-642-16558-0_10
fatcat:2ch6uu732vhbrj2dntas6m6zcy
« Previous
Showing results 1 — 15 out of 13,602 results