Relevant bibliographies by topics / Real-time scheduling analysis

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Books
  4. Book chapters
  5. Conference papers

Academic literature on the topic 'Real-time scheduling analysis'

Author: Grafiati
Published: 4 June 2021
Last updated: 15 February 2022

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Real-time scheduling analysis.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Real-time scheduling analysis"

1

Geniet, Annie Choquet, and Gaëlle Largeteau Skapin. "Size analysis in multiprocessor real-time scheduling." International Journal of Critical Computer-Based Systems 5, no. 3/4 (2014): 197. http://dx.doi.org/10.1504/ijccbs.2014.064664.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Lee, Jinkyu, and Insik Shin. "EDZL Schedulability Analysis in Real-Time Multicore Scheduling." IEEE Transactions on Software Engineering 39, no. 7 (July 2013): 910–16. http://dx.doi.org/10.1109/tse.2012.75.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Yang, Mao Lin, Hang Lei, Yong Liao, and Lin Hui Hu. "Synchronization Analysis for Hard Real-Time Multicore Systems." Applied Mechanics and Materials 241-244 (December 2012): 2246–52. http://dx.doi.org/10.4028/www.scientific.net/amm.241-244.2246.

Full text
Abstract:
Multicore processors are increasingly used in real-time embedded systems. Better utilization of hard real-time systems requires accurate scheduling and synchronization analysis. In this paper, we characterize the major synchronization penalties arising from partitioned fixed priority scheduling for hard real-time tasks on multicore platform, including transitive remote preemption, multiple remote blocking, and multiple priority inversions. Subsequently, we propose a new response time analysis by improving the approach to bound task blocking time. The key idea of this approach is to classify the total blocking time into (i) direct blocking, including local and remote blocking, and transitive remote preemption; and (ii) multiple local interference which is incurred by multiple priority inversion. Simulation results indicate that the proposed approach produces less pessimistic results in task blocking time, and better schedulability performance.
APA, Harvard, Vancouver, ISO, and other styles
4

Yang, Xiuli, Yanhong Huang, Jianqi Shi, and Zongyu Cao. "A Performance Analysis Framework of Time-Triggered Ethernet Using Real-Time Calculus." Electronics 9, no. 7 (July 3, 2020): 1090. http://dx.doi.org/10.3390/electronics9071090.

Full text
Abstract:
With increasing demands of deterministic and real-time communication, network performance analysis is becoming an increasingly important research topic in safety-critical areas, such as aerospace, automotive electronics and so on. Time-triggered Ethernet (TTEthernet) is a novel hybrid network protocol based on the Ethernet standard; it is deterministic, synchronized and congestion-free. TTEthernet with a time-triggered mechanism meets the real-time and reliability requirements of safety-critical applications. Time-triggered (TT) messages perform strict periodic scheduling following the offline schedule tables. Different scheduling strategies have an effect on the performance of TTEthernet. In this paper, a performance analysis framework is designed to analyze the end-to-end delay, backlog bounds and resource utilization of network by real-time calculus. This method can be used as a base for the performance evaluation of TTEthernet scheduling. In addition, this study discusses the impacts of clock synchronization and traffic integration strategies on TT traffic in the network. Finally, a case study is presented to prove the feasibility of the performance analysis framework.
APA, Harvard, Vancouver, ISO, and other styles
5

Wu, Jian Lang, Jing Kai Shi, and Yi Bin Wang. "Analysis on Scheduling Algorithms of Real-Time Hybrid Tasks." Applied Mechanics and Materials 644-650 (September 2014): 2253–57. http://dx.doi.org/10.4028/www.scientific.net/amm.644-650.2253.

