Search icon CANCEL
Subscription
0
Cart icon
Your Cart (0 item)
Close icon
You have no products in your basket yet
Arrow left icon
Explore Products
Best Sellers
New Releases
Books
Videos
Audiobooks
Learning Hub
Free Learning
Arrow right icon
Arrow up icon
GO TO TOP
F# High Performance

You're reading from   F# High Performance Increase your F# programming productivity and focus on performance optimization with best practices, expert techniques, and more

Arrow left icon
Product type Paperback
Published in Jan 2017
Publisher Packt
ISBN-13 9781786468079
Length 338 pages
Edition 1st Edition
Languages
Arrow right icon
Author (1):
Arrow left icon
Eriawan Kusumawardhono Eriawan Kusumawardhono
Author Profile Icon Eriawan Kusumawardhono
Eriawan Kusumawardhono
Arrow right icon
View More author details
Toc

Table of Contents (9) Chapters Close

Preface 1. Performing Common Optimizations in F# 2. Performance Measurement FREE CHAPTER 3. Optimizing Data Structures 4. Introduction to Concurrency in F# 5. Advanced Concurrency Support in F# 6. Optimizing Type Provider 7. Language Features and Constructs Optimization 8. Optimizing Computation Expressions

Introduction to memory storage allocation


The type of storage in memory to store the data value according to the CLI standard specification basically falls into these three storage categories (from fastest to slowest):

  • Register

  • Stack

  • Heap

Register

Register is the fastest to access, because it does not have memory allocation overheads compared to stack and heap. The concept of register is similar to the processor's register. This register is not the same as stack and heap; it is related to how the value is stored in the code. Usage of register in CLR is translated into any of the processor's registers, and depends on the platform used. For example, when running on x86/x64 processors, Intel's general purpose register of EAX, EBX, ECX, EDX will be used.

Stack

The nature of stack is LIFO, abbreviated from last in first out. It means that data is stored not in a first come, first served basis, but the last one stored is the first one that can be read, as data is stored from the bottom to the highest...

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 $19.99/month. Cancel anytime
Banner background image