Bibliographies thématiques / REAL-TIME TASKS

Littérature scientifique sur le sujet « REAL-TIME TASKS »

Auteur : Grafiati
Publié le 11 septembre 2023

Créez une référence correcte selon les styles APA, MLA, Chicago, Harvard et plusieurs autres

Choisissez une source :

Sommaire

Consultez les listes thématiques d’articles de revues, de livres, de thèses, de rapports de conférences et d’autres sources académiques sur le sujet « REAL-TIME TASKS ».

À côté de chaque source dans la liste de références il y a un bouton « Ajouter à la bibliographie ». Cliquez sur ce bouton, et nous générerons automatiquement la référence bibliographique pour la source choisie selon votre style de citation préféré : APA, MLA, Harvard, Vancouver, Chicago, etc.

Vous pouvez aussi télécharger le texte intégral de la publication scolaire au format pdf et consulter son résumé en ligne lorsque ces informations sont inclues dans les métadonnées.

Articles de revues sur le sujet "REAL-TIME TASKS"

1

Udvanshi, Pankaj. « Scheduling of Real Time Tasks ». IOSR Journal of Engineering 03, no 6 (juin 2013) : 44–58. http://dx.doi.org/10.9790/3021-03624458.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
2

Pandey, Ankush. « A Real Time Approach to Compute Distance between Objects for Automated Tasks ». Journal of Advanced Research in Dynamical and Control Systems 12, SP8 (30 juillet 2020) : 968–83. http://dx.doi.org/10.5373/jardcs/v12sp8/20202602.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
3

Oh, Y., et S. H. Son. « Scheduling Real-Time Tasks for Dependability ». Journal of the Operational Research Society 48, no 6 (juin 1997) : 629. http://dx.doi.org/10.2307/3010227.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
4

Shin, Kang G., Tein-Hsiang Lin et Yann-Hang Lee. « Optimal Checkpointing of Real-Time Tasks ». IEEE Transactions on Computers C-36, no 11 (novembre 1987) : 1328–41. http://dx.doi.org/10.1109/tc.1987.5009472.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
5

Behrouzian, Amir, Hadi Alizadeh Ara, Marc Geilen, Dip Goswami et Twan Basten. « Firmness Analysis of Real-time Tasks ». ACM Transactions on Embedded Computing Systems 19, no 4 (16 juillet 2020) : 1–24. http://dx.doi.org/10.1145/3398328.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
6

Oh, Y., et S. H. Son. « Scheduling real-time tasks for dependability ». Journal of the Operational Research Society 48, no 6 (juin 1997) : 629–39. http://dx.doi.org/10.1057/palgrave.jors.2600413.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
7

Oh, Y., et S. H. Son. « Scheduling real-time tasks for dependability ». Journal of the Operational Research Society 48, no 6 (1997) : 629–39. http://dx.doi.org/10.1038/sj.jors.2600413.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
8

Moron, Celio Estevan, et Hussein Zedan. « On guaranteeing hard real-time tasks ». Microprocessing and Microprogramming 38, no 1-5 (septembre 1993) : 485–90. http://dx.doi.org/10.1016/0165-6074(93)90185-n.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
9

Schwan, K., et H. Zhou. « Dynamic scheduling of hard real-time tasks and real-time threads ». IEEE Transactions on Software Engineering 18, no 8 (1992) : 736–48. http://dx.doi.org/10.1109/32.153383.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
10

Зинченко, Сергей Валериевич, et Валерий Петрович Зинченко. « THE SCHEDULING TASKS IN REAL-TIME SYSTEMS ». Information systems, mechanics and control, no 17 (29 décembre 2017) : 113–23. http://dx.doi.org/10.20535/2219-3804172017123927.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
Plus de sources

Thèses sur le sujet "REAL-TIME TASKS"

1

Singh, Abhishek Jeffay Kevin. « Co-scheduling real-time tasks and non real-time tasks using empirical probability distribution of execution time requirements ». Chapel Hill, N.C. : University of North Carolina at Chapel Hill, 2009. http://dc.lib.unc.edu/u?/etd,2724.

Texte intégral
Résumé :
Thesis (Ph. D.)--University of North Carolina at Chapel Hill, 2009.
Title from electronic title page (viewed Mar. 10, 2010). "... in partial fulfillment of the requirements for the degree of Doctor of Philosophy in the Department of Computer Science." Discipline: Computer Science; Department/School: Computer Science.
Styles APA, Harvard, Vancouver, ISO, etc.
2

Zhu, Wenjing. « Adaptive threshhold-based scheduling for real-time and non-real-time tasks ». Thesis, University of British Columbia, 1991. http://hdl.handle.net/2429/29913.

Texte intégral
Résumé :
This thesis documents our study on scheduling mixed real-time and non-real-time tasks with different performance metrics. The work is motivated by the need to provide satisfactory performance trade-offs in a dynamic environment where the arrival rates and proportions of the real-time and non-real-time tasks vary with time. We first examine two threshold-based schemes, Queue Length Threshold and Minimum Laxity Threshold, and propose the corresponding adaptive schemes based on our results from approximate analysis and simulation. The idea is to improve performance by adjusting trade-off points adaptively as the arrival rates change. We further discuss the idea of integrating the two thresholds. The new algorithm, ADP, is evaluated by simulation under various load conditions and compared with other common scheduling disciplines as well as an optimal algorithm. Some implementation issues are also discussed. We conclude that by setting appropriate threshold functions in accordance to the requirements of applications, we can achieve satisfactory bounded loss ratio for real-time tasks and acceptably low average delay for non-real-time tasks in a wide range of workload conditions.
Science, Faculty of
Computer Science, Department of
Graduate
Styles APA, Harvard, Vancouver, ISO, etc.
3

DI, FRISCHIA STEFANO. « Real-Time Algorithms for Spectral Classification Tasks ». Doctoral thesis, Università degli Studi dell'Aquila, 2021. http://hdl.handle.net/11697/177860.

Texte intégral
Résumé :
The present PhD thesis covers a research about real-time spectral classification exploiting machine learning tools and in particular deep learning with neural networks. Spectroscopy is the study of the interaction between matter and electromagnetic radiation. In particular, we focused on Raman spectroscopy because it allows a chemical compound identification that has many fields of application. Our approach to solve spectral classification is a combination of signal processing methods and machine learning tools. First, it has been analysed the most important spectrum feature that could affect classification accuracy: signal-to-noise ratio. Since the level of noise must be reduced both at acquisition time and at processing time, an investigation of the noise sources in a CCD device has been carried on in order to identify the main parameters that concur to generate noise. Once that the best acquisition strategy has been demonstrated, we focused on a Cultural Heritage case of study about pigment spectra classification, exploiting machine learning tools to overcome the problem of a limited reference database. A hierarchical pipeline of signal processing methods has been designed to implement the necessary Data Augmentation. In addition, these methods have been enhanced with the use of Generative Adversarial Networks (GANs). Once that an augmented dataset has been generated, we tested it on 3 different neural network architectures, finding that the Convolutional Neural Networks (CNN) with GAN enhancement is the best approach for classification. The implemented technique of the present thesis is potentially applicable in every spectroscopic analysis that lacks a sufficient number of training reference examples.
Styles APA, Harvard, Vancouver, ISO, etc.
4

Nemati, Farhang. « Partitioned Scheduling of Real-Time Tasks on Multi-core Platforms ». Licentiate thesis, Mälardalen University, School of Innovation, Design and Engineering, 2010. http://urn.kb.se/resolve?urn=urn:nbn:se:mdh:diva-9595.

Texte intégral
Résumé :

In recent years multiprocessor architectures have become mainstream, and multi-core processors are found in products ranging from small portable cell phones to large computer servers. In parallel, research on real-time systems has mainly focused on traditional single-core processors. Hence, in order for real-time systems to fully leverage on the extra capacity offered by new multi-core processors, new design techniques, scheduling approaches, and real-time analysis methods have to be developed.

In the multi-core and multiprocessor domain there are mainly two scheduling approaches, global and partitioned scheduling. Under global scheduling each task can execute on any processor at any time while under partitioned scheduling tasks are statically allocated to processors and migration of tasks among processors is not allowed. Besides simplicity and efficiency of partitioned scheduling protocols, existing scheduling and synchronization methods developed for single-core processor platforms can more easily be extended to partitioned scheduling. This also simplifies migration of existing systems to multi-cores. An important issue related to partitioned scheduling is distribution of tasks among processors which is a bin-packing problem.

In this thesis we propose a partitioning framework for distributing tasks on the processors of multi-core platforms. Depending on the type of performance we desire to achieve, the framework may distribute a task set differently, e.g., in an application in which tasks process huge amounts of data the goal of the framework may be to decrease cache misses.Furthermore, we propose a blocking-aware partitioning heuristic algorithm to distribute tasks onto the processors of a multi-core architecture. The objective of the proposed algorithm is to decrease blocking overhead of tasks which reduces the total utilization and has the potential to reduce the number of required processors.Finally, we have implemented a tool to facilitate evaluation and comparison of different multiprocessor scheduling and synchronization approaches, as well as different partitioning heuristics. We have applied the tool in the evaluation of several partitioning heuristic algorithms, and the tool is flexible to which any new scheduling or synchronization protocol as well as any new partitioning heuristic can easily be added.

Styles APA, Harvard, Vancouver, ISO, etc.
5

Chang, Tzu-Chiang. « Static scheduler for hard real-time tasks on multiprocessor systems ». Thesis, Monterey, California. Naval Postgraduate School, 1992. http://hdl.handle.net/10945/24043.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
6

Han, Kai. « Scheduling Distributed Real-Time Tasks in Unreliable and Untrustworthy Systems ». Diss., Virginia Tech, 2010. http://hdl.handle.net/10919/26917.

Texte intégral
Résumé :
In this dissertation, we consider scheduling distributed soft real-time tasks in unreliable (e.g., those with arbitrary node and network failures) and untrustworthy systems (e.g., those with Byzantine node behaviors). We present a distributed real-time scheduling algorithm called Gamma. Gamma considers a distributed (i.e., multi-node) task model where tasks are subject to Time/Utility Function (or TUF) end-to-end time constraints, and the scheduling optimality criterion of maximizing the total accrued utility. The algorithm makes three novel contributions. First, Gamma uses gossip for reliably propagating task scheduling parameters and for discovering task execution nodes. Second, Gamma achieves distributed real-time mutual exclusion in unreliable environments. Third, the algorithm guards against potential disruption of message propagation due to Byzantine attacks using a mechanism called Launcher-Attacker-Infective-Susceptible-Immunized-Removed-Consumer (or LAISIRC). By doing so, the algorithm schedules tasks with probabilistic termination-time satisfactions, despite system unreliability and untrustworthiness. We analytically establish several timeliness and non-timeliness properties of the algorithm including probabilistic end-to-end task termination time satisfactions, optimality of message overheads, mutual exclusion guarantees, and the mathematical model of the LAISIRC mechanism. We conducted simulation-based experimental studies and compared Gamma with its competitors. Our experimental studies reveal that Gammaâ s scheduling algorithm accrues greater utility and satisfies a greater number of deadlines than do competitor algorithms (e.g., HVDF) by as much as 47% and 45%, respectively. LAISIRC is more tolerant to Byzantine attacks than competitor protocols (e.g., Path Verification) by obtaining as much as 28% higher correctness ratio. Gammaâ s mutual exclusion algorithm accrues greater utility than do competitor algorithms (e.g., EDF-Sigma) by as much as 25%. Further, we implemented the basic Gamma algorithm in the Emulab/ChronOS 250-node testbed, and measured the algorithmâ s performance. Our implementation measurements validate our theoretical analysis and the algorithm's effectiveness and robustness.
Ph. D.
Styles APA, Harvard, Vancouver, ISO, etc.
7

