The Morning Paper

APRIL 14, 2019

The paper sets out what we can do in software given today’s hardware, and along the way also highlights areas where cooperation from hardware will be needed in the future. Microarchitectural channels. There are also stateless interconnects including buses and on-chip networks. Threat scenarios. IPC) input and output channels.

Hardware 44

Hardware Cache Latency Speed 44

All Things Distributed

JULY 14, 2015

Streams provide you with the underlying infrastructure to create new applications, such as continuously updated free-text search indexes, caches, or other creative extensions requiring up-to-date table changes. An AWS Lambda function is a simpler option that you can use, as it only requires you to code the logic, set it, and forget it.

Database 167

Database Lambda AWS IoT 167

John McCalpin

AUGUST 1, 2018

Bandwidth, performance analysis has two recurring themes: How fast should this code (or “simple” variations on this code) run on this hardware? Interacting components in the execution of an MPI job — a brief outline (from memory): The user source code, which contains an ordered set of calls to MPI routines.

Hardware 40

Hardware Transportation Performance Latency 40

Alex Russell

APRIL 29, 2021

After 20 years of neck-in-neck competition, often starting from common code lineages, there just isn't that much left to wring out of the system. For heavily latency-sensitive use-cases like WebXR, this is a critical component in delivering a good experience. is access to hardware devices. Offscreen Canvas. Compression Streams.

Media 145

Media Games Education Engineering 145

The Morning Paper

DECEMBER 8, 2019

Byte-addressable non-volatile memory,) NVM will fundamentally change the way hardware interacts, the way operating systems are designed, and the way applications operate on data. Therefore any programming abstraction must be low latency and the kernel needs to be kept off the path of persistent data access as much as possible.

Hardware 56

Hardware Programming Media Storage 56

Highly Scalable

AUGUST 20, 2013

This system has been designed to supplement and succeed the existing Hadoop-based system that had too high latency of data processing and too high maintenance costs. In many cases join is performed on a finite time window or other type of buffer e.g. LFU cache that contains most frequent tuples in the stream.

Big Data 154

Big Data Processing Lambda Database 154

SQL Server According to Bob

JANUARY 11, 2020

Stable media is commonly physical disk storage, but other devices and certain caching facilities qualify as well. Many high-end disk subsystems provide high-speed cache facilities to reduce the latency of read and write operations. This cache is often supported by a battery-powered backup facility.

Servers 40

Servers Cache Media Hardware 40

Smashing Magazine

AUGUST 22, 2021

Because we are dealing with network protocols here, we will mainly look at network aspects, of which two are most important: latency and bandwidth. Latency can be roughly defined as the time it takes to send a packet from point A (say, the client) to point B (the server). Two-way latency is often called round-trip time (RTT).

Performance 106

Performance Network Latency Servers 106

John McCalpin

NOVEMBER 5, 2016

So consider the dense matrix multiplication operation C += A*B, where A, B, and C are dense square matrices of order N, and the matrix multiplication operation is equivalent to the pseudo-code: for (i=0; i<N; i++) { for (j=0; j<N; j++) { for (k=0; k<N; k++) { C[i][j] += A[i][k] * B[k][j]; } } }.

Cache 40

Cache C++ Latency Hardware 40

Alex Russell

OCTOBER 22, 2017

For this page to be done loading it needs to be responsive to user input — the “interactive” in “Time to Interactive” Browsers process user input by generating DOM events that application code listens to. Simulated packet loss and variable latency, however, can make benchmarking extremely difficult and slow.

Performance 68

Performance Benchmarking Network Mobile 68

SQL Server According to Bob

JANUARY 11, 2020

Time of Last Access The time of last access is a caching ​​ algorithm ​​ that enables ​​ cache ​​ entries to be ordered by their ​​ access times.

Servers 40

Servers Cache Database Media 40

Smashing Magazine

JANUARY 11, 2021

Have we optimized enough with tree-shaking, scope hoisting, code-splitting, and all the fancy loading patterns with intersection observer, progressive hydration, clients hints, HTTP/3, service workers and — oh my — edge workers? It’s much easier to reach performance goals when the code base is fresh or is just being refactored.

Performance 145

Performance Cache Media Metrics 145

Smashing Magazine

JANUARY 6, 2020

Is it worth exploring tree-shaking, scope hoisting, code-splitting, and all the fancy loading patterns with intersection observer, server push, clients hints, HTTP/2, service workers and — oh my — edge workers? It’s much easier to reach performance goals when the code base is fresh or is just being refactored.

Performance 145

Performance Cache Network Metrics 145

John McCalpin

APRIL 25, 2023

For most high-end processors these values have remained in the range of 75% to 85% of the peak DRAM bandwidth of the system over the past 15-20 years — an amazing accomplishment given the increase in core count (with its associated cache coherence issues), number of DRAM channels, and ever-increasing pipelining of the DRAMs themselves.

Benchmarking 97

Benchmarking Cache Latency Tuning 97

Smashing Magazine

JANUARY 7, 2019

Is it worth exploring tree-shaking, scope hoisting, code-splitting, and all the fancy loading patterns with intersection observer, server push, clients hints, HTTP/2, service workers and — oh my — edge workers? Estimated Input Latency tells us if we are hitting that threshold, and ideally, it should be below 50ms.

Performance 104

Performance Cache Metrics Network 104