Relevant bibliographies by topics / DAG task

Academic literature on the topic 'DAG task'

Author: Grafiati
Published: 25 May 2024

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Contents

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'DAG task.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "DAG task"

1

Liu, Zhiguo, Luxi Zhang, Lin Wang, Xiaoqi Dong, and Junlin Rong. "Research on Multi-DAG Satellite Network Task Scheduling Algorithm Based on Cache-Composite Priority." Electronics 13, no. 4 (February 15, 2024): 763. http://dx.doi.org/10.3390/electronics13040763.

Full text
Abstract:
The problem of multiple DAGs sharing satellite constellation resources has gradually attracted widespread attention. Due to the limited computing resources and energy consumption of satellite networks, it is necessary to formulate a reasonable multi-DAG task scheduling scheme to ensure the fairness of each workflow under the premise of considering latency and energy consumption. Therefore, in this paper, we propose a multi-DAG satellite network task scheduling algorithm based on cache-composite priority under the Software-Defined Networking satellite network architecture. The basic idea of this algorithm lies in the DAG selection phase, where not only are task priorities computed but also the concept of fair scheduling is introduced, so as to prevent the excessively delayed scheduling of low-priority DAG tasks. In addition, the concept of public subtasks is introduced to reduce the system overhead caused by repetitive tasks. The experimental results show that the hybrid scheduling strategy proposed in this paper can meet the demand of DAG scheduling and improve the degree of task completion while effectively reducing the task latency and energy consumption.
APA, Harvard, Vancouver, ISO, and other styles
2

Zhao, Yao, Jian Dong, Hongwei Liu, Jin Wu, and Yanxin Liu. "Performance Improvement of DAG-Aware Task Scheduling Algorithms with Efficient Cache Management in Spark." Electronics 10, no. 16 (August 4, 2021): 1874. http://dx.doi.org/10.3390/electronics10161874.

Full text
Abstract:
Directed acyclic graph (DAG)-aware task scheduling algorithms have been studied extensively in recent years, and these algorithms have achieved significant performance improvements in data-parallel analytic platforms. However, current DAG-aware task scheduling algorithms, among which HEFT and GRAPHENE are notable, pay little attention to the cache management policy, which plays a vital role in in-memory data-parallel systems such as Spark. Cache management policies that are designed for Spark exhibit poor performance in DAG-aware task-scheduling algorithms, which leads to cache misses and performance degradation. In this study, we propose a new cache management policy known as Long-Running Stage Set First (LSF), which makes full use of the task dependencies to optimize the cache management performance in DAG-aware scheduling algorithms. LSF calculates the caching and prefetching priorities of resilient distributed datasets according to their unprocessed workloads and significance in parallel scheduling, which are key factors in DAG-aware scheduling algorithms. Moreover, we present a cache-aware task scheduling algorithm based on LSF to reduce the resource fragmentation in computing. Experiments demonstrate that, compared to DAG-aware scheduling algorithms with LRU and MRD, the same algorithms with LSF improve the JCT by up to 42% and 30%, respectively. The proposed cache-aware scheduling algorithm also exhibits about 12% reduction in the average job completion time compared to GRAPHENE with LSF.
APA, Harvard, Vancouver, ISO, and other styles
3

Cai, Lingfeng, Xianglin Wei, Changyou Xing, Xia Zou, Guomin Zhang, and Xiulei Wang. "Failure-resilient DAG task scheduling in edge computing." Computer Networks 198 (October 2021): 108361. http://dx.doi.org/10.1016/j.comnet.2021.108361.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Jiang, Yuyi, Zhiqing Shao, Yi Guo, Huanhuan Zhang, and 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.

Full text
Abstract:
An efficient DAG task scheduling is crucial for leveraging the performance potential of a heterogeneous system and finding a schedule that minimizes themakespan(i.e., the total execution time) of a DAG is known to be NP-complete. A recently proposed metaheuristic method, Chemical Reaction Optimization (CRO), demonstrates its capability for solving NP-complete optimization problems. This paper develops an algorithm named Double-Reaction-Structured Chemical Reaction Optimization (DRSCRO) for DAG scheduling on heterogeneous systems, which modifies the conventional CRO framework and incorporates CRO with the variable neighborhood search (VNS) method. DRSCRO has two reaction phases for super molecule selection and global optimization, respectively. In the molecule selection phase, the CRO as a metaheuristic algorithm is adopted to obtain a super molecule for accelerating convergence. For promoting the intensification capability, in the global optimization phase, the VNS algorithm with a new processor selection model is used as the initialization under the consideration of scheduling order and processor assignment, and the load balance neighborhood structure of VNS is also utilized in the ineffective reaction operator. The experimental results verify the effectiveness and efficiency of DRSCRO in terms ofmakespanand convergence rate.
APA, Harvard, Vancouver, ISO, and other styles
5

