Thematische Bibliographien / Numba

Inhaltsverzeichnis

Zeitschriftenartikel
Dissertationen
Bücher
Buchteile
Konferenzberichte
Berichte der Organisationen

Auswahl der wissenschaftlichen Literatur zum Thema „Numba“

Autor: Grafiati

Veröffentlicht am 28. Juni 2021

Zuletzt aktualisiert am 25. April 2022

Geben Sie eine Quelle nach APA, MLA, Chicago, Harvard und anderen Zitierweisen an

Wählen Sie eine Art der Quelle aus:

Machen Sie sich mit den Listen der aktuellen Artikel, Bücher, Dissertationen, Berichten und anderer wissenschaftlichen Quellen zum Thema "Numba" bekannt.

Neben jedem Werk im Literaturverzeichnis ist die Option "Zur Bibliographie hinzufügen" verfügbar. Nutzen Sie sie, wird Ihre bibliographische Angabe des gewählten Werkes nach der nötigen Zitierweise (APA, MLA, Harvard, Chicago, Vancouver usw.) automatisch gestaltet.

Sie können auch den vollen Text der wissenschaftlichen Publikation im PDF-Format herunterladen und eine Online-Annotation der Arbeit lesen, wenn die relevanten Parameter in den Metadaten verfügbar sind.

Zeitschriftenartikel zum Thema "Numba"

Pivarski, Jim, Peter Elmer und David Lange. „Awkward Arrays in Python, C++, and Numba“. EPJ Web of Conferences 245 (2020): 05023. http://dx.doi.org/10.1051/epjconf/202024505023.

Der volle Inhalt der Quelle

Annotation:

The Awkward Array library has been an important tool for physics analysis in Python since September 2018. However, some interface and implementation issues have been raised in Awkward Array’s first year that argue for a reimplementation in C++ and Numba. We describe those issues, the new architecture, and present some examples of how the new interface will look to users. Of particular importance is the separation of kernel functions from data structure management, which allows a C++ implementation and a Numba implementation to share kernel functions, and the algorithm that transforms recordoriented data into columnar Awkward Arrays.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Sulaiman, Hasti, Fransiskus Xaverius Rema und Anita Anita. „MENELUSURI JEJAK SEJARAH PENINGGALAN PORTUGIS DI KAMPUNG NUMBA“. HISTORIA Jurnal Program Studi Pendidikan Sejarah 6, Nr. 2 (05.09.2018): 237. http://dx.doi.org/10.24127/hj.v6i2.1528.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Dressler, Sven, und Daniel N. Wilke. „PyBONDEM-GPU: A discrete element bonded particle Python research framework – Development and examples“. EPJ Web of Conferences 249 (2021): 14009. http://dx.doi.org/10.1051/epjconf/202124914009.

Der volle Inhalt der Quelle

Annotation:

Discrete element modelling (DEM) is widely used to simulate granular systems, nowadays routinely on graphical processing units. Graphics processing units (GPUs) are inherently designed for parallel computation, and recent advances in the architecture, compiler design and language development are allowing general-purpose computation to be computed on multiple GPUs. Application of DEM to bonded particle systems are much less common, with a number of open research questions remaining. This study outlines a Bonded-Particle Research DEM Framework, PyBONDEM-GPU, written in Python. This framework leverages the parallel nature of GPUs for computational speed-up and the rapid prototype flexibility of Python. Python is faster and easier to learn than classical compiled languages, making computational simulation development accessible to undergraduate and graduate engineers. PyBONDEMGPU leverages the Numba-CUDA module to compile Python syntax for execution on GPUs. The framework enables research of fibre pull-out from fibre-matrix embeddings. Bonds are simulated between all interacting particles. The performance of PyBONDEM-GPU is compared against Python CPU implementations of PyBONDEM using the Numpy and Numba-CPU Python modules. PyBONDEM-GPU was found to be 1000 times faster than the Numpy implementation and 4 times faster than the Numba-CPU implementation to resolve forces and to integrate the equations of motion.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Lavrinov, M. I. „AN OVERVIEW OF THE NUMBA JIT COMPILER AS A GPU PARALLEL COMPUTING TOOL“. Современные наукоемкие технологии (Modern High Technologies), Nr. 2 2022 (2022): 67–71. http://dx.doi.org/10.17513/snt.39039.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Boussou, Cécile, und Sylvie Vago. „NumBA, voyage au cœur des collections patrimoniales des bibliothèques du Cirad“. De l’ombre à la lumière, Nr. 99 (01.10.2020): 6–7. http://dx.doi.org/10.35562/arabesques.2236.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Betcke, Timo, und Matthew W. Scroggs. „Designing a High-Performance Boundary Element Library With OpenCL and Numba“. Computing in Science & Engineering 23, Nr. 4 (01.07.2021): 18–28. http://dx.doi.org/10.1109/mcse.2021.3085420.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Döschl, Alexander, Max-Emanuel Keller und Peter Mandl. „Performance evaluation of GPU- and cluster-computing for parallelization of compute-intensive tasks“. International Journal of Web Information Systems 17, Nr. 4 (06.08.2021): 377–402. http://dx.doi.org/10.1108/ijwis-03-2021-0032.

Der volle Inhalt der Quelle

Annotation:

Purpose This paper aims to evaluate different approaches for the parallelization of compute-intensive tasks. The study compares a Java multi-threaded algorithm, distributed computing solutions with MapReduce (Apache Hadoop) and resilient distributed data set (RDD) (Apache Spark) paradigms and a graphics processing unit (GPU) approach with Numba for compute unified device architecture (CUDA). Design/methodology/approach The paper uses a simple but computationally intensive puzzle as a case study for experiments. To find all solutions using brute force search, 15! permutations had to be computed and tested against the solution rules. The experimental application comprises a Java multi-threaded algorithm, distributed computing solutions with MapReduce (Apache Hadoop) and RDD (Apache Spark) paradigms and a GPU approach with Numba for CUDA. The implementations were benchmarked on Amazon-EC2 instances for performance and scalability measurements. Findings The comparison of the solutions with Apache Hadoop and Apache Spark under Amazon EMR showed that the processing time measured in CPU minutes with Spark was up to 30% lower, while the performance of Spark especially benefits from an increasing number of tasks. With the CUDA implementation, more than 16 times faster execution is achievable for the same price compared to the Spark solution. Apart from the multi-threaded implementation, the processing times of all solutions scale approximately linearly. Finally, several application suggestions for the different parallelization approaches are derived from the insights of this study. Originality/value There are numerous studies that have examined the performance of parallelization approaches. Most of these studies deal with processing large amounts of data or mathematical problems. This work, in contrast, compares these technologies on their ability to implement computationally intensive distributed algorithms.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Njiki Chatué, C., T. Njanko, E. M. Fozing, B. E. Bella Nké, N. Séta und E. Njonfang. „Field observations, magnetic fabrics and microstructures evidences of syn-kinematic emplacement of the Numba granitic pluton (western Cameroon domain)“. Journal of African Earth Sciences 172 (Dezember 2020): 104009. http://dx.doi.org/10.1016/j.jafrearsci.2020.104009.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Ge, Jixing. „GGCHEMPY: A Pure Python-based Gas-grain Chemical Code for Efficient Simulation of Interstellar Chemistry*“. Research in Astronomy and Astrophysics 22, Nr. 1 (01.01.2022): 015004. http://dx.doi.org/10.1088/1674-4527/ac321e.

Der volle Inhalt der Quelle

Annotation:

Abstract In this paper, we present a new gas-grain chemical code for interstellar clouds written in pure Python (GGCHEMPY (GGCHEMPY is available on https://github.com/JixingGE/GGCHEMPY)). By combining with the high-performance Python compiler Numba, GGCHEMPY is as efficient as the Fortran-based version. With the Python features, flexible computational workflows and extensions become possible. As a showcase, GGCHEMPY is applied to study the general effects of three-dimensional projection on molecular distributions using a two-core system which can be easily extended for more complex cases. By comparing the molecular distribution differences between two overlapping cores and two merging cores, we summarized the typical chemical differences such as N2H+, HC3N, C2S, H2CO, HCN and C2H, which can be used to interpret 3D structures in molecular clouds.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Rousselle, Olivier, und Tom Sykora. „Fast simulation of Time-of-Flight detectors at the LHC“. EPJ Web of Conferences 251 (2021): 03027. http://dx.doi.org/10.1051/epjconf/202125103027.

Der volle Inhalt der Quelle

Annotation:

The modelling of Cherenkov based detectors is traditionally done using Geant4 toolkit. In this work, we present another method based on Python programming language and Numba high performance compiler to speed up the simulation. As an example we take one of the Forward Proton Detectors at the CERN LHC - ATLAS Forward Proton (AFP) Time-of-Flight, which is used to reduce the background from multiple proton-proton collisions in soft and hard diffiractive events. We describe the technical details of the fast Cherenkov model of photon generation and transportation through the optical part of the ToF detector. The fast simulation is revealed to be about 200 times faster than the corresponding Geant4 simulation, and provides similar results concerning length and time distributions of photons. The study is meant as the first step in a construction of a building kit allowing creation of a fast simulation of an arbitrary shaped optical part of detectors.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Mehr Quellen

Dissertationen zum Thema "Numba"

Verbeek, Benjamin. „Maximum Likelihood Estimation of Hyperon Parameters in Python : Facilitating Novel Studies of Fundamental Symmetries with Modern Software Tools“. Thesis, Uppsala universitet, Institutionen för materialvetenskap, 2021. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-446041.

Der volle Inhalt der Quelle

Annotation:

In this project, an algorithm has been implemented in Python to estimate the parameters describing the production and decay of a spin 1/2 baryon - antibaryon pair. This decay can give clues about a fundamental asymmetry between matter and antimatter. A model-independent formalism developed by the Uppsala hadron physics group and previously implemented in C++, has been shown to be a promising tool in the search for physics beyond the Standard Model (SM) of particle physics. The program developed in this work provides a more user-friendly alternative, and is intended to motivate further use of the formalism through a more maintainable, customizable and readable implementation. The hope is that this will expedite future research in the area of charge parity (CP)-violation and eventually lead to answers to questions such as why the universe consists of matter. A Monte-Carlo integrator is used for normalization and a Python library for function minimization. The program returns an estimation of the physics parameters including error estimation. Tests of statistical properties of the estimator, such as consistency and bias, have been performed. To speed up the implementation, the Just-In-Time compiler Numba has been employed which resulted in a speed increase of a factor 400 compared to plain Python code.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Hojný, Ondřej. „Evoluční návrh kombinačních obvodů“. Master's thesis, Vysoké učení technické v Brně. Fakulta strojního inženýrství, 2021. http://www.nusl.cz/ntk/nusl-442801.

Der volle Inhalt der Quelle

Annotation:

This diploma thesis deals with the use of Cartesian Genetic Programming (CGP) for combinational circuits design. The work addresses the issue of optimizaion of selected logic circuts, arithmetic adders and multipliers, using Cartesian Genetic Programming. The implementation of the CPG is performed in the Python programming language with the aid of NumPy, Numba and Pandas libraries. The method was tested on selected examples and the results were discussed.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Rottenburg, Richard. „Die Lemwareng-Nuba : Ein Beispeil kultureller Akkreszenz im heutigen Nil-Sudan : Zusammenfassung /“. Berlin : Arabische Buch, 1988. http://catalogue.bnf.fr/ark:/12148/cb37026226f.

Der volle Inhalt der Quelle

Annotation:

Résumé de: Diss.--Fachbereich Philosophie und Sozialwissenschaften 2--Berlin--Freie Universität, 1987. Titre de soutenance : Ritual und Wildnis : zur Inkorporation der modernen Aussenwelt in den Kosmos der Lemwareng in Südkordofan Sudan.
Bibliogr. p. 43-44.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Lepers, Baptiste. „Improving performance on NUMA systems“. Thesis, Grenoble, 2014. http://www.theses.fr/2014GRENM005/document.

Der volle Inhalt der Quelle

Annotation:

Les machines multicœurs actuelles utilisent une architecture à Accès Mémoire Non-Uniforme (Non-Uniform Memory Access - NUMA). Dans ces machines, les cœurs sont regroupés en nœuds. Chaque nœud possède son propre contrôleur mémoire et est relié aux autres nœuds via des liens d'interconnexion. Utiliser ces architectures à leur pleine capacité est difficile : il faut notamment veiller à éviter les accès distants (i.e., les accès d'un nœud vers un autre nœud) et la congestion sur les bus mémoire et les liens d'interconnexion. L'optimisation de performance sur une machine NUMA peut se faire de deux manières : en implantant des optimisations ad-hoc au sein des applications ou de manière automatique en utilisant des heuristiques. Cependant, les outils existants fournissent trop peu d'informations pour pouvoir implanter efficacement des optimisations et les heuristiques existantes ne permettent pas d'éviter les problèmes de congestion. Cette thèse résout ces deux problèmes. Dans un premier temps nous présentons MemProf, le premier outil d'analyse permettant d'implanter efficacement des optimisations NUMA au sein d'applications. Pour ce faire, MemProf construit des flots d'interactions entre threads et objets. Nous évaluons MemProf sur 3 machines NUMA et montrons que les optimisations trouvées grâce à MemProf permettent d'obtenir des gains de performance significatifs (jusqu'à 2.6x) et sont très simples à implanter (moins de 10 lignes de code). Dans un second temps, nous présentons Carrefour, un algorithme de gestion de la mémoire pour machines NUMA. Contrairement aux heuristiques existantes, Carrefour se concentre sur la réduction de la congestion sur les machines NUMA. Carrefour permet d'obtenir des gains de performance significatifs (jusqu'à 3.3x) et est toujours plus performant que les heuristiques existantes
Modern multicore systems are based on a Non-Uniform Memory Access (NUMA) design. In a NUMA system, cores are grouped in a set of nodes. Each node has a memory controller and is interconnected with other nodes using high speed interconnect links. Efficiently exploiting such architectures is notoriously complex for programmers. Two key objectives on NUMA multicore machines are to limit as much as possible the number of remote memory accesses (i.e., accesses from a node to another node) and to avoid contention on memory controllers and interconnect links. These objectives can be achieved by implementing application-level optimizations or by implementing application-agnostic heuristics. However, in many cases, existing profilers do not provide enough information to help programmers implement application-level optimizations and existing application-agnostic heuristics fail to address contention issues. The contributions of this thesis are twofold. First we present MemProf, a profiler that allows programmers to choose and implement efficient application-level optimizations for NUMA systems. MemProf builds temporal flows of interactions between threads and objects, which help programmers understand why and which memory objects are accessed remotely. We evaluate MemProf on Linux on three different machines. We show how MemProf helps us choose and implement efficient optimizations, unlike existing profilers. These optimizations provide significant performance gains (up to 2.6x), while requiring very lightweight modifications (10 lines of code or less). Then we present Carrefour, an application-agnostic memory management algorithm. Contrarily to existing heuristics, Carrefour focuses on traffic contention on memory controllers and interconnect links. Carrefour provides significant performance gains (up to 3.3x) and always performs better than existing heuristics

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Voron, Gauthier. „Virtualisation efficace d'architectures NUMA“. Thesis, Sorbonne université, 2018. http://www.theses.fr/2018SORUS026/document.

Der volle Inhalt der Quelle

Annotation:

Alors que le surcoût de la virtualisation reste marginal sur des machines peu puissantes, la situation change radicalement quand le nombre de cœur disponible augmente. Il existe aujourd’hui des machines de plusieurs dizaines de cœurs dans les data centers dédiés au cloud computing, un modèle de gestion de ressources qui utilise largement la virtualisation. Ces machines reposent sur une architecture Non Uniform Memory Access (NUMA) pour laquelle le placement des tâches sur les cœurs ainsi que celui des données en mémoire est déterminant pour les performances.Cette thèse montre d’une part comment la virtualisation affecte le comportement des applications en les empêchant notamment d’utiliser un placement efficace de leurs données en mémoire. Cette étude montre que les erreurs de placement ainsi provoquées engendrent une dégradation des performances allant jusqu’à 700%. D’autre part, cette thèse propose une méthode qui permet la virtualisation efficace d’architectures NUMA par la mise en œuvre dans l’hyperviseur Xen de politiques génériques de placement mémoire. Une évaluation sur un ensemble de 29 applications exécutées sur une machine NUMA de 48 cœurs montre que ces politiques multiplient les performances de 9 de ces applications par 2 ou plus et diminuent le surcoût de la virtualisation à moins de 50% pour 23 d’entre elles
While virtualization only introduces a negligible overhead on machines with few cores, this is not the case when the number of cores increases. We can find such computers with tens of cores in todays data centers dedicated to the cloud computing, a resource management model which relies on virtualization. These large multicore machines have a complex architecture, called Non Uniform Memory Access (NUMA). Achieving high performance on a NUMA architecture requires to wisely place application threads on the appropriate cores and application data in the appropriate memory bank.In this thesis, we show how virtualization techniques modify the applications behavior by preventing them to efficiently place their data in memory. We show that the data misplacement leads to a serious performance degradation, up to 700%.Additionally, we suggest a method which allows the Xen hypervisor to efficiently virtualize NUMA architectures by implementing a set of generic memory placement policies. With an evaluation over a set of 29 applications on a 48-cores machine, we show that the NUMA policies can multiply the performance of 9 applications by more than 2 and decrease the virtualization overhead below 50% for 23 of them

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Khamis, Cornelia. „Mehrsprachigkeit bei den Nubi : das Sprachverhalten viersprachig aufwachsender Vorschul- und Schulkinder in Bombo/Uganda /“. Hamburg : Lit, 1994. http://catalogue.bnf.fr/ark:/12148/cb39937996t.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Braithwaite, Ryan Karl. „NUMA Data-Access Bandwidth Characterization and Modeling“. Thesis, Virginia Tech, 2012. http://hdl.handle.net/10919/31151.

Der volle Inhalt der Quelle

Annotation:

Clusters of seemingly homogeneous compute nodes are increasingly heterogeneous within each node due to replication and distribution of node-level subsystems. This intra-node heterogeneity can adversely affect program execution performance by inflicting additional data-access performance penalties when accessing non-local data. In many modern NUMA architectures, both memory and I/O controllers are distributed within a node and CPU cores are logically divided into “local” and “remote” data-accesses within the system. In this thesis a method for analyzing main memory and PCIe data-access characteristics of modern AMD and Intel NUMA architectures is presented. Also presented here is the synthesis of data-access performance models designed to quantify the effects of these architectural characteristics on data-access bandwidth. Such performance models provide an analytical tool for determining the performance impact of remote data-accesses for a program or access pattern running in a given system. Data-access performance models also provide a means for comparing the data-access bandwidth and attributes of NUMA architectures, for improving application performance when running on these architectures, and for improving process/thread mapping onto CPU cores in these architectures. Preliminary examples of how programs respond to these data-access bandwidth characteristics are also presented as motivation for future work.
Master of Science

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Kissinger, Thomas. „Energy-Aware Data Management on NUMA Architectures“. Doctoral thesis, Saechsische Landesbibliothek- Staats- und Universitaetsbibliothek Dresden, 2017. http://nbn-resolving.de/urn:nbn:de:bsz:14-qucosa-223436.

Der volle Inhalt der Quelle

Annotation:

The ever-increasing need for more computing and data processing power demands for a continuous and rapid growth of power-hungry data center capacities all over the world. As a first study in 2008 revealed, energy consumption of such data centers is becoming a critical problem, since their power consumption is about to double every 5 years. However, a recently (2016) released follow-up study points out that this threatening trend was dramatically throttled within the past years, due to the increased energy efficiency actions taken by data center operators. Furthermore, the authors of the study emphasize that making and keeping data centers energy-efficient is a continuous task, because more and more computing power is demanded from the same or an even lower energy budget, and that this threatening energy consumption trend will resume as soon as energy efficiency research efforts and its market adoption are reduced. An important class of applications running in data centers are data management systems, which are a fundamental component of nearly every application stack. While those systems were traditionally designed as disk-based databases that are optimized for keeping disk accesses as low a possible, modern state-of-the-art database systems are main memory-centric and store the entire data pool in the main memory, which replaces the disk as main bottleneck. To scale up such in-memory database systems, non-uniform memory access (NUMA) hardware architectures are employed that face a decreased bandwidth and an increased latency when accessing remote memory compared to the local memory. In this thesis, we investigate energy awareness aspects of large scale-up NUMA systems in the context of in-memory data management systems. To do so, we pick up the idea of a fine-grained data-oriented architecture and improve the concept in a way that it keeps pace with increased absolute performance numbers of a pure in-memory DBMS and scales up on NUMA systems in the large scale. To achieve this goal, we design and build ERIS, the first scale-up in-memory data management system that is designed from scratch to implement a data-oriented architecture. With the help of the ERIS platform, we explore our novel core concept for energy awareness, which is Energy Awareness by Adaptivity. The concept describes that software and especially database systems have to quickly respond to environmental changes (i.e., workload changes) by adapting themselves to enter a state of low energy consumption. We present the hierarchically organized Energy-Control Loop (ECL), which is a reactive control loop and provides two concrete implementations of our Energy Awareness by Adaptivity concept, namely the hardware-centric Resource Adaptivity and the software-centric Storage Adaptivity. Finally, we will give an exhaustive evaluation regarding the scalability of ERIS as well as our adaptivity facilities.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Lenis, Josefina. „Execution strategies for memory-bound applications on NUMA systems“. Doctoral thesis, Universitat Autònoma de Barcelona, 2019. http://hdl.handle.net/10803/666763.

