Littérature scientifique sur le sujet « Distribution shared memory »
Créez une référence correcte selon les styles APA, MLA, Chicago, Harvard et plusieurs autres
Sommaire
Consultez les listes thématiques d’articles de revues, de livres, de thèses, de rapports de conférences et d’autres sources académiques sur le sujet « Distribution shared memory ».
À côté de chaque source dans la liste de références il y a un bouton « Ajouter à la bibliographie ». Cliquez sur ce bouton, et nous générerons automatiquement la référence bibliographique pour la source choisie selon votre style de citation préféré : APA, MLA, Harvard, Vancouver, Chicago, etc.
Vous pouvez aussi télécharger le texte intégral de la publication scolaire au format pdf et consulter son résumé en ligne lorsque ces informations sont inclues dans les métadonnées.
Articles de revues sur le sujet "Distribution shared memory"
Chandra, Rohit, Ding-Kai Chen, Robert Cox, Dror E. Maydan, Nenad Nedeljkovic et Jennifer M. Anderson. « Data distribution support on distributed shared memory multiprocessors ». ACM SIGPLAN Notices 32, no 5 (mai 1997) : 334–45. http://dx.doi.org/10.1145/258916.258945.
Texte intégralMarzolla, Moreno, et Gabriele D’angelo. « Parallel Data Distribution Management on Shared-memory Multiprocessors ». ACM Transactions on Modeling and Computer Simulation 30, no 1 (8 février 2020) : 1–25. http://dx.doi.org/10.1145/3369759.
Texte intégralAxtmann, Michael, Sascha Witt, Daniel Ferizovic et Peter Sanders. « Engineering In-place (Shared-memory) Sorting Algorithms ». ACM Transactions on Parallel Computing 9, no 1 (31 mars 2022) : 1–62. http://dx.doi.org/10.1145/3505286.
Texte intégralO'Hearn, Kurt A., Abdullah Alperen et Hasan Metin Aktulga. « Fast Solvers for Charge Distribution Models on Shared Memory Platforms ». SIAM Journal on Scientific Computing 42, no 1 (janvier 2020) : C1—C22. http://dx.doi.org/10.1137/18m1224684.
Texte intégralBYNA, SURENDRA, KIRK W. CAMERON et XIAN-HE SUN. « ISOLATING COSTS IN SHARED MEMORY COMMUNICATION BUFFERING ». Parallel Processing Letters 15, no 04 (décembre 2005) : 357–65. http://dx.doi.org/10.1142/s0129626405002271.
Texte intégralAddison, C., Y. Ren et M. van Waveren. « OpenMP Issues Arising in the Development of Parallel BLAS and LAPACK Libraries ». Scientific Programming 11, no 2 (2003) : 95–104. http://dx.doi.org/10.1155/2003/278167.
Texte intégralCrooks, P., et R. H. Perrott. « Language Constructs for Data Partitioning and Distribution ». Scientific Programming 4, no 2 (1995) : 59–85. http://dx.doi.org/10.1155/1995/656010.
Texte intégralNikolopoulos, Dimitrios S., Ernest Artiaga, Eduard Ayguadé et Jesús Labarta. « Scaling Non-Regular Shared-Memory Codes by Reusing Custom Loop Schedules ». Scientific Programming 11, no 2 (2003) : 143–58. http://dx.doi.org/10.1155/2003/379739.
Texte intégralBozkus, Zeki, Larry Meadows, Steven Nakamoto, Vincent Schuster et Mark Young. « PGHPF – An Optimizing High Performance Fortran Compiler for Distributed Memory Machines ». Scientific Programming 6, no 1 (1997) : 29–40. http://dx.doi.org/10.1155/1997/705102.
Texte intégralWarren, Karen H. « PDDP, A Data Parallel Programming Model ». Scientific Programming 5, no 4 (1996) : 319–27. http://dx.doi.org/10.1155/1996/857815.
Texte intégralThèses sur le sujet "Distribution shared memory"
Leventhal, Sean. « Speculative data distribution in shared memory multiprocessors ». College Park, Md. : University of Maryland, 2008. http://hdl.handle.net/1903/8076.
Texte intégralThesis research directed by: Dept. of Electrical and Computer Engineering. Title from t.p. of PDF. Includes bibliographical references. Published by UMI Dissertation Services, Ann Arbor, Mich. Also available in paper.
HEMMATPOUR, MASOUD. « High Performance Computing using Infiniband-based clusters ». Doctoral thesis, Politecnico di Torino, 2019. http://hdl.handle.net/11583/2750549.
Texte intégralHedberg, Per Henrik. « Interpersonal society : essays on shared beliefs, trust, mnemonic oppression, distributive fairness, and value creation ». Doctoral thesis, Handelshögskolan i Stockholm, Institutionen för Marknadsföring och strategi, 2012. http://urn.kb.se/resolve?urn=urn:nbn:se:hhs:diva-1761.
Texte intégralTrapanese, Cinzia. « Spatial foraging in primates : strategies and mechanisms of decision-making What, where and when : spatial foraging decisions in primates Species-specific socio-ecology shapes spatial foraging strategies in primates Where or what ? Primates in “miniature nature” : frugivory triggers spatial cognition to forage efficiently ». Thesis, Sorbonne Paris Cité, 2018. http://www.theses.fr/2018USPCB119.
Texte intégralForaging can be a challenging activity, especially for animals like primates living in seasonal environments characterised by not fairly predictable food availability. Since fruit is an ephemeral resource, a frugivorous diet is associated to brain size and high cognitive abilities. This comparative study aims to investigate the spatial foraging strategies of three primate species (Macaca tonkeana=5 individuals, M. fascicularis=3 and Sapajus sp.=6) having different degree of frugivory and living in semi-free ranging conditions at the Primate Centre of Strasbourg University. The experimental protocol aims to assess the relative weight of Where (food location, Spatial Foraging Task), Where vs. What (food distribution, Clumped vs. Scattered Tasks and quality, Clumped vs. Quality Task) and When (food temporal availability) variables on the individual foraging decisions. Forty-two boxes were fixed on trees in the outdoor area and were lockable via a remote-control system to individually test subjects in their social group. Each week, a subset of boxes was filled with one/two appealing fruit types; a seasonal pace of one month was repeated for four months to mimic the seasonality of wild fruit. We recorded subjects' trajectories, the order of visited boxes and the presence of other individuals. In the Spatial Foraging Task, considering the trials in which subjects visited all six baited boxes (Tonkeans Ntrials=35, long-tailed macaques Ntrials=31, capuchins Ntrials=11), we compared the observed routes to simulated routes under three strategies: optimal route, nearest neighbour rule, random route. None of the species choose random routes, suggesting that they relied on spatial memory to visit food sites. Capuchins optimized more their travels than long-tailed macaques, which followed mainly a nearest neighbour strategy, while Tonkeans used both strategies at similar frequency. All study species used a global (optimal path) or local strategy (nearest-neighbour rule) to forage efficiently. In the Clumped vs. Scattered Tasks, we tested how the food distribution influences primate spatial foraging. In the Clumped vs. Scattered Task 1, 12 boxes were baited with the same fruit type, six boxes in a circular clumped distribution and other six in a scattered circle. The Task 2 provided a similarly preferred fruit in the same two circular configurations but with opposite reciprocal spatial positions in terms of the side of the outdoor area. All study species (Nvisited boxes=2477) visited at first significantly more the clumped distribution. In the Clumped vs. Quality Task, we assessed the relative impact of food preference versus food distribution: boxes had the similar spatial configuration of the Clumped vs. Scattered Task 1 but the scattered distribution was filled with the most favourite fruit and the clumped one with the least preferred fruit. All species (Nvisited boxes=2546) showed again a preference for visiting first the boxes of the clumped distribution, but the most frugivorous species, Tonkeans, showed a less strong preference compared to the least frugivorous, the capuchins. The higher was the frugivory degree of the species, the higher were the goal-directed travels. Lastly, to investigate if primates developed a temporal knowledge of fruit availability, we investigated if they correctly remembered food spatio-temporal availability: primates visited each month between 79%-98% of baited boxes/tot boxes visited, even if this positive result could be explained by alternative hypothesis (e.g. ability in detecting the available boxes). All primate species maximised foraging efficiency, avoiding random walks. However, frugivorous species took food preference into account in their decisions and showed significantly more goal-directed movement. This study underlines how species feeding ecology may affect the evolution of their abstract mental abilities and more in general, their behaviour
Huang, Chi-Ting, et 黃啟庭. « A Resource-Oriented Workload Distribution Scheme for Software Distributed Shared Memory Systems ». Thesis, 2003. http://ndltd.ncl.edu.tw/handle/99763665405419622002.
Texte intégral國立成功大學
電機工程學系碩博士班
91
Dynamic workload distribution plays an important role in Software Distributed Shared Memory Systems to improve system performance efficiently. It can adjust the workload distribution of DSM applications with runtime collected information at the executing period. By adequately utilizing various resources among nodes, DSM applications can archive the load balance and get the best performance. In early researches, most of them can not process workload distribution well among nodes which have different resource capability. It is because that the factors affecting the performance are not only the processor power but also the available physical memory and network bandwidth. By taking all of these factors into consideration, the DSM system can provide better performance in most situations. In this thesis, we will introduce a workload distribution scheme, named Resource-Oriented Workload Distribution Scheme (ROWDS), to achieve high performance in different environments. In the experiments, we can see that our ROWDS, which considers several factors simultaneously, can perform better than the other ones merely taking a single factor into account.
Kok, Yih-Tzye, et 郭義潔. « Design and Implementation of Load Distributing on Distributed Shared Memory System ». Thesis, 1995. http://ndltd.ncl.edu.tw/handle/88777216904949625158.
Texte intégral國立成功大學
電機工程研究所
83
Synchronization barries are the most costly constructs among other synchronization constructs in the MIMD parallel program model. The idle time due to synchronization barrier can be a source of overhead in a parallel computation, particularly when some load unbalance occurs. In this thesis, we will examine the effects of load unbalance on the synchronization barriers, and attempt to proposed a dynamic load distributing algorithm to circumvent these unbalance effects by minimizes the idle times that incurred by synchronization barriers. Additionally, communication cost due to the dependencies between threads are important consideration issues for performance improvement in the design of DSM system. We have attempted to include the communication cost consideration into our load distributing system design, by introduce a selection policy a selection policy for selecting a suitable thread for migration, which will reduce the communication cost in the system. All of the algorithms have been implemented on a locally distributed shared memory system, Cohesion. The experimental results show that the effect of load unbalance to the synchronization barrier will be reduced significantly, while our selection policy only do well on certain applications with a regular shared data access pattern.
Chapitres de livres sur le sujet "Distribution shared memory"
Nikolopoulos, Dimitrios S., et Eduard Ayguadé. « A Study of Implicit Data Distribution Methods for OpenMP Using the SPEC Benchmarks ». Dans OpenMP Shared Memory Parallel Programming, 115–29. Berlin, Heidelberg : Springer Berlin Heidelberg, 2001. http://dx.doi.org/10.1007/3-540-44587-0_11.
Texte intégralAyguadé, Eduard, Jordi Garcia, M. Luz Grande et Jesús Labarta. « Data distribution and loop parallelization for shared-memory multiprocessors ». Dans Languages and Compilers for Parallel Computing, 41–55. Berlin, Heidelberg : Springer Berlin Heidelberg, 1997. http://dx.doi.org/10.1007/bfb0017244.
Texte intégralHirooka, Takashi, Hiroshi Ohta et Takayoshi Iitsuka. « Automatic Data Distribution Method Using First Touch Control for Distributed Shared Memory Multiprocessors ». Dans Languages and Compilers for Parallel Computing, 147–61. Berlin, Heidelberg : Springer Berlin Heidelberg, 2003. http://dx.doi.org/10.1007/3-540-35767-x_10.
Texte intégralMattingly, R. B., et C. D. Meyer. « Computing the Stationary Distribution Vector of an Irreducible Markov Chain on a Shared-Memory Multiprocessor ». Dans Numerical Solution of Markov Chains, 491–510. Boca Raton : CRC Press, 2021. http://dx.doi.org/10.1201/9781003210160-26.
Texte intégralShanmugan, S. « Influences of Powder Size (SMAs) Distribution Fe–Mn/625 Alloy Systematic Studies of 4D-Printing Conceivable Applications ». Dans Shape Memory Composites Based on Polymers and Metals for 4D Printing, 81–92. Cham : Springer International Publishing, 2022. http://dx.doi.org/10.1007/978-3-030-94114-7_5.
Texte intégralDudai, Yadin. « Persistence of Collective Memory over 3,000 Years ». Dans National Memories, 259–79. Oxford University PressNew York, 2022. http://dx.doi.org/10.1093/oso/9780197568675.003.0013.
Texte intégralBisseling, Rob H. « Sparse matrix–vector multiplication ». Dans Parallel Scientific Computation, 190–290. Oxford University Press, 2020. http://dx.doi.org/10.1093/oso/9780198788348.003.0004.
Texte intégralYang, Ning, Shiaaulir Wang et Paul Schonfeld. « Simulation-Based Scheduling of Waterway Projects Using a Parallel Genetic Algorithm ». Dans Transportation Systems and Engineering, 334–47. IGI Global, 2015. http://dx.doi.org/10.4018/978-1-4666-8473-7.ch016.
Texte intégralYang, Ning, Shiaaulir Wang et Paul Schonfeld. « Simulation-Based Scheduling of Waterway Projects Using a Parallel Genetic Algorithm ». Dans Civil and Environmental Engineering, 1071–84. IGI Global, 2016. http://dx.doi.org/10.4018/978-1-4666-9619-8.ch046.
Texte intégralPetersen, Wesley, et Peter Arbenz. « Shared Memory Parallelism ». Dans Introduction to Parallel Computing. Oxford University Press, 2004. http://dx.doi.org/10.1093/oso/9780198515760.003.0009.
Texte intégralActes de conférences sur le sujet "Distribution shared memory"
Chandra, Rohit, Ding-Kai Chen, Robert Cox, Dror E. Maydan, Nenad Nedeljkovic et Jennifer M. Anderson. « Data distribution support on distributed shared memory multiprocessors ». Dans the ACM SIGPLAN 1997 conference. New York, New York, USA : ACM Press, 1997. http://dx.doi.org/10.1145/258915.258945.
Texte intégralNodine, Mark H., et Jeffrey Scott Vitter. « Deterministic distribution sort in shared and distributed memory multiprocessors ». Dans the fifth annual ACM symposium. New York, New York, USA : ACM Press, 1993. http://dx.doi.org/10.1145/165231.165247.
Texte intégralMarzolla, Moreno, et Gabriele D'Angelo. « Parallel sort-based matching for data distribution management on shared-memory multiprocessors ». Dans 2017 IEEE/ACM 21st International Symposium on Distributed Simulation and Real-Time Applications (DS-RT). IEEE, 2017. http://dx.doi.org/10.1109/distra.2017.8167660.
Texte intégralWolin, Elliott, D. Abbott, V. Gurjyan, G. Heyes, E. Jastrzembski, D. Lawrence. et C. Timmer. « The ET system - high speed event transfer and distribution via shared memory and networks ». Dans 2007 IEEE Nuclear Science Symposium Conference Record. IEEE, 2007. http://dx.doi.org/10.1109/nssmic.2007.4436464.
Texte intégralNikolopoulos, Dimitrios S., Eduard Ayguadé, Theodore S. Papatheodorou, Constantine D. Polychronopoulos et Jesús Labarta. « The trade-off between implicit and explicit data distribution in shared-memory programming paradigms ». Dans the 15th international conference. New York, New York, USA : ACM Press, 2001. http://dx.doi.org/10.1145/377792.377801.
Texte intégralDzafic, I., et H. T. Neisius. « Real-time power flow algorithm for shared memory multiprocessors for European distribution network types ». Dans Energy Conference (IPEC 2010). IEEE, 2010. http://dx.doi.org/10.1109/ipecon.2010.5697097.
Texte intégralChung, Soon M., et Jaerheen Yang. « Distributive join algorithm for shared-memory multiprocessors ». Dans the 1993 ACM/SIGAPP symposium. New York, New York, USA : ACM Press, 1993. http://dx.doi.org/10.1145/162754.168683.
Texte intégralDuan, Shanzhong, et Andrew Ries. « Efficient Parallel Computer Simulation of the Motion Behaviors of Closed-Loop Multibody Systems ». Dans ASME 2007 International Mechanical Engineering Congress and Exposition. ASMEDC, 2007. http://dx.doi.org/10.1115/imece2007-41912.
Texte intégralLowenthal, D. K., V. W. Freeh et D. W. Miller. « Efficient support for two-dimensional data distributions in distributed shared memory systems ». Dans Proceedings 16th International Parallel and Distributed Processing Symposium. IPDPS 2002. IEEE, 2002. http://dx.doi.org/10.1109/ipdps.2002.1015552.
Texte intégralJovanova, Jovana, Angela Nastevska et Mary Frecker. « Target Shape Optimization of 3D Compliant Mechanism With Superelastic Joints and Shape Memory Actuation ». Dans ASME 2019 Conference on Smart Materials, Adaptive Structures and Intelligent Systems. American Society of Mechanical Engineers, 2019. http://dx.doi.org/10.1115/smasis2019-5639.
Texte intégralRapports d'organisations sur le sujet "Distribution shared memory"
Merritt, Alexander M., et Kevin Thomas Tauke Pedretti. LDRD final report : managing shared memory data distribution in hybrid HPC applications. Office of Scientific and Technical Information (OSTI), septembre 2010. http://dx.doi.org/10.2172/1007320.
Texte intégral