Vucha, Mahendra, and 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.

Full text
Abstract:
Modern embedded systems are being modeled as Reconfigurable High Speed Computing System (RHSCS) where Reconfigurable Hardware, that is, Field Programmable Gate Array (FPGA), and softcore processors configured on FPGA act as computing elements. As system complexity increases, efficient task distribution methodologies are essential to obtain high performance. A dynamic task distribution methodology based on Minimum Laxity First (MLF) policy (DTD-MLF) distributes the tasks of an application dynamically onto RHSCS and utilizes available RHSCS resources effectively. The DTD-MLF methodology takes the advantage of runtime design parameters of an application represented as DAG and considers the attributes of tasks in DAG and computing resources to distribute the tasks of an application onto RHSCS. In this paper, we have described the DTD-MLF model and verified its effectiveness by distributing some of real life benchmark applications onto RHSCS configured on Virtex-5 FPGA device. Some benchmark applications are represented as DAG and are distributed to the resources of RHSCS based on DTD-MLF model. The performance of the MLF based dynamic task distribution methodology is compared with static task distribution methodology. The comparison shows that the dynamic task distribution model with MLF criteria outperforms the static task distribution techniques in terms of schedule length and effective utilization of available RHSCS resources.
APA, Harvard, Vancouver, ISO, and other styles
6

Kaur, Mandeep, and Balwinder Singh Sohi. "Efficient DAG Task Scheduling Algorithm for Wireless Sensor Networks." International Journal of Computer Sciences and Engineering 6, no. 12 (December 31, 2018): 735–43. http://dx.doi.org/10.26438/ijcse/v6i12.735743.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Zhai, Wenzheng, Yue-Li Hu, and Feng Ran. "CQPSO scheduling algorithm for heterogeneous multi-core DAG task model." Modern Physics Letters B 31, no. 19-21 (July 27, 2017): 1740050. http://dx.doi.org/10.1142/s0217984917400504.

Full text
Abstract:
Efficient task scheduling is critical to achieve high performance in a heterogeneous multi-core computing environment. The paper focuses on the heterogeneous multi-core directed acyclic graph (DAG) task model and proposes a novel task scheduling method based on an improved chaotic quantum-behaved particle swarm optimization (CQPSO) algorithm. A task priority scheduling list was built. A processor with minimum cumulative earliest finish time (EFT) was acted as the object of the first task assignment. The task precedence relationships were satisfied and the total execution time of all tasks was minimized. The experimental results show that the proposed algorithm has the advantage of optimization abilities, simple and feasible, fast convergence, and can be applied to the task scheduling optimization for other heterogeneous and distributed environment.
APA, Harvard, Vancouver, ISO, and other styles
8

Voudouris, Petros, Per Stenström, and Risat Pathan. "Federated Scheduling of Sporadic DAGs on Unrelated Multiprocessors." ACM Transactions on Embedded Computing Systems 20, no. 5s (October 31, 2021): 1–25. http://dx.doi.org/10.1145/3477018.

Full text
Abstract:
This paper presents a federated scheduling algorithm for implicit-deadline sporadic DAGs that execute on an unrelated heterogeneous multiprocessor platform. We consider a global work-conserving scheduler to execute a single DAG exclusively on a subset of the unrelated processors. Formal schedulability analysis to find the makespan of a DAG on its dedicated subset of the processors is proposed. The problem of determining each subset of dedicated unrelated processors for each DAG such that the DAG meets its deadline (i.e., designing the federated scheduling algorithm) is tackled by proposing a novel processors-to-task assignment heuristic using a new concept called processor value . Empirical evaluation is presented to show the effectiveness of our approach.
APA, Harvard, Vancouver, ISO, and other styles
9

Singh, Manjeet, and 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 (November 30, 2022): 40–46. http://dx.doi.org/10.17762/ijritcc.v10i11.5778.

