Einloggen

Thematische Bibliographien / REAL-TIME TASKS / Zeitschriftenartikel

Um die anderen Arten von Veröffentlichungen zu diesem Thema anzuzeigen, folgen Sie diesem Link: REAL-TIME TASKS.

Zeitschriftenartikel 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 Top-50 Zeitschriftenartikel für die Forschung 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.

Sehen Sie die Zeitschriftenartikel für verschiedene Spezialgebieten durch und erstellen Sie Ihre Bibliographie auf korrekte Weise.

1

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

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

3

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

4

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

5

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

6

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

7

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

8

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

9

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

10

Зинченко, Сергей Валериевич, 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

11

Allen, R. K., A. Burns und A. J. Wellings. „Sporadic tasks in hard real-time systems“. ACM SIGAda Ada Letters XV, Nr. 5 (September 1995): 46–51. http://dx.doi.org/10.1145/221309.221313.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

12

Weiping Zhu. „Allocating Soft Real-Time Tasks on Cluster“. SIMULATION 77, Nr. 5-6 (November 2001): 219–29. http://dx.doi.org/10.1177/003754970107700507.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

13

Mok, A. K., und D. Chen. „A multiframe model for real-time tasks“. IEEE Transactions on Software Engineering 23, Nr. 10 (1997): 635–45. http://dx.doi.org/10.1109/32.637146.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

14

Chantem, T., Xiaobo Sharon Hu und M. D. Lemmon. „Generalized Elastic Scheduling for Real-Time Tasks“. IEEE Transactions on Computers 58, Nr. 4 (April 2009): 480–95. http://dx.doi.org/10.1109/tc.2008.175.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

15

Wedde, Horst F., Sabine Böhm und Wolfgang Freund. „Real-time Transactions Need Their Constituting Tasks“. IFAC Proceedings Volumes 34, Nr. 22 (November 2001): 277–82. http://dx.doi.org/10.1016/s1474-6670(17)32951-8.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

16

Altenbernd, P., und C. Ditze. „Allocation of Periodic Hard Real-Time Tasks“. IFAC Proceedings Volumes 29, Nr. 6 (November 1996): 197–204. http://dx.doi.org/10.1016/s1474-6670(17)43764-5.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

17

Pospischil, G., P. Puschner, A. Vrchoticky und R. Zainlinger. „Developing real-time tasks with predictable timing“. IEEE Software 9, Nr. 5 (September 1992): 35–44. http://dx.doi.org/10.1109/52.156895.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

18

LEE, W. Y. „Optimal Scheduling for Real-Time Parallel Tasks“. IEICE Transactions on Information and Systems E89-D, Nr. 6 (01.06.2006): 1962–66. http://dx.doi.org/10.1093/ietisy/e89-d.6.1962.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

19

Hong, K. S., und J. Y. T. Leung. „On-line scheduling of real-time tasks“. IEEE Transactions on Computers 41, Nr. 10 (1992): 1326–31. http://dx.doi.org/10.1109/12.166609.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

20

Gerber, R., W. Pugh und M. Saksena. „Parametric dispatching of hard real-time tasks“. IEEE Transactions on Computers 44, Nr. 3 (März 1995): 471–79. http://dx.doi.org/10.1109/12.372041.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

21

Jackson, L. E., und G. N. Rouskas. „Deterministic preemptive scheduling of real-time tasks“. Computer 35, Nr. 5 (Mai 2002): 72–79. http://dx.doi.org/10.1109/mc.2002.999778.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

22

Reimann, Sven, Wei Wu und Steven Liu. „Real-Time Scheduling of PI Control Tasks“. IEEE Transactions on Control Systems Technology 24, Nr. 3 (Mai 2016): 1118–25. http://dx.doi.org/10.1109/tcst.2015.2464304.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

23

Hwang, Chi‐Pan, und Cheng‐Seen Ho. „Hardware design of a real‐time Petri net model for real‐time tasks“. Journal of the Chinese Institute of Engineers 18, Nr. 4 (Juni 1995): 481–92. http://dx.doi.org/10.1080/02533839.1995.9677713.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

24

Patel, Dinkan, und Anjuman Ranavadiya. „REVIEW OF TASK SCHEDULING METHODS FOR REAL TIME TASKS IN CLOUD ENVIRONMENT“. International Journal of Engineering Technologies and Management Research 5, Nr. 1 (07.02.2020): 85–89. http://dx.doi.org/10.29121/ijetmr.v5.i1.2018.50.

Der volle Inhalt der Quelle

Annotation:

Cloud Computing is a type of Internet model that enables convenient, on-demand resources that can be used rapidly and with minimum effort. Cloud Computing can be IaaS, PaaS or SaaS. Scheduling of these tasks is important so that resources can be utilized efficiently with minimum time which in turn gives better performance. Real time tasks require dynamic scheduling as tasks cannot be known in advance as in static scheduling approach. There are different task scheduling algorithms that can be utilized to increase the performance in real time and performing these on virtual machines can prove to be useful. Here a review of various task scheduling algorithms is done which can be used to perform the task and allocate resources so that performance can be increased.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

25

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

Der volle Inhalt der Quelle

Annotation:

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

APA, Harvard, Vancouver, ISO und andere Zitierweisen

26

LEE, Wan Yeon, Kyungwoo LEE, Kyong Hoon KIM und Young Woong KO. „Processor-Minimum Scheduling of Real-Time Parallel Tasks“. IEICE Transactions on Information and Systems E92-D, Nr. 4 (2009): 723–26. http://dx.doi.org/10.1587/transinf.e92.d.723.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

27

Gong, Min-Sik, Gun-Jae Jeong, Ye-Jin Song, Myoung-Jo Jung, Moon-Haeng Cho und Cheol-Hoon Lee. „Power-Aware Scheduling for Mixed Real-Time Tasks“. Journal of the Korea Contents Association 7, Nr. 1 (28.01.2007): 83–93. http://dx.doi.org/10.5392/jkca.2007.7.1.083.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

28

Hamidzadeb, B., und Y. Atif. „Dynamic scheduling of real-time tasks, by assignment“. IEEE Concurrency 6, Nr. 4 (Oktober 1998): 14–25. http://dx.doi.org/10.1109/4434.736402.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

29

Zhong, Xiliang, und Cheng-Zhong Xu. „System-wide energy minimization for real-time tasks“. ACM Transactions on Embedded Computing Systems 7, Nr. 3 (April 2008): 1–24. http://dx.doi.org/10.1145/1347375.1347381.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

30

Lei, Zhenyang, Xiangdong Lei und Jun Long. „Real-Time Scheduling Parallel Tasks on Multicore Platforms“. Journal of Physics: Conference Series 1673 (November 2020): 012002. http://dx.doi.org/10.1088/1742-6596/1673/1/012002.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

31

Cheng, Albert Mo Kim, und Chen Feng. „Predictive thermal management for hard real-time tasks“. ACM SIGBED Review 3, Nr. 1 (Januar 2006): 35–40. http://dx.doi.org/10.1145/1279711.1279719.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

32

Dertouzos, M. L., und A. K. Mok. „Multiprocessor online scheduling of hard-real-time tasks“. IEEE Transactions on Software Engineering 15, Nr. 12 (1989): 1497–506. http://dx.doi.org/10.1109/32.58762.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

33

Aydin, H., R. Melhem, D. Mosse und P. Mejia-Alvarez. „Power-aware scheduling for periodic real-time tasks“. IEEE Transactions on Computers 53, Nr. 5 (Mai 2004): 584–600. http://dx.doi.org/10.1109/tc.2004.1275298.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

34

Levitin, Gregory, Liudong Xing und Hanoch Ben-Haim. „Optimizing software rejuvenation policy for real time tasks“. Reliability Engineering & System Safety 176 (August 2018): 202–8. http://dx.doi.org/10.1016/j.ress.2018.04.010.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

35

Bhuiyan, Ashikahmed, Zhishan Guo, Abusayeed Saifullah, Nan Guan und Haoyi Xiong. „Energy-Efficient Real-Time Scheduling of DAG Tasks“. ACM Transactions on Embedded Computing Systems 17, Nr. 5 (22.11.2018): 1–25. http://dx.doi.org/10.1145/3241049.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

36

