Littérature scientifique sur le sujet « Batches of task graphs »
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 « Batches of task graphs ».
À 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 "Batches of task graphs"
DIAKITÉ, SÉKOU, LORIS MARCHAL, JEAN-MARC NICOD et LAURENT PHILIPPE. « PRACTICAL STEADY-STATE SCHEDULING FOR TREE-SHAPED TASK GRAPHS ». Parallel Processing Letters 21, no 04 (décembre 2011) : 397–412. http://dx.doi.org/10.1142/s0129626411000291.
Texte intégralWang, Xun, Chaogang Zhang, Ying Zhang, Xiangyu Meng, Zhiyuan Zhang, Xin Shi et Tao Song. « IMGG : Integrating Multiple Single-Cell Datasets through Connected Graphs and Generative Adversarial Networks ». International Journal of Molecular Sciences 23, no 4 (14 février 2022) : 2082. http://dx.doi.org/10.3390/ijms23042082.
Texte intégralWang, Yue, Ruiqi Xu, Xun Jian, Alexander Zhou et Lei Chen. « Towards distributed bitruss decomposition on bipartite graphs ». Proceedings of the VLDB Endowment 15, no 9 (mai 2022) : 1889–901. http://dx.doi.org/10.14778/3538598.3538610.
Texte intégralJia, Haozhang. « Graph sampling based deep metric learning for cross-view geo-localization ». Journal of Physics : Conference Series 2711, no 1 (1 février 2024) : 012004. http://dx.doi.org/10.1088/1742-6596/2711/1/012004.
Texte intégralAngriman, Eugenio, Michał Boroń et Henning Meyerhenke. « A Batch-dynamic Suitor Algorithm for Approximating Maximum Weighted Matching ». ACM Journal of Experimental Algorithmics 27 (31 décembre 2022) : 1–41. http://dx.doi.org/10.1145/3529228.
Texte intégralZhang, Xin, Yanyan Shen, Yingxia Shao et Lei Chen. « DUCATI : A Dual-Cache Training System for Graph Neural Networks on Giant Graphs with the GPU ». Proceedings of the ACM on Management of Data 1, no 2 (13 juin 2023) : 1–24. http://dx.doi.org/10.1145/3589311.
Texte intégralVo, Tham, et Phuc Do. « GOW-Stream : A novel approach of graph-of-words based mixture model for semantic-enhanced text stream clustering ». Intelligent Data Analysis 25, no 5 (15 septembre 2021) : 1211–31. http://dx.doi.org/10.3233/ida-205443.
Texte intégralDa San Martino, Giovanni, Alessandro Sperduti, Fabio Aiolli et Alessandro Moschitti. « Efficient Online Learning for Mapping Kernels on Linguistic Structures ». Proceedings of the AAAI Conference on Artificial Intelligence 33 (17 juillet 2019) : 3421–28. http://dx.doi.org/10.1609/aaai.v33i01.33013421.
Texte intégralLuo, Haoran, Haihong E, Yuhao Yang, Gengxian Zhou, Yikai Guo, Tianyu Yao, Zichen Tang, Xueyuan Lin et Kaiyang Wan. « NQE : N-ary Query Embedding for Complex Query Answering over Hyper-Relational Knowledge Graphs ». Proceedings of the AAAI Conference on Artificial Intelligence 37, no 4 (26 juin 2023) : 4543–51. http://dx.doi.org/10.1609/aaai.v37i4.25576.
Texte intégralAuerbach, Joshua, David F. Bacon, Rachid Guerraoui, Jesper Honig Spring et Jan Vitek. « Flexible task graphs ». ACM SIGPLAN Notices 43, no 7 (27 juin 2008) : 1–11. http://dx.doi.org/10.1145/1379023.1375659.
Texte intégralThèses sur le sujet "Batches of task graphs"
Toch, Lamiel. « Contributions aux techniques d’ordonnancement sur plates-formes parallèles ou distribuées ». Electronic Thesis or Diss., Besançon, 2012. http://www.theses.fr/2012BESA2045.
Texte intégralWorks presented in this document tackle scheduling of parallel applications in either parallel (cluster) or distributed (computing grid) platforms. In our researches we were concentrated on either scheduling of applications modeled by a DAG, directed acyclic graph, for computing grid or scheduling of parallel programs (parallel jobs) represented by a rectangular shape whose the two dimensions are the number of requested processors and the execution time. The researches follow three main topics. The first topic concerns the scheduling of a set of instances of an application for computing grid. The second topic deals with the scheduling of parallel jobs inclusters. The third one tackles the scheduling of parallel jobs in multiprocessor machines. We brought contributions on these three topics. The first contribution under the first topic consists of the advanced experimental study of three algorithms for scheduling a set of instances of an application on a heterogeneous platform without communication costs : a list-based algorithm, a steady-state algorithm and genetic algorithm. Moreover we integrate communications in this genetic algorithm. The second contribution under the second topic is the design of a new technique for scheduling parallel jobs in clusters : job folding which uses virtualization of processors. The third contribution deals with a new technique which comes from statistics and signal cessing applied to scheduling of parallel jobs in a multiprocessor machine. Eventually we givesome works that we carried out but which did not give significant results for scheduling
Dechu, Satish. « Task graphs mapping on to network processors using simulated annealing / ». Available to subscribers only, 2007. http://proquest.umi.com/pqdweb?did=1453188941&sid=15&Fmt=2&clientId=1509&RQT=309&VName=PQD.
Texte intégralNegelspach, Greg L. « Grain size management in repetitive task graphs for multiprocessor computer scheduling ». Thesis, Monterey, Calif. : Springfield, Va. : Naval Postgraduate School ; Available from National Technical Information Service, 1994. http://handle.dtic.mil/100.2/ADA288575.
Texte intégralChieregato, 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égralWitt, Carl Philipp. « Predictive Resource Management for Scientific Workflows ». Doctoral thesis, Humboldt-Universität zu Berlin, 2020. http://dx.doi.org/10.18452/21608.
Texte intégralScientific experiments produce data at unprecedented volumes and resolutions. For the extraction of insights from large sets of raw data, complex analysis workflows are necessary. Scientific workflows enable such data analyses at scale. To achieve scalability, most workflow management systems are designed as an additional layer on top of distributed resource managers, such as batch schedulers or distributed data processing frameworks. However, like distributed resource managers, they do not automatically determine the amount of resources required for executing individual tasks in a workflow. The status quo is that workflow management systems delegate the challenge of estimating resource usage to the user. This limits the performance and ease-of-use of scientific workflow management systems, as users often lack the time, expertise, or incentives to estimate resource usage accurately. This thesis is an investigation of how to learn and predict resource usage during workflow execution. In contrast to prior work, an integrated perspective on prediction and scheduling is taken, which introduces various challenges, such as quantifying the effects of prediction errors on system performance. The main contributions are: 1. A survey of peak memory usage prediction in batch processing environments. It provides an overview of prior machine learning approaches, commonly used features, evaluation metrics, and data sets. 2. A static workflow scheduling method that uses statistical methods to predict which scheduling decisions can be improved. 3. A feedback-based approach to scheduling and predictive resource allocation, which is extensively evaluated using simulation. The results provide insights into the desirable characteristics of scheduling heuristics and prediction models. 4. A prediction model that reduces memory wastage. The design takes into account the asymmetric costs of overestimation and underestimation, as well as follow up costs of prediction errors.
Kasinger, Charles D. « A periodic scheduling heuristic for mapping iterative task graphs onto distributed memory multiprocessors ». Thesis, Monterey, Calif. : Springfield, Va. : Naval Postgraduate School ; Available from National Technical Information Service, 1994. http://handle.dtic.mil/100.2/ADA286047.
Texte intégralKoman, Charles Brian. « A tool for efficient execution and development of repetitive task graphs on a distributed memory multiprocessor ». Thesis, Monterey, Calif. : Springfield, Va. : Naval Postgraduate School ; Available from National Technical Information Service, 1995. http://handle.dtic.mil/100.2/ADA305995.
Texte intégralPop, Ruxandra. « Mapping Concurrent Applications to Multiprocessor Systems with Multithreaded Processors and Network on Chip-Based Interconnections ». Licentiate thesis, Linköpings universitet, Institutionen för datavetenskap, 2011. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-64256.
Texte intégralGurhem, Jérôme. « Paradigmes de programmation répartie et parallèle utilisant des graphes de tâches pour supercalculateurs post-pétascale ». Thesis, Lille, 2021. http://www.theses.fr/2021LILUI005.
Texte intégralSince the middle of the 1990s, message passing libraries are the most used technology to implement parallel and distributed applications. However, they may not be a solution efficient enough on exascale machines since scalability issues will appear due to the increase in computing resources. Task-based programming models can be used, for example, to avoid collective communications along all the resources like reductions, broadcast or gather by transforming them into multiple operations on tasks. Then, these operations can be scheduled by the scheduler to place the data and computations in a way that optimize and reduce the data communications. The main objective of this thesis is to study what must be task-based programming for scientific applications and to propose a specification of such distributed and parallel programming, by experimenting for several simplified representations of important scientific applications for TOTAL, and classical dense and sparse linear methods.During the dissertation, several programming languages and paradigms are studied. Dense linear methods to solve linear systems, sequences of sparse matrix vector product and the Kirchhoff seismic pre-stack depth migration are studied and implemented as task-based applications. A taxonomy, based on several of these languages and paradigms is proposed.Software were developed using these programming models for each simplified application. As a result of these researches, a methodology for parallel task programming is proposed, optimizing data movements, in general, and for targeted scientific applications, in particular
Bouguelia, Sara. « Modèles de dialogue et reconnaissance d'intentions composites dans les conversations Utilisateur-Chatbot orientées tâches ». Electronic Thesis or Diss., Lyon 1, 2023. http://www.theses.fr/2023LYO10106.
Texte intégralDialogue Systems (or simply chatbots) are in very high demand these days. They enable the understanding of user needs (or user intents), expressed in natural language, and on fulfilling such intents by invoking the appropriate back-end APIs (Application Programming Interfaces). Chatbots are famed for their easy-to-use interface and gentle learning curve (it only requires one of humans' most innate ability, the use of natural language). The continuous improvement in Artificial Intelligence (AI), Natural Language Processing (NLP), and the countless number of devices allow performing real-world tasks (e.g., making a reservation) by using natural language-based interactions between users and a large number of software enabled services.Nonetheless, chatbot development is still in its preliminary stage, and there are several theoretical and technical challenges that need to be addressed. One of the challenges stems from the wide range of utterance variations in open-end human-chatbot interactions. Additionally, there is a vast space of software services that may be unknown at development time. Natural human conversations can be rich, potentially ambiguous, and express complex and context-dependent intents. Traditional business process and service composition modeling and orchestration techniques are limited to support such conversations because they usually assume a priori expectation of what information and applications will be accessed and how users will explore these sources and services. Limiting conversations to a process model means that we can only support a small fraction of possible conversations. While existing advances in NLP and Machine Learning (ML) techniques automate various tasks such as intent recognition, the synthesis of API calls to support a broad range of potentially complex user intents is still largely a manual, ad-hoc and costly process.This thesis project aims at advancing the fundamental understanding of cognitive services engineering. In this thesis we contribute novel abstractions and techniques focusing on the synthesis of API calls to support a broad range of potentially complex user intents. We propose reusable and extensible techniques to recognize and realize complex intents during humans-chatbots-services interactions. These abstractions and techniques seek to unlock the seamless and scalable integration of natural language-based conversations with software-enabled services
Livres sur le sujet "Batches of task graphs"
Shukla, Shridhar B. Real-time execution control of task-level data-flow graphs using a compile-time approach. Monterey, Calif : Naval Postgraduate School, 1992.
Trouver le texte intégralBrooks, Colton. Ielts Writing Task 1 - Data, Charts, Graphs and Letters. Lulu Press, Inc., 2015.
Trouver le texte intégralWorthwhile IELTS Writing TASK-1 : GRAPHS,TABLES,DIAGRAMS,CHARTS &FIGURES. Rana Books India, 2021.
Trouver le texte intégralBrooks, Colton. Ielts Writing Task 1 - Data, Charts, Graphs and Letters - Fill the Gap. Lulu Press, Inc., 2015.
Trouver le texte intégralHOSSAIN, Delwer. IELTS GRAPH : 200 Samples from Past Exam : IELTS ACADEMIC WRITING TASK 1 : 200 Practice Test with Answer, Bar and Line Graphs, Pie Charts, Maps and Tables. Independently Published, 2021.
Trouver le texte intégralHOSSAIN, Delwer. IELTS GRAPH : 200 Samples from Past Exam : IELTS ACADEMIC WRITING TASK 1 : 200 Practice Test with Answer, Bar and Line Graphs, Pie Charts, Maps and Tables. Independently Published, 2021.
Trouver le texte intégralHOSSAIN, Delwer. IELTS GRAPH : 200 Samples from Past Exam : IELTS ACADEMIC WRITING TASK 1 : 200 Practice Test with Answer, Bar and Line Graphs, Pie Charts, Maps and Tables. Independently Published, 2021.
Trouver le texte intégralConsultants, Ielts Writing, et Marc Roche. IELTS Writing Masterclass 8. 5. Master IELTS Writing Academic + General Task 1 and 2, Including Graphs, Letters, Essay Writing and Grammar for IELTS Academic and General Training : IELTS Writing Originals ©. Independently Published, 2020.
Trouver le texte intégralConsultants, Ielts Writing, et Marc Roche. IELTS Writing Masterclass 8. 5. Master IELTS Writing Academic + General Task 1 and 2, Including Graphs, Letters, Essay Writing and Grammar for IELTS Academic and General Training : IELTS Writing Originals ©. Independently Published, 2021.
Trouver le texte intégralLittle, Danity. How Women Executives Succeed. Greenwood Publishing Group, Inc., 1994. http://dx.doi.org/10.5040/9798400667008.
Texte intégralChapitres de livres sur le sujet "Batches of task graphs"
Diakité, Sékou, Loris Marchal, Jean-Marc Nicod et Laurent Philippe. « Steady-State for Batches of Identical Task Trees ». Dans Lecture Notes in Computer Science, 203–15. Berlin, Heidelberg : Springer Berlin Heidelberg, 2009. http://dx.doi.org/10.1007/978-3-642-03869-3_22.
Texte intégralEberhart, Aaron, Cogan Shimizu, Christopher Stevens, Pascal Hitzler, Christopher W. Myers et Benji Maruyama. « A Domain Ontology for Task Instructions ». Dans Knowledge Graphs and Semantic Web, 1–13. Cham : Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-65384-2_1.
Texte intégralBrézillon, Patrick. « Task-Realization Models in Contextual Graphs ». Dans Modeling and Using Context, 55–68. Berlin, Heidelberg : Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/11508373_5.
Texte intégralFinta, Lucian, et Zhen Liu. « Makespan minimization of task graphs with random task running times ». Dans DIMACS Series in Discrete Mathematics and Theoretical Computer Science, 125–38. Providence, Rhode Island : American Mathematical Society, 1995. http://dx.doi.org/10.1090/dimacs/021/10.
Texte intégralMiranda-Jiménez, Sabino, Alexander Gelbukh et Grigori Sidorov. « Summarizing Conceptual Graphs for Automatic Summarization Task ». Dans Conceptual Structures for STEM Research and Education, 245–53. Berlin, Heidelberg : Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-35786-2_18.
Texte intégralBoeres, Cristina, Aline Nascimento⋆ et Vinod E. F. Rebello. « Scheduling Arbitrary Task Graphs on LogP Machines ». Dans Euro-Par’99 Parallel Processing, 340–49. Berlin, Heidelberg : Springer Berlin Heidelberg, 1999. http://dx.doi.org/10.1007/3-540-48311-x_44.
Texte intégralKlijn, Eva L., Felix Mannhardt et Dirk Fahland. « Aggregating Event Knowledge Graphs for Task Analysis ». Dans Lecture Notes in Business Information Processing, 493–505. Cham : Springer Nature Switzerland, 2023. http://dx.doi.org/10.1007/978-3-031-27815-0_36.
Texte intégralBaskiyar, Sanjeev, et Christopher Dickinson. « Scheduling Directed A-Cyclic Task Graphs on Heterogeneous Processors Using Task Duplication ». Dans High Performance Computing - HiPC 2003, 259–67. Berlin, Heidelberg : Springer Berlin Heidelberg, 2003. http://dx.doi.org/10.1007/978-3-540-24596-4_28.
Texte intégralGelenbe, Erol. « Critical Path Length of Large Acyclic Task Graphs ». Dans Parallel Computing on Distributed Memory Multiprocessors, 195–203. Berlin, Heidelberg : Springer Berlin Heidelberg, 1993. http://dx.doi.org/10.1007/978-3-642-58066-6_11.
Texte intégralLöwe, Welf, Wolf Zimmermann, Sven Dickert et Jörn Eisenbiegler. « Source Code and Task Graphs in Program Optimization ». Dans High-Performance Computing and Networking, 273–82. Berlin, Heidelberg : Springer Berlin Heidelberg, 2001. http://dx.doi.org/10.1007/3-540-48228-8_28.
Texte intégralActes de conférences sur le sujet "Batches of task graphs"
Zhu, Wenhao, Tianyu Wen, Guojie Song, Xiaojun Ma et Liang Wang. « Hierarchical Transformer for Scalable Graph Learning ». Dans Thirty-Second International Joint Conference on Artificial Intelligence {IJCAI-23}. California : International Joint Conferences on Artificial Intelligence Organization, 2023. http://dx.doi.org/10.24963/ijcai.2023/523.
Texte intégralAuerbach, Joshua, David F. Bacon, Rachid Guerraoui, Jesper Honig Spring et Jan Vitek. « Flexible task graphs ». Dans the 2008 ACM SIGPLAN-SIGBED conference. New York, New York, USA : ACM Press, 2008. http://dx.doi.org/10.1145/1375657.1375659.
Texte intégralYang, Zhen, Tinglin Huang, Ming Ding, Yuxiao Dong, Rex Ying, Yukuo Cen, Yangliao Geng et Jie Tang. « BatchSampler : Sampling Mini-Batches for Contrastive Learning in Vision, Language, and Graphs ». 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.3599263.
Texte intégralLi, Jinqing, Xiaojun Chen, Dakui Wang et Yuwei Li. « Enhancing Label Representations with Relational Inductive Bias Constraint for Fine-Grained Entity Typing ». Dans Thirtieth International Joint Conference on Artificial Intelligence {IJCAI-21}. California : International Joint Conferences on Artificial Intelligence Organization, 2021. http://dx.doi.org/10.24963/ijcai.2021/529.
Texte intégralAgrawal, Kunal, Charles E. Leiserson et Jim Sukha. « Executing task graphs using work-stealing ». Dans 2010 IEEE International Symposium on Parallel & Distributed Processing (IPDPS). IEEE, 2010. http://dx.doi.org/10.1109/ipdps.2010.5470403.
Texte intégralLong, Douglas L., et Lori A. Clarke. « Task interaction graphs for concurrency analysis ». Dans the 11th international conference. New York, New York, USA : ACM Press, 1989. http://dx.doi.org/10.1145/74587.74592.
Texte intégralCarpov, Sergiu, Jacques Carlier, Dritan Nace et Renaud Sirdey. « Probabilistic Parameters of Conditional Task Graphs ». Dans 2011 14th International Conference on Network-Based Information Systems (NBiS). IEEE, 2011. http://dx.doi.org/10.1109/nbis.2011.63.
Texte intégralSzymanek, Radoslaw, et Krzysztof Krzysztof. « Partial task assignment of task graphs under heterogeneous resource constraints ». Dans the 40th conference. New York, New York, USA : ACM Press, 2003. http://dx.doi.org/10.1145/775832.775895.
Texte intégralDokulil, Jiri, et Jana Katreniakova. « Visualization of Open Community Runtime Task Graphs ». Dans 2017 21st International Conference on Information Visualisation (IV). IEEE, 2017. http://dx.doi.org/10.1109/iv.2017.31.
Texte intégralSbîrlea, Dragos, Zoran Budimlić et Vivek Sarkar. « Bounded memory scheduling of dynamic task graphs ». Dans the 23rd international conference. New York, New York, USA : ACM Press, 2014. http://dx.doi.org/10.1145/2628071.2628090.
Texte intégralRapports d'organisations sur le sujet "Batches of task graphs"
Mbabzi, Kikundwa Emma. Standardisation of Staff Training to Increase Efficiency. Purdue University, novembre 2021. http://dx.doi.org/10.5703/1288284317427.
Texte intégralKüsters, Ralf, et Ralf Molitor. Computing Most Specific Concepts in Description Logics with Existential Restrictions. Aachen University of Technology, 2000. http://dx.doi.org/10.25368/2022.108.
Texte intégralKriegel, Francesco. Terminological knowledge aquisition in probalistic description logic. Technische Universität Dresden, 2018. http://dx.doi.org/10.25368/2022.239.
Texte intégral