Full text
Abstract:
In large scale environments, scheduling presents a significant challenge because it is an NP-hard problem. There are basically two types of task in execution- dependent task and independent task. The execution of dependent task must follow a strict order because output of one activity is typically the input of another. In this paper, a reliable fault tolerant approach is proposed for scheduling of dependent task in large scale computing environments. The workflow of dependent task is represented with the help of a DAG (directed acyclic graph). The proposed methodology is evaluated over various parameters by applying it in a large scale computing environment- ‘grid computing’. Grid computing is a high performance computing for solving complex, large and data intensive problems in various fields. The result analysis shows that the proposed DAG based reliable scheduling (DBRS) approach increases the performance of system by decreasing the makespan, number of failures and increasing performance improvement ratio (PIR).
APA, Harvard, Vancouver, ISO, and other styles
10

Taufer, Michela, and 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 (July 28, 2016): 19–31. http://dx.doi.org/10.1177/1094342015594518.

Full text
Abstract:
The problem of achieving high-performance cost-effectively in cloud computing is challenging when workflows have Directed Acyclic Graph (DAG)-structured inter-task dependencies. We study this problem within single cloud instances and provide empirical evidence that the static Area-Oriented DAG-Scheduling (AO) paradigm, which predetermines the order for executing a DAG’s tasks, provides both high performance and cost effectiveness. AO produces schedules in a platform-oblivious manner; it ignores the performance characteristics of the platform’s resources and focuses only on the dependency structure of the workflow. Specifically, AO’s schedules strive to enhance the rate of rendering tasks eligible for execution. Using an archive of diverse DAG-structured workflows, we experimentally compare AO with a variety of competing DAG-schedulers: (a) the static locally optimal DAG-scheduler (LO), which, like AO, is static and platform-oblivious but chooses its DAG-ordering based on tasks’ outdegrees; and (b) five dynamic versions of static schedulers (including AO and LO), each of which can violate its parent static scheduler’s prescribed task orders to avoid stalling. Our results provide evidence of AO’s supremacy as compared with LO and its essential equivalence to dynamic-AO: neither competitor yields higher performance at an lower cost than AO does. Two aspects of these results are notable. Firstly, AO is platform-oblivious, whereas dynamic-AO is intensely platform-sensitive; one would expect platform sensitivity to enhance performance. Secondly, AO outperforms LO by an order of magnitude, together with lower costs; one would not expect such a performance gap.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "DAG task"

1

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.

Full text
Abstract:
I moderni sistemi cyber-fisici embedded integrano diverse funzionalità complesse che sono soggette a stringenti vincoli temporali. Purtroppo, i tradizionali modelli di task sequenziali e le soluzioni per uniprocessori non possono essere applicati in questo contesto: diventa necessario un modello più espressivo. In questo scenario, il Directed Acyclic Graph (DAG) è un modello adatto a esprimere la complessità e il parallelismo dei task di questo tipo di sistemi. Negli ultimi anni sono stati proposti diversi metodi, con diverse configurazioni, per risolvere il problema della schedulabilità di applicazioni con DAG tasks. Tuttavia, rimangono ancora molti problemi aperti. Oltre alla schedulabilità, aspetti come la freschezza dei dati o la reazione a un evento sono cruciali per le prestazioni di questo tipo di sistemi. Per esempio, una tipica applicazione nel campo automobilistico è costituita dal rilevamento dell'ambiente, dalla pianificazione e dall'attuazione basata sui dati elaborati. La latenza del controllo end-to-end è quindi decisiva, e può diventare molto complicata in scenari reali. Questa tesi rappresenta uno sforzo in entrambe le direzioni: (i) la schedulabilità di DAG tasks su un multiprocessore, e (ii) la supervisione della latenza end-to-end per task a multi-frequenza. Per il primo problema, viene presentata un'indagine sullo stato dell'arte del modello di task a grafico aciclico diretto, con particolare attenzione ai test più efficaci, facili da implementare e da adottare. Per quanto riguarda il secondo, viene proposto un metodo per convertire un task-set di DAG a multi-frequenza con vincoli temporali in un DAG a singola frequenza che ottimizza la schedulabilità e la latenza end-to-end.
Modern 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.
APA, Harvard, Vancouver, ISO, and other styles
2

Chieregato, Federico. "Modelling task execution time in Directed Acyclic Graphs for efficient distributed management." Master's thesis, Alma Mater Studiorum - Università di Bologna, 2022.

