Search Results - "Shared-memory programming"

Refine Results
  1. 1

    Solving the multi-objective flexible job shop scheduling problem with a novel parallel branch and bound algorithm by Soto, Carlos, Dorronsoro, Bernabé, Fraire, Héctor, Cruz-Reyes, Laura, Gomez-Santillan, Claudia, Rangel, Nelson

    ISSN: 2210-6502
    Published: Elsevier B.V 01.03.2020
    Published in Swarm and evolutionary computation (01.03.2020)
    “…This work presents a novel parallel branch and bound algorithm to efficiently solve to optimality a set of instances of the multi-objective flexible job shop…”
    Get full text
    Journal Article
  2. 2

    Programming parallel dense matrix factorizations and inversion for new-generation NUMA architectures by Catalán, Sandra, Igual, Francisco D., Herrero, José R., Rodríguez-Sánchez, Rafael, Quintana-Ortí, Enrique S.

    ISSN: 0743-7315, 1096-0848
    Published: Elsevier Inc 01.05.2023
    “…We propose a methodology to address the programmability issues derived from the emergence of new-generation shared-memory NUMA architectures. For this purpose,…”
    Get full text
    Journal Article
  3. 3

    Architectural Adaptation and Performance-Energy Optimization for CFD Application on AMD EPYC Rome by Szustak, Lukasz, Wyrzykowski, Roman, Kuczynski, Lukasz, Olas, Tomasz

    ISSN: 1045-9219, 1558-2183
    Published: New York IEEE 01.12.2021
    “…The advantages of the second-generation AMD EPYC Rome processors can be successfully used in the race to Exascale. However, the novel architecture's complexity…”
    Get full text
    Journal Article
  4. 4

    Modularity‐based parallel protein design algorithm with an implementation using shared memory programming by Pal, Abantika, Mulumudy, Rohith, Mitra, Pralay

    ISSN: 0887-3585, 1097-0134, 1097-0134
    Published: Hoboken, USA John Wiley & Sons, Inc 01.03.2022
    “…Given a target protein structure, the prime objective of protein design is to find amino acid sequences that will fold/acquire to the given three‐dimensional…”
    Get full text
    Journal Article
  5. 5

    A Shared Memory SMC Sampler for Decision Trees by Drousiotis, Efthyvoulos, Varsi, Alessandro, Spirakis, Paul G., Maskell, Simon

    ISSN: 2643-3001
    Published: IEEE 17.10.2023
    “…Modern classification problems tackled by using Decision Tree (DT) models often require demanding constraints in terms of accuracy and scalability. This is…”
    Get full text
    Conference Proceeding
  6. 6

    Parallelization of Array Method with Hybrid Programming: OpenMP and MPI by Velarde Martínez, Apolinar

    ISSN: 2076-3417, 2076-3417
    Published: Basel MDPI AG 01.08.2022
    Published in Applied sciences (01.08.2022)
    “…For parallelization of applications with high processing times and large amounts of storage in High Performance Computing (HPC) systems, shared memory…”
    Get full text
    Journal Article
  7. 7

    The Heat Equation: High-Performance Scientific Computing Case Study by Schuster, Micah D.

    ISSN: 1521-9615, 1558-366X
    Published: New York IEEE 01.09.2018
    Published in Computing in science & engineering (01.09.2018)
    “…In recent years, high-performance computing and powerful supercomputers have become staples in many areas of academia and industry. The author introduces the…”
    Get full text
    Journal Article
  8. 8

    Extending Shared-Memory Computations to Multiple Distributed Nodes by Ahmed, Waseem

    ISSN: 2158-107X, 2156-5570
    Published: West Yorkshire Science and Information (SAI) Organization Limited 2020
    “…With the emergence of accelerators like GPUs, MICs and FPGAs, the availability of domain specific libraries (like MKL) and the ease of parallelization…”
    Get full text
    Journal Article
  9. 9

    Programmability and Performance of New Global-View Programming API for Multi-Node and Multi-Core Processing by Sakaguchi, Yugo, Midorikawa, Hiroko

    Published: IEEE 01.08.2019
    “…Various partitioned global address space (PGAS) languages capable of providing global-view programming environments on multi-node computer systems have been…”
    Get full text
    Conference Proceeding
  10. 10

    Tpetra, and the Use of Generic Programming in Scientific Computing by Baker, C.G., Heroux, M.A.

    ISSN: 1058-9244, 1875-919X
    Published: United States Hindawi 2012
    Published in Scientific programming (2012)
    “…We present Tpetra, a Trilinos package for parallel linear algebra primitives implementing the Petra object model. We describe Tpetra's design, based on generic…”
    Get full text
    Journal Article
  11. 11

    RWT: Suppressing Write-Through Cost When Coherence is Not Needed by Hao Liu, Devigne, Clement, Garcia, Lucas, Meunier, Quentin, Wajsburt, Franck, Greiner, Alain

    ISSN: 2159-3469
    Published: IEEE 01.07.2015
    “…In shared-memory multicore architectures, handling a write cache operation is more complicated than in single processor systems. A cache line may be present in…”
    Get full text
    Conference Proceeding
  12. 12

    OpenMP for Networks of SMPs by Hu, Y.Charlie, Lu, Honghui, Cox, Alan L., Zwaenepoel, Willy

    ISSN: 0743-7315, 1096-0848
    Published: San Diego, CA Elsevier Inc 01.12.2000
    “…In this paper, we present the first system that implements OpenMP on a network of shared-memory multiprocessors. This system enables the programmer to rely on…”
    Get full text
    Journal Article
  13. 13

    Built-in fast gather control network for efficient support of coherence protocols by Lodde, Mario, Roca, Toni, Flich, José

    ISSN: 1751-8601, 1751-861X, 2095-882X, 1751-861X, 2589-0514
    Published: Stevenage The Institution of Engineering and Technology 01.03.2013
    “…Future chip multiprocessors will include hundreds of cores organised in a tile-based design pattern. These systems commonly employ a shared memory programming…”
    Get full text
    Journal Article
  14. 14

    Parallel evolutionary algorithms based on shared memory programming approaches by Redondo, J. L., García, I., Ortigosa, P. M.

    ISSN: 0920-8542, 1573-0484
    Published: Boston Springer US 01.11.2011
    Published in The Journal of supercomputing (01.11.2011)
    “…In this work, two parallel techniques based on shared memory programming are presented. These models are specially suitable to be applied over evolutionary…”
    Get full text
    Journal Article Conference Proceeding
  15. 15

    OpenMP Implementation of SPICE3 Circuit Simulator by Weng, Tien-Hsiung, Perng, Ruey-Kuen, Chapman, Barbara

    ISSN: 0885-7458, 1573-7640
    Published: New York Springer Nature B.V 01.10.2007
    “…In this paper, we describe our experience of creating an OpenMP implementation of the SPICE3 circuit simulator program. Given the irregular patterns of access…”
    Get full text
    Journal Article
  16. 16

    ARS: an adaptive runtime system for locality optimization by Tao, Jie, Schulz, Martin, Karl, Wolfgang

    ISSN: 0167-739X, 1872-7115
    Published: Elsevier B.V 01.07.2003
    Published in Future generation computer systems (01.07.2003)
    “…Shared memory programs running on Non-Uniform Memory Access (NUMA) machines usually face inherent performance problems stemming from excessive remote memory…”
    Get full text
    Journal Article
  17. 17

    Algorithmic optimizations of a conjugate gradient solver on shared memory architectures by Löf, Henrik, Rantakokko, Jarmo

    ISSN: 1744-5760, 1744-5779, 1744-5779
    Published: Taylor & Francis Group 01.10.2006
    “…OpenMP is an architecture-independent language for programming in the shared memory model. OpenMP is designed to be simple and powerful in terms of programming…”
    Get full text
    Journal Article
  18. 18

    Scalable parallel graph coloring algorithms by Gebremedhin, Assefaw Hadish, Manne, Fredrik

    ISSN: 1040-3108, 1096-9128
    Published: Chichester, UK John Wiley & Sons, Ltd 01.10.2000
    Published in Concurrency (Chichester, England.) (01.10.2000)
    “…Finding a good graph coloring quickly is often a crucial phase in the development of efficient, parallel algorithms for many scientific and engineering…”
    Get full text
    Journal Article
  19. 19

    Scaling Non‐Regular Shared‐Memory Codes by Reusing Custom Loop Schedules by Nikolopoulos, Dimitrios S., Artiaga, Ernest, Ayguadé, Eduard, Labarta, Jesús

    ISSN: 1058-9244, 1875-919X
    Published: 01.01.2003
    Published in Scientific programming (01.01.2003)
    “…In this paper we explore the idea of customizing and reusing loop schedules to improve the scalability of non‐regular numerical codes in shared‐memory…”
    Get full text
    Journal Article
  20. 20

    An advanced compiler framework for non-cache-coherent multiprocessors by Yunheung Paek, Navarro, A., Zapata, E., Hoeflinger, J., Padua, D.

    ISSN: 1045-9219, 1558-2183
    Published: New York IEEE 01.03.2002
    “…The Cray T3D and T3E are non-cache-coherent (NCC) computers with a NUMA structure. They have been shown to exhibit a very stable and scalable performance for a…”
    Get full text
    Journal Article