Efficient Rate Conversion Filtering on GPUs with Shared Memory Access Pattern Scrambling

2016 ◽  
Author(s):  
Mrugesh Gajjar ◽  
Ismayil Guracar
Keyword(s):  
Shared Memory ◽  
Memory Access ◽  
Access Pattern ◽  
Rate Conversion

COMPLEXITY OF VERIFYING JAVA SHARED MEMORY EXECUTION

2003 ◽  
Vol 13 (04) ◽  
pp. 721-733 ◽  
Author(s):  
ALEX GONTMAKHER ◽  
SERGEY POLYAKOV ◽  
ASSAF SCHUSTER
Keyword(s):  
Shared Memory ◽  
Memory Access ◽  
Np Complete

This paper studies the problem of testing shared memory Java implementations to determine whether the memory behavior they provide is consistent. The complexity of the task is analyzed. The problem is defined as that of analyzing memory access traces. The study showed that the problem is NP-complete, both in the general case and in some particular cases in which the number of memory operations per thread, the number of write operations per variable, and the number of variables are restricted.

Shared Memory Access—Boon for Graphics

1988 ◽  
Vol 5 (11) ◽  
pp. 455-458
Author(s):  
Chitra Dorai ◽  
V N Shukla
Keyword(s):  
Shared Memory ◽  
Memory Access

Evaluation of Memory Access Pattern Protection in a Practical Setting

2014 ◽  
Author(s):  
Yuto Nakano ◽  
Shinsaku Kiyomoto ◽  
Yutaka Miyake
Keyword(s):  
Memory Access ◽  
Access Pattern

Multiprocessor shared memory access and rewards

1998 ◽  
Vol 335 (4) ◽  
pp. 629-641 ◽  
Author(s):  
Joann M. Paul ◽  
Marlin H. Mickle
Keyword(s):  
Shared Memory ◽  
Memory Access

VM-based shared memory on low-latency, remote-memory-access networks

1997 ◽  
Vol 25 (2) ◽  
pp. 157-169 ◽  
Author(s):  
Leonidas Kontothanassis ◽  
Galen Hunt ◽  
Robert Stets ◽  
Nikolaos Hardavellas ◽  
Michał Cierniak ◽  
...  
Keyword(s):  
Shared Memory ◽  
Access Networks ◽  
Memory Access ◽  
Remote Memory ◽  
Low Latency ◽  
Remote Memory Access

scholarly journals Data structures access model for remote shared memory

2021 ◽  
Vol 244 ◽  
pp. 07001
Author(s):  
Anatoliy Nyrkov ◽  
Konstantin Ianiushkin ◽  
Andrey Nyrkov ◽  
Yulia Romanova ◽  
Vagiz Gaskarov
Keyword(s):  
Shared Memory ◽  
Data Structures ◽  
Data Model ◽  
High Performance ◽  
Direct Memory Access ◽  
Performance Comparison ◽  
Memory Access ◽  
Memory Storage ◽  
Race Conditions ◽  
Performance Computing

Recent achievements in high-performance computing significantly narrow the performance gap between single and multi-node computing, and open up opportunities for systems with remote shared memory. The combination of in-memory storage, remote direct memory access and remote calls requires rethinking how data organized, protected and queried in distributed systems. Reviewed models let us implement new interpretations of distributed algorithms allowing us to validate different approaches to avoid race conditions, decrease resource acquisition or synchronization time. In this paper, we describe the data model for mixed memory access with analysis of optimized data structures. We also provide the result of experiments, which contain a performance comparison of data structures, operating with different approaches, evaluate the limitations of these models, and show that the model does not always meet expectations. The purpose of this paper to assist developers in designing data structures that will help to achieve architectural benefits or improve the design of existing distributed system.

QUAD – A Memory Access Pattern Analyser

2010 ◽  
pp. 269-281 ◽  
Author(s):  
S. Arash Ostadzadeh ◽  
Roel J. Meeuws ◽  
Carlo Galuzzi ◽  
Koen Bertels
Keyword(s):  
Memory Access ◽  
Access Pattern
Sign in / Sign up

Export Citation Format

Share Document