Find full text
Abstract:
In this thesis, has been shown a framework that predicts the execution time of tasks in Directed Acyclic Graphs (DAG), each task is the smallest unit of work that executes a function over a set of inputs and in this scenario represents a vertex in a DAG. This thesis includes an implementation for extracting profiling information from Apache Spark, as well, an evaluation of the framework for the Spark decision support benchmark TPC-DS and an in-house and completely different DAG runtime system for real-world DAGS, involving computational quantum chemistry applications. Speeding up the execution in Spark or other workflows is an important problem for many real-time applications; since it is impractical to generate a predictive model that considers the actual values of the inputs to tasks, has been explored the use of Surrogates as the number of parents and the mean parent duration of a task. For this reason, this solution takes the name of PRODIGIOUS, Performance modelling of DAGs via surrogate features. Since the duration of the tasks is a float value, have been studied different regression algorithms, tuning the Hyperparameters through GridSearchCV. The main objective of PRODIGIOUS concern, not only to understand if the use of surrogates instead of actual inputs is enough to predict the execution time of tasks of the same DAG type, but also if it is possible to predict the execution time of tasks of different DAG type creating so a DAG agnostic framework that could help scientist and computer engineer making more efficient their workflow. Others agnostic feature chosen were, the core for each task, the RAM of the benchmark, the data access type, and the number of executors.
APA, Harvard, Vancouver, ISO, and other styles
3

Mazouzi, Houssemeddine. "Algorithmes pour le déchargement de tâches sur serveurs de périphérie." Thesis, Paris 13, 2019. http://www.theses.fr/2019PA131076.

Full text
Abstract:
Le déchargement de calculs est l’une des solutions les plus prometteuses pour surmonter le manque d e ressources au niveau des terminaux mobiles. Elle permet l’exécution d’une partie ou de la totalité d’une application mobile dans le cloud. L’objectif est d’améliorer les temps d’exécution et de réduire la consommation énergétique. Malheureusement, le cloud est généralement éloignés des équipements terminaux. Ce qui rend cette approche souffrir de délais importants et fluctuants. Cela est particulièrement problématique pour certaines applications pour lesquelles un temps de réponse réduit est nécessaire. Pour réduire ce délai d’accès, l’une des approches émergentes est de pousser le Cloud vers la bordure du réseau. Cette proximité permet aux applications mobiles de décharger leurs tâches et données vers un Cloud “local” ou “Edge Cloud”.Dans cette thèse, nous nous concentrons sur le déchargement de calculs dans une architecture de type mobiles (Mobile Edge Computing – MEC), composée de plusieurs serveurs de périphérie. Notre objectif est d’explorer de nouvelles stratégies de déchargement efficaces afin d’améliorer les performances des applications tant du point de vue délais de calcul que consommation énergétique, tout en garantissant les contraintes de temps d’exécution des applications. Notre première contribution est une nouvelle stratégie de déchargement sur plusieurs serveurs de périphérie. Nous proposons par la suite une extension de cette stratégie en incluant également le Cloud. Nous évaluons ces stratégies tant du point de vue théorique que pratique avec l’implémentation d’un middleware de déchargement. Finalement, nous proposons une nouvelle approche élastique dans le cas d’applications multitâches caractérisées par un graphe de dépendances entre les tâches
Computation 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
APA, Harvard, Vancouver, ISO, and other styles
4

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.

Full text
Abstract:
L'intégration de nouvelles fonctionnalités augmente la complexité des systèmes temps réel , alors que chaque fonctionnalité peut imposer des contraintes de précédences entre les tâches. De plus, la prévalence des multicœurs peut créer l'illusion d'une capacité de calcul élevée. Cependant, cette capacité n'est pas exploitable dans les systèmes critiques en raison de la variabilité des temps d'exécution causé par les nouvelles architecture matérielle qui améliorent le comportement moyen mais pas le pire cas. Cette difficulté s'ajoute à l'existence d'anomalies d'ordonnancement pour les systèmes multicœurs. Dans cette thèse, nous considérons l'ordonnancement partitionné des graphes de précédence. La variabilité des temps d'exécution est décrite par des distributions de probabilité. Nous proposons une Analyse des Temps de Réponse (ATR) basée sur des équations itératives et des opérateurs probabilistes pour des distributions indépendantes. Pour les distributions dépendantes, nous les modélisons par des réseau bayésien. Nous utilisons également la représentation de C-espace et la classification SVM pour estimer la probabilité d'ordonnancabilité. De plus, nous fournissons des techniques de partitionnement et définition des priorités de manière à augmenter le parallélisme. Nous réduisons aussi la complexité de l'analyse en réduisant la taille du graphe sans modifier sa structure
The 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
APA, Harvard, Vancouver, ISO, and other styles
5

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

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

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.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

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