Full text
Abstract:
In real-time systems, periodic tasks and aperiodic tasks exist simultaneously. In a uniprocessor system, mainly there are Deferrable Server algorithm (DS) [1], Slack Stealing algorithm (SSA) [2] and their extended version for software/hardware hybrid real-time task scheduling. DS algorithm sets a high priority periodic task server to provide services for aperiodic tasks, while SSA algorithm computes tasks unoccupied time offline, and then schedule aperiodic tasks during the unoccupied period. The two algorithms are both proposed for soft real-time tasks, reducing the response time of the real-time tasks, but cannot guarantee that these aperiodic real-time tasks received can meet deadlines. In this paper, through combination of DS algorithm and EDF (Earliest Deadline First) algorithm [6], a new algorithm called DS-EDF is introduced, which can scheduling hard real-time aperiodic tasks on the DS server. This algorithm is not only suitable for uniprocessor systems, but also has the ability to extend to multiprocessor systems.
APA, Harvard, Vancouver, ISO, and other styles
6

Fengxiang Zhang and A. Burns. "Schedulability Analysis for Real-Time Systems with EDF Scheduling." IEEE Transactions on Computers 58, no. 9 (September 2009): 1250–58. http://dx.doi.org/10.1109/tc.2009.58.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Liu, Di, Nan Guan, Jelena Spasic, Gang Chen, Songran Liu, Todor Stefanov, and Wang Yi. "Scheduling Analysis of Imprecise Mixed-Criticality Real-Time Tasks." IEEE Transactions on Computers 67, no. 7 (July 1, 2018): 975–91. http://dx.doi.org/10.1109/tc.2018.2789879.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Pavlogiannis, Andreas, Nico Schaumberger, Ulrich Schmid, and Krishnendu Chatterjee. "Precedence-Aware Automated Competitive Analysis of Real-Time Scheduling." IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 39, no. 11 (November 2020): 3981–92. http://dx.doi.org/10.1109/tcad.2020.3012803.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Gezgin, Tayfun, Ingo Stierand, Stefan Henkler, and Achim Rettberg. "State-based scheduling analysis for distributed real-time systems." Design Automation for Embedded Systems 18, no. 1-2 (July 9, 2013): 1–18. http://dx.doi.org/10.1007/s10617-013-9112-7.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Zmaranda, Doina, Gianina Gabor, Daniela Elena Popescu, Codruta Vancea, and Florin Vancea. "Using Fixed Priority Pre-emptive Scheduling in Real-Time Systems." International Journal of Computers Communications & Control 6, no. 1 (March 1, 2011): 187. http://dx.doi.org/10.15837/ijccc.2011.1.2213.

Full text
Abstract:
For real-time applications, task scheduling is a problem of paramount importance. Several scheduling algorithms were proposed in the literature, starting from static scheduling or cyclic executives which provide very deterministic yet inflexible behaviour, to the so called best-effort scheduling, which facilitates maximum run-time flexibility but allows only probabilistic predictions of run-time performance presenting a non-predictable and nondeterministic solution. Between these two extremes lies fixed priority scheduling algorithms, such as Rate Monotonic, that is not so efficient for real-time purposes but exhibits a predictable approach because scheduling is doing offline and guarantees regarding process deadlines could be obtained using appropriate analysis methods. This paper investigates the use of Rate Monotonic algorithm by making adjustments in order to make it more suitable for real-time applications. The factors that motivate the interest for fixed priority scheduling algorithms such Rate Monotonic when doing with real-time systems lies in its associated analysis that could be oriented in two directions: schedulability analysis and analysis of process interactions. The analyzing process is carried out using a previously implemented framework that allows modelling, simulation and schedulability analysis for a set of real-time system tasks, and some of the results obtained are presented.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Real-time scheduling analysis"

1

Applegate, Clarence Bruce 1972. "A scheduling analysis tool for real-time systems." Thesis, Massachusetts Institute of Technology, 2000. http://hdl.handle.net/1721.1/81536.

