نتایج جستجو برای: random access time

تعداد نتایج: 2358137  

2010
Erik Demaine Eric Liu

It is clear that the fastest memory levels are substantially smaller than the slowest ones. Generally, each level has a direct connection to the level immediately below it. (In addition, the faster, smaller levels are substantially more expensive to produce, so do not expect 1GB of register space any time soon.) Additionally, many of the levels communicate in blocks. For example, asking RAM to ...

2013
Michael Brand

In the study of random access machines (RAMs) it has been shown that the availability of an extra input integer, having no special properties other than being sufficiently large, is enough to reduce the computational complexity of some problems. However, this has only been shown so far for specific problems. We provide a characterization of the power of such extra inputs for general problems. T...

2012
Satyajit Desai Mark R. McLellan

Process Variation Aware DRAM (Dynamic Random Access Memory) Design Using Block-Based Adaptive Body Biasing Algorithm

2017
H. Zhao A. Lyle Y. Zhang P. K. Amiri G. Rowlands Z. Zeng J. Katine H. Jiang K. Galatsis K. L. Wang I. N. Krivorotov J.-P. Wang

2015
Dieudonne Manzi Mugisha Mark R. McLellan

Exploiting Application Behaviors for Resilient Static Random Access Memory Arrays in the Near-Threshold Computing Regime

1999
Jun Zhao Fred J. Meyer Fabrizio Lombardi

This paper presents an approach for the maximal diagnosis of all faults (stuck-at, open and short) in the interconnect of a random access memory (RAM); and the interconnect includes data and address lines. This approach accomplishes maximal diagnosis under a complex model in which the lines in the interconnect of the RAM can be affected by multiple faults. Maximal diagnosis consists of detectio...

Journal: :SIAM J. Comput. 1997
Louis Mak

It is shown that every unit-cost random-access machine (RAM) that runs in time T can be simulated by a concurrent-read exclusive-write parallel random-access machine (CREW PRAM) in time O(T 1/2 log T ). The proof is constructive; thus it gives a mechanical way to translate any sequential algorithm designed to run on a unit-cost RAM into a parallel algorithm that runs on a CREW PRAM and obtain a...

2001
Ethan L. Miller Scott A. Brandt Darrell D. E. Long

Magnetic RAM (MRAM) is a new memory technology with access and cost characteristics comparable to those of conventional dynamic RAM (DRAM) and the non-volatility of magnetic media such as disk. Simply replacing DRAM with MRAM will make main memory non-volatile, but it will not improve file system performance. However, effective use of MRAM in a file system has the potential to significantly imp...

2011
Yasuhiro Takahashi Yuki Urata Toshikazu Sekine Nazrul Anuar Nayan Michio Yokoyama

This paper proposes a novel adiabatic static random access memory (SRAM) using memristor. The proposed SRAM which is a sinusoidal driving consists of one NMOS transistor and one memristor (i.e. 1T1M type). The proposed SRAM also is driven by an optimal voltage resulting in a decrease of energy dissipation. From SPICE simulation results, we show that the energy dissipation of proposed 1T1M-SRAM ...

Journal: :journal of advances in computer research 2013
somayeh rahmani ahmad khademzadeh amir masoud eftekhari moghadam

in recent years, many researchers have been done in the area of wireless sensornetworks that has led to the variety of algorithms and methods for the collection andtransmission of environment information; but still many challenges faced bywireless sensor networks using methodologies are applied in various fields. such asmedia access control that due to the media being shared on these networks, ...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید