Relevant bibliographies by topics / Memory Affinity

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Books
  4. Book chapters
  5. Conference papers
  6. Reports

Academic literature on the topic 'Memory Affinity'

Author: Grafiati
Published: 4 June 2021
Last updated: 1 February 2022

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

Select a source type:

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

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

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

Journal articles on the topic "Memory Affinity"

1

Fishman, Michael A., and Alan S. Perelson. "Lymphocyte memory and affinity selection." Journal of Theoretical Biology 173, no. 3 (April 1995): 241–62. http://dx.doi.org/10.1016/s0022-5193(95)80003-4.

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

Nikolopoulos, D. S., E. Artiaga, E. Ayguadé, and J. Labarta. "Exploiting memory affinity in OpenMP through schedule reuse." ACM SIGARCH Computer Architecture News 29, no. 5 (December 2001): 49–55. http://dx.doi.org/10.1145/563647.563657.

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

Ji, Minwen. "Affinity-based management of main memory database clusters." ACM Transactions on Internet Technology 2, no. 4 (November 2002): 307–39. http://dx.doi.org/10.1145/604596.604599.

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

Shimoda, Michiko, Toru Nakamura, Yoshimasa Takahashi, Hideki Asanuma, Shin-ichi Tamura, Takeshi Kurata, Tsuguo Mizuochi, Norihiro Azuma, Choemon Kanno, and Toshitada Takemori. "Isotype-specific Selection of High Affinity Memory B Cells in Nasal-associated Lymphoid Tissue." Journal of Experimental Medicine 194, no. 11 (December 3, 2001): 1597–608. http://dx.doi.org/10.1084/jem.194.11.1597.

Full text
Abstract:
Mucosal immunoglobulin (Ig)A dominance has been proposed to be associated with preferential class switch recombination (CSR) to the IgA heavy chain constant region, Cα. Here, we report that B cell activation in nasal-associated lymphoid tissue (NALT) upon stimulation with the hapten (4-hydroxy-3-nitrophenyl)acetyl (NP) coupled to chicken γ globulin caused an anti-NP memory response dominated by high affinity IgA antibodies. In the response, however, NP-specific IgG+ B cells expanded and sustained their number as a major population in germinal centers (GCs), supporting the view that CSR to IgG heavy chain constant region, Cγ, operated efficiently in NALT. Both IgG+ and IgA+ GC B cells accumulated somatic mutations, indicative of affinity maturation to a similar extent, suggesting that both types of cell were equally selected by antigen. Despite the selection in GCs, high affinity NP-specific B cells were barely detected in the IgG memory compartment, whereas such cells dominated the IgA memory compartment. Taken together with the analysis of the VH gene clonotype in GC and memory B cells, we propose that NALT is equipped with a unique machinery providing IgA-specific enrichment of high affinity cells into the memory compartment, facilitating immunity with high affinity and noninflammatory secretory antibodies.
APA, Harvard, Vancouver, ISO, and other styles
5

Koni, Pandelakis A., and Richard A. Flavell. "Lymph Node Germinal Centers Form in the Absence of Follicular Dendritic Cell Networks." Journal of Experimental Medicine 189, no. 5 (March 1, 1999): 855–64. http://dx.doi.org/10.1084/jem.189.5.855.

Full text
Abstract:
Follicular dendritic cell networks are said to be pivotal to both the formation of germinal centers (GCs) and their functions in generating antigen-specific antibody affinity maturation and B cell memory. We report that lymphotoxin β–deficient mice form GC cell clusters in the gross anatomical location expected of GCs, despite the complete absence of follicular dendritic cell networks. Furthermore, antigen-specific GC generation was at first relatively normal, but these GCs then rapidly regressed and GC-phase antibody affinity maturation was reduced. Lymphotoxin β–deficient mice also showed substantial B cell memory in their mesenteric lymph nodes. This memory antibody response was of relatively low affinity for antigen at week 4 after challenge, but by week 10 after challenge was comparable to wild-type, indicating that affinity maturation had failed in the GC phase but developed later.
APA, Harvard, Vancouver, ISO, and other styles
6

Torrellas, Josep, Andrew Tucker, and Anoop Gupta. "Benefits of cache-affinity scheduling in shared-memory multiprocessors." ACM SIGMETRICS Performance Evaluation Review 21, no. 1 (June 1993): 272–74. http://dx.doi.org/10.1145/166962.167038.

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

Neuberger, Michael S., Michael R. Ehrenstein, Cristina Rada, Julian Sale, Facundo D. Batista, Gareth Williams, and Cesar Milstein. "Memory in the B–cell compartment: antibody affinity maturation." Philosophical Transactions of the Royal Society of London. Series B: Biological Sciences 355, no. 1395 (March 29, 2000): 357–60. http://dx.doi.org/10.1098/rstb.2000.0573.

Full text
Abstract:
In the humoral arm of the immune system, the memory response is not only more quickly elicited and of greater magnitude than the primary response, but it is also different in quality. In the recall response to antigen, the antibodies produced are of higher affinity and of different isotype (typically immunoglobulin G rather than immunoglobulin M). This maturation rests on the antigen dependence of B–cell maturation and is effected by programmed genetic modifications of the immunoglobulin gene loci. Here we consider how the B–cell response to antigen depends on the affinity of the antigen–receptor interaction. We also compare and draw parallels between the two processes, which underpin the generation of secondaryresponse antibodies: V gene somatic hypermutation and immunoglobulin heavy–chain class switching.
APA, Harvard, Vancouver, ISO, and other styles
8

Góes, Luís Fabrício Wanderley, Christiane Pousa Ribeiro, Márcio Castro, Jean-François Méhaut, Murray Cole, and Marcelo Cintra. "Automatic Skeleton-Driven Memory Affinity for Transactional Worklist Applications." International Journal of Parallel Programming 42, no. 2 (May 31, 2013): 365–82. http://dx.doi.org/10.1007/s10766-013-0253-x.

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

Kaji, Tomohiro, Akiko Ishige, Masaki Hikida, Junko Taka, Atsushi Hijikata, Masato Kubo, Takeshi Nagashima, et al. "Distinct cellular pathways select germline-encoded and somatically mutated antibodies into immunological memory." Journal of Experimental Medicine 209, no. 11 (October 1, 2012): 2079–97. http://dx.doi.org/10.1084/jem.20120127.

Full text
Abstract:
One component of memory in the antibody system is long-lived memory B cells selected for the expression of somatically mutated, high-affinity antibodies in the T cell–dependent germinal center (GC) reaction. A puzzling observation has been that the memory B cell compartment also contains cells expressing unmutated, low-affinity antibodies. Using conditional Bcl6 ablation, we demonstrate that these cells are generated through proliferative expansion early after immunization in a T cell–dependent but GC-independent manner. They soon become resting and long-lived and display a novel distinct gene expression signature which distinguishes memory B cells from other classes of B cells. GC-independent memory B cells are later joined by somatically mutated GC descendants at roughly equal proportions and these two types of memory cells efficiently generate adoptive secondary antibody responses. Deletion of T follicular helper (Tfh) cells significantly reduces the generation of mutated, but not unmutated, memory cells early on in the response. Thus, B cell memory is generated along two fundamentally distinct cellular differentiation pathways. One pathway is dedicated to the generation of high-affinity somatic antibody mutants, whereas the other preserves germ line antibody specificities and may prepare the organism for rapid responses to antigenic variants of the invading pathogen.
APA, Harvard, Vancouver, ISO, and other styles
10

Smith, Kenneth G. C., Amanda Light, Lorraine A. O'Reilly, Soon-Meng Ang, Andreas Strasser, and David Tarlinton. "bcl-2 Transgene Expression Inhibits Apoptosis in the Germinal Center and Reveals Differences in the Selection of Memory B Cells and Bone Marrow Antibody-Forming Cells." Journal of Experimental Medicine 191, no. 3 (February 7, 2000): 475–84. http://dx.doi.org/10.1084/jem.191.3.475.

Full text
Abstract:
Immunization with T cell–dependent antigens generates long-lived memory B cells and antibody-forming cells (AFCs). Both populations originate in germinal centers and, predominantly, produce antibodies with high affinity for antigen. The means by which germinal center B cells are recruited into these populations remains unclear. We have examined affinity maturation of antigen-specific B cells in mice expressing the cell death inhibitor bcl-2 as a transgene. Such mice had reduced apoptosis in germinal centers and an excessive number of memory B cells with a low frequency of V gene somatic mutation, including those mutations encoding amino acid exchanges known to enhance affinity. Despite the frequency of AFCs being increased in bcl-2–transgenic mice, the fraction secreting high-affinity antibody in the bone marrow at day 42 remained unchanged compared with controls. The inability of BCL-2 to alter selection of bone marrow AFCs is consistent with these cells being selected within the germinal center on the basis of their affinity being above some threshold rather than their survival being due to a selective competition for an antigen-based signal. Continuous competition for antigen does, however, explain formation of the memory compartment.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Memory Affinity"

1

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.

Full text
Abstract:
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, and other styles
2

Zhou, Naweiluo. "Autonomic Thread Parallelism and Mapping Control for Software Transactional Memory." Thesis, Université Grenoble Alpes (ComUE), 2016. http://www.theses.fr/2016GREAM045/document.

Full text
Abstract:
L’exécution de programmes paralléles demande à établir un compromis entre le temps de calcul (nombre de threads) et le temps de synchronisation. Ce compromis dépend principalement du nombre de threads actifs. Un haut degré de parallélisme (beaucoup de threads) permet généralement de diminuer le temps de calcul, mais peut aussi avoir pour conséquence d’augmenter les surcoûts de synchronisation entre threads. De plus, le placement des threads sur les cœurs peut impacter les performances du programme, car le temps pour accéder aux données en mémoire peut varier d’un cœur à l’autre en raison de la contention sur la la hiérarchie mémoire. Ainsi, la performance d’un programme peut être améliorée en adaptant le nombre de threads actifs et en plaçant correctement les threads sur les cœurs de calcul. Cependant, il n’existe pas de règle universelle permettant de décider a priori du niveau de parallélisme optimal et du placement de threads d’un programme, en particulier pour un programme avec les changemets de comportement dynamique. D’ailleurs, un paramétrage hors ligne est moins précis. Cette thèse présente un travail sur la gestion dynamique du parallélisme et du placement de threads. Cette thèse s’attaque au problème de gestion de threads utilisant de la mémoire transactionnelle logicielle (Software Transactional Memory, STM). La mémoire transactionnelle logicielle constitue une technique prometteuse pour traiter le problème de synchronisation en évitant les verrous.Le concept de calcul autonomique offre aux programmeurs un cadre de méthodeset techniques pour construire des systèmes auto-adaptatifs ayant un comportementmaîtrisé. L’idée clé est d’implémenter des boucles de rétroaction afin de concevoir des contrôleurs sûrs, efficaces et prédictibles, permettant d’observer et d’ajuster de manière dynamique les systèmes contrôlés, tout en minimisant le surcoût d’une telle méthode. La thèse propose de concevoir des boucles de rétroaction afin d’automatiser le gestion de threads à l’exécution avec comme objectif la réduction du temps d’exécution des programmes
Parallel programs need to manage the trade-off between the time spent in synchronisation and computation. The trade-off is significantly affected by the number of active threads. High parallelism may decrease computing time while increase synchronisation cost. Furthermore, thread placement on different cores may impact on program performance, as the data access time can vary from one core to another due to intricacies of its underlying memory architecture. Therefore, the performance of a program can be improved by adjusting its parallelism degree and the mapping of its threads to physical cores. Alas, there is no universal rule to decide them for a program from an offline view, especially for a program with online behaviour variation. Moreover, offline tuning is less precise. This thesis presents work on dynamical management of parallelism and thread placement. It addresses multithread issues via Software Transactional Memory (STM). STM has emerged as a promising technique, which bypasses locks, to tackle synchronisation through transactions. Autonomic computing offers designers a framework of methods and techniques to build autonomic systems with well-mastered behaviours. Its key idea is to implement feedback control loops to design safe, efficient and predictable controllers, which enable monitoring and adjusting controlled systems dynamically while keeping overhead low. This dissertation proposes feedback control loops to automate management of threads at runtime and diminish program execution time
APA, Harvard, Vancouver, ISO, and other styles
3

Nordén, Markus. "Multithreaded PDE Solvers on Non-Uniform Memory Architectures." Doctoral thesis, Uppsala universitet, Avdelningen för teknisk databehandling, 2006. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-7149.

Full text
Abstract:
A trend in parallel computer architecture is that systems with a large shared memory are becoming more and more popular. A shared memory system can be either a uniform memory architecture (UMA) or a cache coherent non-uniform memory architecture (cc-NUMA). In the present thesis, the performance of parallel PDE solvers on cc-NUMA computers is studied. In particular, we consider the shared namespace programming model, represented by OpenMP. Since the main memory is physically, or geographically distributed over several multi-processor nodes, the latency for local memory accesses is smaller than for remote accesses. Therefore, the geographical locality of the data becomes important. The focus of the present thesis is to study multithreaded PDE solvers on cc-NUMA systems, in particular their memory access pattern with respect to geographical locality. The questions posed are: (1) How large is the influence on performance of the non-uniformity of the memory system? (2) How should a program be written in order to reduce this influence? (3) Is it possible to introduce optimizations in the computer system for this purpose? The main conclusion is that geographical locality is important for performance on cc-NUMA systems. This is shown experimentally for a broad range of PDE solvers as well as theoretically using a model involving characteristics of computer systems and applications. Geographical locality can be achieved through migration directives that are inserted by the programmer or — possibly in the future — automatically by the compiler. On some systems, it can also be accomplished by means of transparent, hardware initiated migration and replication. However, a necessary condition that must be fulfilled if migration is to be effective is that the memory access pattern must not be "speckled", i.e. as few threads as possible shall make accesses to each memory page. We also conclude that OpenMP is competitive with MPI on cc-NUMA systems if care is taken to get a favourable data distribution.
APA, Harvard, Vancouver, ISO, and other styles
4

Radovic, Zoran. "Software Techniques for Distributed Shared Memory." Doctoral thesis, Uppsala University, Department of Information Technology, 2005. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-6058.

Full text
Abstract:

In large multiprocessors, the access to shared memory is often nonuniform, and may vary as much as ten times for some distributed shared-memory architectures (DSMs). This dissertation identifies another important nonuniform property of DSM systems: nonuniform communication architecture, NUCA. High-end hardware-coherent machines built from large nodes, or from chip multiprocessors, are typical NUCA systems, since they have a lower penalty for reading recently written data from a neighbor's cache than from a remote cache. This dissertation identifies node affinity as an important property for scalable general-purpose locks. Several software-based hierarchical lock implementations exploiting NUCAs are presented and evaluated. NUCA-aware locks are shown to be almost twice as efficient for contended critical sections compared to traditional lock implementations.

The shared-memory “illusion”' provided by some large DSM systems may be implemented using either hardware, software or a combination thereof. A software-based implementation can enable cheap cluster hardware to be used, but typically suffers from poor and unpredictable performance characteristics.

This dissertation advocates a new software-hardware trade-off design point based on a new combination of techniques. The two low-level techniques, fine-grain deterministic coherence and synchronous protocol execution, as well as profile-guided protocol flexibility, are evaluated in isolation as well as in a combined setting using all-software implementations. Finally, a minimum of hardware trap support is suggested to further improve the performance of coherence protocols across cluster nodes. It is shown that all these techniques combined could result in a fairly stable performance on par with hardware-based coherence.

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

Centuori, Sara M., Cecil J. Gomes, Samuel S. Kim, Charles W. Putnam, Brandon T. Larsen, Linda L. Garland, David W. Mount, and Jesse D. Martinez. "Double-negative (CD27−IgD−) B cells are expanded in NSCLC and inversely correlate with affinity-matured B cell populations." BIOMED CENTRAL LTD, 2018. http://hdl.handle.net/10150/627195.

Full text
Abstract:
Background: The presence of B cells in early stage non-small cell lung cancer (NSCLC) is associated with longer survival, however, the role these cells play in the generation and maintenance of anti-tumor immunity is unclear. B cells differentiate into a variety of subsets with differing characteristics and functions. To date, there is limited information on the specific B cell subsets found within NSCLC. To better understand the composition of the B cell populations found in NSCLC we have begun characterizing B cells in lung tumors and have detected a population of B cells that are CD79A(+)CD27(-)IgD(-). These CD27(-)IgD(-)(double-negative) B cells have previously been characterized as unconventional memory B cells and have been detected in some autoimmune diseases and in the elderly population but have not been detected previously in tumor tissue. Methods: A total of 15 fresh untreated NSCLC tumors and 15 matched adjacent lung control tissues were dissociated and analyzed by intracellular flow cytometry to detect the B cell-related markers CD79A, CD27 and IgD. All CD79A(+) B cells subsets were classified as either naive (CD27(-)IgD(+)), affinity-matured (CD27(+)IgD(-)), early memory/germinal center cells (CD27(+)IgD(+)) or double-negative B cells (CD27(-)IgD(-)). Association of double-negative B cells with clinical data including gender, age, smoking status, tumor diagnosis and pathologic differentiation status were also examined using the logistic regression analysis for age and student's t-test for all other variables. Associations with other B cell subpopulations were examined using Spearman's rank correlation. Results: We observed that double-negative B cells were frequently abundant in lung tumors compared to normal adjacent controls (13 out of 15 cases), and in some cases made up a substantial proportion of the total B cell compartment. The presence of double-negative cells was also found to be inversely related to the presence of affinity-matured B cells within the tumor, Spearman's coefficient of -0.76. Conclusions: This study is the first to observe the presence of CD27(-)IgD(-)double-negative B cells in human NSCLC and that this population is inversely correlated with traditional affinity-matured B cell populations.
APA, Harvard, Vancouver, ISO, and other styles
6

Löf, Henrik. "Iterative and Adaptive PDE Solvers for Shared Memory Architectures." Doctoral thesis, Uppsala universitet, Avdelningen för teknisk databehandling, 2006. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-7136.

Full text
Abstract:
Scientific computing is used frequently in an increasing number of disciplines to accelerate scientific discovery. Many such computing problems involve the numerical solution of partial differential equations (PDE). In this thesis we explore and develop methodology for high-performance implementations of PDE solvers for shared-memory multiprocessor architectures. We consider three realistic PDE settings: solution of the Maxwell equations in 3D using an unstructured grid and the method of conjugate gradients, solution of the Poisson equation in 3D using a geometric multigrid method, and solution of an advection equation in 2D using structured adaptive mesh refinement. We apply software optimization techniques to increase both parallel efficiency and the degree of data locality. In our evaluation we use several different shared-memory architectures ranging from symmetric multiprocessors and distributed shared-memory architectures to chip-multiprocessors. For distributed shared-memory systems we explore methods of data distribution to increase the amount of geographical locality. We evaluate automatic and transparent page migration based on runtime sampling, user-initiated page migration using a directive with an affinity-on-next-touch semantic, and algorithmic optimizations for page-placement policies. Our results show that page migration increases the amount of geographical locality and that the parallel overhead related to page migration can be amortized over the iterations needed to reach convergence. This is especially true for the affinity-on-next-touch methodology whereby page migration can be initiated at an early stage in the algorithms. We also develop and explore methodology for other forms of data locality and conclude that the effect on performance is significant and that this effect will increase for future shared-memory architectures. Our overall conclusion is that, if the involved locality issues are addressed, the shared-memory programming model provides an efficient and productive environment for solving many important PDE problems.
APA, Harvard, Vancouver, ISO, and other styles
7

Moreaud, Stéphanie. "Mouvement de données et placement des tâches pour les communications haute performance sur machines hiérarchiques." Phd thesis, Université Sciences et Technologies - Bordeaux I, 2011. http://tel.archives-ouvertes.fr/tel-00635651.

Full text
Abstract:
Les architectures des machines de calcul sont de plus en plus complexes et hiérarchiques, avec des processeurs multicœurs, des bancs mémoire distribués, et de multiples bus d'entrées-sorties. Dans le cadre du calcul haute performance, l'efficacité de l'exécution des applications parallèles dépend du coût de communication entre les tâches participantes qui est impacté par l'organisation des ressources, en particulier par les effets NUMA ou de cache. Les travaux de cette thèse visent à l'étude et à l'optimisation des communications haute performance sur les architectures hiérarchiques modernes. Ils consistent tout d'abord en l'évaluation de l'impact de la topologie matérielle sur les performances des mouvements de données, internes aux calculateurs ou au travers de réseaux rapides, et pour différentes stratégies de transfert, types de matériel et plateformes. Dans une optique d'amélioration et de portabilité des performances, nous proposons ensuite de prendre en compte les affinités entre les communications et le matériel au sein des bibliothèques de communication. Ces recherches s'articulent autour de l'adaptation du placement des tâches en fonction des schémas de transfert et de la topologie des calculateurs, ou au contraire autour de l'adaptation des stratégies de mouvement de données à une répartition définie des tâches. Ce travail, intégré aux principales bibliothèques MPI, permet de réduire de façon significative le coût des communications et d'améliorer ainsi les performances applicatives. Les résultats obtenus témoignent de la nécessité de prendre en compte les caractéristiques matérielles des machines modernes pour en exploiter la quintessence.
APA, Harvard, Vancouver, ISO, and other styles
8

Wirzberger, Maria, René Schmidt, Maria Georgi, Wolfram Hardt, Guido Brunnett, and Günter Daniel Rey. "Effects of system response delays on elderly humans’ cognitive performance in a virtual training scenario." Springer Nature, 2019. https://monarch.qucosa.de/id/qucosa%3A34294.

Full text
Abstract:
Observed influences of system response delay in spoken human-machine dialogues are rather ambiguous and mainly focus on perceived system quality. Studies that systematically inspect effects on cognitive performance are still lacking, and effects of individual characteristics are also often neglected. Building on benefits of cognitive training for decelerating cognitive decline, this Wizard-of-Oz study addresses both issues by testing 62 elderly participants in a dialogue-based memory training with a virtual agent. Participants acquired the method of loci with fading instructional guidance and applied it afterward to memorizing and recalling lists of German nouns. System response delays were randomly assigned, and training performance was included as potential mediator. Participants’ age, gender, and subscales of affinity for technology (enthusiasm, competence, positive and negative perception of technology) were inspected as potential moderators. The results indicated positive effects on recall performance with higher training performance, female gender, and less negative perception of technology. Additionally, memory retention and facets of affinity for technology moderated increasing system response delays. Participants also provided higher ratings in perceived system quality with higher enthusiasm for technology but reported increasing frustration with a more positive perception of technology. Potential explanations and implications for the design of spoken dialogue systems are discussed.
APA, Harvard, Vancouver, ISO, and other styles
9

Grund, Lidiane Zito. "Papel das citocinas IL-5 e IL-17A na diferenciação de células produtoras de anticorpos de vida longa (ASC) induzida pelo veneno do peixe Thalassophryne nattereri." Universidade de São Paulo, 2009. http://www.teses.usp.br/teses/disponiveis/42/42133/tde-09022010-114250/.

Full text
Abstract:
O veneno do T.nattereri induz uma resposta de memória com a diferenciação de células B B220neg, indicativo de células produtoras de anticorpos de vida longa (ASC). Para avaliar o efeito do veneno na diferenciação de ASCs, camundongos BALB/c foram imunizados e sacrificados nos dias 21, 28, 48, 74 e 120 para avaliação de anticorpos plasmáticos e células B no peritônio, baço e medula óssea. O veneno induziu intensa esplenomegalia, formação de centros germinativos e persistentes níveis de anticorpos específicos IgG1, IgG2a e IgE anafilática. Células B1a e ASC apareceram rapidamente e a população de ASC CD138pos foi dividida em três subtipos (B220highCD43high, B220lowCD43low, e B220negCD43high) que persistiram em diferentes níveis em todos compartimentos. Finalmente, por métodos de neutralização nós sugerimos um papel importante da IL-5 e IL-17 A no desenvolvimento de ASC B220neg e na população B1a e mais ainda, a produção de TNF-a, IL-1b, IL-6, KC bem como a retenção do veneno nas células dendríticas foliculares parece promover os mecanismos para manutenção das ASCs.
T. nattereri fish venom induces a memory immune response with the differentiation of B cells B220neg, an indicative of long-lived antibody-secreting cells - ASC. To assess the effect of the venom on differentiation of ASCs, BALB/c mice were immunized with venom and sacrificed at days 21, 28, 48, 74 and 120 to evaluate plasmatic antibodies and B cell subtypes in peritoneum, spleen and bone marrow. The venom promoted splenomegaly, germinal centers formation and persistent levels of specific antibodies IgG1, IgG2a and anaphylactic IgE. B1a cells and ASC emerged rapidly and CD138pos ASCs can be divided into three subsets (B220high CD43high, B220low CD43low, and B220neg CD43high) that persist at different levels in all compartments. Finally, by neutralization methods we suggested an important role for IL-5 and IL-17A on development of B220neg ASCs and B1a population and moreover the production of TNF-a, IL-1b, IL-6, KC as well as the venom retained in follicular dendritic cells seem to provide mechanisms to explain the maintenance of ASCs.
APA, Harvard, Vancouver, ISO, and other styles
10

HUANG, CHUN-CHIH, and 黃俊智. "Improvement of Memory Bandwidth Utilization using OpenMP Task with Processor Affinity." Thesis, 2013. http://ndltd.ncl.edu.tw/handle/38777552387604890104.

Full text
Abstract:
碩士
輔仁大學
資訊工程學系碩士班
102
The CPU design has been evolving for more than 30 years since the first x86-microprocessor. The processor frequency has increased according to Moore's Law and continued upward until encountering bottlenecks caused by power consumption problems and heat dissipation. As a result, CPU performance improvement has slowed recently. The current solution is to increase the number of cores, but not increase the operating frequency. Even though the computing performance of processors has increased, memory speed and bandwidth have not caught up with processor speed in terms of shared memory architectures. Multi-core processor technology is rapidly evolving, but the memory interface is a limiting factor in fulfilling the needs of multi-core and multi-threaded processors. This is a big challenge for software developers. This thesis mainly focuses on research regarding applications that consume a large amount of memory resources, and measuring the memory bandwidth usage in parallel programming applications in shared memory multi-core computing environments. The run time thread is dynamically allocated to each processor core by the scheduler of operating system. Current parallel programming researches only aim to load balance and keep the multi-core running efficiently. As a result, applications may have poor spatial data locality. This will also cause uneven memory bandwidth usage due to differences in memory access paths. The question of obtaining maximum memory bandwidth utilization by controlling the thread of processor affinity is the main scope of this particular research. According to the test results, the OpenMP task level parallelism achieved a 7% (8776.87 MB/s to 9376.27 MB/s) improvement compared to OpenMP parallel level parallelism. Memory bandwidth utilization of 62% (8786.87 MB/s to 14201.88 MB/s) was achieved if appropriate processor affinity was set for thread placement. OpenMP task level parallelism in addition to processor affinity resulted in 69% (8786.87 MB/s to 14802.69 MB/s) of improvement using 2 threads. Similarly, using 4 threads with 33% (11801.28 to 15704.62 MB/s) of improvement, 6 threads with 20% (13098.61 to 15840.78 MB/s) of improvement, 12 and 24 threads with 15% (13753.40 to 15825.86 MB/s) of improvement had been observed. Thus, task level parallelism combined with processor affinity greatly increases the level of parallelism in an OpenMP parallel programming environment. As a result, it can improve the overall performance of parallel applications.
APA, Harvard, Vancouver, ISO, and other styles

Books on the topic "Memory Affinity"

1

Williamson, J. N. Affinity. New York City: Leisure Books, 2001.

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

Torrellas, Josep. Evaluating the benefits of cache-affinity scheduling in shared-memory multiprocessors. Stanford, Calif: Computer Systems Laboratory, Stanford University, 1992.

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

Kämpchen, Martin. Indo-German Exchanges in Education. Oxford University Press, 2020. http://dx.doi.org/10.1093/oso/9780190126278.001.0001.

Full text
Abstract:
Rabindranath Tagore visited Germany three times and professed a special affinity to the German people and their culture. In 1930, his final visit, the Indian poet met the German couple Paul and Edith Geheeb, who had started the Odenwaldschule in 1910. They fled from Germany (from the Hitler regime) in 1934 to Switzerland and led their new school, the Ecole D’Humanité, until their death. They followed the innovative education of the Reformpädagogik (New Education Movement) which gave maximum freedom to children to choose their education. Tagore recognized a striking similarity to his school in Santiniketan. Both educators, working in two different cultures and historical situations, came to the same basic conclusions about how education of children should be like in this modern age. The book first discusses the personalities of Paul and Edith Geheeb and offers a brief delineation of their school’s genesis. The meeting with Rabindranath Tagore and its aftermath is given special attention as it still occupies an important place in the collective memory of the Ecole d’Humanité. After a study of the pedagogical principles which guided Tagore and Geheeb, a comparative study of its similarities and dissimilarities follows. Geheeb’s two schools generated Indo-German cultural activities, especially in the field of Sanskrit studies. The schools had numerous Indian guests and Paul and Edith corresponded with several Indian personalities. Edith developed an interest in the activities of the Ramakrishna Mission. In 1953, Indira Gandhi and her sons stayed in the Ecole. In 1965–6, when Edith was 80, she visited India, especially Tagore’s Santiniketan and Belur Math, the headquarters of the Ramakrishna Mission.
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Memory Affinity"

1

Terboven, Christian, Jonas Hahnfeld, Xavier Teruel, Sergi Mateo, Alejandro Duran, Michael Klemm, Stephen L. Olivier, and Bronis R. de Supinski. "Approaches for Task Affinity in OpenMP." In OpenMP: Memory, Devices, and Tasks, 102–15. Cham: Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-45550-1_8.

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

Pophale, Swaroop, and Oscar Hernandez. "Evaluating OpenMP Affinity on the POWER8 Architecture." In OpenMP: Memory, Devices, and Tasks, 35–46. Cham: Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-45550-1_3.

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

