Book Image

Hands-On High Performance with Go

By : Bob Strecansky
Book Image

Hands-On High Performance with Go

By: Bob Strecansky

Overview of this book

Go is an easy-to-write language that is popular among developers thanks to its features such as concurrency, portability, and ability to reduce complexity. This Golang book will teach you how to construct idiomatic Go code that is reusable and highly performant. Starting with an introduction to performance concepts, you’ll understand the ideology behind Go’s performance. You’ll then learn how to effectively implement Go data structures and algorithms along with exploring data manipulation and organization to write programs for scalable software. This book covers channels and goroutines for parallelism and concurrency to write high-performance code for distributed systems. As you advance, you’ll learn how to manage memory effectively. You’ll explore the compute unified device architecture (CUDA) application programming interface (API), use containers to build Go code, and work with the Go build cache for quicker compilation. You’ll also get to grips with profiling and tracing Go code for detecting bottlenecks in your system. Finally, you’ll evaluate clusters and job queues for performance optimization and monitor the application for performance regression. By the end of this Go programming book, you’ll be able to improve existing code and fulfill customer requirements by writing efficient programs.
Table of Contents (20 chapters)
Section 1: Learning about Performance in Go
Section 2: Applying Performance Concepts in Go
Section 3: Deploying, Monitoring, and Iterating on Go Programs with Performance in Mind

Exploring trees

A tree is a non-linear data structure that is used in computer science to store information. It's commonly used to store data that maintains relationships, particularly if the relationships form a hierarchy. Trees are also simple to search (diagram for array sorting algorithms in the Understanding sort algorithms section) shows us that many trees have an O(log n) time complexity with operations in trees). For many problems, trees are the best solution because of how they reference hierarchical data. Trees are combinations of nodes that don't make a cycle.

Each tree is made up of elements called nodes. We start at the root node (the yellow box labeled root in the binary trees figure below). There is a left and a right reference pointer (numbers 2 and 7, in our case ) and a data element (the number 1, in this case) within each node. As a tree grows, the...