Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

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… Expand
Wikipedia

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.
2016
2016
Delay uncertainty and signal criticality driven routing channel optimization for advanced DRAM products
Signal delay uncertainty induced by crosstalk is a critical challenge to the physical design of long interconnect channels in… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2008
2008
Energy-delay tradeoffs in 32-bit static shifter designs
This paper compares the energy-delay tradeoff curves of 32-bit static barrel and funnel shifters. The Stanford Circuit… Expand
  • table 1
  • figure 3
  • figure 1
  • figure 4
  • table 2
Is this relevant?
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… Expand
Is this relevant?
2004
2004
Wire swizzling to reduce delay uncertainty due to capacitive coupling
Reduction of worst-case delay and delay uncertainty due to capacitive coupling is a still unsolved problem in physical design. We… Expand
  • table 1
  • table 2
  • figure 1
  • figure 2
  • table 4
Is this relevant?
2000
2000
Fast portable orthogonally persistent Java
A powerful feature of the Java programming languageis its user-definableclassloading policy, which when combined with the… Expand
  • figure 10
  • figure 11
  • figure 16
  • figure 17
  • figure 18
Is this relevant?
1998
1998
Swizzle Barrier Optimizations for Orthogonal Persistence in Java
Swizzling refers to the translation of object references from an external, persistent format to an internal, transient format… Expand
  • table 1
  • table 2
  • table 3
  • figure 1
  • figure 2
Is this relevant?
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… Expand
  • figure 1
  • figure 2
  • table 1
  • table 2
  • table 3
Is this relevant?
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… Expand
Is this relevant?
1995
1995
A Layered Architecture for Supporting Objects in a Relational System: A Performance Study
O-Raid uses a layered approach to provide support for objects on top of a distributed relational database system called Raid. In… Expand
Is this relevant?
1995
1995
Client cache management in a distributed object database
A distributed object database stores persistently at servers. Applications run on client machines, fetching objects into a client… Expand
  • figure 2-1
  • figure 2-2
  • figure 3-1
  • figure 3-2
  • figure 3-4
Is this relevant?
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License
ACCEPT & CONTINUE