Skip to search formSkip to main contentSkip to account menu

Gather-scatter (vector addressing)

Known as: Gather (vector addressing), Vector addressing, Gather-scatter 
Gather-scatter is a type of memory addressing that often arises when addressingvectors in sparse linear algebra operations. It is thevector… 
Wikipedia (opens in a new tab)

Related topics

Related topics

10 relations
Advanced Vector ExtensionsCompute kernelCray X-MPHaswell (microarchitecture)

Broader (1)

Parallel computing

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
LightPcapNg: Implementing a library for general-purpose tracing based on PcapNg
The current work analyzes the PcapNg format and presents a new library: LightPcapNg. Its purpose is to provide a lightweight… 
2013
2013
Exploring SIMD for Molecular Dynamics , Using Intel
We analyse gather-scatter performance bottlenecks in molecular dynamics codes and the challenges that they pose for obtaining… 
2012
2012
Poster: Advances in Gyrokinetic Particle in Cell Simulation for Fusion Plasmas to Extreme Scale
The Gyrokinetic Particle-in-cell (PIC) method has been successfully applied in studies of low-frequency microturbulence in… 
2011
2011
A Transformation to Convert Packing Code to Compact Datatypes for Efficient Zero-Copy Data Transfer
Many high performance applications spend considerable time packing data into contiguous communication buffers. Datatypes provide… 
2004
2004
Communication Models for a Free-Space Optical Cross-Connect Switch
We design and analyze communication algorithms for an optical switch based on the electroholographic effect, that provides… 
2000
2000
Transmission scheduling for gossiping in multihop packet radio networks
Routing information updates, exchange of congestion control information, and synchronisation in distributed computation… 
Highly Cited
1998
Highly Cited
1998
Efficient layering for high speed communication: Fast Messages 2.x
The authors describe their experience designing, implementing, and evaluating two generations of the high performance… 
1998
1998
Parallel Run Length Encoding Compression: Reducing I/o in dYnamic Environmental Simulations
Dynamic simulations based on time-varying inputs are extremely I/O intensive. This is shown by industrial appli cations… 
1997
1997
Toward Optimal Complete Exchange on Wormhole-Routed Tori
In this paper, we propose new routing schemes to perform all-to-all personalized communication (or known as complete exchange) in… 
1988
1988
GaAs Supercomputing: Architecture, Language, And Algorithms For Image Processing
The application of high-speed GaAs processors in a parallel system matches the demanding computational requirements of image… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)