Qamhieh, Manar. « Scheduling of parallel real-time DAG tasks on multiprocessor systems ». Thesis, Paris Est, 2015. http://www.theses.fr/2015PEST1030/document.

Texte intégral
Résumé :
Les applications temps réel durs sont celles qui doivent exécuter en respectant des contraintes temporelles. L'ordonnancement temps réel a bien été étudié sur mono-processeurs depuis plusieurs années. Récemment, l'utilisation d'architectures multiprocesseurs a augmenté dans les applications industrielles et des architectures parallèles sont proposées pour que le logiciel devienne compatible avec ces plateformes. L'ordonnancement multiprocesseurs de tâches parallèles dépendantes n'est pas une simple généralisation du cas mono-processeur et la problématique d'ordonnancement devient plus complexe et difficile. Dans cette thèse, nous étudions le problème d'ordonnancement temps réel de graphes de tâches parallèles acycliques sur des plateformes multiprocesseurs. Dans ce modèle, un graphe est composé d'un ensemble de sous-tâches dépendantes sous contraintes de précédence qui expriment les relations de précédences entre les sous-tâches. L'ordre d'exécution des sous-tâches est dynamique, c'est-à-dire que les sous-tâches peuvent s'exécuter en parallèle ou séquentiellement par rapport aux décisions de l'ordonnanceur temps réel. Pour traiter les contraintes de précédence, nous proposons deux méthodes pour l'ordonnancement des graphes : par transformation du modèle de graphe de sous tâches parallèles en un modèle de tâches séquentielles indépendantes, plus simple à ordonnancer et par ordonnancement direct des graphes en prenant en compte les relations de dépendance entre les sous-tâches. Nous proposons un ordonnancement des graphes en prenant directement en compte les paramètres temporels des graphes et un ordonnancement au niveau des sous-tâches, par rapport à des paramètres temporels attribués aux sous-tâches par un algorithme spécifique. Enfin, nous prouvons que les deux méthodes d'ordonnancement de graphes ne sont pas comparables. Nous fournissons alors des résultats de simulation pour comparer ces méthodes en utilisant les algorithmes d'ordonnancement globaux EDF et DM. Nous avons développé un logiciel nommé YARTISS pour générer des graphes aléatoires et réaliser les simulations
The interest for multiprocessor systems has recently been increased in industrial applications, and parallel programming API's have been introduced to benefit from new processing capabilities. The use of multiprocessors for real-time systems, whose execution is performed based on certain temporal constraints is now investigated by the industry. Real-time scheduling problem becomes more complex and challenging in that context. In multiprocessor systems, a hard real-time scheduler is responsible for allocating ready jobs to available processors of the systems while respecting their timing parameters. In this thesis, we study the problem of real-time scheduling of parallel Directed Acyclic Graph (DAG) tasks on homogeneous multiprocessor systems. In this model, a DAG task consists of a set of subtasks that execute under precedence constraints. At all times, the real-time scheduler is responsible for determining how subtasks execute, either sequentially or in parallel, based on the available processors of the system. We propose two DAG scheduling approaches to determine the execution form of DAG tasks. The first approach is the DAG Stretching algorithm, from the Model Transformation approach, which forces DAG tasks to execute as sequentially as possible. The second approach is the Direct Scheduling, which aims at scheduling DAG tasks while respecting their internal dependencies. We provide real-time schedulability analyses for Direct Scheduling at DAG-Level and at Subtask-Level. Due to the incomparability of DAG scheduling approaches, we use extensive simulations to compare performance of global EDF with global DM scheduling using our simulation tool YARTISS
Styles APA, Harvard, Vancouver, ISO, etc.
8

Haugli, Fredrik Bakkevig. « Using online worst-case execution time analysis and alternative tasks in real time systems ». Thesis, Norges teknisk-naturvitenskapelige universitet, Institutt for teknisk kybernetikk, 2014. http://urn.kb.se/resolve?urn=urn:nbn:no:ntnu:diva-26100.

Texte intégral
Résumé :
As embedded hardware becomes more powerful, it allows for more complex realtime systems running tasks with highly dynamic execution times. This dynamicitymakes the already formidable task of producing accurate WCET analysis evenmore di?cult. Since the variation in execution time depends on task input andthe state of the system, it is postulated that a more accurate estimate for theWCET can be found online with knowledge about the task parameters.This thesis will explore the concept of online execution time analysis and itspotential utilization. Line detection in images through Hough line transform isfound to be a relevant application whose execution time can be estimated bythe contrast of the input image. A system for scheduling tasks utilizing theironline WCET estimate is then discussed. It dynamically checks for potentialdeadline misses and degrades tasks, either by running a more e?cient alternativetask instead or by aborting the task, until timely execution is guaranteed. Anexperiment is presented, demonstrating a higher throughput of tasks with onlineWCET estimation. Finally, the work on a framework for more precise simulationsand experiments is presented.
Styles APA, Harvard, Vancouver, ISO, etc.
9

Huang, Chiao Ching Baskiyar Sanjeev. « Minimum power consumption for rate monotonic tasks ». Auburn, Ala, 2008. http://repo.lib.auburn.edu/EtdRoot/2008/FALL/Computer_Science_and_Software_Engineering/Thesis/Huang_Chiao_10.pdf.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
10

Rafiq, Salman. « Measuring Performance of Soft Real-Time Tasks on Multi-core Systems ». Thesis, KTH, Skolan för informations- och kommunikationsteknik (ICT), 2011. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-37219.

Texte intégral
Résumé :
Multi-core platforms are well established, and they are slowly moving into the area of embedded and real-time systems. Nowadays to take advantage of multi-core systems in terms of throughput, soft real-time applications are run together with general purpose applications under an operating system such as Linux. But due to shared hardware resources in multi-core architectures, it is likely that these applications will interfere and compete with each other. This can cause slower response times for soft real-time tasks. In order to investigate this problem, a number of memory intensive and computation intensive soft real-time tasks were co-scheduled with Linux SMP running a general purpose task on it. For performance measurement a test environment is created that uses hardware registers to count core, level-2 cache and memory bus events at run-time instead of having a simulator tool. In particular events related to L1 and L2 instruction and data cache, memory bus utilization and difference in response times of soft real-time tasks are measured. After completing this research, we can say that it is only possible for soft real-time applications to co-exist with Linux SMP cores running general purpose applications without major performance degradation, if the task on Linux is not much memory intensive. If it is memory intensive then there is a trade-off between number of cores running general purpose applications and the amount of tolerance an embedded system can have in response times.
Styles APA, Harvard, Vancouver, ISO, etc.
Plus de sources

Livres sur le sujet "REAL-TIME TASKS"

1

Andre, Goforth, et Ames Research Center, dir. Real-time design with peer tasks. Moffett Field, Calif : National Aeronautics and Space Administration, Ames Research Center, 1995.

Trouver le texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
2

Andre, Goforth, et Ames Research Center, dir. Real-time design with peer tasks. Moffett Field, Calif : National Aeronautics and Space Administration, Ames Research Center, 1995.

Trouver le texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
3

Andre, Goforth, et Ames Research Center, dir. Real-time design with peer tasks. Moffett Field, Calif : National Aeronautics and Space Administration, Ames Research Center, 1995.

Trouver le texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
4

Andre, Goforth, et Ames Research Center, dir. Real-time design with peer tasks. Moffett Field, Calif : National Aeronautics and Space Administration, Ames Research Center, 1995.

Trouver le texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
5

Chang, Tzu-Chiang. Static scheduler for hard real-time tasks on multiprocessor systems. Monterey, Calif : Naval Postgraduate School, 1992.

Trouver le texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
6

Hergenröder, Gerhard. ALLOC : Ein wissensbasierter Ansatz zur Lösung des Allokationsproblems von Tasks in verteilten Realzeitsystemen. Erlangen : Regionales Rechenzentrum Erlangen, 1989.

Trouver le texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
7

United States. National Aeronautics and Space Administration., dir. Research in distributed real-time systems : Summary report (1996-97) for the period ending July, 1997 ... under grant NAG1 -1114. Norfolk, Va : Dept. of Aerospace Engineering, College of Engineering & Technology, Old Dominion University, 1997.

Trouver le texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
8

Shukla, Shridhar B. Real-time execution control of task-level data-flow graphs using a compile-time approach. Monterey, Calif : Naval Postgraduate School, 1992.

Trouver le texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
9

Guha, Krishnendu, Sangeet Saha et Amlan Chakrabarti. Self Aware Security for Real Time Task Schedules in Reconfigurable Hardware Platforms. Cham : Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-79701-0.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
10

Thoen, Filip, et Francky Catthoor, dir. Modeling, Verification and Exploration of Task-Level Concurrency in Real-Time Embedded Systems. Boston, MA : Springer US, 2000. http://dx.doi.org/10.1007/978-1-4615-4437-1.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
Plus de sources

Chapitres de livres sur le sujet "REAL-TIME TASKS"

1

Christmann, Dennis, et Reinhard Gotzhein. « Real-Time Tasks in SDL ». Dans System Analysis and Modeling : Theory and Practice, 53–71. Berlin, Heidelberg : Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-36757-1_4.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
2

Cardeira, Carlos B., Z. Mammeri, F. Simonot et J. P. Thomesse. « Scheduling Tasks and Traffic in Fieldbus Based Real-Time Systems ». Dans Real Time Computing, 673. Berlin, Heidelberg : Springer Berlin Heidelberg, 1994. http://dx.doi.org/10.1007/978-3-642-88049-0_98.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
3

ul Hassan, Umair, et Edward Curry. « Human-in-the-Loop Tasks for Data Management, Citizen Sensing, and Actuation in Smart Environments ». Dans Real-time Linked Dataspaces, 139–58. Cham : Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-29665-0_9.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
4

Gharsellaoui, Hamza, et Samir Ben Ahmed. « Real-Time Reconfigurable Scheduling of Sporadic Tasks ». Dans Communications in Computer and Information Science, 24–39. Berlin, Heidelberg : Springer Berlin Heidelberg, 2014. http://dx.doi.org/10.1007/978-3-662-45943-0_2.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
5

Janarthanan, Vasudevan. « Designing Schedulers for Hard Real-Time Tasks ». Dans Advances in Intelligent Systems and Computing, 1125–34. Cham : Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-32467-8_97.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
6

Park, Ho-Joon, et Chang-Hoon Lee. « An Efficient Real-Time Middleware Scheduling Algorithm for Periodic Real-Time Tasks ». Dans Lecture Notes in Computer Science, 304–12. Berlin, Heidelberg : Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/978-3-540-30583-5_33.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
7

Gen, Mitsuo, et Myungryun Yoo. « Real Time Tasks Scheduling Using Hybrid Genetic Algorithm ». Dans Studies in Computational Intelligence, 319–50. Berlin, Heidelberg : Springer Berlin Heidelberg, 2008. http://dx.doi.org/10.1007/978-3-540-76827-2_13.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
8

Cledou, Guillermina, José Proença, Bernhard H. C. Sputh et Eric Verhulst. « Coordination of Tasks on a Real-Time OS ». Dans Lecture Notes in Computer Science, 250–66. Cham : Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-22397-7_15.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
9

Choi, Seonho, et Ashok K. Agrawala. « Scheduling of Real-Time Tasks with Complex Constraints ». Dans Performance Evaluation : Origins and Directions, 253–82. Berlin, Heidelberg : Springer Berlin Heidelberg, 2000. http://dx.doi.org/10.1007/3-540-46506-5_11.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
10

Christmann, Dennis, Tobias Braun et Reinhard Gotzhein. « SDL Real-Time Tasks – Concept, Implementation, and Evaluation ». Dans Lecture Notes in Computer Science, 239–57. Berlin, Heidelberg : Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-38911-5_14.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.

Actes de conférences sur le sujet "REAL-TIME TASKS"

1

Kai Wang et Tein-Hsiang Lin. « Scheduling adaptive tasks in real-time systems ». Dans Proceedings Real-Time Systems Symposium. IEEE Comput. Soc. Press, 1994. http://dx.doi.org/10.1109/real.1994.342715.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
2

Singh, Abhishek, et Kevin Jeffay. « Co-Scheduling Variable Execution Time Requirement Real-Time Tasks and Non Real-Time Tasks ». Dans 19th Euromicro Conference on Real-Time Systems (ECRTS'07). IEEE, 2007. http://dx.doi.org/10.1109/ecrts.2007.87.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
3

Sun, Jinghao, Nan Guan, Yang Wang, Qingqiang He et Wang Yi. « Real-Time Scheduling and Analysis of OpenMP Task Systems with Tied Tasks ». Dans 2017 IEEE Real-Time Systems Symposium (RTSS). IEEE, 2017. http://dx.doi.org/10.1109/rtss.2017.00016.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
4

Chen, Jian-Jia. « Task Set Synthesis with Cost Minimization for Sporadic Real-Time Tasks ». Dans 2013 IEEE 34th Real-Time Systems Symposium (RTSS). IEEE, 2013. http://dx.doi.org/10.1109/rtss.2013.42.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
5

Gupta et Spezialetti. « Busy-idle profiles and compact task graphs : compile-time support for interleaved and overlapped scheduling of real-time tasks ». Dans Proceedings Real-Time Systems Symposium. IEEE Comput. Soc. Press, 1994. http://dx.doi.org/10.1109/real.1994.342727.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
6

Ekberg, Pontus, et Sanjoy Baruah. « Partitioned Scheduling of Recurrent Real-Time Tasks ». Dans 2021 IEEE Real-Time Systems Symposium (RTSS). IEEE, 2021. http://dx.doi.org/10.1109/rtss52674.2021.00040.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
7

Aggarwal, S., et C. Chraibi. « On the Scheduling of Hyperperiodic Tasks ». Dans Fifth Euromicro Workshop on Real-Time Systems. IEEE, 1993. http://dx.doi.org/10.1109/emwrt.1993.639066.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
8

Jiang, Xu, Nan Guan, Haochun Liang, Yue Tang, Lei Qiao et Wang Yi. « Virtually-Federated Scheduling of Parallel Real-Time Tasks ». Dans 2021 IEEE Real-Time Systems Symposium (RTSS). IEEE, 2021. http://dx.doi.org/10.1109/rtss52674.2021.00050.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
9

Velasco, Manel, Pau Martí et Enrico Bini. « Control-Driven Tasks : Modeling and Analysis ». Dans 2008 IEEE 29th Real-Time Systems Symposium (RTSS). IEEE, 2008. http://dx.doi.org/10.1109/rtss.2008.29.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
10

Thuel et Lehoczky. « Algorithms for scheduling hard aperiodic tasks in fixed-priority systems using slack stealing ». Dans Proceedings Real-Time Systems Symposium. IEEE Comput. Soc. Press, 1994. http://dx.doi.org/10.1109/real.1994.342733.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.

Rapports d'organisations sur le sujet "REAL-TIME TASKS"

1

Chintamaneni, Prasad R., Xiaoping Yuan, Satish K. Tripathi et Ashok K. Agrawala. Scheduling Tasks in a Real-Time System. Fort Belvoir, VA : Defense Technical Information Center, février 1988. http://dx.doi.org/10.21236/ada198862.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
2

Augenblick, Ned, Muriel Niederle et Charles Sprenger. Working Over Time : Dynamic Inconsistency in Real Effort Tasks. Cambridge, MA : National Bureau of Economic Research, janvier 2013. http://dx.doi.org/10.3386/w18734.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
3

Jeffay, Kevin. Scheduling Sporadic Tasks with Shared Resources in Hard-Real-Time Systems. Fort Belvoir, VA : Defense Technical Information Center, novembre 1990. http://dx.doi.org/10.21236/ada242043.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
4

Koenig, Sven, et Craig Tovey. Analysis, Evaluation and Improvement of Sequential Single-Item Auctions for the Cooperative Real-Time Allocation of Tasks. Fort Belvoir, VA : Defense Technical Information Center, mars 2013. http://dx.doi.org/10.21236/ada585661.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
5

Ali, Syed F., Dutch Guckenberger, Marcia Rossi et Mayard Williams. Evaluation of Above Real-Time Training and Self-Instructional Strategies for Airmanship Tasks on a Flight Simulator. Fort Belvoir, VA : Defense Technical Information Center, mai 2000. http://dx.doi.org/10.21236/ada387689.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
6

Ступнік, М. І., В. С. Моркун et З. П. Бакум. Information and Communication Technologies in the Process of Mining Engineer Training. Криворізький державний педагогічний університет, 2013. http://dx.doi.org/10.31812/0564/405.

Texte intégral
Résumé :
Based on scientific analysis the authors of the article argued the necessity of solving priority tasks – the development of new educational technologies aimed at supporting the training of engineers in terms of the mining engineering as high-tech industry. The features of mining computer technologies are determined. There was worked out the project of the adaptive system of a mining engineer individual training "Electronic manual" aimed at the development of future professionals. The essence of individual preparation of future mining engineer ICT is defined. It is proved that the efficiency of the designing and planning of mining operations through the introduction of ICT at present is the real way to influence the quality of mining products that will promote individual learning orientation. For the first time pedagogical foundations for introducing adaptive training of mining engineers are clarified.
Styles APA, Harvard, Vancouver, ISO, etc.
7

Bakhtiari, Sasan. Task 1. Monitoring real time materials degradation. NRC extended In-situ and real-time Monitoring. Office of Scientific and Technical Information (OSTI), mars 2012. http://dx.doi.org/10.2172/1252705.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
8

Fisher, Donna, Paul Fortier, David Hughes et Mayford Roark. DBSSG Predictable Real-Time Information Systems Task Group. Fort Belvoir, VA : Defense Technical Information Center, février 1995. http://dx.doi.org/10.21236/ada291950.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
9

Swaminathan, Vishnu, et Krishnendu Chakrabarty. Real-Time Task Scheduling for Energy-Aware Embedded Systems. Fort Belvoir, VA : Defense Technical Information Center, janvier 2005. http://dx.doi.org/10.21236/ada439593.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
10

Huang, Hui-Min. Hierarchical real-time control task decomposition for a coal mining automation project. Gaithersburg, MD : National Institute of Standards and Technology, 1990. http://dx.doi.org/10.6028/nist.ir.90-4271.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
Vous pouvez également être intéressé par les bibliographies sur le sujet « REAL-TIME TASKS » pour d’autres types de sources :
Articles de revues Thèses Livres
Nous offrons des réductions sur tous les plans premium pour les auteurs dont les œuvres sont incluses dans des sélections littéraires thématiques. Contactez-nous pour obtenir un code promo unique!

Vers la bibliographie