Full text
Abstract:
This diploma thesis deals with automatic task processing, especially with automatic processing of forms on web pages. The thesis throws light on the theoretical and practical matter. At the beginning of this thesis are described the reasons, why this topic were chosen. Also there are mentioned the possible uses of application, realized on this principles. Foremost simplification of retrieval of data with standardized (but general) format from common users, which could be used for data mining process. For creating this kind of application is described concepts of its implementation, including description of problematic parts and their possible solution. In this part is mentioned algorithm, which deals with security limitation of current web browsers -- so-called cross-site scripting. One part of this thesis is description of current commercial and non-commercial solutions, which at least partly fulfills the demands of the application. At the conclusion is analyzed functionality of created application and proposed advancements and improvements for creating new versions of application
APA, Harvard, Vancouver, ISO, and other styles
8

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

Full text
Abstract:
En oro för svenska elevers sjunkande skolresultat har gjorts gällande. Då grunden för läsning läggs i förskolan har förtydliganden av mål och riktlinjer för barns språkliga utveckling gjorts i den nyligen reviderade läroplanen för förskolan. Förskolans uppdrag är att varje barns språkutveckling skall stimuleras i verksamheten utifrån deras olika förutsättningar och behov. Mot bakgrund av detta har jag genomfört en kvalitativ studie kring hur den sociala och fysiska språkmiljön kan se ut kring ett enskilt barn under en dag i förskolan verksamhet, samt hur och när dennes språkutveckling då stimuleras. Empirin har samlats in via observationer och har sedan analyserats utifrån aktuell forskning på området med avstamp i Vygotskijs sociokulturella teori kring barns kognitiva utveckling. Någon konkret språklig stimulans utifrån den fysiska språkmiljön går av resultatet inte att påvisa. Den sociala språkmiljön kring barnet har under dagen för studien utgjorts av samtal, fri lek, högläsning och TAKK (tecken som alternativ och kompletterande kommunikation). Stimulans av så väl fonologiska, semantiska, grammatiska som pragmatiska aspekter av barnets språkutveckling går under dagen att utläsa. Undersökningens resultat visar på att enskilda barns språkliga stimulans till stor del är beroende av kompetenta och engagerade vuxna med förmåga att tillsammans med barnen skapa lustfyllda och kreativa miljöer.
APA, Harvard, Vancouver, ISO, and other styles
9

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

Full text
Abstract:
This work deals with the design and implementation of a system for parallel execution of tasks in the Knowledge Technology Research Group. The goal is to create a web application that allows to control their processing and monitor runs of these tasks including the use of system resources. The work first analyzes the current method of parallel data processing and the shortcomings of this solution. Then the work describes the existing tools including the problems that their test deployment revealed. Based on this knowledge, the requirements for a new application are defined and the design of the entire system is created. After that the selected parts of implementation and the way of the whole system testing is described together with the comparison of the efficiency with the original system.
APA, Harvard, Vancouver, ISO, and other styles
10

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

Full text
Abstract:
Inhibitory control is vital to typical development and matures rapidly throughout early childhood. Inhibitory control deficits are seen in both autism spectrum disorders and attention-deficit/hyperactivity disorder and, along with other executive functions, inhibitory control contributes to school success. The tasks used to measure and stress these skills in children have not been fully explored. Even given the cognitive development levels of young children, the current inhibitory control tasks for preschoolers are not completely comparable to the tasks used with adults. For my thesis study, I added a mixed condition to the day/night inhibitory control task in preschool children using methodological design features from the Dimensional Change Card Sort (DCCS) Task. This addition allowed the day/night task to serve as a better analogue to the Stroop task, which is an inhibitory control task commonly used with adults. In addition, electroencephalogram (EEG) illuminated the neural patterns of the task in children at age four. This study demonstrated that the borders condition of the day/night task is an appropriate executive function task that can be used with preschool aged children.
Master of Science
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "DAG task"

1

Illinois. Governor's Task Force on Day Care. Governor's Task Force on Day Care: Final report. [Springfield, Ill.]: The Task Force, 1987.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
2

Casofa, Fachmy. Tak boleh lelah dan kalah. Solo: Metagraf, 2014.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
3

Bubílková, Zuzana. Co týden (ne)dal. Praha: Nakl. Lidové noviny, 1993.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
4

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

Find full text
APA, Harvard, Vancouver, ISO, and other styles
5

Child care: A workforce issue : report of the Secretary's Task Force. [Washington, D.C.?]: U.S. Department of Labor, 1988.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
6

W, Awdry. 3-dai no kikansha. Tōkyō: Popurasha, 2005.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
7

Spirn, Michele. The Know-Nothings talk turkey. New York: HarperCollins, 2000.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
8

Meishun, Jin, ed. Han yu jian dan shuo: Korean easy talk. Taibei Xian Zhonghe Shi: Tong yi chu ban she you xian gong si, 2005.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
9

H, Molgard Max, ed. Straight talk about gospel principles. Salt Lake City, Utah: Bookcraft, 1994.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
10

Paulsen, Jan. Let's talk: Conversations with young Adventists about their church. Nampa, Idaho: Pacific Press Pub. Association, 2013.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Book chapters on the topic "DAG task"

1

Chen, Chen, and Jie Zhu. "DAG-Based Task Scheduling Optimization in Heterogeneous Distributed Systems." In 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.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Rajak, Nidhi, and Diwakar Shukla. "An Efficient Task Scheduling Strategy for DAG in Cloud Computing Environment." In Advances in Intelligent Systems and Computing, 273–89. Singapore: Springer Singapore, 2020. http://dx.doi.org/10.1007/978-981-15-1518-7_23.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Shu, Lang, Guanyan Pan, Bei Wang, Wenbing Peng, Minhui Fang, Yifei Chen, Fanding Huang, Songchen Li, and Yuxia Cheng. "Smart DAG Task Scheduling Based on MCTS Method of Multi-strategy Learning." In 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.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Zhao, Tianqi, Mingyue Zhao, Yue Shi, and Kuangyu Zheng. "SPath: An Energy-Efficient DAG Task Offloading Scheme with Space-Ground Cooperative Computing." In Lecture Notes in Computer Science, 499–510. Singapore: Springer Nature Singapore, 2023. http://dx.doi.org/10.1007/978-981-99-2233-8_36.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Tian, Yuan, Füsun Özgüner, and Eylem Ekici. "Comparison of Hyper-DAG Based Task Mapping and Scheduling Heuristics for Wireless Sensor Networks." In Computer and Information Sciences - ISCIS 2005, 74–83. Berlin, Heidelberg: Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/11569596_10.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Lasko, Wolf W., and Lara M. Lasko. "Das Wunder der Kommunikation." In Charisma-Talk, 23–24. Wiesbaden: Springer Fachmedien Wiesbaden, 2013. http://dx.doi.org/10.1007/978-3-658-02984-5_12.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Lasko, Wolf W., and Lara M. Lasko. "Das Energieecho des Handelns." In Charisma-Talk, 3–4. Wiesbaden: Springer Fachmedien Wiesbaden, 2013. http://dx.doi.org/10.1007/978-3-658-02984-5_2.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Baruah, Sanjoy, Marko Bertogna, and Giorgio Buttazzo. "The Sporadic DAG Tasks Model." In Embedded Systems, 191–204. Cham: Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-08696-5_21.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Beetz, Maud. "Ohne Small Talk kein Business Talk." In Der Knigge für das Bankgeschäft, 119–40. Wiesbaden: Gabler, 2009. http://dx.doi.org/10.1007/978-3-8349-8200-1_9.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Lasko, Wolf W. "Das Gespräch beleben." In Small Talk und Karriere, 113–54. Wiesbaden: Gabler Verlag, 2001. http://dx.doi.org/10.1007/978-3-322-87156-5_2.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "DAG task"

1

Li, Xiang, Mustafa Abdallah, Shikhar Suryavansh, Mung Chiang, Kwang Taik Kim, and Saurabh Bagchi. "DAG-based Task Orchestration for Edge Computing." In 2022 41st International Symposium on Reliable Distributed Systems (SRDS). IEEE, 2022. http://dx.doi.org/10.1109/srds55811.2022.00013.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Baruah, Sanjoy. "Federated Scheduling of Sporadic DAG Task Systems." In 2015 IEEE International Parallel and Distributed Processing Symposium (IPDPS). IEEE, 2015. http://dx.doi.org/10.1109/ipdps.2015.33.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Shang, Ying, Jinglei Li, and Xiguang Wu. "DAG-based Task Scheduling in Mobile Edge Computing." In 2020 7th International Conference on Information Science and Control Engineering (ICISCE). IEEE, 2020. http://dx.doi.org/10.1109/icisce50968.2020.00095.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Peccerillo, Biagio, and Sandro Bartolini. "Task-DAG Support in Single-Source PHAST Library." In the 10th International Workshop. New York, New York, USA: ACM Press, 2019. http://dx.doi.org/10.1145/3303084.3309496.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Bonifaci, Vincenzo, Alberto Marchetti-Spaccamela, Sebastian Stiller, and Andreas Wiese. "Feasibility Analysis in the Sporadic DAG Task Model." In 2013 25th Euromicro Conference on Real-Time Systems (ECRTS). IEEE, 2013. http://dx.doi.org/10.1109/ecrts.2013.32.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Miletto, Marcelo Cogo, and Lucas Schnorr. "OpenMP and StarPU Abreast: the Impact of Runtime in Task-Based Block QR Factorization Performance." In XX Simpósio em Sistemas Computacionais de Alto Desempenho. Sociedade Brasileira de Computação, 2019. http://dx.doi.org/10.5753/wscad.2019.8654.

