Thematische Bibliographien / REAL-TIME TASKS

Inhaltsverzeichnis

Zeitschriftenartikel
Dissertationen
Bücher
Buchteile
Konferenzberichte
Berichte der Organisationen

Auswahl der wissenschaftlichen Literatur zum Thema „REAL-TIME TASKS“

Autor: Grafiati

Veröffentlicht am 11. September 2023

Geben Sie eine Quelle nach APA, MLA, Chicago, Harvard und anderen Zitierweisen an

Wählen Sie eine Art der Quelle aus:

Machen Sie sich mit den Listen der aktuellen Artikel, Bücher, Dissertationen, Berichten und anderer wissenschaftlichen Quellen zum Thema "REAL-TIME TASKS" bekannt.

Neben jedem Werk im Literaturverzeichnis ist die Option "Zur Bibliographie hinzufügen" verfügbar. Nutzen Sie sie, wird Ihre bibliographische Angabe des gewählten Werkes nach der nötigen Zitierweise (APA, MLA, Harvard, Chicago, Vancouver usw.) automatisch gestaltet.

Sie können auch den vollen Text der wissenschaftlichen Publikation im PDF-Format herunterladen und eine Online-Annotation der Arbeit lesen, wenn die relevanten Parameter in den Metadaten verfügbar sind.

Zeitschriftenartikel zum Thema "REAL-TIME TASKS"

Udvanshi, Pankaj. „Scheduling of Real Time Tasks“. IOSR Journal of Engineering 03, Nr. 6 (Juni 2013): 44–58. http://dx.doi.org/10.9790/3021-03624458.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

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.07.2020): 968–83. http://dx.doi.org/10.5373/jardcs/v12sp8/20202602.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Oh, Y., und S. H. Son. „Scheduling Real-Time Tasks for Dependability“. Journal of the Operational Research Society 48, Nr. 6 (Juni 1997): 629. http://dx.doi.org/10.2307/3010227.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

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

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Behrouzian, Amir, Hadi Alizadeh Ara, Marc Geilen, Dip Goswami und Twan Basten. „Firmness Analysis of Real-time Tasks“. ACM Transactions on Embedded Computing Systems 19, Nr. 4 (16.07.2020): 1–24. http://dx.doi.org/10.1145/3398328.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Oh, Y., und S. H. Son. „Scheduling real-time tasks for dependability“. Journal of the Operational Research Society 48, Nr. 6 (Juni 1997): 629–39. http://dx.doi.org/10.1057/palgrave.jors.2600413.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

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

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Moron, Celio Estevan, und Hussein Zedan. „On guaranteeing hard real-time tasks“. Microprocessing and Microprogramming 38, Nr. 1-5 (September 1993): 485–90. http://dx.doi.org/10.1016/0165-6074(93)90185-n.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

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

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Зинченко, Сергей Валериевич, und Валерий Петрович Зинченко. „THE SCHEDULING TASKS IN REAL-TIME SYSTEMS“. Information systems, mechanics and control, Nr. 17 (29.12.2017): 113–23. http://dx.doi.org/10.20535/2219-3804172017123927.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Mehr Quellen

Dissertationen zum Thema "REAL-TIME TASKS"

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.

Der volle Inhalt der Quelle

Annotation:

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.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

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.

Der volle Inhalt der Quelle

Annotation:

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

APA, Harvard, Vancouver, ISO und andere Zitierweisen

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

Der volle Inhalt der Quelle

Annotation:

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.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

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.

Der volle Inhalt der Quelle

Annotation:

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.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

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.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

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

Der volle Inhalt der Quelle

Annotation:

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.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

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

Der volle Inhalt der Quelle

Annotation:

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 nommé 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

APA, Harvard, Vancouver, ISO und andere Zitierweisen

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.

Der volle Inhalt der Quelle

Annotation:

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.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

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.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

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.

Der volle Inhalt der Quelle

Annotation:

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.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Mehr Quellen

Bücher zum Thema "REAL-TIME TASKS"

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

Den vollen Inhalt der Quelle finden

APA, Harvard, Vancouver, ISO und andere Zitierweisen

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

Den vollen Inhalt der Quelle finden

APA, Harvard, Vancouver, ISO und andere Zitierweisen

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

Den vollen Inhalt der Quelle finden

APA, Harvard, Vancouver, ISO und andere Zitierweisen

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

Den vollen Inhalt der Quelle finden

APA, Harvard, Vancouver, ISO und andere Zitierweisen

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

Den vollen Inhalt der Quelle finden

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Hergenröder, Gerhard. ALLOC: Ein wissensbasierter Ansatz zur Lösung des Allokationsproblems von Tasks in verteilten Realzeitsystemen. Erlangen: Regionales Rechenzentrum Erlangen, 1989.

Den vollen Inhalt der Quelle finden

APA, Harvard, Vancouver, ISO und andere Zitierweisen

United States. National Aeronautics and Space Administration., Hrsg. 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.

Den vollen Inhalt der Quelle finden

APA, Harvard, Vancouver, ISO und andere Zitierweisen

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

Den vollen Inhalt der Quelle finden

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Guha, Krishnendu, Sangeet Saha und 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.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Thoen, Filip, und Francky Catthoor, Hrsg. 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.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Mehr Quellen

Buchteile zum Thema "REAL-TIME TASKS"

Christmann, Dennis, und Reinhard Gotzhein. „Real-Time Tasks in SDL“. In 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.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

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

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

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

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Gharsellaoui, Hamza, und Samir Ben Ahmed. „Real-Time Reconfigurable Scheduling of Sporadic Tasks“. In 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.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Janarthanan, Vasudevan. „Designing Schedulers for Hard Real-Time Tasks“. In 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.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Park, Ho-Joon, und Chang-Hoon Lee. „An Efficient Real-Time Middleware Scheduling Algorithm for Periodic Real-Time Tasks“. In 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.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

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

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

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

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

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

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Christmann, Dennis, Tobias Braun und Reinhard Gotzhein. „SDL Real-Time Tasks – Concept, Implementation, and Evaluation“. In 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.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Konferenzberichte zum Thema "REAL-TIME TASKS"

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

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

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

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

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

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

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

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

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

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Ekberg, Pontus, und Sanjoy Baruah. „Partitioned Scheduling of Recurrent Real-Time Tasks“. In 2021 IEEE Real-Time Systems Symposium (RTSS). IEEE, 2021. http://dx.doi.org/10.1109/rtss52674.2021.00040.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Aggarwal, S., und C. Chraibi. „On the Scheduling of Hyperperiodic Tasks“. In Fifth Euromicro Workshop on Real-Time Systems. IEEE, 1993. http://dx.doi.org/10.1109/emwrt.1993.639066.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

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

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

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

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

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

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Berichte der Organisationen zum Thema "REAL-TIME TASKS"

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

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

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

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

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

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Koenig, Sven, und 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, März 2013. http://dx.doi.org/10.21236/ada585661.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Ali, Syed F., Dutch Guckenberger, Marcia Rossi und 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.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

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

Der volle Inhalt der Quelle

Annotation:

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.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

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

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

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

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

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

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

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.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Wir bieten Rabatte auf alle Premium-Pläne für Autoren, deren Werke in thematische Literatursammlungen aufgenommen wurden. Kontaktieren Sie uns, um einen einzigartigen Promo-Code zu erhalten!