Gotowa bibliografia na temat „Batches of task graphs”
Utwórz poprawne odniesienie w stylach APA, MLA, Chicago, Harvard i wielu innych
Spis treści
Zobacz listy aktualnych artykułów, książek, rozpraw, streszczeń i innych źródeł naukowych na temat „Batches of task graphs”.
Przycisk „Dodaj do bibliografii” jest dostępny obok każdej pracy w bibliografii. Użyj go – a my automatycznie utworzymy odniesienie bibliograficzne do wybranej pracy w stylu cytowania, którego potrzebujesz: APA, MLA, Harvard, Chicago, Vancouver itp.
Możesz również pobrać pełny tekst publikacji naukowej w formacie „.pdf” i przeczytać adnotację do pracy online, jeśli odpowiednie parametry są dostępne w metadanych.
Artykuły w czasopismach na temat "Batches of task graphs"
DIAKITÉ, SÉKOU, LORIS MARCHAL, JEAN-MARC NICOD i LAURENT PHILIPPE. "PRACTICAL STEADY-STATE SCHEDULING FOR TREE-SHAPED TASK GRAPHS". Parallel Processing Letters 21, nr 04 (grudzień 2011): 397–412. http://dx.doi.org/10.1142/s0129626411000291.
Pełny tekst źródłaWang, Xun, Chaogang Zhang, Ying Zhang, Xiangyu Meng, Zhiyuan Zhang, Xin Shi i Tao Song. "IMGG: Integrating Multiple Single-Cell Datasets through Connected Graphs and Generative Adversarial Networks". International Journal of Molecular Sciences 23, nr 4 (14.02.2022): 2082. http://dx.doi.org/10.3390/ijms23042082.
Pełny tekst źródłaWang, Yue, Ruiqi Xu, Xun Jian, Alexander Zhou i Lei Chen. "Towards distributed bitruss decomposition on bipartite graphs". Proceedings of the VLDB Endowment 15, nr 9 (maj 2022): 1889–901. http://dx.doi.org/10.14778/3538598.3538610.
Pełny tekst źródłaJia, Haozhang. "Graph sampling based deep metric learning for cross-view geo-localization". Journal of Physics: Conference Series 2711, nr 1 (1.02.2024): 012004. http://dx.doi.org/10.1088/1742-6596/2711/1/012004.
Pełny tekst źródłaAngriman, Eugenio, Michał Boroń i Henning Meyerhenke. "A Batch-dynamic Suitor Algorithm for Approximating Maximum Weighted Matching". ACM Journal of Experimental Algorithmics 27 (31.12.2022): 1–41. http://dx.doi.org/10.1145/3529228.
Pełny tekst źródłaZhang, Xin, Yanyan Shen, Yingxia Shao i 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, nr 2 (13.06.2023): 1–24. http://dx.doi.org/10.1145/3589311.
Pełny tekst źródłaVo, Tham, i Phuc Do. "GOW-Stream: A novel approach of graph-of-words based mixture model for semantic-enhanced text stream clustering". Intelligent Data Analysis 25, nr 5 (15.09.2021): 1211–31. http://dx.doi.org/10.3233/ida-205443.
Pełny tekst źródłaDa San Martino, Giovanni, Alessandro Sperduti, Fabio Aiolli i Alessandro Moschitti. "Efficient Online Learning for Mapping Kernels on Linguistic Structures". Proceedings of the AAAI Conference on Artificial Intelligence 33 (17.07.2019): 3421–28. http://dx.doi.org/10.1609/aaai.v33i01.33013421.
Pełny tekst źródłaLuo, Haoran, Haihong E, Yuhao Yang, Gengxian Zhou, Yikai Guo, Tianyu Yao, Zichen Tang, Xueyuan Lin i 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, nr 4 (26.06.2023): 4543–51. http://dx.doi.org/10.1609/aaai.v37i4.25576.
Pełny tekst źródłaAuerbach, Joshua, David F. Bacon, Rachid Guerraoui, Jesper Honig Spring i Jan Vitek. "Flexible task graphs". ACM SIGPLAN Notices 43, nr 7 (27.06.2008): 1–11. http://dx.doi.org/10.1145/1379023.1375659.
Pełny tekst źródłaRozprawy doktorskie na temat "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.
Pełny tekst źródłaWorks 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.
Pełny tekst źródłaNegelspach, 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.
Pełny tekst źródłaChieregato, Federico. "Modelling task execution time in Directed Acyclic Graphs for efficient distributed management". Master's thesis, Alma Mater Studiorum - Università di Bologna, 2022.
Znajdź pełny tekst źródłaWitt, Carl Philipp. "Predictive Resource Management for Scientific Workflows". Doctoral thesis, Humboldt-Universität zu Berlin, 2020. http://dx.doi.org/10.18452/21608.
Pełny tekst źródłaScientific 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.
Pełny tekst źródłaKoman, 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.
Pełny tekst źródłaPop, 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.
Pełny tekst źródłaGurhem, 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.
Pełny tekst źródłaSince 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.
Pełny tekst źródłaDialogue 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
Książki na temat "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.
Znajdź pełny tekst źródłaBrooks, Colton. Ielts Writing Task 1 - Data, Charts, Graphs and Letters. Lulu Press, Inc., 2015.
Znajdź pełny tekst źródłaWorthwhile IELTS Writing TASK-1: GRAPHS,TABLES,DIAGRAMS,CHARTS &FIGURES. Rana Books India, 2021.
Znajdź pełny tekst źródłaBrooks, Colton. Ielts Writing Task 1 - Data, Charts, Graphs and Letters - Fill the Gap. Lulu Press, Inc., 2015.
Znajdź pełny tekst źródłaHOSSAIN, 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.
Znajdź pełny tekst źródłaHOSSAIN, 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.
Znajdź pełny tekst źródłaHOSSAIN, 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.
Znajdź pełny tekst źródłaConsultants, Ielts Writing, i 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.
Znajdź pełny tekst źródłaConsultants, Ielts Writing, i 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.
Znajdź pełny tekst źródłaLittle, Danity. How Women Executives Succeed. Greenwood Publishing Group, Inc., 1994. http://dx.doi.org/10.5040/9798400667008.
Pełny tekst źródłaCzęści książek na temat "Batches of task graphs"
Diakité, Sékou, Loris Marchal, Jean-Marc Nicod i Laurent Philippe. "Steady-State for Batches of Identical Task Trees". W 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.
Pełny tekst źródłaEberhart, Aaron, Cogan Shimizu, Christopher Stevens, Pascal Hitzler, Christopher W. Myers i Benji Maruyama. "A Domain Ontology for Task Instructions". W Knowledge Graphs and Semantic Web, 1–13. Cham: Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-65384-2_1.
Pełny tekst źródłaBrézillon, Patrick. "Task-Realization Models in Contextual Graphs". W Modeling and Using Context, 55–68. Berlin, Heidelberg: Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/11508373_5.
Pełny tekst źródłaFinta, Lucian, i Zhen Liu. "Makespan minimization of task graphs with random task running times". W 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.
Pełny tekst źródłaMiranda-Jiménez, Sabino, Alexander Gelbukh i Grigori Sidorov. "Summarizing Conceptual Graphs for Automatic Summarization Task". W 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.
Pełny tekst źródłaBoeres, Cristina, Aline Nascimento⋆ i Vinod E. F. Rebello. "Scheduling Arbitrary Task Graphs on LogP Machines". W Euro-Par’99 Parallel Processing, 340–49. Berlin, Heidelberg: Springer Berlin Heidelberg, 1999. http://dx.doi.org/10.1007/3-540-48311-x_44.
Pełny tekst źródłaKlijn, Eva L., Felix Mannhardt i Dirk Fahland. "Aggregating Event Knowledge Graphs for Task Analysis". W 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.
Pełny tekst źródłaBaskiyar, Sanjeev, i Christopher Dickinson. "Scheduling Directed A-Cyclic Task Graphs on Heterogeneous Processors Using Task Duplication". W 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.
Pełny tekst źródłaGelenbe, Erol. "Critical Path Length of Large Acyclic Task Graphs". W 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.
Pełny tekst źródłaLöwe, Welf, Wolf Zimmermann, Sven Dickert i Jörn Eisenbiegler. "Source Code and Task Graphs in Program Optimization". W High-Performance Computing and Networking, 273–82. Berlin, Heidelberg: Springer Berlin Heidelberg, 2001. http://dx.doi.org/10.1007/3-540-48228-8_28.
Pełny tekst źródłaStreszczenia konferencji na temat "Batches of task graphs"
Zhu, Wenhao, Tianyu Wen, Guojie Song, Xiaojun Ma i Liang Wang. "Hierarchical Transformer for Scalable Graph Learning". W 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.
Pełny tekst źródłaAuerbach, Joshua, David F. Bacon, Rachid Guerraoui, Jesper Honig Spring i Jan Vitek. "Flexible task graphs". W the 2008 ACM SIGPLAN-SIGBED conference. New York, New York, USA: ACM Press, 2008. http://dx.doi.org/10.1145/1375657.1375659.
Pełny tekst źródłaYang, Zhen, Tinglin Huang, Ming Ding, Yuxiao Dong, Rex Ying, Yukuo Cen, Yangliao Geng i Jie Tang. "BatchSampler: Sampling Mini-Batches for Contrastive Learning in Vision, Language, and Graphs". W 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.
Pełny tekst źródłaLi, Jinqing, Xiaojun Chen, Dakui Wang i Yuwei Li. "Enhancing Label Representations with Relational Inductive Bias Constraint for Fine-Grained Entity Typing". W 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.
Pełny tekst źródłaAgrawal, Kunal, Charles E. Leiserson i Jim Sukha. "Executing task graphs using work-stealing". W 2010 IEEE International Symposium on Parallel & Distributed Processing (IPDPS). IEEE, 2010. http://dx.doi.org/10.1109/ipdps.2010.5470403.
Pełny tekst źródłaLong, Douglas L., i Lori A. Clarke. "Task interaction graphs for concurrency analysis". W the 11th international conference. New York, New York, USA: ACM Press, 1989. http://dx.doi.org/10.1145/74587.74592.
Pełny tekst źródłaCarpov, Sergiu, Jacques Carlier, Dritan Nace i Renaud Sirdey. "Probabilistic Parameters of Conditional Task Graphs". W 2011 14th International Conference on Network-Based Information Systems (NBiS). IEEE, 2011. http://dx.doi.org/10.1109/nbis.2011.63.
Pełny tekst źródłaSzymanek, Radoslaw, i Krzysztof Krzysztof. "Partial task assignment of task graphs under heterogeneous resource constraints". W the 40th conference. New York, New York, USA: ACM Press, 2003. http://dx.doi.org/10.1145/775832.775895.
Pełny tekst źródłaDokulil, Jiri, i Jana Katreniakova. "Visualization of Open Community Runtime Task Graphs". W 2017 21st International Conference on Information Visualisation (IV). IEEE, 2017. http://dx.doi.org/10.1109/iv.2017.31.
Pełny tekst źródłaSbîrlea, Dragos, Zoran Budimlić i Vivek Sarkar. "Bounded memory scheduling of dynamic task graphs". W the 23rd international conference. New York, New York, USA: ACM Press, 2014. http://dx.doi.org/10.1145/2628071.2628090.
Pełny tekst źródłaRaporty organizacyjne na temat "Batches of task graphs"
Mbabzi, Kikundwa Emma. Standardisation of Staff Training to Increase Efficiency. Purdue University, listopad 2021. http://dx.doi.org/10.5703/1288284317427.
Pełny tekst źródłaKüsters, Ralf, i 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.
Pełny tekst źródłaKriegel, Francesco. Terminological knowledge aquisition in probalistic description logic. Technische Universität Dresden, 2018. http://dx.doi.org/10.25368/2022.239.
Pełny tekst źródła