Der volle Inhalt der Quelle

Annotation:

En los últimos años, muchas herramientas de alineadores de secuencias han aparecido y se han hecho populares por la rápida evolución de las tecnologías de secuenciación de próxima generación (NGS). Obviamente, los investigadores que usan tales herramientas están interesados en obtener el máximo rendimiento cuando los ejecutan en infraestructuras modernas. Las arquitecturas NUMA (acceso no uniforme a memoria) de hoy en día presentan grandes desafíos para lograr que dichas aplicaciones logren una buena escalabilidad a medida que se utilizan más procesadores/núcleos. El sistema de memoria en los sistemas NUMA muestra una alta complejidad y puede ser la causa principal de la pérdida del rendimiento de una aplicación. La existencia de varios bancos de memoria en sistemas NUMA implica un aumento lógico en la latencia asociada con los accesos de un procesador dado a un banco remoto. Este fenómeno generalmente se atenúa mediante la aplicación de estrategias que tienden a aumentar la localidad de los accesos a la memoria. Sin embargo, los sistemas NUMA también pueden sufrir problemas de contención que pueden ocurrir cuando los accesos concurrentes se concentran en un número reducido de bancos. Las herramientas de alineadores de secuencia usan estructuras de datos grandes para contener genomas de referencia a los que se alinean todas las lecturas. Por lo tanto, estas herramientas son muy sensibles a los problemas de rendimiento relacionados con el sistema de memoria. El objetivo principal de este estudio es explorar las ventajas y desventajas entre la ubicación de datos y la dispersión de datos en los sistemas NUMA. Hemos introducido una serie de pasos metódicos para caracterizar las arquitecturas NUMA y ayudar a comprender el potencial de los recursos. Con esta información, diseñamos y experimentamos con varias herramientas de alineación de secuencias populares, en dos sistemas NUMA ampliamente disponibles para evaluar el rendimiento de diferentes políticas de asignación de memoria y estrategias de replicación y partición de datos. Encontramos que no hay un método que sea el mejor en todos los casos. Sin embargo, concluimos que aplicar “interleave” a la memoria es la política de asignación de memoria que proporciona el mejor rendimiento cuando se utiliza una gran cantidad de procesadores y bancos de memoria. En el caso de la partición y replicación de datos, los mejores resultados se obtienen generalmente cuando el número de particiones utilizadas es mayor, a veces combinado con una política de “interleave”.
Over the last several years, many sequence alignment tools have appeared and become popular thanks to the fast evolution of next-generation sequencing (NGS) technologies. Researchers that use such tools are interested in getting maximum performance when they execute them in modern infrastructures. Today’s NUMA (Non-Uniform Memory Access) architectures present significant challenges in getting such applications to achieve good scalability as more processors/cores are used. The memory system in NUMA systems shows a high complexity and may be the primary cause for the loss of an application’s performance. The existence of several memory banks in NUMA systems implies a logical increase in latency associated with the accesses of a given processor to a remote bank. This phenomenon is usually attenuated by the application of strategies that tend to increase the locality of memory accesses. However, NUMA systems may also suffer from contention problems that can occur when concurrent accesses are concentrated on a reduced number of banks. Sequence alignment tools use large data structures to contain reference genomes to which all reads are aligned. Therefore, these tools are very sensitive to performance problems related to the memory system. The main goal of this study is to explore the trade-offs between data locality and data dispersion in NUMA systems. We introduced a series of methodical steps to characterize NUMA architectures and to help understand the potential of the resources. With this information we designed and experimented with several popular sequence alignment tools on two widely available NUMA systems to assess the performance of different memory allocation policies and data partitioning and replication strategies. We find that there is not one method that is best in all cases. However, we conclude that memory interleaving is the memory allocation policy that provides the best performance for applications using large centralized data structured on a large number of processors and memory banks. In the case of data partitioning and replication, the best results are usually obtained when the number of partitions used is higher, and in some cases, combined with an interleaving policy.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Pousa, Ribeiro Christiane. „Contributions au contrôle de l'affinité mémoire sur architectures multicoeurs et hiérarchiques“. Thesis, Grenoble, 2011. http://www.theses.fr/2011GRENM030/document.

Der volle Inhalt der Quelle

Annotation:

Les plates-formes multi-coeurs avec un accès mémoire non uniforme (NUMA) sont devenu des ressources usuelles de calcul haute performance. Dans ces plates-formes, la mémoire partagée est constituée de plusieurs bancs de mémoires physiques organisés hiérarchiquement. Cette hiérarchie est également constituée de plusieurs niveaux de mémoires caches et peut être assez complexe. En raison de cette complexité, les coûts d'accès mémoire peuvent varier en fonction de la distance entre le processeur et le banc mémoire accédé. Aussi, le nombre de coeurs est très élevé dans telles machines entraînant des accès mémoire concurrents. Ces accès concurrents conduisent à des ponts chauds sur des bancs mémoire, générant des problèmes d'équilibrage de charge, de contention mémoire et d'accès distants. Par conséquent, le principal défi sur les plates-formes NUMA est de réduire la latence des accès mémoire et de maximiser la bande passante. Dans ce contexte, l'objectif principal de cette thèse est d'assurer une portabilité des performances évolutives sur des machines NUMA multi-coeurs en contrôlant l'affinité mémoire. Le premier aspect consiste à étudier les caractéristiques des plates-formes NUMA que sont à considérer pour contrôler efficacement les affinités mémoire, et de proposer des mécanismes pour tirer partie de telles affinités. Nous basons notre étude sur des benchmarks et des applications de calcul scientifique ayant des accès mémoire réguliers et irréguliers. L'étude de l'affinité mémoire nous a conduit à proposer un environnement pour gérer le placement des données pour les différents processus des applications. Cet environnement s'appuie sur des informations de compilation et sur l'architecture matérielle pour fournir des mécanismes à grains fins pour contrôler le placement. Ensuite, nous cherchons à fournir des solutions de portabilité des performances. Nous entendons par portabilité des performances la capacité de l'environnement à apporter des améliorations similaires sur des plates-formes NUMA différentes. Pour ce faire, nous proposons des mécanismes qui sont indépendants de l'architecture machine et du compilateur. La portabilité de l'environnement est évaluée sur différentes plates-formes à partir de plusieurs benchmarks et des applications numériques réelles. Enfin, nous concevons des mécanismes d'affinité mémoire qui peuvent être facilement adaptés et utilisés dans différents systèmes parallèles. Notre approche prend en compte les différentes structures de données utilisées dans les différentes applications afin de proposer des solutions qui peuvent être utilisées dans différents contextes. Toutes les propositions développées dans ce travail de recherche sont mises en œuvre dans une framework nommée Minas (Memory Affinity Management Software). Nous avons évalué l'adaptabilité de ces mécanismes suivant trois modèles de programmation parallèle à savoir OpenMP, Charm++ et mémoire transactionnelle. En outre, nous avons évalué ses performances en utilisant plusieurs benchmarks et deux applications réelles de géophysique
Multi-core platforms with non-uniform memory access (NUMA) design are now a common resource in High Performance Computing. In such platforms, the shared memory is organized in an hierarchical memory subsystem in which the main memory is physically distributed into several memory banks. Additionally, the hierarchical memory subsystem of these platforms feature several levels of cache memories. Because of such hierarchy, memory access costs may vary depending on the distance between tasks and data. Furthermore, since the number of cores is considerably high in such machines, concurrent accesses to the same distributed shared memory are performed. These accesses produce more stress on the memory banks, generating load-balancing issues, memory contention and remote accesses. Therefore, the main challenge on a NUMA platform is to reduce memory access latency and memory contention. In this context, the main objective of this thesis is to attain scalable performances on multi-core NUMA machines by controlling memory affinity. The first goal of this thesis is to investigate which characteristics of the NUMA platform and the application have an important impact on the memory affinity control and propose mechanisms to deal with them on multi-core machines with NUMA design. We focus on High Performance Scientific Numerical workloads with regular and irregular memory access characteristics. The study of memory affinity aims at the proposal of an environment to manage memory affinity on Multi-core Platforms with NUMA design. This environment provides fine grained mechanisms to manage data placement for an application by using compilation time and architecture information. The second goal is to provide solutions that show performance portability. By performance portability, we mean solutions that are capable of providing similar performances improvements on different NUMA platforms. In order to do so, we propose mechanisms that are independent of machine architecture and compiler. The portability of the proposed environment is evaluated through the performance analysis of several benchmarks and applications over different platforms. Last, the third goal of this thesis is to design memory affinity mechanisms that can be easily adapted and used in different parallel systems. Our approach takes into account the different data structures used in High Performance Scientific Numerical workloads, in order to propose solutions that can be used in different contexts. We evaluate the adaptability of such mechanisms in two parallel programming systems. All the ideas developed in this research work are implemented in a Framework named Minas (Memory affInity maNAgement Software). Several OpenMP benchmarks and two real world applications from geophysics are used to evaluate its performance. Additionally, Minas integration on Charm++ (Parallel Programming System) and OpenSkel (Skeleton Pattern System for Software Transactional Memory) is also evaluated

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Mehr Quellen

Bücher zum Thema "Numba"

Candima, Kōmbala. Kanduḷa numba. Dehivala: Kōmbala Candima, 2000.

Den vollen Inhalt der Quelle finden

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Numba nāṅdan duvē. Moratuva: Suhada Prakāśakayō, 1985.

Den vollen Inhalt der Quelle finden

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Ada numba janita kaḷemi. Mīgamuva: Es. Bī. Prinṭars, 1992.

Den vollen Inhalt der Quelle finden

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Mage dukaṭa numba nāndan. Ratmalāna: Tusita Prakāśakayō, 1997.

Den vollen Inhalt der Quelle finden

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Nohadunida duva numba?: Manō vidyātmaka, parisara vidyātmaka nava kathāva. [Colombo?]: Ca. Pa. Vīrasiṃha, 1990.

Den vollen Inhalt der Quelle finden

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Meyer, Matthew James. Numb. [Saint Paul, MN]: Falling Leaf Press, 2006.

Den vollen Inhalt der Quelle finden

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Padwal, Sunil. Numb. New Delhi: Vadehra Art Gallery, 2007.

Den vollen Inhalt der Quelle finden

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Grabien, Deborah. Comfortably numb. San Francisco: Plus One Press, 2013.

Den vollen Inhalt der Quelle finden

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Shindō, Fuyuki. Sokonashi numa. Tōkyō: Shinchōsha, 2006.

Den vollen Inhalt der Quelle finden

APA, Harvard, Vancouver, ISO und andere Zitierweisen

English, Sharon. Uncomfortably numb. Erin, ON: Porcupine's Quill, 2002.

Den vollen Inhalt der Quelle finden

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Mehr Quellen

Buchteile zum Thema "Numba"

Oden, Lena, und Tarek Saidi. „Implementation and Evaluation of CUDA-Unified Memory in Numba“. In Euro-Par 2020: Parallel Processing Workshops, 197–208. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-71593-9_16.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Hadfield, Hugo, Dietmar Hildenbrand und Alex Arsenovic. „Gajit: Symbolic Optimisation and JIT Compilation of Geometric Algebra in Python with GAALOP and Numba“. In Advances in Computer Graphics, 499–510. Cham: Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-22514-8_50.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Steele, Guy L., Xiaowei Shen, Josep Torrellas, Mark Tuckerman, Eric J. Bohm, Laxmikant V. Kalé, Glenn Martyna et al. „Caches, NUMA“. In Encyclopedia of Parallel Computing, 220. Boston, MA: Springer US, 2011. http://dx.doi.org/10.1007/978-0-387-09766-4_2087.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Kalé, Laxmikant V., Abhinav Bhatele, Eric J. Bohm, James C. Phillips, David H. Bailey, Ananth Y. Grama, Joseph Fogarty et al. „NUMA Caches“. In Encyclopedia of Parallel Computing, 1329–38. Boston, MA: Springer US, 2011. http://dx.doi.org/10.1007/978-0-387-09766-4_16.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Yurigan, Joseph J., und Todd M. Oravitz. „Comfortably Numb“. In A Case Approach to Perioperative Drug-Drug Interactions, 187–91. New York, NY: Springer New York, 2015. http://dx.doi.org/10.1007/978-1-4614-7495-1_37.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Voss, Michael, Rafael Asenjo und James Reinders. „TBB on NUMA Architectures“. In Pro TBB, 581–604. Berkeley, CA: Apress, 2019. http://dx.doi.org/10.1007/978-1-4842-4398-5_20.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Dolezal, Ondrej. „Numb Legs and Constipation“. In Clinical Cases in Neurology, 161–65. Cham: Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-16628-1_24.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Kalé, Laxmikant V., Abhinav Bhatele, Eric J. Bohm, James C. Phillips, David H. Bailey, Ananth Y. Grama, Joseph Fogarty et al. „Nonuniform Memory Access (NUMA) Machines“. In Encyclopedia of Parallel Computing, 1329. Boston, MA: Springer US, 2011. http://dx.doi.org/10.1007/978-0-387-09766-4_2115.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Negri, Mario. „2. La lingua di Numa“. In Historical Philology, 229. Amsterdam: John Benjamins Publishing Company, 1992. http://dx.doi.org/10.1075/cilt.87.27neg.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Metzger, Paul, Murray Cole und Christian Fensch. „NUMA Optimizations for Algorithmic Skeletons“. In Euro-Par 2018: Parallel Processing, 590–602. Cham: Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-96983-1_42.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Konferenzberichte zum Thema "Numba"

Lam, Siu Kwan, Antoine Pitrou und Stanley Seibert. „Numba“. In the Second Workshop. New York, New York, USA: ACM Press, 2015. http://dx.doi.org/10.1145/2833157.2833162.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Anderson, Todd, und Tim Mattson. „Multithreaded parallel Python through OpenMP support in Numba“. In Python in Science Conference. SciPy, 2021. http://dx.doi.org/10.25080/majora-1b6fd038-012.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Chen, Xinyu, und Trilce Estrada. „Index Clustering: A Map-reduce Clustering Approach using Numba“. In 6th International Conference on Data Science, Technology and Applications. SCITEPRESS - Science and Technology Publications, 2017. http://dx.doi.org/10.5220/0006437402330240.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Emmanuel, Gahizi, Gilbert Gutabaga Hungilo und Pranowo. „Numba acceleration of image steganography using Mendelbrot set fractals“. In THE 5TH INTERNATIONAL CONFERENCE ON INDUSTRIAL, MECHANICAL, ELECTRICAL, AND CHEMICAL ENGINEERING 2019 (ICIMECE 2019). AIP Publishing, 2020. http://dx.doi.org/10.1063/5.0000526.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Crist, James. „Dask & Numba: Simple libraries for optimizing scientific python code“. In 2016 IEEE International Conference on Big Data (Big Data). IEEE, 2016. http://dx.doi.org/10.1109/bigdata.2016.7840867.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Hungilo, Gilbert Gutabaga, Gahizi Emmanuel und Pranowo. „Performance comparison in simulation of Mandelbrot set fractals using Numba“. In THE 5TH INTERNATIONAL CONFERENCE ON INDUSTRIAL, MECHANICAL, ELECTRICAL, AND CHEMICAL ENGINEERING 2019 (ICIMECE 2019). AIP Publishing, 2020. http://dx.doi.org/10.1063/5.0000636.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Oden, Lena. „Lessons learned from comparing C-CUDA and Python-Numba for GPU-Computing“. In 2020 28th Euromicro International Conference on Parallel, Distributed and Network-Based Processing (PDP). IEEE, 2020. http://dx.doi.org/10.1109/pdp50117.2020.00041.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Saito, Carlos, und Sidney Novoa. „NUMBA WACHOKKERI: EMPOWERING INDIGENOUS PEOPLES TO PROTECT THEIR FOREST WITH CUTTING-EDGE TECHNOLOGY“. In 13th International Conference on Education and New Learning Technologies. IATED, 2021. http://dx.doi.org/10.21125/edulearn.2021.1549.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Prost, Jean-Philippe. „Numbat“. In the Third Workshop. Morristown, NJ, USA: Association for Computational Linguistics, 2006. http://dx.doi.org/10.3115/1604263.1604272.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Lee, Taeil. „Numb“. In SA '19: SIGGRAPH Asia 2019. New York, NY, USA: ACM, 2019. http://dx.doi.org/10.1145/3354918.3366356.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Berichte der Organisationen zum Thema "Numba"

Giraldo, Frank. The Nonhydrostatic Unified Model of the Atmosphere (NUMA): CG Dynamical Core. Fort Belvoir, VA: Defense Technical Information Center, März 2011. http://dx.doi.org/10.21236/ada547006.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Giraldo, Frank. The Development of the Non-hydrostatic Unified Model of the Atmosphere (NUMA). Fort Belvoir, VA: Defense Technical Information Center, September 2011. http://dx.doi.org/10.21236/ada560004.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Lagoa, Sérgio, und Ricardo Barradas. Modelos de organização e desafios dos sistemas de pensões em Portugal numa perspetiva Europeia. DINÂMIA'CET-Iscte, März 2022. http://dx.doi.org/10.15847/dinamiacet-iul.wp.2022.01.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Cardoso, Diogo. Os números da emigração de Vitorino Magalhães Godinho: revisão historiográfica com o caso do Brasil na época moderna. APHES Working Paper in Economic and Social History, März 2022. http://dx.doi.org/10.55462/wpaphes_a_502.

Der volle Inhalt der Quelle

Annotation:

Vitorino Magalhães Godinho, nos anos de 1970, lançou as bases do que viriam a ser os estudos sobre emigração, ao longo da história, no livro Estrutura da Antiga Sociedade Portuguesa e no seu artigo no primeiro número da revista de História Económica e Social. Esta comunicação pretende discutir os valores de saídas apresentados pelo autor em trabalhos que se tornaram clássicos e inúmeras vezes repetidos. Para tal será feita uma análise dos números lançados por Godinho e uma comparação com os dados apresentados por outros investigadores com o intuito de rever a historiografia sobre o assunto e testar a validade dos seus números – que alguns autores consideram demasiado elevados. Interessa a este estudo perceber também quais as fontes utilizadas para este tipo de abordagens, principalmente até ao século XVIII, antes da introdução do passaporte. Para o fazer será utilizado o estudo de caso do Brasil, território que, ao longo da época moderna, foi concentrando os destinos de emigração daqueles que partiam do reino para fora da Europa. Esta metodologia servirá para discutir as vantagens dos estudos dirigidos a espaços específicos para um apuramento mais afinado do número total de migrantes. Será ainda avançada uma proposta de fonte que pode ser usada com este objetivo: os processos inquisitoriais. A riqueza desta documentação é sobejamente conhecida dos historiadores, mas o seu potencial como fonte para o estudo da emigração numa perspetiva macro é ainda pouco divulgado. Através dela poderemos calcular a dimensão da emigração para determinados espaços, com o Nordeste à cabeça, e perceber também motivações para a partida ou a fixação num território em particular. Estes processos servirão ainda para determinar de onde estes migrantes são naturais, com Lisboa a assumir um peso que contraria os resultados expectáveis junto da bibliografia, ainda que o Entre Douro e Minho mantenha a preponderância.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Wir bieten Rabatte auf alle Premium-Pläne für Autoren, deren Werke in thematische Literatursammlungen aufgenommen wurden. Kontaktieren Sie uns, um einen einzigartigen Promo-Code zu erhalten!