Schmidl, Dirk, Tim Cramer, Christian Terboven, Dieter an Mey, and Matthias S. Müller. "An OpenMP Extension Library for Memory Affinity." In Using and Improving OpenMP for Devices, Tasks, and More, 103–14. Cham: Springer International Publishing, 2014. http://dx.doi.org/10.1007/978-3-319-11454-5_8.

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

Virouleau, Philippe, Adrien Roussel, François Broquedis, Thierry Gautier, Fabrice Rastello, and Jean-Marc Gratien. "Description, Implementation and Evaluation of an Affinity Clause for Task Directives." In OpenMP: Memory, Devices, and Tasks, 61–73. Cham: Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-45550-1_5.

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

Shi, Weisong, and Zhimin Tang. "Affinity-Based Self Scheduling for Software Shared Memory Systems." In Lecture Notes in Computer Science, 163–68. Berlin, Heidelberg: Springer Berlin Heidelberg, 1999. http://dx.doi.org/10.1007/978-3-540-46642-0_23.

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

Pousa Ribeiro, Christiane, Márcio Castro, Jean-François Méhaut, and Alexandre Carissimi. "Improving Memory Affinity of Geophysics Applications on NUMA Platforms Using Minas." In Lecture Notes in Computer Science, 279–92. Berlin, Heidelberg: Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-19328-6_27.

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

Mitchell, Kate. "‘Making it seem like it’s authentic’: the Faux-Victorian Novel as Cultural Memory in Affinity and Fingersmith." In History and Cultural Memory in Neo-Victorian Fiction, 117–42. London: Palgrave Macmillan UK, 2010. http://dx.doi.org/10.1057/9780230283121_6.

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

Kim, Dongwook, Eunjin Kim, and Joonwon Lee. "A Virtual Cache Scheme for Improving Cache-Affinity on Multiprogrammed Shared Memory Multiprocessors." In High Performance Computing Systems and Applications, 249. Boston, MA: Springer US, 1998. http://dx.doi.org/10.1007/978-1-4615-5611-4_25.

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

Veugelers, John W. P. "Discourse and Politics." In Empire's Legacy, 133–52. Oxford University Press, 2019. http://dx.doi.org/10.1093/oso/9780190875664.003.0010.

Full text
Abstract:
This chapter distinguishes between front- and back-stage discourse in locating the nature and extent of the affinity between the ex-colonials and the far right. The front stage discourse of the far right avoids the folkways, Orientalism, and collective memory of the French of Algeria, whose front-stage discourse in turn avoids partisanship. The backstage discourse of each reveals a stronger affinity: the party newspaper shows a preoccupation with French Algeria (as well as Pétainism); and the private discourse of the ex-colonials shows signs of nativism, populism, anti-communism, and suspicion of Islam. Divergences remain, significantly, over republicanism, anti-Semitism, and the deeper tradition of the French far right.
APA, Harvard, Vancouver, ISO, and other styles
10

Ahmad, Waseem. "Artificial Immune Optimization Algorithm." In Improving Knowledge Discovery through the Integration of Data Mining Techniques, 104–23. IGI Global, 2015. http://dx.doi.org/10.4018/978-1-4666-8513-0.ch006.

Full text
Abstract:
Artificial immune system (AIS) is a paradigm inspired by processes and metaphors of natural immune system (NIS). There is a rapidly growing interest in AIS approaches to machine learning and especially in the domain of optimization. Of particular interest is the way human body responds to diseases and pathogens as well as adapts to remain immune for long periods after a disease has been combated. In this chapter, we are presenting a novel multilayered natural immune system (NIS) inspired algorithms in the domain of optimization. The proposed algorithm uses natural immune system components such as B-cells, Memory cells and Antibodies; and processes such as negative clonal selection and affinity maturation to find multiple local optimum points. Another benefit this algorithm presents is the presence of immunological memory that is in the form of specific memory cells which keep track of previously explored solutions. The algorithm is evaluated on two well-known numeric functions to demonstrate the applicability.
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Memory Affinity"

1

Ribeiro, Christiane Pousa, Jean-Francois Mehaut, Alexandre Carissimi, Marcio Castro, and Luiz Gustavo Fernandes. "Memory Affinity for Hierarchical Shared Memory Multiprocessors." In 2009 21st International Symposium on Computer Architecture and High Performance Computing (SBAC-PAD). IEEE, 2009. http://dx.doi.org/10.1109/sbac-pad.2009.16.

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

Pasqualin, Douglas Pereira, Matthias Diener, Andre Rauber Du Bois, and Mauricio Lima Pilla. "Thread Affinity in Software Transactional Memory." In 2020 19th International Symposium on Parallel and Distributed Computing (ISPDC). IEEE, 2020. http://dx.doi.org/10.1109/ispdc51135.2020.00033.

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

Torrellas, Josep, Andrew Tucker, and Anoop Gupta. "Benefits of cache-affinity scheduling in shared-memory multiprocessors." In the 1993 ACM SIGMETRICS conference. New York, New York, USA: ACM Press, 1993. http://dx.doi.org/10.1145/166955.167038.

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

Diener, Matthias, Eduardo H. M. Cruz, Marco A. Z. Alves, Edson Borin, and Philippe O. A. Navaux. "Optimizing memory affinity with a hybrid compiler/OS approach." In CF '17: Computing Frontiers Conference. New York, NY, USA: ACM, 2017. http://dx.doi.org/10.1145/3075564.3075566.

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

Ribeiro, Christiane Pousa, Jean-Francois Mehaut, and Alexandre Carissimi. "Memory affinity management for numerical scientific applications over Multi-core Multiprocessors with Hierarchical Memory." In 2010 IEEE International Symposium on Parallel & Distributed Processing, Workshops and Phd Forum (IPDPSW 2010). IEEE, 2010. http://dx.doi.org/10.1109/ipdpsw.2010.5470796.

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

Zhong, Qi, Xuetao Guan, Tao Huang, Xu Cheng, and Keyi Wang. "Affinity-aware DMA buffer management for reducing off-chip memory access." In the 27th Annual ACM Symposium. New York, New York, USA: ACM Press, 2012. http://dx.doi.org/10.1145/2245276.2232031.

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

Arul, Joseph M., and Chun-Chih Huang. "Improvement of memory bandwidth utilization using OpenMP task with processor affinity." In 2015 International Symposium on Next-Generation Electronics (ISNE). IEEE, 2015. http://dx.doi.org/10.1109/isne.2015.7131947.

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

Misale, Claudia. "Accelerating Bowtie2 with a lock-less concurrency approach and memory affinity." In 2014 22nd Euromicro International Conference on Parallel, Distributed and Network-Based Processing (PDP). IEEE, 2014. http://dx.doi.org/10.1109/pdp.2014.50.

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

Jia, Gangyong, Xi Li, Chao Wang, Xuehai Zhou, and Zongwei Zhu. "Memory Affinity: Balancing Performance, Power, Thermal and Fairness for Multi-core Systems." In 2012 IEEE International Conference on Cluster Computing (CLUSTER). IEEE, 2012. http://dx.doi.org/10.1109/cluster.2012.33.

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

Vaswani, Raj, and John Zahorjan. "The implications of cache affinity on processor scheduling for multiprogrammed, shared memory multiprocessors." In the thirteenth ACM symposium. New York, New York, USA: ACM Press, 1991. http://dx.doi.org/10.1145/121132.121140.

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

Reports on the topic "Memory Affinity"

1

Cox, Jeremy. The unheard voice and the unseen shadow. Norges Musikkhøgskole, August 2018. http://dx.doi.org/10.22501/nmh-ar.621671.

Full text
Abstract:
The French composer Francis Poulenc had a profound admiration and empathy for the writings of the Spanish poet Federico García Lorca. That empathy was rooted in shared aspects of the artistic temperament of the two figures but was also undoubtedly reinforced by Poulenc’s fellow-feeling on a human level. As someone who wrestled with his own homosexuality and who kept his orientation and his relationships apart from his public persona, Poulenc would have felt an instinctive affinity for a figure who endured similar internal conflicts but who, especially in his later life and poetry, was more open about his sexuality. Lorca paid a heavy price for this refusal to dissimulate; his arrest in August 1936 and his assassination the following day, probably by Nationalist militia, was accompanied by taunts from his killers about his sexuality. Everything about the Spanish poet’s life, his artistic affinities, his personal predilections and even the relationship between these and his death made him someone to whom Poulenc would be naturally drawn and whose untimely demise he would feel keenly and might wish to commemorate musically. Starting with the death of both his parents while he was still in his teens, reinforced by the sudden loss in 1930 of an especially close friend, confidante and kindred spirit, and continuing throughout the remainder of his life with the periodic loss of close friends, companions and fellow-artists, Poulenc’s life was marked by a succession of bereavements. Significantly, many of the dedications that head up his compositions are ‘to the memory of’ the individual named. As Poulenc grew older, and the list of those whom he had outlived lengthened inexorably, his natural tendency towards the nostalgic and the elegiac fused with a growing sense of what might be termed a ‘survivor’s anguish’, part of which he sublimated into his musical works. It should therefore come as no surprise that, during the 1940s, and in fulfilment of a desire that he had felt since the poet’s death, he should turn to Lorca for inspiration and, in the process, attempt his own act of homage in two separate works: the Violin Sonata and the ‘Trois Chansons de Federico García Lorca’. This exposition attempts to unfold aspects of the two men’s aesthetic pre-occupations and to show how the parallels uncovered cast reciprocal light upon their respective approaches to the creative process. It also examines the network of enfolded associations, musical and autobiographical, which link Poulenc’s two compositions commemorating Lorca, not only to one another but also to a wider circle of the composer’s works, especially his cycle setting poems of Guillaume Apollinaire: ‘Calligrammes’. Composed a year after the ‘Trois Chansons de Federico García Lorca’, this intricately wrought collection of seven mélodies, which Poulenc saw as the culmination of an intensive phase in his activity in this genre, revisits some of ‘unheard voices’ and ‘unseen shadows’ enfolded in its predecessor. It may be viewed, in part, as an attempt to bring to fuller resolution the veiled but keenly-felt anguish invoked by these paradoxical properties.
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Memory Affinity' for particular source types:
Journal articles
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography