Skip to search formSkip to main contentSkip to account menu

Swizzling (computer graphics)

Known as: Swizzling 
In computer graphics, swizzling means rearranging the elements of a vector. For example, if A = {1,2,3,4}, where the components are x, y, z, and w… 
Wikipedia (opens in a new tab)

Related topics

Related topics

4 relations

Broader (1)

Computer graphics
High-Level Shading LanguageLinear algebraOpenGL ES

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2013
2013
Data bus swizzling in TSV-based three-dimensional integrated circuits
2013
2013
An area-efficient minimum-time FFT schedule using single-ported memory
FFT design requires an exhaustive recoupling of data across successive stages of computation. The resulting memory access… 
2011
2011
An Efficient Buffer Scheme for Flash-based Databases
Most embedded database systems are built on a two-level memory hierarchy, a RAM buffer on top of flash memory. Both kinds of… 
2005
2005
Controlling Inductive Coupling in Wide Global Signal Busses Through Swizzling
Recent advances in Deep Submicron (DSM) design and manufacturing technologies have brought to the forefront the importance of… 
2003
2003
Reducing mutual inductance of wide signal busses through swizzling
  • B. Soudan
  • 10th IEEE International Conference on Electronics…
  • 2003
  • Corpus ID: 36098242
On-chip inductive coupling has been shown to depend on the distance wires ran in parallel. It has also been shown to depend on… 
1998
1998
Experience Using a Globally Shared State Abstraction to Support Distributed Applications
In this paper, we evaluate the effectiveness of basing distributed systems on a persistent globally shared address space… 
Review
1997
Review
1997
Object Models for Distributed or Persistent Programming
As use of object orientation for application development has increased, many researchers have investigated the design of object… 
1996
1996
Reducing the virtual memory overhead of swizzling
Swizzling is a mechanism used by OODBs and persistent object systems to convert pointers from their disk format to a more… 
1995
1995
Several Implementations of Persistent Pointers in a Memory-Mapped I/O Environment
Several techniques for dereferencing persistent pointers have been proposed to improve performance of object-oriented database… 
1995
1995
Locking in OODBMS Client Supporting Nested TransactionsLaurent Dayn
Nested transactions facilitate the control of complex persistent applications by enabling both ne-tuning of the scope of rollback… 
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)