Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Bryan Veal

dblp:46/6603 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
0since 2021 · last 2017
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Computer networks · 1 · 1 first-authorApplied, interdisciplinary, general and emerging computing · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer architecture, parallel and distributed computing, and storage systems
1 paper
Storage systems · 50% Memory systems · 50%
Databases, data mining, and information retrieval
1 paper
Indexing and storage engines · 100%

Topics — the 5 heaviest of 6, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Storage systems › storage performance
low-latency storage
0.312017
Platform Storage Performance With 3D XPoint Technology · Proc. IEEE 2017
Memory systems
non-volatile memory
0.312017
Platform Storage Performance With 3D XPoint Technology · Proc. IEEE 2017
Storage systems
non-volatile memory storage
0.312017
Platform Storage Performance With 3D XPoint Technology · Proc. IEEE 2017
Memory systems › non-volatile memory
persistent memory
0.312017
Platform Storage Performance With 3D XPoint Technology · Proc. IEEE 2017
Indexing and storage engines
key-value store
0.112017
Platform Storage Performance With 3D XPoint Technology · Proc. IEEE 2017

Methods — techniques the papers use, named apart from their topics

storage performance measurement · 0.6OS paging · 0.6
YearPublicationVenuePosition
2017 Platform Storage Performance With 3D XPoint Technology
abstract
With a combination of high performance and nonvolatility, the arrival of 3D XPoint memory promises to fundamentally change the memory-storage hierarchy at the hardware, system software, and application levels. This memory will be deployed first as a block addressable storage device, known as the Intel Optane SSD, and even in this familiar form it will drive basic system change. Access times consistently as fast, or faster, than the rest of the system will blur the line between storage and memory. The low latencies from these solid-state drives (SSDs) allow rethinking even basic storage methodologies to be more memory-like. For example, the manner in which storage performance is measured shifts from inputoutput operations (IOs) at a given queue depth to response time for a given load, like memory is typically measured. System changes to match the low latency of these SSDs are already advanced, and in many cases they enable the application to utilize the SSD's performance. In other cases, additional work is required, particularly on policies set originally with slow storage in mind. On top of these already-capable systems are real applications. System-level tests show that applications such as keyvalue stores and real-time analytics can benefit immediately. These application benefits include significantly faster runtime (up to 3× ) and access to larger data sets than supported in DRAM. Newly viable mechanisms for expanding application memory footprint include native application support or native operating system paging, a significant change in the use of SSDs. The next step in this convergence is 3D XPoint memory accessed through processor load/store operations. Significant operating system support is already in place. The implications of consistently low latency storage and fast persistent memory on computing are great, with applications and systems taking advantage of this new technology as storage as the first to benefit.
Frank T. Hady, Annie P. Foong, Bryan Veal
Proc. IEEE3
2007 Performance scalability of a multi-core web server
abstract
Today's large multi-core Internet servers support thousands of concurrent connections or ows. The computation ability of future server platforms will depend on increasing numbers of cores. The key to ensure that performance scales with cores is to ensure that systems software and hardware are designed to fully exploit the parallelism that is inherent in independent network ows. This paper identifies the major bottlenecks to scalability for a reference server workload on a commercial server platform. However, performance scaling on commercial web servers has proven elusive. We determined that on web server running a modified SPEC-web2005 Support workload, throughput scales only 4.8 x on eight cores. Our results show that the operating system, TCP/IP stack, and application exploited ow-level parallelism well with few exceptions, and that load imbalance and shared cache affected performance little. Having eliminated these potential bottlenecks, we determined that performance scaling was limited by the capacity of the address bus, which became saturated on all eight cores. If this key obstacle is addressed, commercial web server and systems software are well-positioned to scale to a large number of cores.
Bryan Veal, Annie P. Foong
ANCS1