1 Asynchronous I/O Latency Asynchronous I/O interfaces Message queues 2 I/O optimizations Optimizing network transfers Optimizing local transfers 3 Influence of data structures on I/O Measuring I/O efficiency of algorithms 4 Caching Principles Policies Distributed Caches 5 Conclusion

1 Asynchronous I/O Latency Asynchronous I/O interfaces Message queues 2 I/O optimizations Optimizing network transfers Optimizing local transfers 3 Influence of data structures on I/O Measuring I/O efficiency of algorithms 4 Caching Principles Policies Distributed Caches 5 Conclusion

7.1 图的基本概念 7.2 图的表示与实现 7.3 图的遍历 7.4 最小生成树 7.5 拓扑排序 7.6 关键路径 7.7 最短路径

1 Storage devices Existing devices 2 Parallelizing files’ storage Striping Introduction to Map/Reduce 3 Risks of data loss and corruption 4 Data consistency Checksums Practical usage 5 Data safety Redundancy Parity Erasure coding 6 Conclusion

Intro Threading Safety Solutions 1 Introduction and expectations Scope : what is parallelism ? Finding parallelism Expectations 2 Threading, theory and practice Processes and threads Python threading C ++threading and async 3 Thread-safety issues Data races Thread safety 4 Thread-safety solutions Avoid the problem Replicate Atomics Locking

1 Measuring Performance What is performance ? Tools available Finding bottlenecks 2 Code modernization 3 Improving Memory Handling Context Containers and memory Container reservation Detecting offending code 4 The nightmare of thread safety Context and constraints Identifying problems Solving problems Thread contention 5 Low level optimizations Scope and target How to measure ? Improving 6 Conclusion

1 Why python and C++ Pros and Cons of each language Respective usecases 2 C ++getting usable Language “simplifications” Making bad code harder to write 3 Performant C++ New performance related features Templates Avoiding virtuality when possible 4 Migrating from Python 2 to python 3 Tour of python 3 changes How to support both versions How to migrate 5 Conclusion

6.1 树的基本概念 6.2 二叉树 6.3 二叉树遍历和线索二叉树 6.4 树和森林 6.5 *树的等价问题/树的应用 6.6 霍夫曼树及其应用

4.1 栈的基本概念 4.2 栈的表示与实现 4.3 栈的应用 4.4 队列的基本概念 4.5 队列表示与实现 4.6 队列的应用 4.7 递归及其应用

8.1 查找的基本概念 8.2 线性表的查找 8.3 树表的查找 8.4 哈希表查找