Full text
Abstract:
Directed Acyclic Graph (DAG) is a high-level abstraction to describe the activities of parallel applications. A DAG contains tasks (nodes) and dependencies (edges) in the task-based programming paradigm. Application performance depends on the choices of the runtime system. Our work intends to evaluate and compare the performance of three different runtime systems, GCC/libgomp, LLVM/libomp, and StarPU for a task-based dense block QR factorization. The obtained results show that while GCC/libgomp achieves up to 5.4% better performance in the best case, it has scalability problems for finegrain problems with large DAGs. LLVM/libomp and StarPU are more scalable, and StarPU is much faster in task creation and submission than the other runtimes.
APA, Harvard, Vancouver, ISO, and other styles
7

Battre, Dominic, Matthias Hovestadt, Bjorn Lohrmann, Alexander Stanik, and Daniel Warneke. "Detecting bottlenecks in parallel DAG-based data flow programs." In 2010 3rd Workshop on Many-Task Computing on Grids and Supercomputers (MTAGS). IEEE, 2010. http://dx.doi.org/10.1109/mtags.2010.5699429.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Ariffin, Wan Nor Munirah, Nor Azrita Mohd Amin, Shazirawati Mohd Puzi, Hafiz Masran, and Mohd Mustafa Albakri Abdullah. "Transformation of DCG onto DAG for task assignment problem." In 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.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Chen, Nan, Shuai Zhao, Ian Gray, Alan Burns, Siyuan Ji, and Wanli Chang. "Precise Response Time Analysis for Multiple DAG Tasks with Intra-task Priority Assignment." In 2023 IEEE 29th Real-Time and Embedded Technology and Applications Symposium (RTAS). IEEE, 2023. http://dx.doi.org/10.1109/rtas58335.2023.00021.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Lan, Tian, Ziyue Li, Zhishuai Li, Lei Bai, Man Li, Fugee Tsung, Wolfgang Ketter, Rui Zhao, and Chen Zhang. "MM-DAG: Multi-task DAG Learning for Multi-modal Data - with Application for Traffic Congestion Analysis." In 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.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "DAG task"

1

Edwards, Harold C., and Daniel Alejandro Ibanez. Kokkos' Task DAG Capabilities. Office of Scientific and Technical Information (OSTI), September 2017. http://dx.doi.org/10.2172/1398234.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Vera, Jose, and Ken Evans. PR186-203600-Z01 Impact of Drag Reducing Agents on Corrosion Management. Chantilly, Virginia: Pipeline Research Council International, Inc. (PRCI), October 2021. http://dx.doi.org/10.55274/r0012177.

Full text
Abstract:
The purpose of this research was to understand the potential impact of drag reducing agents (DRA) on internal corrosion of liquid hydrocarbon pipelines. The first task of this project included a comprehensive review of literature and knowledge, both in public domain and from industry experience, on the effect of DRA on water and solid transport in liquid hydrocarbons, and possible interactions with other performance chemicals typically used in the oil and gas industry. This was the basis for defining the final bench test methodology and test matrix to be performed in the second task. A novel bench-top apparatus was designed based on a vertical Couette cell approach, and a test methodology was successfully implemented to evaluate the potential effect(s) of DRA on water accumulation and localized corrosion at the oil/water interface. A test matrix was conducted with two DRAs (a water based and an oil based) and two corrosion inhibitors (a water soluble and an oil soluble) at a given test condition (3.5% NaCl saturated with 97%CO2/3%O2, pH ~6 at 80 oF). There is a related webinar.
APA, Harvard, Vancouver, ISO, and other styles
3