Full text
Abstract:
Thesis (S.B. and M.Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2000.
Includes bibliographical references (leaves 63-65).
by Clarence Bruce Applegate.
S.B.and M.Eng.
APA, Harvard, Vancouver, ISO, and other styles
2

Bouakaz, Adnan. "Real-time scheduling of dataflow graphs." Phd thesis, Université Rennes 1, 2013. http://tel.archives-ouvertes.fr/tel-00945453.

Full text
Abstract:
The ever-increasing functional and nonfunctional requirements in real-time safety-critical embedded systems call for new design flows that solve the specification, validation, and synthesis problems. Ensuring key properties, such as functional determinism and temporal predictability, has been the main objective of many embedded system design models. Dataflow models of computation (such as KPN, SDF, CSDF, etc.) are widely used to model stream-based embedded systems due to their inherent functional determinism. Since the introduction of the (C)SDF model, a considerable effort has been made to solve the static-periodic scheduling problem. Ensuring boundedness and liveness is the essence of the proposed algorithms in addition to optimizing some nonfunctional performance metrics (e.g. buffer minimization, throughput maximization, etc.). However, nowadays real-time embedded systems are so complex that real-time operating systems are used to manage hardware resources and host real-time tasks. Most of real-time operating systems rely on priority-driven scheduling algorithms (e.g. RM, EDF, etc.) instead of static schedules which are inflexible and difficult to maintain. This thesis addresses the real-time scheduling problem of dataflow graph specifications; i.e. transformation of the dataflow specification to a set of independent real-time tasks w.r.t. a given priority-driven scheduling policy such that the following properties are satisfied: (1) channels are bounded and overflow/underflow-free; (2) the task set is schedulable on a given uniprocessor (or multiprocessor) architecture. This problem requires the synthesis of scheduling parameters (e.g. periods, priorities, processor allocation, etc.) and channel capacities. Furthermore, the thesis considers two performance optimization problems: buffer minimization and throughput maximization.
APA, Harvard, Vancouver, ISO, and other styles
3

Chadli, Mounir. "Analyse of real-time systems from scheduling perspective." Thesis, Rennes 1, 2018. http://www.theses.fr/2018REN1S062/document.

Full text
Abstract:
Les logiciels sont devenus une partie importante de notre vie quotidienne, car ils sont maintenant utilisés dans de nombreux périphériques hétérogènes, tels que nos téléphones, nos voitures, nos appareils ménagers, etc. Ces périphériques sont parsemés d’un certain nombre de logiciels intégrés, chacun gérant une tâche spécifique. Ces logiciels intégrés sont conçus pour fonctionner à l’intérieur de systèmes plus vastes avec un matériel varié et hétérogène et des ressources limitées. L'utilisation de logiciels embarqués est motivée par la flexibilité et la simplicité que ces logiciels peuvent garantir, ainsi que par la réduction des coûts. Les Cyber-Physical System (CPS) sont des logiciels utilisés pour contrôler des systèmes physiques. Les CPS sont souvent intégrés et s'exécutent en temps réel, ce qui signifie qu'ils doivent réagir aux événements externes. Un CPS complexe peut contenir de nombreux systèmes en temps réel. Le fait que ces systèmes puissent être utilisés dans des domaines critiques tels que la médecine ou les transports exige un haut niveau de sécurité pour ces systèmes. Les systèmes temps réel (RTS), par définition, sont des systèmes informatiques de traitement qui doivent répondre à des entrées générées de manière externe. Ils sont appelés temps réel car leur réponse doit respecter des contraintes de temps strictes. Par conséquent, l'exactitude de ces systèmes ne dépend pas seulement de l'exactitude des résultats de leur traitement, mais également du moment auquel ces résultats sont donnés. Le principal problème lié à l'utilisation de systèmes temps réel est la difficulté de vérifier leurs contraintes de synchronisation. Un moyen de vérifier les contraintes de temps peut consister à utiliser la théorie de la planification, stratégie utilisée pour partager les ressources système entre ses différents composants. Outre les contraintes de temps, il convient de prendre en compte d'autres contraintes, telles que la consommation d'énergie ou la sécurité. Plusieurs méthodes de vérification ont été utilisées au cours des dernières années, mais avec la complexité croissante des logiciels embarqués, ces méthodes atteignent leurs limites. C'est pourquoi les chercheurs se concentrent maintenant sur la recherche de nouvelles méthodes et de nouveaux formalismes capables de vérifier l'exactitude des systèmes les plus complexes. Aujourd'hui, une classe de méthodes de vérification bien utilisées est les techniques basées sur des modèles. Ces techniques décrivent le comportement du système considéré à l'aide de formalismes mathématiques, puis, à l'aide de méthodes appropriées, permettent d'évaluer l'efficacité du système par rapport à un ensemble de propriétés. Dans ce manuscrit, nous nous concentrons sur l'utilisation de techniques basées sur des modèles pour développer de nouvelles techniques de planification afin d'analyser et de valider la satisfiabilité d'un certain nombre de propriétés sur des systèmes temps réel. L'idée principale est d'exploiter la théorie de l'ordonnancement pour proposer ces nouvelles techniques. Pour ce faire, nous proposons un certain nombre de nouveaux modèles afin de vérifier la satisfiabilité d'un certain nombre de propriétés telles que l'ordonnancement, la consommation d'énergie ou la fuite d'informations
Software’s become an important part of our daily life as they are now used in many heterogeneous devices, such as our phones, our cars, our home appliances … etc. These devices are dotted with a number of embedded software’s, each handling a specific task. These embedded software’s are designed to run inside larger systems with various and heterogeneous hardware and limited resources. The use of embedded software is motivated by the flexibility and the simplicity that these software can guarantee, and to minimize the cost. Cyber-Physical System (CPS) are software used to control physical systems. CPS are often embedded and run in real-time, which means that they must react to external events. A complex CPS can contains many real-time systems. The fact that these systems can be used in critical domains like medicine or transport requires a high level of safety for these systems. Real-Time Systems (RTS) by definition are processing information systems that have to respond to externally generated inputs, and they are called real-time because their response must respect a strict timing constraints. Therefore, the correctness of these systems does not depend only on the correctness of their treatment results, but it also depends on the timings at which these results are given. The main problem with using real-time systems is the difficulty to verify their timing constraints. A way to verify timing constraints can be to use Scheduling theory which is a strategy used in order to share the system resources between its different components. In addition to the timing constraints, other constraints should be taken in consideration, like energy consumption or security. Several verification methods have been used in the last years, but with the increasing complexity of the embedded software these methods reach their limitation. That is why researchers are now focusing their works on finding new methods and formalisms capable of verifying the correctness of the most complex systems. Today, a well-used class of verification methods are model-based techniques. These techniques describe the behavior of the system under consideration using mathematical formalisms, then using appropriate methods they give the possibility to evaluate the correctness of the system with respect to a set of properties. In this manuscript we focus on using model-based techniques to develop new scheduling techniques in order to analyze and validate the satisfiability of a number of properties on real-time systems. The main idea is to exploit scheduling theory to propose these new techniques. To do that, we propose a number of new models in order to verify the satisfiability of a number of properties as schedulability, energy consumption or information leakage
APA, Harvard, Vancouver, ISO, and other styles
4

Rodziewicz, Pawel. "Timing and scheduling analysis of real-time object-oriented models." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1998. http://www.collectionscanada.ca/obj/s4/f2/dsk2/ftp01/MQ39491.pdf.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Bate, Iain John. "Scheduling and timing analysis for safety critical real-time systems." Thesis, University of York, 1999. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.286151.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Koo, Ja-Ryeong. "Global scheduling on temperature-constrained multiprocessor real-time systems." Texas A&M University, 2008. http://hdl.handle.net/1969.1/85913.

Full text
Abstract:
In this thesis, we study temperature-constrained multiprocessor real-time systems, where real-time guarantees must be met without exceeding safe temperature levels within the processors. We focus on Pfair scheduling algorithms, especially ERfair scheduling scheme (a work-conserving extension to Pfair scheduling) as our main multiprocessor real-time scheduling methodology. Then, we study the benefits of simple reactive speed scaling as described in the real-time multiprocessor systems. In this thesis, in support of the temperature-awareness, we extend the applicability of the reactive speed scaling to global scheduling schemes for multiprocessors. We propose temperature-aware scheduling and processor selection schemes motivated by existing (thermally non-optimal) ERfair scheduling in order to reduce thermal stress and therefore increase the processor utilization. Then, we show that the proposed algorithm and reactive scheme can enhance the processor utilization compared with any constant speed scheme on real-time multiprocessor systems. Additionally, we show how the maximum schedulable utilization (MSU) for partitioning heuristics can be determined on the temperature-constrained multiprocessor real-time systems.
APA, Harvard, Vancouver, ISO, and other styles
7

Coleman, Benjamin J. "Lookahead scheduling in a real-time context: Models, algorithms, and analysis." W&M ScholarWorks, 2004. https://scholarworks.wm.edu/etd/1539623445.

Full text
Abstract:
Our research considers job scheduling, a special type of resource assignment problem. For example, at a cross-docking facility trucks must be assigned to doors where they will be unloaded. The cargo on each truck has various destinations within the facility, and the unloading time for a truck is dependent on the distance from the assigned door to these destinations. The goal is to assign the trucks to doors while minimizing the amount of time to unload all trucks.;We study scheduling algorithms for problems like the cross-docking example that are different from traditional algorithms in two ways. First, we utilize real-time, where the algorithm executes at the same time as when the jobs are handled. Because the time used by the algorithm to make decisions cannot be used to complete a job, these decisions must be made quickly Second, our algorithms utilize lookahead, or partial knowledge of jobs that will arrive in the future.;The three goals of this research were to demonstrate that lookahead algorithms can be implemented effectively in a real-time context, to measure the amount of improvement gained by utilizing lookahead, and to explore the conditions in which lookahead is beneficial.;We present a model suitable for representing problems that include lookahead in a real-time context. Using this model, we develop lookahead algorithms for two important job scheduling systems and argue that these algorithms make decisions efficiently. We then study the performance of lookahead algorithms using mathematical analysis and simulation.;Our results provide a detailed picture of the behavior of lookahead algorithms in a real-time context. Our analytical study shows that lookahead algorithms produce schedules that are significantly better than those without lookahead. We also found that utilizing Lookahead-1, or knowledge of the next arriving job, produces substantial improvement while requiring the least effort to design. When more lookahead information is used, the solutions are better, but the amount of improvement is not significantly larger than a Lookahead-1 algorithm. Further, algorithms utilizing more lookahead are more complex to design, implement, and analyze. We conclude that Lookahead-1 algorithms are the best balance between improvement and design effort.
APA, Harvard, Vancouver, ISO, and other styles
8

Wang, Jinggang. "Soft Real-Time Switched Ethernet: Best-Effort Packet Scheduling Algorithm, Implementation, and Feasibility Analysis." Thesis, Virginia Tech, 2002. http://hdl.handle.net/10919/35277.

Full text
Abstract:
In this thesis, we present a MAC-layer packet scheduling algorithm, called Best-effort Packet Scheduling Algorithm(BPA), for real-time switched Ethernet networks. BPA considers a message model where application messages have trans-node timeliness requirements that are specified using Jensen's benefit functions. The algorithm seeks to maximize aggregate message benefit by allowing message packets to inherit benefit functions of their parent messages and scheduling packets to maximize aggregate packet-level benefit. Since the packet scheduling problem is NP-hard, BPA heuristically computes schedules with a worst-case cost of O(n^2), faster than the O(n^3) cost of the best known Chen and Muhlethaler's Algorithm(CMA) for the same problem. Our simulation studies show that BPA performs the same or significantly better than CMA. We also construct a real-time switched Ethernet by prototyping an Ethernet switch using a Personal Computer(PC) and implementing BPA in the network protocol stack of the Linux kernel for packet scheduling. Our actual performance measurements of BPA using the network implementation reveal the effectiveness of the algorithm. Finally, we derive timeliness feasibility conditions of real-time switched Ethernet systems that use the BPA algorithm. The feasibility conditions allow real-time distributed systems to be constructed using BPA, with guaranteed soft timeliness.
Master of Science
APA, Harvard, Vancouver, ISO, and other styles
9

Stigge, Martin. "Real-Time Workload Models : Expressiveness vs. Analysis Efficiency." Doctoral thesis, Uppsala universitet, Avdelningen för datorteknik, 2014. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-219307.

Full text
Abstract:
The requirements for real-time systems in safety-critical applications typically contain strict timing constraints. The design of such a system must be subject to extensive validation to guarantee that critical timing constraints will never be violated while the system operates. A mathematically rigorous technique to do so is to perform a schedulability analysis for formally verifying models of the computational workload. Different workload models allow to describe task activations at different levels of expressiveness, ranging from traditional periodic models to sophisticated graph-based ones. An inherent conflict arises between the expressiveness and analysis efficiency of task models. The more expressive a task model is, the more accurately it can describe a system design, reducing over-approximations and thus minimizing wasteful over-provisioning of system resources. However, more expressiveness implies higher computational complexity of corresponding analysis methods. Consequently, an ideal model provides the highest possible expressiveness for which efficient exact analysis methods exist. This thesis investigates the trade-off between expressiveness and analysis efficiency. A new digraph-based task model is introduced, which generalizes all previously proposed models that can be analyzed in pseudo-polynomial time without using any analysis-specific over-approximations. We develop methods allowing to efficiently analyze variants of the model despite their strictly increased expressiveness. A key contribution is the notion of path abstraction which enables efficient graph traversal algorithms. We demonstrate tractability borderlines for different classes of schedulers, namely static priority and earliest-deadline first schedulers, by establishing hardness results. These hardness proofs provide insights about the inherent complexity of developing efficient analysis methods and indicate fundamental difficulties of the considered schedulability problems. Finally, we develop a novel abstraction refinement scheme to cope with combinatorial explosion and apply it to schedulability and response-time analysis problems. All methods presented in this thesis are extensively evaluated, demonstrating practical applicability.
APA, Harvard, Vancouver, ISO, and other styles
10

Zuhily, Areej. "Scheduling analysis of fixed priority hard real-time systems with multiframe tasks." Thesis, University of York, 2009. http://etheses.whiterose.ac.uk/11090/.

Full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "Real-time scheduling analysis"

1

Real-time systems: Scheduling, analysis, and verification. Hoboken, NJ: Wiley-Interscience, 2002.

Find full text
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Real-time scheduling analysis"

1

Ekberg, Pontus, and Wang Yi. "Complexity of Uniprocessor Scheduling Analysis." In Handbook of Real-Time Computing, 1–18. Singapore: Springer Singapore, 2019. http://dx.doi.org/10.1007/978-981-4585-87-3_35-1.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Bloom, Gedare, Joel Sherrill, Tingting Hu, and Ivan Cibrario Bertolotti. "Scheduling Analysis and Interrupt Handling." In Real-Time Systems Development with RTEMS and Multicore Processors, 69–100. First edition. | [Boca Raton : CRC Press, 2020] | Series: Embedded systems: CRC Press, 2020. http://dx.doi.org/10.1201/9781351255790-4.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Moreira, Orlando, and Henk Corporaal. "Temporal Analysis." In Scheduling Real-Time Streaming Applications onto an Embedded Multiprocessor, 53–75. Cham: Springer International Publishing, 2013. http://dx.doi.org/10.1007/978-3-319-01246-9_4.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Sha, Lui, Mark H. Klein, and John B. Goodenough. "Rate Monotonic Analysis for Real-Time Systems." In Foundations of Real-Time Computing: Scheduling and Resource Management, 129–55. Boston, MA: Springer US, 1991. http://dx.doi.org/10.1007/978-1-4615-3956-8_5.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Macariu, Georgiana, and Vladimir Creţu. "Model-Based Analysis of Contract-Based Real-Time Scheduling." In Software Technologies for Embedded and Ubiquitous Systems, 227–39. Berlin, Heidelberg: Springer Berlin Heidelberg, 2009. http://dx.doi.org/10.1007/978-3-642-10265-3_21.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Pop, Paul, Petru Eles, and Zebo Peng. "Scheduling and Bus Access Optimization for Time-Driven Systems." In Analysis and Synthesis of Distributed Real-Time Embedded Systems, 65–91. Boston, MA: Springer US, 2004. http://dx.doi.org/10.1007/978-1-4020-2873-1_4.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Kurose, J. F., Don Towsley, and C. M. Krishna. "Design and Analysis of Processor Scheduling Policies for Real-Time Systems." In Foundations of Real-Time Computing: Scheduling and Resource Management, 63–89. Boston, MA: Springer US, 1991. http://dx.doi.org/10.1007/978-1-4615-3956-8_3.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Leulseged, Amare, and Nimal Nissanke. "Probabilistic Analysis of Multi-processor Scheduling of Tasks with Uncertain Parameters." In Real-Time and Embedded Computing Systems and Applications, 103–22. Berlin, Heidelberg: Springer Berlin Heidelberg, 2004. http://dx.doi.org/10.1007/978-3-540-24686-2_7.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Qamhieh, Manar, and Serge Midonnet. "Experimental Analysis of the Tardiness of Parallel Tasks in Soft Real-Time Systems." In Job Scheduling Strategies for Parallel Processing, 36–52. Cham: Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-15789-4_3.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Donga, Jayna, and M. S. Holia. "An Analysis of Scheduling Algorithms in Real-Time Operating System." In Inventive Computation Technologies, 374–81. Cham: Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-33846-6_42.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Real-time scheduling analysis"

1

Cirinei, Michele, and Theodore P. Baker. "EDZL Scheduling Analysis." In 19th Euromicro Conference on Real-Time Systems (ECRTS'07). IEEE, 2007. http://dx.doi.org/10.1109/ecrts.2007.14.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Baruah, Sanjoy, and Alan Burns. "Sustainable Scheduling Analysis." In 2006 27th IEEE International Real-Time Systems Symposium (RTSS'06). IEEE, 2006. http://dx.doi.org/10.1109/rtss.2006.47.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Nikolic, Borislav, and Konstantinos Bletsas. "Towards Realistic Core-Failure-Resilient Scheduling and Analysis." In 2015 IEEE Real-Time Systems Symposium (RTSS). IEEE, 2015. http://dx.doi.org/10.1109/rtss.2015.47.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Nasri, Mitra, and Bjorn B. Brandenburg. "An Exact and Sustainable Analysis of Non-preemptive Scheduling." In 2017 IEEE Real-Time Systems Symposium (RTSS). IEEE, 2017. http://dx.doi.org/10.1109/rtss.2017.00009.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Devadas, Vinay, Fei Li, and Hakan Aydin. "Competitive Analysis of Energy-Constrained Real-Time Scheduling." In 2009 21st Euromicro Conference on Real-Time Systems (ECRTS). IEEE, 2009. http://dx.doi.org/10.1109/ecrts.2009.12.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Many, Florian, and David Doose. "Scheduling Analysis under Fault Bursts." In 2011 IEEE Real-Time and Embedded Technology and Applications Symposium (RTAS). IEEE, 2011. http://dx.doi.org/10.1109/rtas.2011.19.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Zhang, Fengxiang, and Alan Burns. "Analysis of Hierarchical EDF Pre-emptive Scheduling." In 28th IEEE International Real-Time Systems Symposium (RTSS 2007). IEEE, 2007. http://dx.doi.org/10.1109/rtss.2007.12.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Han, Song, Deji Chen, Ming Xiong, and Aloysius K. Mok. "A Schedulability Analysis of Deferrable Scheduling Using Patterns." In 2008 20th Euromicro Conference on Real-Time Systems (ECRTS). IEEE, 2008. http://dx.doi.org/10.1109/ecrts.2008.8.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Fortier and Murphy. "Simulation analysis of real-time task scheduling." In Proceedings of the Twenty-Seventh Annual Hawaii International Conference on System Sciences. IEEE Comput. Soc. Press, 1994. http://dx.doi.org/10.1109/hicss.1994.323227.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Selim, Arwa Z., Noha E. El-Attar, M. E. Ghoneim, and Wael A. Awad. "Performance Analysis of Real-Time Scheduling Algorithms." In ICICSE '20: 2020 International Conference on Internet Computing for Science and Engineering. New York, NY, USA: ACM, 2020. http://dx.doi.org/10.1145/3424311.3424317.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Real-time scheduling analysis' for particular source types:
Journal articles Dissertations / Theses
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography