# Optimization for number of goroutines using feedback control Yusuke MIYAKE / Pepabo R&D Institute, GMO Pepabo, Inc. 2019.07.25 GopherCon 2019 ![Image](/uploads/documents/4/2/d/f/42dfd7f07b1ef4 ## I ssues to solve for the realization 1. Selection of performance metrics 2. Finding how to control rapidly and continuously ## Performance metrics ## Performance metrics • Independent resource type based on the metrics • Continuously • Rapidly • Accurately • Feedback control meets these conditions. ## Feedback control • Tracking a given set-point using errors from the set-point. • Applying

Persistent Transactional Data Structures CHRISTINA PETERSON, KENNETH LAMAR 20 21 October 24-29 |Introduction|Persistent Hash Map|Persistent Transactional Data Structures|Live Demonstration|References| Transactional Data Structures Design Goals Methodology Performance Results Live Demonstration ## I ntroduction |Introduction|Persistent Hash Map|Persistent Transactional Data Structures|Live Demonstration|References| $ ^{TM} $ DC Persistent Memory |Introduction|Persistent Hash Map|Persistent Transactional Data Structures|Live Demonstration|References| |---|---|---|---|---| |0|00|00|0000|| |0000|00000|0000||| |000|000000|000000|||

## +24 ## Reusable Code, Reusable Data Structures ## SEBASTIAN THEOPHIL  ## WHY THIS TALK? ![Image](/uploads/documents

## +24 ## Data Structures That Make Video Games Go Round AL-AFIQ YEONG 20 24 September 15 - 20 Exposing the Games Industry: Data Structures That Make Video Games Co Round One Data Structure At A Time O(\log N) $ ! Awesome!!! ##### Problems (Not really, more like caveats ...) Like all tree data structures, not really cache friendly. - Can always represent the tree as a heap but you still jump around

## +21 ## PGAS in C++: A Portable Abstraction for Distributed Data Structures ## BENJAMIN BROCK 20 21 October 24-29 ## About Me - PhD candidate at Berkeley - Advised by Kathy Yelick and Aydın Buluç supercomputer? Introduce PGAS Model, RDMA Building Remote Pointer Types Building Distributed Data Structures Extending to GPUs This Talk Background: how do we write a program for a supercomputer? Introduce Introduce PGAS Model, RDMA Building Remote Pointer Types Building Distributed Data Structures Extending to GPUs This Talk Background: how do we write a program for a supercomputer? Introduce PGAS

## Designing Fast and Efficient List-like Data Structures ## YANNIC BONENBERGER ## List-like data structures • std::vector • std::list • std::deque ## std::vector • C++ version of the array-list data

## Design and Implementation of Highly Scalable Quantifiable Data Structures in C++ ## CHRISTINA PETERSON, VICTOR COOK, ZACHARY PAINTER 2021 | October 24-29 ## Overview Motivation Correctness (Safety) function $ P(X) $ . $ P(X) $ varies for each of the abstract data types for concurrent data structures. ## Stacks High Entropy ▶ Concurrent implementations are challenging ▶ EBS attains high throughput Logical Processors: 64 ## Conclusion ## Key Take-Aways Quantifiability enables highly scalable data structures by permitting relaxed semantics The vector space model facilitates an efficient verification technique

## +23 ## Distributed Ranges: A Model for Building Distributed Data Structures, Algorithms, and Views ## BENJAMIN BROCK ## Notices and Disclaimers For notices, disclaimers, and details about performance 1c933cc9ed6c477/p6_1.jpg) ## Project Goals - Offer high-level, standard C++ distributed data structures - Support distributed algorithms Achieve high performance for both multi-GPU, NUMA, and multi-node Background (Ranges, Parallelism, Distributed Data Structures) - Distributed Ranges (Concepts) - Implementation (Algorithms and views) - Complex Data Structures (Dense and sparse matrices) - Lessons learned

Static variables • 14. Global variables • 15. Type definitions • 16. Enumerated Types • 17. Structures • 18. Command line parameters • 19. Header files • 20. The preprocessor ☐ 20.1. Conditionals instead? Well, `typedef` gets really useful when paired with two things: enumerated types and structures. ### 16. Enumerated Types Using the `typedef` and `enum` keywords we can define a type that can rather than numbers, so it's a very convenient syntax. ### 17. Structures Using the struct keyword we can create complex data structures using basic C types. A structure is a collection of values of

## CS 591 K1: Data Stream Processing and Analytics Spring 2020 ## 4 /09: Flow control and load shedding Vasiliki (Vasia) Kalavri vkalavri@bu.edu ## Keeping up with the producers • Producers can generate what if the queue grows larger than available memory? • block the producer (back-pressure, flow control) ## Load management approaches ![Image](/uploads/documents/1/8/5/2/1852496083fa00bab53cdd69c80bfbf6/p7_1 runtime and selectively drops tuples according to a QoS specification. • Similar to congestion control or video streaming in a lower quality. ![Image](/uploads/documents/1/8/5/2/1852496083fa00bab53cdd69c80bfbf6/p9_1