Park, Moonju, und Yookun Cho. „Feasibility analysis of hard real-time periodic tasks“. Journal of Systems and Software 73, Nr. 1 (September 2004): 89–100. http://dx.doi.org/10.1016/s0164-1212(03)00236-x.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

37

Eker, Johan, Per Hagander und Karl-Erik Årzén. „A feedback scheduler for real-time controller tasks“. Control Engineering Practice 8, Nr. 12 (Dezember 2000): 1369–78. http://dx.doi.org/10.1016/s0967-0661(00)00086-1.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

38

Wu, Yue, Li-san Tang und Hong-bin Yang. „Overload problem research on aperiodic real-time tasks“. Journal of Shanghai University (English Edition) 13, Nr. 2 (April 2009): 136–41. http://dx.doi.org/10.1007/s11741-009-0209-2.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

39

Drozdowski, Maciej. „Real-time scheduling of linear speedup parallel tasks“. Information Processing Letters 57, Nr. 1 (Januar 1996): 35–40. http://dx.doi.org/10.1016/0020-0190(95)00174-3.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

40

Di Natale, M., und J. A. Stankovic. „Scheduling distributed real-time tasks with minimum jitter“. IEEE Transactions on Computers 49, Nr. 4 (April 2000): 303–16. http://dx.doi.org/10.1109/12.844344.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

41

Ripoll, Ismael, Alfons Crespo und Aloysius K. Mok. „Improvement in feasibility testing for real-time tasks“. Real-Time Systems 11, Nr. 1 (Juli 1996): 19–39. http://dx.doi.org/10.1007/bf00365519.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

42

Schmid, Ulrich. „Static priority scheduling of aperiodic real-time tasks“. Random Structures and Algorithms 10, Nr. 1-2 (Januar 1997): 257–303. http://dx.doi.org/10.1002/(sici)1098-2418(199701/03)10:1/2<257::aid-rsa13>3.0.co;2-5.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

43

Li, Jing, Zheng Luo, David Ferry, Kunal Agrawal, Christopher Gill und Chenyang Lu. „Global EDF scheduling for parallel real-time tasks“. Real-Time Systems 51, Nr. 4 (28.10.2014): 395–439. http://dx.doi.org/10.1007/s11241-014-9213-9.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

44

Singh, Abhishek, Pontus Ekberg und Sanjoy Baruah. „Uniprocessor scheduling of real-time synchronous dataflow tasks“. Real-Time Systems 55, Nr. 1 (21.05.2018): 1–31. http://dx.doi.org/10.1007/s11241-018-9310-2.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

45

Gharbi, Atef, Hamza Gharsellaoui und Mohamed Khalgui. „Real-Time Reconfigurations of Embedded Control Systems“. International Journal of System Dynamics Applications 5, Nr. 3 (Juli 2016): 71–93. http://dx.doi.org/10.4018/ijsda.2016070104.

Der volle Inhalt der Quelle

Annotation:

This paper deals with the study of the reconfiguration of embedded control systems with safety following component-based approaches from the functional level to the operational level. The authors define the architecture of the Reconfiguration Agent which is modelled by nested state machines to apply local reconfigurations. They propose in this journal paper technical solutions to implement the whole agent-based architecture, by defining UML meta-models for both Control Components and also agents. To guarantee safety reconfigurations of tasks at run-time, they define service and reconfiguration processes for tasks and use the semaphore concept to ensure safety mutual exclusions. As a method to ensure the scheduling between periodic tasks with precedence and mutual exclusion constraints, the authors apply the priority ceiling protocol.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

46

Missimer, Katherine, Manos Athanassoulis und Richard West. „Telomere: Real-Time NAND Flash Storage“. ACM Transactions on Embedded Computing Systems 21, Nr. 1 (31.01.2022): 1–24. http://dx.doi.org/10.1145/3479157.

Der volle Inhalt der Quelle

Annotation:

Modern solid-state disks achieve high data transfer rates due to their massive internal parallelism. However, out-of-place updates for flash memory incur garbage collection costs when valid data needs to be copied during space reclamation. The root cause of this extra cost is that solid-state disks are not always able to accurately determine data lifetime and group together data that expires before the space needs to be reclaimed. Real-time systems found in autonomous vehicles, industrial control systems, and assembly-line robots store data from hundreds of sensors and often have predictable data lifetimes. These systems require guaranteed high storage bandwidth for read and write operations by mission-critical real-time tasks. In this article, we depart from the traditional block device interface to guarantee the high throughput needed to process large volumes of data. Using data lifetime information from the application layer, our proposed real-time design, called Telomere , is able to intelligently lay out data in NAND flash memory and eliminate valid page copies during garbage collection. Telomere’s real-time admission control is able to guarantee tasks their required read and write operations within their periods. Under randomly generated tasksets containing 500 tasks, Telomere achieves 30% higher throughput with a 5% storage cost compared to pre-existing techniques.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

47

Lei, Zhenyang, Xiangdong Lei und Jun Long. „Memory-Aware Scheduling Parallel Real-Time Tasks for Multicore Systems“. International Journal of Software Engineering and Knowledge Engineering 31, Nr. 04 (April 2021): 613–34. http://dx.doi.org/10.1142/s0218194021400106.

Der volle Inhalt der Quelle

Annotation:

Shared resources on the multicore chip, such as main memory, are increasingly becoming a point of contention. Traditional real-time task scheduling policies focus on solely on the CPU, and do not take in account memory access and cache effects. In this paper, we propose parallel real-time tasks scheduling (PRTTS) policy on multicore platforms. Each set of tasks is represented as a directed acyclic graph (DAG). The priorities of tasks are assigned according to task periods Rate Monotonic (RM). Each task is composed of three phases. The first phase is read memory stage, the second phase is execution phase and the third phase is write memory phase. The tasks use locks and critical sections to protect data access. The global scheduler maintains the task pool in which tasks are ready to be executed which can run on any core. PRTTS scheduling policy consists of two levels: the first level scheduling schedules ready real-time tasks in the task pool to cores, and the second level scheduling schedules real-time tasks on cores. Tasks can preempt the core on running tasks of low priority. The priorities of tasks which want to access memory are dynamically increased above all tasks that do not access memory. When the data accessed by a task is in the cache, the priority of the task is raised to the highest priority, and the task is scheduled immediately to preempt the core on running the task not accessing memory. After accessing memory, the priority of these tasks is restored to the original priority and these tasks are pended, the preempted task continues to run on the core. This paper analyzes the schedulability of PRTTS scheduling policy. We derive an upper-bound on the worst-case response-time for parallel real-time tasks. A series of extensive simulation experiments have been performed to evaluate the performance of proposed PRTTS scheduling policy. The results of simulation experiment show that PRTTS scheduling policy offers better performance in terms of core utilization and schedulability rate of tasks.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

48

Fu, Chun Yan, Hong Zhou, Mao Song Ge, Xiao Qu und Yong Li Wang. „A Quasi-Real-Time MapReduce Schedule Algorithm“. Advanced Materials Research 694-697 (Mai 2013): 2458–61. http://dx.doi.org/10.4028/www.scientific.net/amr.694-697.2458.

Der volle Inhalt der Quelle

Annotation:

In this paper, we extend and rewrite MapReduce dispatcher and its quasi-real-time schedule algorithm to support operation scheduling in time-limited. MapReduce dispatcher has an evaluation of completion time of tasks in dependence of rate of progress of tasks at hand, and allocated resource dynamically to every task when they are running. Experimental investigation shows that, the algorithm increase the resource utilization of the MapReduce system, and the goals of quasi-real-time MapReduce schedule has been achieved.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

49

Da-Ren, Chen, Chen Young-Long und Chen You-Shyang. „Time and Energy Efficient DVS Scheduling for Real-Time Pinwheel Tasks“. Journal of Applied Research and Technology 12, Nr. 6 (Dezember 2014): 1025–39. http://dx.doi.org/10.1016/s1665-6423(14)71663-3.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

50

Koh, Jae-Hwan, und Byoung-Wook Choi. „On Benchmarking of Real-time Mechanisms in Various Periodic Tasks for Real-time Embedded Linux“. Journal of Korea Robotics Society 7, Nr. 4 (30.11.2012): 292–98. http://dx.doi.org/10.7746/jkros.2012.7.4.292.

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!