Esch, R. A. Tank characterization 40-day crust burn for double shell Tank 241-AW-101. Office of Scientific and Technical Information (OSTI), March 1995. http://dx.doi.org/10.2172/33114.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Harris and 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), April 2006. http://dx.doi.org/10.55274/r0011071.

Full text
Abstract:
A literature review was conducted to establish and highlight the state of the art for real-time quality monitoring (RTQM). Work in this task advanced the state of the art in terms of achieving constant welding power input at constant contact tip-to-workpiece distance (CTWD), thus achieving constant welding heat input at constant welding travel speed. This was coupled with high speed on-board DAQ to achieve RTQM, in these terms.
APA, Harvard, Vancouver, ISO, and other styles
5

Rice, A. D. 216-Day report for Tank 241-C-111, cores 58 and 59. Office of Scientific and Technical Information (OSTI), December 1994. http://dx.doi.org/10.2172/39609.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Bannochie, 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), April 2015. http://dx.doi.org/10.2172/1177484.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Rosato-Scott, Claire, Dani J. Barrington, Amita Bhakta, Sarah J. House, Islay Mactaggart, and Jane Wilbur. Incontinence: We Need to Talk About Leaks. Institute of Development Studies (IDS), October 2020. http://dx.doi.org/10.19088/slh.2020.005.

Full text
Abstract:
Anyone, of any gender, at any age, can leak urine or faeces. What would you do if it happened to you? Imagine if you’d woken up this morning and you’d wet the bed. What would you do? Have a wash, put on clean clothes, change the bedding and put it in a washing machine? You may go to the shop and buy an incontinence pad. And perhaps if you knew that there was help available for leaking urine you’d make an appointment to see a doctor next week and then just carry on with the rest of your day, dignity intact. Now imagine if you’d woken up this morning and you’d wet the bed. But to have a wash, or clean your clothes and bedding, you’d have to walk for an hour to collect water. Imagine you are frightened to walk there alone, the path is steep and you struggle to use the hand pump. Even if you did get water, you don’t have enough soap so the smells would linger anyway. And after all that effort, you have nothing to wear to soak up urine if it happens again. What if you didn’t know that leaking urine was common, and you spent the rest of the day worried about your health and too embarrassed to go to work in case people could tell? What if you were worried that your partner would hit you again for making a mess so you had very little to drink all day for fear of it happening again? What can you do to support people living with incontinence? To start, we need to talk about leaks.
APA, Harvard, Vancouver, ISO, and other styles
8

Rosato-Scott, Claire, Dani J. Barrington, Amita Bhakta, Sarah J. House, Islay Mactaggart, and Jane Wilbur. Incontinence: We Need to Talk About Leaks. Institute of Development Studies (IDS), October 2020. http://dx.doi.org/10.19088/slh.2020.011.

Full text
Abstract:
Anyone, of any gender, at any age, can leak urine or faeces. What would you do if it happened to you? Imagine if you’d woken up this morning and you’d wet the bed. What would you do? Have a wash, put on clean clothes, change the bedding and put it in a washing machine? You may go to the shop and buy an incontinence pad. And perhaps if you knew that there was help available for leaking urine you’d make an appointment to see a doctor next week and then just carry on with the rest of your day, dignity intact. Now imagine if you’d woken up this morning and you’d wet the bed. But to have a wash, or clean your clothes and bedding, you’d have to walk for an hour to collect water. Imagine you are frightened to walk there alone, the path is steep and you struggle to use the hand pump. Even if you did get water, you don’t have enough soap so the smells would linger anyway. And after all that effort, you have nothing to wear to soak up urine if it happens again. What if you didn’t know that leaking urine was common, and you spent the rest of the day worried about your health and too embarrassed to go to work in case people could tell? What if you were worried that your partner would hit you again for making a mess so you had very little to drink all day for fear of it happening again? What can you do to support people living with incontinence? To start, we need to talk about leaks.
APA, Harvard, Vancouver, ISO, and other styles
9

Bell, K. E. 45-Day safety screening for Tank 241-B-102 auger samples, riser 1. Office of Scientific and Technical Information (OSTI), December 1994. http://dx.doi.org/10.2172/10105388.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Miller, G. L. 45-Day safety screening report for grab samples from Tank 241-AP-107. Office of Scientific and Technical Information (OSTI), March 1995. http://dx.doi.org/10.2172/41316.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'DAG task' for particular source types:
Journal articles Dissertations / Theses Books
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography