1,892,371 research outputs found
Is random access memory random?
Most software is contructed on the assumption that the programs and data are stored in random access memory (RAM). Physical limitations on the relative speeds of processor and memory elements lead to a variety of memory organizations that match processor addressing rate with memory service rate. These include interleaved and cached memory. A very high fraction of a processor's address requests can be satified from the cache without reference to the main memory. The cache requests information from main memory in blocks that can be transferred at the full memory speed. Programmers who organize algorithms for locality can realize the highest performance from these computers
Random access-random release relay switching matrix
XY relay switching matrix provides complete random access and random release of 400 points. A mercury-wetted bistable relay with independent set and reset coils is the unique feature associated with each point
Random Access Transport Capacity
We develop a new metric for quantifying end-to-end throughput in multihop
wireless networks, which we term random access transport capacity, since the
interference model presumes uncoordinated transmissions. The metric quantifies
the average maximum rate of successful end-to-end transmissions, multiplied by
the communication distance, and normalized by the network area. We show that a
simple upper bound on this quantity is computable in closed-form in terms of
key network parameters when the number of retransmissions is not restricted and
the hops are assumed to be equally spaced on a line between the source and
destination. We also derive the optimum number of hops and optimal per hop
success probability and show that our result follows the well-known square root
scaling law while providing exact expressions for the preconstants as well.
Numerical results demonstrate that the upper bound is accurate for the purpose
of determining the optimal hop count and success (or outage) probability.Comment: Submitted to IEEE Trans. on Wireless Communications, Sept. 200
On multiple access random medium access control
In this paper, we develop a new class of medium access control protocol, which allows each user to transmit at different data rates chosen randomly from an appropriately determined set of rates. By using successive interference cancellation, multiple packets can be received simultaneously. In slotted Aloha type Gaussian networks, we show that the achievable total throughput of the proposed protocol is at least a constant fraction of the mac sum rate when the number of transmission rates at each node is equal to the number of users in the network. We also study the case when only a limited number of transmission rates is available at each node. Extension to rate splitting is discussed. Simulation results show that the proposed protocol can achieve a significant throughput gain over the conventional Aloha
Quantum random access memory
A random access memory (RAM) uses n bits to randomly address N=2^n distinct
memory cells. A quantum random access memory (qRAM) uses n qubits to address
any quantum superposition of N memory cells. We present an architecture that
exponentially reduces the requirements for a memory call: O(log N) switches
need be thrown instead of the N used in conventional (classical or quantum) RAM
designs. This yields a more robust qRAM algorithm, as it in general requires
entanglement among exponentially less gates, and leads to an exponential
decrease in the power needed for addressing. A quantum optical implementation
is presented.Comment: 4 pages, 3 figures. Accepted for publication on Phys. Rev. Let
Random Access Game and Medium Access Control Design
Motivated partially by a control-theoretic viewpoint, we propose a game-theoretic model, called random access game, for contention control. We characterize Nash equilibria of random access games, study their dynamics, and propose distributed algorithms (strategy evolutions) to achieve Nash equilibria. This provides a general analytical framework that is capable of modeling a large class of system-wide quality-of-service (QoS) models via the specification of per-node utility functions, in which system-wide fairness or service differentiation can be achieved in a distributed manner as long as each node executes a contention resolution algorithm that is designed to achieve the Nash equilibrium. We thus propose a novel medium access method derived from carrier sense multiple access/collision avoidance (CSMA/CA) according to distributed strategy update mechanism achieving the Nash equilibrium of random access game. We present a concrete medium access method that adapts to a continuous contention measure called conditional collision probability, stabilizes the network into a steady state that achieves optimal throughput with targeted fairness (or service differentiation), and can decouple contention control from handling failed transmissions. In addition to guiding medium access control design, the random access game model also provides an analytical framework to understand equilibrium and dynamic properties of different medium access protocols
Random access quantum information processors
Qubit connectivity is an important property of a quantum processor, with an
ideal processor having random access -- the ability of arbitrary qubit pairs to
interact directly. Here, we implement a random access superconducting quantum
information processor, demonstrating universal operations on a nine-bit quantum
memory, with a single transmon serving as the central processor. The quantum
memory uses the eigenmodes of a linear array of coupled superconducting
resonators. The memory bits are superpositions of vacuum and single-photon
states, controlled by a single superconducting transmon coupled to the edge of
the array. We selectively stimulate single-photon vacuum Rabi oscillations
between the transmon and individual eigenmodes through parametric flux
modulation of the transmon frequency, producing sidebands resonant with the
modes. Utilizing these oscillations for state transfer, we perform a universal
set of single- and two-qubit gates between arbitrary pairs of modes, using only
the charge and flux bias of the transmon. Further, we prepare multimode
entangled Bell and GHZ states of arbitrary modes. The fast and flexible
control, achieved with efficient use of cryogenic resources and control
electronics, in a scalable architecture compatible with state-of-the-art
quantum memories is promising for quantum computation and simulation.Comment: 7 pages, 5 figures, supplementary information ancillary file, 21
page
Entanglement assisted random access codes
An (n,m,p) Random Access Code (RAC) allows to encode n bits in an m bit
message, in such a way that a receiver of the message can guess any of the
original bits with probability p, greater than 1/2. In Quantum RAC's
(QRACs) one transmits n qubits. The full set of primitive Entanglement Assisted
Random Access Codes (EARACs) is introduced, in which parties are allowed to
share a two-qubit singlet. It is shown that via a concatenation of these, one
can build for any n an (n,1,p) EARAC. QRAC's for n>3 exist only if parties
additionally share classical randomness (SR). We show that EARACs outperform
the best of known QRACs not only in the success probabilities but also in the
amount of communication needed in the preparatory stage of the protocol. Upper
bounds on the performance of EARACs are given, and shown to limit also QRACs.Comment: 4 pages, 1 figure, published versio
- …