Увійти

Готові списки джерел за темами / REAL-TIME TASKS / Дисертації

Щоб переглянути інші типи публікацій з цієї теми, перейдіть за посиланням: REAL-TIME TASKS.

Дисертації з теми "REAL-TIME TASKS"

Автор: Grafiati

Опубліковано: 11 вересня 2023

Оновлено: 25 липня 2025

Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями

Оберіть тип джерела:

Ознайомтеся з топ-50 дисертацій для дослідження на тему "REAL-TIME TASKS".

Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.

Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.

Переглядайте дисертації для різних дисциплін та оформлюйте правильно вашу бібліографію.

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.

Повний текст джерела

Анотація:

Thesis (Ph. D.)--University of North Carolina at Chapel Hill, 2009.<br>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 та ін.

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.

Повний текст джерела

Анотація:

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

Стилі APA, Harvard, Vancouver, ISO та ін.

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.

Повний текст джерела

Анотація:

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

Стилі APA, Harvard, Vancouver, ISO та ін.

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.

Повний текст джерела

Анотація:

<p>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.</p><p>In the multi-core and multiprocessor domain there are mainly two scheduling approaches, glo

Стилі APA, Harvard, Vancouver, ISO та ін.

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.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

6

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

Повний текст джерела

Анотація:

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

Стилі APA, Harvard, Vancouver, ISO та ін.

7

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

Повний текст джерела

Анотація:

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

Стилі APA, Harvard, Vancouver, ISO та ін.

8

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.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

9

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.

Повний текст джерела

Анотація:

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 trans

Стилі APA, Harvard, Vancouver, ISO та ін.

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.

Повний текст джерела

Анотація:

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 computa

Стилі APA, Harvard, Vancouver, ISO та ін.

11

Liberg, Tim, and Per-Erik Måhl. "GPU-accelerated Model Checking of Periodic Self-Suspending Real-Time Tasks." Thesis, Mälardalens högskola, Akademin för innovation, design och teknik, 2012. http://urn.kb.se/resolve?urn=urn:nbn:se:mdh:diva-14661.

Повний текст джерела

Анотація:

Efficient model checking is important in order to make this type of software verification useful for systems that are complex in their structure. If a system is too large or complex then model checking does not simply scale, i.e., it could take too much time to verify the system. This is one strong argument for focusing on making model checking faster. Another interesting aim is to make model checking so fast that it can be used for predicting scheduling decisions for real-time schedulers at runtime. This of course requires the model checking to complete within a order of milliseconds or even

Стилі APA, Harvard, Vancouver, ISO та ін.

12

Nie, Yonggao. "Limited-preemptive fixed priority scheduling of real-time tasks on multiprocessors." Thesis, Mälardalens högskola, Inbyggda system, 2015. http://urn.kb.se/resolve?urn=urn:nbn:se:mdh:diva-28265.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

13

AULUCK, NITIN. "REAL-TIME SCHEDULING ALGORITHMS FOR PRECEDENCE RELATED TASKS ON HETEROGENEOUS MULTIPROCESSORS." University of Cincinnati / OhioLINK, 2005. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1109288052.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

14

Katre, Kedar Maheshwar. "Policies for Migration of Real-Time tasks in Embedded Multicore Systems." OpenSIUC, 2010. https://opensiuc.lib.siu.edu/theses/264.

Повний текст джерела

Анотація:

There has been a lot of work that has been done on timing predictability of real-time tasks on embedded systems. The main assumption in these studies has been that the timing behavior has been based on single processor systems. The scenario has changed entirely when the single core systems have been replaced with the new Multicore systems. The timing predictability is controlled by the migrating tasks, the network topology connecting the cores and the number of cores on the system. In this thesis we come up with a feasibility analysis which depends on the characteristics of the tasks viz. num

Стилі APA, Harvard, Vancouver, ISO та ін.

15

Motakpalli, Sankalpanand. "Aperiodic Job Handling in Cache-Based Real-Time Systems." OpenSIUC, 2017. https://opensiuc.lib.siu.edu/dissertations/1474.

Повний текст джерела

Анотація:

Real-time systems require a-priori temporal guarantees. While most of the normal operation in such a system is modeled using time-driven, hard-deadline sporadic tasks, event-driven behavior is modeled using aperiodic jobs with soft or no deadlines. To provide good Quality-of- Service for aperiodic jobs in the presence of sporadic tasks, aperiodic servers were introduced. Aperiodic servers act as a sporadic task and reserve a quota periodically to serve aperiodic jobs. The use of aperiodic servers in systems with caches is unsafe because aperiodic servers do not take into account, the indirect

Стилі APA, Harvard, Vancouver, ISO та ін.

16

Zhu, Kaiqian. "Limited Preemptive Earliest Deadline First Scheduling of Real-Time Tasks on Multiprocessors." Thesis, Mälardalens högskola, Inbyggda system, 2015. http://urn.kb.se/resolve?urn=urn:nbn:se:mdh:diva-28252.

Повний текст джерела

Анотація:

Real-time systems are employed in many areas, such as aerospace and defenses. In real-time systems, especially in hard real-time systems, it is important to meet the associated time requirements. With the increasing demand for high speed processing capabilities, the requirement for high computing power is becoming more and more urgent. However, it is no longer possible to increase processor speeds because of thermal and power constraints. Consequently, industry has focused on providing more computing capabilities using more number of processors.As to the scheduling policies, they can be classi

Стилі APA, Harvard, Vancouver, ISO та ін.

17

Zahaf, Houssam-Eddine. "Energy efficient scheduling of parallel real-time tasks on heterogeneous multicore systems." Thesis, Lille 1, 2016. http://www.theses.fr/2016LIL10100/document.

Повний текст джерела

Анотація:

Les systèmes cyber-physiques (CPS) et d’Internet des objets génèrent un volume et une variété des données sans précédant. Le temps que ces données parcourent le réseau dans son chemin vers le cloud, la possibilité de réagir à un événement critique pourrait être tardive. Pour résoudre ce problème, les traitements de données nécessitant une réponse rapide sont faits à proximité d’où les données sont collectées. Ainsi, seuls les résultats du pré-traitement sont envoyées au cloud et la réaction pourrai être déclenché suffisamment rapide pour préserver l’intégrité du système. Ce modèle de calcul es

Стилі APA, Harvard, Vancouver, ISO та ін.

18

Gaid, MEMB, AS Cela, and Y. Hamam. "Optimal Real-Time Scheduling of Control Tasks with State Feedback Resource Allocation." IEEE Transactions on Control Systems Technology, 2009. http://encore.tut.ac.za/iii/cpro/DigitalItemViewPage.external?sp=1001370.

Повний текст джерела

Анотація:

Abstract—This paper proposes a new approach for the optimal integrated control and real-time scheduling of control tasks. First, the problem of the optimal integrated control and nonpreemptive off-line scheduling of control tasks in the sense of the H2 performance criterion is addressed. It is shown that this problem may be decomposed into two sub-problems. The first sub-problem aims at finding the optimal non-preemptive off-line schedule, and may be solved using the branch and bound method. The second sub-problem uses the lifting technique to determine the optimal control gains, based on the

Стилі APA, Harvard, Vancouver, ISO та ін.

19

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/.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

20

Babbar, Davender. "On-line hard real-time scheduling of parallel tasks on partitionable multiprocessors /." The Ohio State University, 1994. http://rave.ohiolink.edu/etdc/view?acc_num=osu1487858417983777.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

21

Craig, David W. (David William) Carleton University Dissertation Engineering Electrical. "Light traffic loss of random hard real-time tasks in a network." Ottawa, 1988.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

22

Lennvall, Tomas. "Handling aperiodic tasks and overload in distributed off-line scheduled real-time systems /." Västerås : Mälardalen University, 2003. http://www.mrtc.mdh.se/publications/0541.pdf.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

23

Devarasetty, Ravi Kiran. "Heuristic Algorithms for Adaptive Resource Management of Periodic Tasks in Soft Real-Time Distributed Systems." Thesis, Virginia Tech, 2001. http://hdl.handle.net/10919/31219.

Повний текст джерела

Анотація:

Dynamic real-time distributed systems are characterized by significant run-time uncertainties at the mission and system levels. Typically, processing and communication latencies in such systems do not have known upper bounds and event and task arrivals and failure occurrences are non-deterministically distributed. This thesis proposes adaptive resource management heuristic techniques for periodic tasks in dynamic real-time distributed systems with the (soft real-time) objective of minimizing missed deadline ratios. The proposed resource management techniques continuously monitor the applicatio

Стилі APA, Harvard, Vancouver, ISO та ін.

24

Satka, Zenepe, and Hena Hodžić. "Minimizing the unpredictability that real-time tasks suffer due to inter-core cache interference." Thesis, Mälardalens högskola, Inbyggda system, 2020. http://urn.kb.se/resolve?urn=urn:nbn:se:mdh:diva-48542.

Повний текст джерела

Анотація:

Since different companies are introducing new capabilities and features on their products, the demand for computing power and performance in real-time systems is increasing. To achieve higher performance, processor's manufactures have introduced multi-core platforms. These platforms provide the possibility of executing different tasks in parallel on multiple cores. Since tasks share the same cache level, they face some interference that affects their timing predictability. This thesis is divided into two parts. The first part presents a survey on the existing solutions that others have introdu

Стилі APA, Harvard, Vancouver, ISO та ін.

25

Courbin, Pierre. "Scheduling sequential or parallel hard real-time pre-emptive tasks upon identical multiprocessor platforms." Thesis, Paris Est, 2013. http://www.theses.fr/2013PEST1081/document.

Повний текст джерела

Анотація:

L'ordonnancement de tâches sur un système temps réel dur correspond à trouver une façon de choisir, à chaque instant, quelle tâche doit être exécutée sur le processeur pour que chacune ait le temps de terminer son travail avant son échéance. Ce problème, dans le contexte monoprocesseur, est déjà bien étudié et permet des applications sur des systèmes en production (aérospatiale, bourse etc.). Aujourd'hui, les plateformes multiprocesseur se sont généralisées et ont amené de nombreuses questions telles que l'utilisation efficace de tous les processeurs. Dans cette thèse, nous explorons les appro

Стилі APA, Harvard, Vancouver, ISO та ін.

26

Varghese, B., M. Alamgir Hossain, and Keshav P. Dahal. "Scheduling of tasks in multiprocessor system using hybrid genetic algorithms." Springer Verlag, 2007. http://hdl.handle.net/10454/2552.

Повний текст джерела

Анотація:

This paper presents an investigation into the optimal scheduling of realtime tasks of a multiprocessor system using hybrid genetic algorithms (GAs). A comparative study of heuristic approaches such as `Earliest Deadline First (EDF)¿ and `Shortest Computation Time First (SCTF)¿ and genetic algorithm is explored and demonstrated. The results of the simulation study using MATLAB is presented and discussed. Finally, conclusions are drawn from the results obtained that genetic algorithm can be used for scheduling of real-time tasks to meet deadlines, in turn to obtain high processor utilizat

Стилі APA, Harvard, Vancouver, ISO та ін.

27

Valentin, Eduardo Bezerra, and 92-36710870. "Scheduling hard real-time tasks in heterogeneous multiprocessor platforms subject to energy and temperature constraints." Universidade Federal do Amazonas, 2017. http://tede.ufam.edu.br/handle/tede/6148.

Повний текст джерела

Анотація:

Submitted by Divisão de Documentação/BC Biblioteca Central (ddbc@ufam.edu.br) on 2018-02-08T12:48:35Z No. of bitstreams: 2 license_rdf: 0 bytes, checksum: d41d8cd98f00b204e9800998ecf8427e (MD5) Tese_Eduardo Bezerra Valetim.pdf: 1753904 bytes, checksum: b47b056ce4f5f67a30051e12c578323a (MD5)<br>Approved for entry into archive by Divisão de Documentação/BC Biblioteca Central (ddbc@ufam.edu.br) on 2018-02-08T12:49:13Z (GMT) No. of bitstreams: 2 license_rdf: 0 bytes, checksum: d41d8cd98f00b204e9800998ecf8427e (MD5) Tese_Eduardo Bezerra Valetim.pdf: 1753904 bytes, checksum: b47b056ce4f5f67a30051e12

Стилі APA, Harvard, Vancouver, ISO та ін.

28

Stanhope, Austin. "A control architecture for dynamic execution of robot tasks trained in real-time using particle filters." abstract and full text PDF (UNR users only), 2009. http://0-gateway.proquest.com.innopac.library.unr.edu/openurl?url_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:dissertation&res_dat=xri:pqdiss&rft_dat=xri:pqdiss:1472980.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

29

Belaid, Ikbel. "On line-off line placement and scheduling of real time hardware tasks on dynamically reconfigurable platforms." Nice, 2011. http://www.theses.fr/2011NICE4019.

Повний текст джерела

Анотація:

Le placement et l’ordonnancement des tâches matérielles sont les éléments clés du système d’exploitation temps réel. Ces deux problèmes doivent être traités efficacement afin d’améliorer la qualité du placement exprimée par le taux de fragmentation de ressources et la latence de reconfiguration, et la qualité d’ordonnancement représentée par la durée d’exécution de l’application et la garantie des échéances. En utilisant les systèmes sur puce programmable, nous proposons d’exploiter les caractéristiques physiques de ces puces, en particulier la reconfiguration partielle dynamique. Nous traiton

Стилі APA, Harvard, Vancouver, ISO та ін.

30

Rajnoha, Peter. "Analýza jader real-time operačních systémů běžících na platformě FITkit." Master's thesis, Vysoké učení technické v Brně. Fakulta informačních technologií, 2009. http://www.nusl.cz/ntk/nusl-236754.

Повний текст джерела

Анотація:

The project is dedicated to the identification of the problems found while building RT operating systems for use in embedded devices. The project's main topic is the possibility of using RT system in the FITkit platform and it also discusses individual problems and their possible solutions. One of the problems is the way of acquiring the timing information for tasks to ensure their RT properties. We have extended existing simulator for given microcontroller that is also part of the FITkit. The simulator can be used for detailed monitoring of the execution of individual tasks in the system base

Стилі APA, Harvard, Vancouver, ISO та ін.

31

Poluri, Kaushik. "Bounding the Worst-Case Response Times of Hard-Real-Time Tasks under the Priority Ceiling Protocol in Cache-Based Architectures." OpenSIUC, 2013. https://opensiuc.lib.siu.edu/theses/1213.

Повний текст джерела

Анотація:

AN ABSTRACT OF THE THESIS OF KAUSHIK POLURI, for the Master of Science degree in Electrical and Computer Engineering, presented on 07/03/2013, at Southern Illinois University Carbondale. TITLE: Bounding the Worst-Case Response Times of Hard-Real-Time Tasks under the Priority Ceiling Protocol in Cache-Based Architectures MAJOR PROFESSOR: Dr. HARINI RAMAPRASAD Schedulability analysis of hard-real-time systems requires a-priori knowledge of the worst-case execution times (WCET) of all tasks. Static timing analysis is a safe technique used for calculating WCET that attempts to model program co

Стилі APA, Harvard, Vancouver, ISO та ін.

32

Calafiore, Andrea. "Studio e sviluppo di un'infrastruttura di supporto alla schedulazione di hard/soft real-time tasks in ambiente QNX." Master's thesis, Alma Mater Studiorum - Università di Bologna, 2015. http://amslaurea.unibo.it/8312/.

Повний текст джерела

Анотація:

La tesi tratta lo studio del sistema QNX e dello sviluppo di un simulatore di task hard/soft real-time, tramite uso di un meta-scheduler. Al termine dello sviluppo vengono valutate le prestazioni del sistema operativo QNX Neutrino.

Стилі APA, Harvard, Vancouver, ISO та ін.

33

Nelissen, Geoffrey. "Efficient optimal multiprocessor scheduling algorithms for real-time systems." Doctoral thesis, Universite Libre de Bruxelles, 2013. http://hdl.handle.net/2013/ULB-DIPOT:oai:dipot.ulb.ac.be:2013/209528.

Повний текст джерела

Анотація:

Real-time systems are composed of a set of tasks that must respect some deadlines. We find them in applications as diversified as the telecommunications, medical devices, cars, planes, satellites, military applications, etc. Missing deadlines in a real-time system may cause various results such as a diminution of the quality of service provided by the system, the complete stop of the application or even the death of people. Being able to prove the correct operation of such systems is therefore primordial. This is the goal of the real-time scheduling theory.<p><p>These last years, we have witne

Стилі APA, Harvard, Vancouver, ISO та ін.

34

RAMACHANDRAN, GOWRI SANKAR. "Integration of enhanced slot-shifting in uc/os-II." Thesis, Mälardalens högskola, Akademin för innovation, design och teknik, 2011. http://urn.kb.se/resolve?urn=urn:nbn:se:mdh:diva-12981.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

35

Müller, Dirk, and Matthias Werner. "Improved Heuristics for Partitioned Multiprocessor Scheduling Based on Rate-Monotonic Small-Tasks." Universitätsbibliothek Chemnitz, 2012. http://nbn-resolving.de/urn:nbn:de:bsz:ch1-qucosa-80762.

Повний текст джерела

Анотація:

Partitioned preemptive EDF scheduling is very similar to bin packing, but there is a subtle difference. Estimating the probability of schedulability under a given total utilization has been studied empirically before. Here, we show an approach for closed-form formulae for the problem, starting with n = 3 tasks on m = 2 processors.

Стилі APA, Harvard, Vancouver, ISO та ін.

36

Krappman, Alfred. "Identifying and alleviating shared cache contention : Achieving reliability of real-time tasks on a multi-OS and multi-core system." Thesis, KTH, Skolan för informations- och kommunikationsteknik (ICT), 2015. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-207857.

Повний текст джерела

Анотація:

Current architecture trends results in processors being equipped with more cores and larger shared caches. Concurrent applications on multicore processors may interfere with each other when accessing shared resources. This is especially troublesome if deadline-bound real-time tasks are running. A tool illustrating contention was developed. The tool was used to confirm the contention problem and to evaluate the developed solution. This thesis surveyed state-of-the-art approaches concerned with mitigating contention. The approaches can be categorized as requiring modifications to the operating s

Стилі APA, Harvard, Vancouver, ISO та ін.

37

Al, Sheikh Ahmad. "Resource allocation in hard real-time avionic systems : scheduling and routing problems." Phd thesis, INSA de Toulouse, 2011. http://tel.archives-ouvertes.fr/tel-00631443.

Повний текст джерела

Анотація:

Le domaine avionique a été transformé par l'apparition des architectures modulaires intégrées (IMA). Celles-ci définissent un support d'exécution et de communication standard et mutualisé afin de réduire la complexité de l'architecture physique. Cependant, du fait du partage des ressources, cette démarche introduit une plus grande complexité lors de la conception et de l'intégration des applications ce qui implique d'assister les concepteurs avec des outils dédiés. La présente thèse contribue à cet effort en se focalisant sur deux problèmes d'allocation de ressources : i) le problème de l'ordo

Стилі APA, Harvard, Vancouver, ISO та ін.

38

Al, Sheikh Ahmad. "Resource allocation in hard real-time avionic systems : scheduling and routing problems." Electronic Thesis or Diss., Toulouse, INSA, 2011. http://www.theses.fr/2011ISAT0010.

Повний текст джерела

Анотація:

Le domaine avionique a été transformé par l'apparition des architectures modulaires intégrées (IMA). Celles-ci définissent un support d'exécution et de communication standard et mutualisé afin de réduire la complexité de l'architecture physique. Cependant, du fait du partage des ressources, cette démarche introduit une plus grande complexité lors de la conception et de l'intégration des applications ce qui implique d’assister les concepteurs avec des outils dédiés. La présente thèse contribue à cet effort en se focalisant sur deux problèmes d'allocation de ressources : i) le problème de l'ordo

Стилі APA, Harvard, Vancouver, ISO та ін.

39

Oliveira, Wilson Prates de. "Arquitetura de software para sistemas de tempo real." Universidade de São Paulo, 2011. http://www.teses.usp.br/teses/disponiveis/3/3152/tde-13012012-103355/.

Повний текст джерела

Анотація:

O desenvolvimento de sistemas de controle em plataformas de tempo real é uma tarefa que envolve Engenharia de Controle e Ciência da Computação. Nas últimas décadas, estas áreas se desenvolveram como áreas independentes. Este trabalho busca diminuir distância entre as áreas propondo a utilização de métodos de Engenharia de Software em uma fase de modelagem do software de controle. Uma das propostas apresentadas no trabalho é a utilização de frameworks orientados a objetos no processo de Rapid Control Prototyping (RCP) para substituir a geração automática de código, eliminar os problemas de inte

Стилі APA, Harvard, Vancouver, ISO та ін.

40

Lam, Barbara. "LOW-COST MISSION SUPPORT CONCEPT." International Foundation for Telemetering, 1996. http://hdl.handle.net/10150/607606.

Повний текст джерела

Анотація:

International Telemetering Conference Proceedings / October 28-31, 1996 / Town and Country Hotel and Convention Center, San Diego, California<br>This paper presents a new architecture of the end-to-end ground system to reduce overall mission support costs. The present ground system of the Jet Propulsion Laboratory (JPL) is costly to operate, maintain, deploy, reproduce, and document. In the present climate of shrinking NASA budgets, this proposed architecture takes on added importance as it will dramatically reduce all of the above costs. Currently, the ground support functions (i.e., rec

Стилі APA, Harvard, Vancouver, ISO та ін.

41

Djokic, Jelena. "Investigation into Air Traffic Complexity as a Driver of a Controller‘s Workload." Doctoral thesis, Saechsische Landesbibliothek- Staats- und Universitaetsbibliothek Dresden, 2016. http://nbn-resolving.de/urn:nbn:de:bsz:14-qucosa-208110.

Повний текст джерела

Анотація:

The thesis describes an investigation into Air Traffic Control (ATC) complexity as a contributory factor in changes of controllers' workload. It is considered that ATC complexity, together with equipment interface and procedural demands comprise the task demands imposed on the en-route controller to perform certain activities, which mediated by performance shaping factors create workload. The data used to study this relationship came from ATC real-time simulations completed at EUROCONTROL CRDS in Budapest: recorded flown trajectories, communication performed by the controller (whether with oth

Стилі APA, Harvard, Vancouver, ISO та ін.

42

Ndoye, Falou. "Ordonnancement temps réel préemptif multiprocesseur avec prise en compte du coût du système d’exploitation." Thesis, Paris 11, 2014. http://www.theses.fr/2014PA112056/document.

Повний текст джерела

Анотація:

Dans cette thèse nous étudions le problème d'ordonnancement temps réel multiprocesseur préemptif avec prise en compte du coût exact du système d'exploitation. Ce coût est formé de deux parties : une partie facile à déterminer, correspondant au coût de l'ordonnanceur et une partie difficile à déterminer, correspondant au coût de la préemption. Cette difficulté est due au fait qu'une préemption peut en engendrer une autre, pouvant ainsi créer un phénomène d'avalanche. Dans un premier temps, nous avons étudié l'ordonnancement hors ligne multiprocesseur de tâches indépendantes avec prise en compte

Стилі APA, Harvard, Vancouver, ISO та ін.

43

Davis, Robert Ian. "On exploiting spare capacity in hard real-time systems." Thesis, University of York, 1995. http://etheses.whiterose.ac.uk/10840/.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

44

Fisher, Nathan Wayne Baruah Sanjoy K. "The multiprocessor real-time scheduling of general task systems." Chapel Hill, N.C. : University of North Carolina at Chapel Hill, 2007. http://dc.lib.unc.edu/u?/etd,1108.

Повний текст джерела

Анотація:

Thesis (Ph. D.)--University of North Carolina at Chapel Hill, 2007.<br>Title from electronic title page (viewed Mar. 27, 2008). "... 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 та ін.

45

Zhou, Hongyi. "Task scheduling and synchronization for multiprocessor real-time systems." Diss., Georgia Institute of Technology, 1992. http://hdl.handle.net/1853/9178.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

46

Kivelevitch, Elad H. "Robust, Real Time, and Scalable Multi-Agent Task Allocation." University of Cincinnati / OhioLINK, 2012. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1337007279.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

47

Naedele, Martin. "On the modeling and evaluation of real-time systems." [S.l.] : [s.n.], 2000. http://e-collection.ethbib.ethz.ch/show?type=diss&nr=13564.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

48

Krauth, Elfriede Irene. "Real-time planning support : a task-technology fit perspective = Real-time planningsondersteuning : de afstemming tussen taak en technologie /." Rotterdam : Erasmus Universiteit, 2008. http://opac.nebis.ch/cgi-bin/showAbstract.pl?u20=97890589221932.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

49

Sandnes, Frode Eika. "New approaches to static task graph scheduling for control." Thesis, University of Reading, 1997. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.362290.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

50

Ekberg, Pontus. "Models and Complexity Results in Real-Time Scheduling Theory." Doctoral thesis, Uppsala universitet, Avdelningen för datorteknik, 2015. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-267017.

Повний текст джерела

Анотація:

When designing real-time systems, we want to prove that they will satisfy given timing constraints at run time. The main objective of real-time scheduling theory is to analyze properties of mathematical models that capture the temporal behaviors of such systems. These models typically consist of a collection of computational tasks, each of which generates an infinite sequence of task activations. In this thesis we study different classes of models and their corresponding analysis problems. First, we consider models of mixed-criticality systems. The timing constraints of these systems state tha

Стилі APA, Harvard, Vancouver, ISO та ін.

Ми пропонуємо знижки на всі преміум-плани для авторів, чиї праці увійшли до тематичних добірок літератури. Зв'яжіться з нами, щоб отримати унікальний промокод!