- Methods of optimization programs. Latency numbers every programmer should

Lecture



Это окончание невероятной информации про оптимизация программ .

...

memory ..... 250,000 ns = 250 µs Round trip within same datacenter ...... 500,000 ns = 0.5 ms Read 1 MB sequentially from SSD* ..... 1,000,000 ns = 1 ms Disk seek ........................... 10,000,000 ns = 10 ms Read 1 MB sequentially from disk .... 20,000,000 ns = 20 ms Send packet CA->Netherlands->CA .... 150,000,000 ns = 150 ms

Assuming ~1GB/sec SSD

Methods of optimization programs. Latency numbers every programmer should know

Продолжение:


Часть 1 Methods of optimization programs. Latency numbers every programmer should know
Часть 2 - Methods of optimization programs. Latency numbers every programmer should

See also

created: 2016-05-01
updated: 2026-03-09
485

Was this answer useful?
Choose a quick rating so we can improve the next answer for you.
How satisfied are you?

Comments

To leave a comment

If you have any suggestion, idea, thanks or comment, feel free to write. We really value feedback and are glad to hear your opinion.
To reply

Lectures and tutorial on "Highly loaded projects. Theory of parallel computing. Supercomputers. Distributed systems"

Terms: Highly loaded projects. Theory of parallel computing. Supercomputers. Distributed systems

Comparison of delay times at different levels of architecture. Optimization
All about social networks. Human impact
All about social networks. Development prospects
All about social networks. Technology
All about social networks. Monetization
List of limits and restrictions Vkontakte
Benchmark performance test. Server performance measurement options
Profiling
Architecture von Neumann, anti-machine
network website optimization DNS time, Connect time, TTFB, TTLB
parallel system architecture classes: distributed memory (MPP) and shared memory (SMP)
Shared memory systems using OpenMP as an example
Distributed memory systems using the example of MPI
Parallel computing tasks
Organization of multiprocessor systems (matrix switch, common bus, system with omega network)
Topological links of the modules of computing systems for parallel calculations
The advantages and disadvantages of computers with shared and distributed memory. NUMA
Parallel programming languages
Massively parallel architecture
The main classes of modern parallel computers Massively parallel systems (MPP)
The main classes of modern parallel computers Symmetric multiprocessing SMP
The main classes of modern parallel computers Symmetric multiprocessing SMP
The main classes of modern parallel computers Systems with non-uniform memory access (NUMA)
The main classes of modern parallel computers Parallel Vector Systems (PVP)
The main classes of modern parallel computers Cluster systems
Features of the appointment of judicial computer technical expertise
Brain matryoshka
Transcomputational task
Data center center (storage and) data processing (data center-TsHOD)
Actor model
Methods of optimization programs. Latency numbers every programmer should know
Caching and memcached
How do we create artificial intelligence?
What makes Competitive Parallel Multi-threaded Asynchronous Programming Different?
Decentralized applications DAPP