Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 218,276,762 papers from all fields of science
Search
Sign In
Create Free Account
Write buffer
Known as:
Victim buffer
A write buffer is a type of data buffer used in certain CPU cache architectures like Intel's x86 and AMD64. In multi-core systems, write buffers…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
10 relations
C11 (C standard revision)
CPU cache
Computer data storage
Data buffer
Expand
Broader (1)
Computer memory
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
Analytical Probability Density Calculation for Step Pulse Response of a Single-Ended Buffer With Arbitrary Power-Supply Voltage Fluctuations
Jingook Kim
,
Junho Lee
,
Sunki Cho
,
C. Hwang
,
C. Yoon
,
Jun Fan
IEEE Transactions on Circuits and Systems Part 1…
2014
Corpus ID: 2516705
An analytical methodology to calculate the probability density functions (PDFs) for the step pulse response of a single-ended…
Expand
2011
2011
POPS: Coherence Protocol Optimization for Both Private and Shared Data
Hemayet Hossain
,
S. Dwarkadas
,
Michael C. Huang
International Conference on Parallel…
2011
Corpus ID: 16486020
As the number of cores in a chip multiprocessor (CMP) increases, the need for larger on-chip caches also increases in order to…
Expand
2010
2010
Write buffer-oriented energy reduction in the L1 data cache of two-level caches for the embedded system
Soontae Kim
,
Jongmin Lee
ACM Great Lakes Symposium on VLSI
2010
Corpus ID: 2639678
In resource-constrained embedded systems, on-chip cache memories play an important role in both performance and energy…
Expand
Highly Cited
2010
Highly Cited
2010
A Hybrid Approach to NAND-Flash-Based Solid-State Disks
Li-Pin Chang
IEEE transactions on computers
2010
Corpus ID: 9526776
Replacing power-hungry disks with NAND-flash-based solid-state disks (SSDs) is a recently emerging trend in flash-memory…
Expand
Highly Cited
2008
Highly Cited
2008
BPLRU: A Buffer Management Scheme for Improving Random Writes in Flash Storage
Hyojun Kim
,
Seongjun Ahn
USENIX Conference on File and Storage…
2008
Corpus ID: 16896892
Flash memory has become the most important storage media in mobile devices, and is beginning to replace hard disks in desktop…
Expand
Highly Cited
2007
Highly Cited
2007
A log buffer-based flash translation layer using fully-associative sector translation
Sang-Won Lee
,
Dong-Joo Park
,
Tae-Sun Chung
,
Dong-Ho Lee
,
Sangwon Park
,
Ha-Joo Song
TECS
2007
Corpus ID: 14494226
Flash memory is being rapidly deployed as data storage for mobile devices such as PDAs, MP3 players, mobile phones, and digital…
Expand
2006
2006
An adaptive bandwidth allocation scheme with preemptive priority for integrated voice/data mobile networks
Shensheng Tang
,
W. Li
IEEE Transactions on Wireless Communications
2006
Corpus ID: 227978
This paper presents an adaptive bandwidth allocation scheme, called complete sharing with preemptive priority (CSPP) scheme, for…
Expand
2004
2004
Diskbench : User-level Disk Feature Extraction Tool
Z. Dimitrijevic
,
R. Rangaswami
,
D. Watson
,
A. Acharya
2004
Corpus ID: 14850561
Despite the increases in disk capacity and decreases in mechanical delays in recent years, the performance gap between magnetic…
Expand
Highly Cited
2001
Highly Cited
2001
High-Performance DRAMs in Workstation Environments
V. Cuppu
,
B. Jacob
,
B. Davis
,
T. Mudge
IEEE Trans. Computers
2001
Corpus ID: 765872
This paper presents a simulation-based performance study of several of the new high-performance DRAM architectures, each…
Expand
1997
1997
How to write buffer overflows
Mudge
1997
Corpus ID: 57508122
How to write Buffer Overflows This is really rough, and some of it is not needed. I wrote this as a reminder note to myself as I…
Expand
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)
ACCEPT & CONTINUE