Littérature scientifique sur le sujet « DAG task »
Créez une référence correcte selon les styles APA, MLA, Chicago, Harvard et plusieurs autres
Sommaire
Consultez les listes thématiques d’articles de revues, de livres, de thèses, de rapports de conférences et d’autres sources académiques sur le sujet « DAG task ».
À côté de chaque source dans la liste de références il y a un bouton « Ajouter à la bibliographie ». Cliquez sur ce bouton, et nous générerons automatiquement la référence bibliographique pour la source choisie selon votre style de citation préféré : APA, MLA, Harvard, Vancouver, Chicago, etc.
Vous pouvez aussi télécharger le texte intégral de la publication scolaire au format pdf et consulter son résumé en ligne lorsque ces informations sont inclues dans les métadonnées.
Articles de revues sur le sujet "DAG task"
Liu, Zhiguo, Luxi Zhang, Lin Wang, Xiaoqi Dong et Junlin Rong. « Research on Multi-DAG Satellite Network Task Scheduling Algorithm Based on Cache-Composite Priority ». Electronics 13, no 4 (15 février 2024) : 763. http://dx.doi.org/10.3390/electronics13040763.
Texte intégralZhao, Yao, Jian Dong, Hongwei Liu, Jin Wu et Yanxin Liu. « Performance Improvement of DAG-Aware Task Scheduling Algorithms with Efficient Cache Management in Spark ». Electronics 10, no 16 (4 août 2021) : 1874. http://dx.doi.org/10.3390/electronics10161874.
Texte intégralCai, Lingfeng, Xianglin Wei, Changyou Xing, Xia Zou, Guomin Zhang et Xiulei Wang. « Failure-resilient DAG task scheduling in edge computing ». Computer Networks 198 (octobre 2021) : 108361. http://dx.doi.org/10.1016/j.comnet.2021.108361.
Texte intégralJiang, Yuyi, Zhiqing Shao, Yi Guo, Huanhuan Zhang et Kun Niu. « DRSCRO : A Metaheuristic Algorithm for Task Scheduling on Heterogeneous Systems ». Mathematical Problems in Engineering 2015 (2015) : 1–20. http://dx.doi.org/10.1155/2015/396582.
Texte intégralVucha, Mahendra, et Arvind Rajawat. « Dynamic Task Distribution Model for On-Chip Reconfigurable High Speed Computing System ». International Journal of Reconfigurable Computing 2015 (2015) : 1–12. http://dx.doi.org/10.1155/2015/783237.
Texte intégralKaur, Mandeep, et Balwinder Singh Sohi. « Efficient DAG Task Scheduling Algorithm for Wireless Sensor Networks ». International Journal of Computer Sciences and Engineering 6, no 12 (31 décembre 2018) : 735–43. http://dx.doi.org/10.26438/ijcse/v6i12.735743.
Texte intégralZhai, Wenzheng, Yue-Li Hu et Feng Ran. « CQPSO scheduling algorithm for heterogeneous multi-core DAG task model ». Modern Physics Letters B 31, no 19-21 (27 juillet 2017) : 1740050. http://dx.doi.org/10.1142/s0217984917400504.
Texte intégralVoudouris, Petros, Per Stenström et Risat Pathan. « Federated Scheduling of Sporadic DAGs on Unrelated Multiprocessors ». ACM Transactions on Embedded Computing Systems 20, no 5s (31 octobre 2021) : 1–25. http://dx.doi.org/10.1145/3477018.
Texte intégralSingh, Manjeet, et Javalkar Dinesh Kumar. « DBRS : Directed Acyclic Graph based Reliable Scheduling Approach in Large Scale Computing ». International Journal on Recent and Innovation Trends in Computing and Communication 10, no 11 (30 novembre 2022) : 40–46. http://dx.doi.org/10.17762/ijritcc.v10i11.5778.
Texte intégralTaufer, Michela, et Arnold L. Rosenberg. « Scheduling DAG-based workflows on single cloud instances : High-performance and cost effectiveness with a static scheduler ». International Journal of High Performance Computing Applications 31, no 1 (28 juillet 2016) : 19–31. http://dx.doi.org/10.1177/1094342015594518.
Texte intégralThèses sur le sujet "DAG task"
VERUCCHI, MICAELA. « Analisi esaustiva di DAG task : soluzioni per moderni sistemi real-time embedded ». Doctoral thesis, Università degli studi di Modena e Reggio Emilia, 2021. http://hdl.handle.net/11380/1237396.
Texte intégralModern cyber-physical embedded systems integrate several complex functionalities that are subject to tight timing constraints. Unfortunately, traditional sequential task models and uniprocessors solutions can not be applied in this context: a more expressive model becomes necessary. In this scenario, the Directed Acyclic Graph (DAG) is a suitable model to express the complexity and the parallelism of the tasks of these kinds of systems. In recent years, several methods with different settings have been proposed to solve the schedulability problem for applications featuring DAG tasks. However, there are still many open problems left. Besides schedulability, aspects like the freshness of data or reaction to an event are crucial for the performance of those kind of systems. For example, a typical application in the automotive field is composed of sensing the environment, planning, and actuate consequently to the elaborated data. Control end-to-end latency is then decisive, and it can get very complicated in real scenarios. This thesis represents an effort in both directions: (i) the schedulability of a DAG task on a multiprocessor, and (ii) the supervision of end-to-end latency for multi-rate tasks. For the former problem, a survey of the state-of-the-art of the Directed Acyclic Graph task model is presented, with a focus on scheduling tests that are more effective, easy to implement, and adopt. Regarding the latter, a method is proposed to convert a multi-rate DAG task-set with timing constraints into a single-rate DAG that optimizes schedulability, age, and reaction latency.
Chieregato, Federico. « Modelling task execution time in Directed Acyclic Graphs for efficient distributed management ». Master's thesis, Alma Mater Studiorum - Università di Bologna, 2022.
Trouver le texte intégralMazouzi, Houssemeddine. « Algorithmes pour le déchargement de tâches sur serveurs de périphérie ». Thesis, Paris 13, 2019. http://www.theses.fr/2019PA131076.
Texte intégralComputation offloading is one of the most promising paradigm to overcome the lack of computational resources in mobile devices. Basically, it allows the execution of part orall of a mobile application in the cloud. The main objective is to reduce both execution time and energy consumption for the mobile terminals. Unfortunately, even if clouds have rich computing and storage resources, they are usually geographically far from mobile applications and may suffer from large delays, which is particularly problematic for mobile applications with small response time requirements. To reduce this long delay, one of the emerging approach is to push the cloud to the network edge. This proximity gives the opportunity to mobile users to offload their tasks to “local” cloud for processing. An Edge Cloud can be seen as small data center acting as a shadow image of larger data centers. This geographical proximity between mobile applications and edge cloud means that the access delay can be greatly reduced, but affects also higher throughput, improved responsiveness and better scalability. In this thesis, we focus on computation offloading in mobile environment (Mobile Edge Computing - MEC), composed of several edge servers. Our goal is to explore new and effective offloading strategies to improve applications performances in both execution time and energy consumption, while ensuring application requirements. Our first contribution is a new offloading strategy in the case of multiple edge servers. Thenwe extend this strategy to include the Cloud. Both strategies have been evaluated theoretically and experimentally by the implementation of an offloading middleware. Finally, we propose a new elastic approach in the case of multitasking applications characterized by a graph of dependencies between tasks
Ben, Amor Slim. « Ordonnancement des tâches avec des dépendances et des temps d’exécution probabilistes sur processeur multi-cœurs ». Electronic Thesis or Diss., Sorbonne université, 2020. http://www.theses.fr/2020SORUS188.
Texte intégralThe continuous integration of new functionality increases the complexity of embedded systems, while each functionality might impose precedence constraints between the programs fulfilling it. In addition, the prevalence of several processors may create the illusion of higher computation capacity easing the associated scheduling problem. However, this capacity is not exploitable in critical real time systems because of the increased variability of the execution times due to processor features designed to provide excellent average time behavior and not necessarily ensuring small worst case bounds. This difficulty is added to the existence of scheduling anomalies when the systems are built a top of multi-core processors. In this thesis, we consider partitioned scheduling of DAG tasks defining precedence constraints. The variability of execution times is described by probability distributions. We propose a Response Time Analysis (RTA) based on iterative equations and probabilistic operators for independent distributions. For dependent distributions, we model them using Bayesian network. We also use C-space representation combined with SVM classification to estimate the schedulability probability. Moreover, we provide techniques to define priority and sub-task partitioning in a way to increase parallelism. We also decrease analysis complexity by reducing size of graph without altering the precedence structures
Qamhieh, Manar. « Scheduling of parallel real-time DAG tasks on multiprocessor systems ». Thesis, Paris Est, 2015. http://www.theses.fr/2015PEST1030/document.
Texte intégralThe 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
Stutzman, Rick Lloyd. « A cross-validation study of Das's simultaneous-successive-planning model / ». The Ohio State University, 1986. http://rave.ohiolink.edu/etdc/view?acc_num=osu1487266362338663.
Texte intégralMeisner, Tomáš. « Integrace dat a možnosti automatického zpracování úloh ». Master's thesis, Vysoká škola ekonomická v Praze, 2009. http://www.nusl.cz/ntk/nusl-9918.
Texte intégralWaldenvik, Caroline. « En dag av språkstimulering ». Thesis, Malmö högskola, Fakulteten för lärande och samhälle (LS), 2012. http://urn.kb.se/resolve?urn=urn:nbn:se:mau:diva-34677.
Texte intégralGrepl, Filip. « Aplikace pro řízení paralelního zpracování dat ». Master's thesis, Vysoké učení technické v Brně. Fakulta informačních technologií, 2021. http://www.nusl.cz/ntk/nusl-445490.
Texte intégralRoss, Alleyne Patricia. « Individual Differences in Preschool Aged Children's Inhibitory Control : Adding Borders to the Day/Night Task ». Thesis, Virginia Tech, 2016. http://hdl.handle.net/10919/78096.
Texte intégralMaster of Science
Livres sur le sujet "DAG task"
Illinois. Governor's Task Force on Day Care. Governor's Task Force on Day Care : Final report. [Springfield, Ill.] : The Task Force, 1987.
Trouver le texte intégralCasofa, Fachmy. Tak boleh lelah dan kalah. Solo : Metagraf, 2014.
Trouver le texte intégralBubílková, Zuzana. Co týden (ne)dal. Praha : Nakl. Lidové noviny, 1993.
Trouver le texte intégralNasional, Institut Keguruan dan Ilmu Pendidikan Saraswati Fakultas Pendidikan Matematika dan Ilmu Pengetahuan Alam Seminar. Optimalisasi lingkungan, organisasi, dan task menuju pembelajaran enase : Buku prosiding. Tabanan : Fakultas Pendidikan Matematika dan Ilmu Pengetahuan Alam, Institut Keguruan dan Ilmu Pendidikan Saraswati bekerja sama dengan Pustaka Larasan, 2012.
Trouver le texte intégralChild care : A workforce issue : report of the Secretary's Task Force. [Washington, D.C.?] : U.S. Department of Labor, 1988.
Trouver le texte intégralW, Awdry. 3-dai no kikansha. Tōkyō : Popurasha, 2005.
Trouver le texte intégralSpirn, Michele. The Know-Nothings talk turkey. New York : HarperCollins, 2000.
Trouver le texte intégralMeishun, Jin, dir. Han yu jian dan shuo : Korean easy talk. Taibei Xian Zhonghe Shi : Tong yi chu ban she you xian gong si, 2005.
Trouver le texte intégralH, Molgard Max, dir. Straight talk about gospel principles. Salt Lake City, Utah : Bookcraft, 1994.
Trouver le texte intégralPaulsen, Jan. Let's talk : Conversations with young Adventists about their church. Nampa, Idaho : Pacific Press Pub. Association, 2013.
Trouver le texte intégralChapitres de livres sur le sujet "DAG task"
Chen, Chen, et Jie Zhu. « DAG-Based Task Scheduling Optimization in Heterogeneous Distributed Systems ». Dans Computer Supported Cooperative Work and Social Computing, 303–16. Singapore : Springer Nature Singapore, 2024. http://dx.doi.org/10.1007/978-981-99-9637-7_23.
Texte intégralRajak, Nidhi, et Diwakar Shukla. « An Efficient Task Scheduling Strategy for DAG in Cloud Computing Environment ». Dans Advances in Intelligent Systems and Computing, 273–89. Singapore : Springer Singapore, 2020. http://dx.doi.org/10.1007/978-981-15-1518-7_23.
Texte intégralShu, Lang, Guanyan Pan, Bei Wang, Wenbing Peng, Minhui Fang, Yifei Chen, Fanding Huang, Songchen Li et Yuxia Cheng. « Smart DAG Task Scheduling Based on MCTS Method of Multi-strategy Learning ». Dans Algorithms and Architectures for Parallel Processing, 224–42. Singapore : Springer Nature Singapore, 2024. http://dx.doi.org/10.1007/978-981-97-0834-5_14.
Texte intégralZhao, Tianqi, Mingyue Zhao, Yue Shi et Kuangyu Zheng. « SPath : An Energy-Efficient DAG Task Offloading Scheme with Space-Ground Cooperative Computing ». Dans Lecture Notes in Computer Science, 499–510. Singapore : Springer Nature Singapore, 2023. http://dx.doi.org/10.1007/978-981-99-2233-8_36.
Texte intégralTian, Yuan, Füsun Özgüner et Eylem Ekici. « Comparison of Hyper-DAG Based Task Mapping and Scheduling Heuristics for Wireless Sensor Networks ». Dans Computer and Information Sciences - ISCIS 2005, 74–83. Berlin, Heidelberg : Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/11569596_10.
Texte intégralLasko, Wolf W., et Lara M. Lasko. « Das Wunder der Kommunikation ». Dans Charisma-Talk, 23–24. Wiesbaden : Springer Fachmedien Wiesbaden, 2013. http://dx.doi.org/10.1007/978-3-658-02984-5_12.
Texte intégralLasko, Wolf W., et Lara M. Lasko. « Das Energieecho des Handelns ». Dans Charisma-Talk, 3–4. Wiesbaden : Springer Fachmedien Wiesbaden, 2013. http://dx.doi.org/10.1007/978-3-658-02984-5_2.
Texte intégralBaruah, Sanjoy, Marko Bertogna et Giorgio Buttazzo. « The Sporadic DAG Tasks Model ». Dans Embedded Systems, 191–204. Cham : Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-08696-5_21.
Texte intégralBeetz, Maud. « Ohne Small Talk kein Business Talk ». Dans Der Knigge für das Bankgeschäft, 119–40. Wiesbaden : Gabler, 2009. http://dx.doi.org/10.1007/978-3-8349-8200-1_9.
Texte intégralLasko, Wolf W. « Das Gespräch beleben ». Dans Small Talk und Karriere, 113–54. Wiesbaden : Gabler Verlag, 2001. http://dx.doi.org/10.1007/978-3-322-87156-5_2.
Texte intégralActes de conférences sur le sujet "DAG task"
Li, Xiang, Mustafa Abdallah, Shikhar Suryavansh, Mung Chiang, Kwang Taik Kim et Saurabh Bagchi. « DAG-based Task Orchestration for Edge Computing ». Dans 2022 41st International Symposium on Reliable Distributed Systems (SRDS). IEEE, 2022. http://dx.doi.org/10.1109/srds55811.2022.00013.
Texte intégralBaruah, Sanjoy. « Federated Scheduling of Sporadic DAG Task Systems ». Dans 2015 IEEE International Parallel and Distributed Processing Symposium (IPDPS). IEEE, 2015. http://dx.doi.org/10.1109/ipdps.2015.33.
Texte intégralShang, Ying, Jinglei Li et Xiguang Wu. « DAG-based Task Scheduling in Mobile Edge Computing ». Dans 2020 7th International Conference on Information Science and Control Engineering (ICISCE). IEEE, 2020. http://dx.doi.org/10.1109/icisce50968.2020.00095.
Texte intégralPeccerillo, Biagio, et Sandro Bartolini. « Task-DAG Support in Single-Source PHAST Library ». Dans the 10th International Workshop. New York, New York, USA : ACM Press, 2019. http://dx.doi.org/10.1145/3303084.3309496.
Texte intégralBonifaci, Vincenzo, Alberto Marchetti-Spaccamela, Sebastian Stiller et Andreas Wiese. « Feasibility Analysis in the Sporadic DAG Task Model ». Dans 2013 25th Euromicro Conference on Real-Time Systems (ECRTS). IEEE, 2013. http://dx.doi.org/10.1109/ecrts.2013.32.
Texte intégralMiletto, Marcelo Cogo, et Lucas Schnorr. « OpenMP and StarPU Abreast : the Impact of Runtime in Task-Based Block QR Factorization Performance ». Dans XX Simpósio em Sistemas Computacionais de Alto Desempenho. Sociedade Brasileira de Computação, 2019. http://dx.doi.org/10.5753/wscad.2019.8654.
Texte intégralBattre, Dominic, Matthias Hovestadt, Bjorn Lohrmann, Alexander Stanik et Daniel Warneke. « Detecting bottlenecks in parallel DAG-based data flow programs ». Dans 2010 3rd Workshop on Many-Task Computing on Grids and Supercomputers (MTAGS). IEEE, 2010. http://dx.doi.org/10.1109/mtags.2010.5699429.
Texte intégralAriffin, Wan Nor Munirah, Nor Azrita Mohd Amin, Shazirawati Mohd Puzi, Hafiz Masran et Mohd Mustafa Albakri Abdullah. « Transformation of DCG onto DAG for task assignment problem ». Dans 1ST JOINT INTERNATIONAL CONFERENCE ON MATHEMATICS, STATISTICS AND ENGINEERING (J-CoMSE 2021) : J-COMSE 2021 CONFERENCE PROCEEDING. AIP Publishing, 2022. http://dx.doi.org/10.1063/5.0078955.
Texte intégralChen, Nan, Shuai Zhao, Ian Gray, Alan Burns, Siyuan Ji et Wanli Chang. « Precise Response Time Analysis for Multiple DAG Tasks with Intra-task Priority Assignment ». Dans 2023 IEEE 29th Real-Time and Embedded Technology and Applications Symposium (RTAS). IEEE, 2023. http://dx.doi.org/10.1109/rtas58335.2023.00021.
Texte intégralLan, Tian, Ziyue Li, Zhishuai Li, Lei Bai, Man Li, Fugee Tsung, Wolfgang Ketter, Rui Zhao et Chen Zhang. « MM-DAG : Multi-task DAG Learning for Multi-modal Data - with Application for Traffic Congestion Analysis ». Dans KDD '23 : The 29th ACM SIGKDD Conference on Knowledge Discovery and Data Mining. New York, NY, USA : ACM, 2023. http://dx.doi.org/10.1145/3580305.3599436.
Texte intégralRapports d'organisations sur le sujet "DAG task"
Edwards, Harold C., et Daniel Alejandro Ibanez. Kokkos' Task DAG Capabilities. Office of Scientific and Technical Information (OSTI), septembre 2017. http://dx.doi.org/10.2172/1398234.
Texte intégralVera, Jose, et Ken Evans. PR186-203600-Z01 Impact of Drag Reducing Agents on Corrosion Management. Chantilly, Virginia : Pipeline Research Council International, Inc. (PRCI), octobre 2021. http://dx.doi.org/10.55274/r0012177.
Texte intégralEsch, R. A. Tank characterization 40-day crust burn for double shell Tank 241-AW-101. Office of Scientific and Technical Information (OSTI), mars 1995. http://dx.doi.org/10.2172/33114.
Texte intégralHarris et Vaze. PR-185-0351-R05 Welding for Small to Medium Diameter Gas Pipelines - Real-Time Quality Monitoring. Chantilly, Virginia : Pipeline Research Council International, Inc. (PRCI), avril 2006. http://dx.doi.org/10.55274/r0011071.
Texte intégralRice, A. D. 216-Day report for Tank 241-C-111, cores 58 and 59. Office of Scientific and Technical Information (OSTI), décembre 1994. http://dx.doi.org/10.2172/39609.
Texte intégralBannochie, C. Results of Preliminary Hg Speciation Testing on 4Q14 Tank 50, 1Q15 Tank 50, and SRNL 14-Day TCLP Leachate. Office of Scientific and Technical Information (OSTI), avril 2015. http://dx.doi.org/10.2172/1177484.
Texte intégralRosato-Scott, Claire, Dani J. Barrington, Amita Bhakta, Sarah J. House, Islay Mactaggart et Jane Wilbur. Incontinence : We Need to Talk About Leaks. Institute of Development Studies (IDS), octobre 2020. http://dx.doi.org/10.19088/slh.2020.005.
Texte intégralRosato-Scott, Claire, Dani J. Barrington, Amita Bhakta, Sarah J. House, Islay Mactaggart et Jane Wilbur. Incontinence : We Need to Talk About Leaks. Institute of Development Studies (IDS), octobre 2020. http://dx.doi.org/10.19088/slh.2020.011.
Texte intégralBell, K. E. 45-Day safety screening for Tank 241-B-102 auger samples, riser 1. Office of Scientific and Technical Information (OSTI), décembre 1994. http://dx.doi.org/10.2172/10105388.
Texte intégralMiller, G. L. 45-Day safety screening report for grab samples from Tank 241-AP-107. Office of Scientific and Technical Information (OSTI), mars 1995. http://dx.doi.org/10.2172/41316.
Texte intégral