Search icon CANCEL
Subscription
0
Cart icon
Your Cart (0 item)
Close icon
You have no products in your basket yet
Save more on your purchases! discount-offer-chevron-icon
Savings automatically calculated. No voucher code required.
Arrow left icon
All Products
Best Sellers
New Releases
Books
Videos
Audiobooks
Learning Hub
Newsletter Hub
Free Learning
Arrow right icon
timer SALE ENDS IN
0 Days
:
00 Hours
:
00 Minutes
:
00 Seconds
Arrow up icon
GO TO TOP
Hands-On Concurrency with Rust

You're reading from   Hands-On Concurrency with Rust Confidently build memory-safe, parallel, and efficient software in Rust

Arrow left icon
Product type Paperback
Published in May 2018
Publisher Packt
ISBN-13 9781788399975
Length 462 pages
Edition 1st Edition
Languages
Concepts
Arrow right icon
Author (1):
Arrow left icon
Brian L. Troutwine Brian L. Troutwine
Author Profile Icon Brian L. Troutwine
Brian L. Troutwine
Arrow right icon
View More author details
Toc

Table of Contents (18) Chapters Close

Title Page
Copyright and Credits
Dedication
Packt Upsell
Contributors
Preface
1. Preliminaries – Machine Architecture and Getting Started with Rust FREE CHAPTER 2. Sequential Rust Performance and Testing 3. The Rust Memory Model – Ownership, References and Manipulation 4. Sync and Send – the Foundation of Rust Concurrency 5. Locks – Mutex, Condvar, Barriers and RWLock 6. Atomics – the Primitives of Synchronization 7. Atomics – Safely Reclaiming Memory 8. High-Level Parallelism – Threadpools, Parallel Iterators and Processes 9. FFI and Embedding – Combining Rust and Other Languages 10. Futurism – Near-Term Rust 1. Other Books You May Enjoy Index

Further reading


Building concurrent data structure is a broad field of wide concern. These notes cover much the same space as the notes from Chapter 4Sync and Send – the Foundation of Rust Concurrency. Please do refer back to those notes.

  • The Little Book of Semaphores, Allen Downey, available at http://greenteapress.com/wp/semaphores/.This is a charming book of concurrency puzzles, suitable for undergraduates but challenging enough in Rust for the absence of semaphores. We'll revisit this book in the next chapter when we build concurrency primitives out of atomics.
  • The Computability of Relaxed Data Structures: Queues and Stacks as Examples, Nir Shavit and Gadi Taubenfeld. This chapter discussed the implementation of a concurrent queue based on the presentation of The Art of Multiprocessor Programming and the author's knowledge of Erlang's process queue. Queues are a common concurrent data structure and there are a great many possible approaches. This paper discusses an interesting notion...
lock icon The rest of the chapter is locked
Register for a free Packt account to unlock a world of extra content!
A free Packt account unlocks extra newsletters, articles, discounted offers, and much more. Start advancing your knowledge today.
Unlock this book and the full library FREE for 7 days
Get unlimited access to 7000+ expert-authored eBooks and videos courses covering every tech area you can think of
Renews at £13.99/month. Cancel anytime
Visually different images