Search this site
1024cores
  • Home
    • About Me
    • Code License
    • Donation
    • Downloads
    • Hardware
    • In Russian
      • 3 базовых вещи относительно параллельных вычислений
      • Lockfree вперёд!
      • Lockfree, Waitfree, Obstruction-free, Atomic-free Algorithms
      • phased_thread_team
      • RAM - не RAM, или Cache-Conscious Data Structures
      • Барьеры памяти
      • Вопрос про Memory Barrier
      • Многопоточность сегодня
      • О lockfree алгоритмах (+бонус)
      • Оттенки FIFO
      • Последовательная консистенция и атомарные операции
      • Хамелеоны быстрые и очень быстрые
      • Что почитать про многопоточность и распараллеливание
      • Что такое Fork/Join? И с чем его едят?
      • Что такое модель памяти? И с чем её едят?
    • Libraries & Technologies
      • Concurrency Kit (C)
      • FastFlow (C++)
      • Intel TBB
      • Just::Thread (C++)
      • OpenMP
      • QuickThread (C++/Fortran)
    • Links
      • Books
    • Lockfree Algorithms
      • Asymmetric Synchronization
        • Asymmetric Work-Stealing
      • Eventcounts
      • False-sharing
      • First Things First
      • Introduction
      • Lazy Concurrent Initialization
        • Elimination of Memory Fences
      • Links
      • Object Life-time Management
        • Differential Reference Counting
          • Differential Reference Counting: Implementation
      • Producer-Consumer Queues
        • Bounded MPMC queue
        • Case Study: FastFlow Queue
        • Intrusive MPSC node-based queue
        • Non-intrusive MPSC node-based queue
        • Priority Queues
        • Queue Catalog
        • Unbounded SPSC Queue
      • Reader-Writer Problem
        • Distributed Reader-Writer Mutex
        • Improved Lockfree SeqLock
        • Multi-Version Concurrency Control
        • Optimistic Concurrency Control
        • State Distribution
        • Wait-free Object Storage with Single-word Atomic Operations
      • Scalability Prerequisites
      • So what is a memory model? And how to cook it?
        • Applied Ordering
        • Compiler vs. Hardware
        • Ordering
        • Visibility
      • Stacks
      • Tips & Tricks
        • Faster Fibers/Coroutines
        • Induced Deadlocks
        • Per-processor Data
        • Pointer Packing
        • SIGSEGV/SEH Trap
        • Spinning
        • Thread Completion Notifications
      • Your Arsenal
    • Parallel Computing
      • Cache-Oblivious Algorithms
        • Cache-Oblivious Algorithms: Implementation
      • Concurrent Skip List
        • Lockfree Insert Operation
        • Lockfree Reader Pattern
        • Memory Allocation
        • Node Count Maintenance
        • Parallelization - Problem Analysis
        • Performance Result
        • Scalability Prerequisites
        • Scheduler Algorithm
        • Scheduling Strategy
        • Skip List Design
        • Work-Distribution and Work-Balancing
        • Work-Stealing vs. Work-Requesting
      • Line Segment Intersection Problem
      • Links
      • Multi-list
        • Multi-list Interface and Implementation
        • Parallelization
        • Performance Results
      • Radix Sort
      • Taxi Paths
        • Fighting The Memory Bandwidth Problem
        • Parallelization
        • Performance Results
        • Single-Threaded Implementation
        • Speeding Up
    • Relacy Race Detector
      • RRD: Introduction
    • Scalable Architecture
      • Case Study: Actor Scheduler
      • Case Study: MultiLane - a concurrent blocking multiset
      • General Recipe
      • Introduction
      • Lightweight Actor Scheduler
      • Links
      • Parallel Disk IO
        • The Solution
      • Task Scheduling Strategies
        • Scheduler Example
      • Wide Finder 2
    • Tools
      • AMD CodeAnalyst
      • Intel Parallel Studio XE
      • PVS-Studio
1024cores
  • Home
    • About Me
    • Code License
    • Donation
    • Downloads
    • Hardware
    • In Russian
      • 3 базовых вещи относительно параллельных вычислений
      • Lockfree вперёд!
      • Lockfree, Waitfree, Obstruction-free, Atomic-free Algorithms
      • phased_thread_team
      • RAM - не RAM, или Cache-Conscious Data Structures
      • Барьеры памяти
      • Вопрос про Memory Barrier
      • Многопоточность сегодня
      • О lockfree алгоритмах (+бонус)
      • Оттенки FIFO
      • Последовательная консистенция и атомарные операции
      • Хамелеоны быстрые и очень быстрые
      • Что почитать про многопоточность и распараллеливание
      • Что такое Fork/Join? И с чем его едят?
      • Что такое модель памяти? И с чем её едят?
    • Libraries & Technologies
      • Concurrency Kit (C)
      • FastFlow (C++)
      • Intel TBB
      • Just::Thread (C++)
      • OpenMP
      • QuickThread (C++/Fortran)
    • Links
      • Books
    • Lockfree Algorithms
      • Asymmetric Synchronization
        • Asymmetric Work-Stealing
      • Eventcounts
      • False-sharing
      • First Things First
      • Introduction
      • Lazy Concurrent Initialization
        • Elimination of Memory Fences
      • Links
      • Object Life-time Management
        • Differential Reference Counting
          • Differential Reference Counting: Implementation
      • Producer-Consumer Queues
        • Bounded MPMC queue
        • Case Study: FastFlow Queue
        • Intrusive MPSC node-based queue
        • Non-intrusive MPSC node-based queue
        • Priority Queues
        • Queue Catalog
        • Unbounded SPSC Queue
      • Reader-Writer Problem
        • Distributed Reader-Writer Mutex
        • Improved Lockfree SeqLock
        • Multi-Version Concurrency Control
        • Optimistic Concurrency Control
        • State Distribution
        • Wait-free Object Storage with Single-word Atomic Operations
      • Scalability Prerequisites
      • So what is a memory model? And how to cook it?
        • Applied Ordering
        • Compiler vs. Hardware
        • Ordering
        • Visibility
      • Stacks
      • Tips & Tricks
        • Faster Fibers/Coroutines
        • Induced Deadlocks
        • Per-processor Data
        • Pointer Packing
        • SIGSEGV/SEH Trap
        • Spinning
        • Thread Completion Notifications
      • Your Arsenal
    • Parallel Computing
      • Cache-Oblivious Algorithms
        • Cache-Oblivious Algorithms: Implementation
      • Concurrent Skip List
        • Lockfree Insert Operation
        • Lockfree Reader Pattern
        • Memory Allocation
        • Node Count Maintenance
        • Parallelization - Problem Analysis
        • Performance Result
        • Scalability Prerequisites
        • Scheduler Algorithm
        • Scheduling Strategy
        • Skip List Design
        • Work-Distribution and Work-Balancing
        • Work-Stealing vs. Work-Requesting
      • Line Segment Intersection Problem
      • Links
      • Multi-list
        • Multi-list Interface and Implementation
        • Parallelization
        • Performance Results
      • Radix Sort
      • Taxi Paths
        • Fighting The Memory Bandwidth Problem
        • Parallelization
        • Performance Results
        • Single-Threaded Implementation
        • Speeding Up
    • Relacy Race Detector
      • RRD: Introduction
    • Scalable Architecture
      • Case Study: Actor Scheduler
      • Case Study: MultiLane - a concurrent blocking multiset
      • General Recipe
      • Introduction
      • Lightweight Actor Scheduler
      • Links
      • Parallel Disk IO
        • The Solution
      • Task Scheduling Strategies
        • Scheduler Example
      • Wide Finder 2
    • Tools
      • AMD CodeAnalyst
      • Intel Parallel Studio XE
      • PVS-Studio
  • More
    • Home
      • About Me
      • Code License
      • Donation
      • Downloads
      • Hardware
      • In Russian
        • 3 базовых вещи относительно параллельных вычислений
        • Lockfree вперёд!
        • Lockfree, Waitfree, Obstruction-free, Atomic-free Algorithms
        • phased_thread_team
        • RAM - не RAM, или Cache-Conscious Data Structures
        • Барьеры памяти
        • Вопрос про Memory Barrier
        • Многопоточность сегодня
        • О lockfree алгоритмах (+бонус)
        • Оттенки FIFO
        • Последовательная консистенция и атомарные операции
        • Хамелеоны быстрые и очень быстрые
        • Что почитать про многопоточность и распараллеливание
        • Что такое Fork/Join? И с чем его едят?
        • Что такое модель памяти? И с чем её едят?
      • Libraries & Technologies
        • Concurrency Kit (C)
        • FastFlow (C++)
        • Intel TBB
        • Just::Thread (C++)
        • OpenMP
        • QuickThread (C++/Fortran)
      • Links
        • Books
      • Lockfree Algorithms
        • Asymmetric Synchronization
          • Asymmetric Work-Stealing
        • Eventcounts
        • False-sharing
        • First Things First
        • Introduction
        • Lazy Concurrent Initialization
          • Elimination of Memory Fences
        • Links
        • Object Life-time Management
          • Differential Reference Counting
            • Differential Reference Counting: Implementation
        • Producer-Consumer Queues
          • Bounded MPMC queue
          • Case Study: FastFlow Queue
          • Intrusive MPSC node-based queue
          • Non-intrusive MPSC node-based queue
          • Priority Queues
          • Queue Catalog
          • Unbounded SPSC Queue
        • Reader-Writer Problem
          • Distributed Reader-Writer Mutex
          • Improved Lockfree SeqLock
          • Multi-Version Concurrency Control
          • Optimistic Concurrency Control
          • State Distribution
          • Wait-free Object Storage with Single-word Atomic Operations
        • Scalability Prerequisites
        • So what is a memory model? And how to cook it?
          • Applied Ordering
          • Compiler vs. Hardware
          • Ordering
          • Visibility
        • Stacks
        • Tips & Tricks
          • Faster Fibers/Coroutines
          • Induced Deadlocks
          • Per-processor Data
          • Pointer Packing
          • SIGSEGV/SEH Trap
          • Spinning
          • Thread Completion Notifications
        • Your Arsenal
      • Parallel Computing
        • Cache-Oblivious Algorithms
          • Cache-Oblivious Algorithms: Implementation
        • Concurrent Skip List
          • Lockfree Insert Operation
          • Lockfree Reader Pattern
          • Memory Allocation
          • Node Count Maintenance
          • Parallelization - Problem Analysis
          • Performance Result
          • Scalability Prerequisites
          • Scheduler Algorithm
          • Scheduling Strategy
          • Skip List Design
          • Work-Distribution and Work-Balancing
          • Work-Stealing vs. Work-Requesting
        • Line Segment Intersection Problem
        • Links
        • Multi-list
          • Multi-list Interface and Implementation
          • Parallelization
          • Performance Results
        • Radix Sort
        • Taxi Paths
          • Fighting The Memory Bandwidth Problem
          • Parallelization
          • Performance Results
          • Single-Threaded Implementation
          • Speeding Up
      • Relacy Race Detector
        • RRD: Introduction
      • Scalable Architecture
        • Case Study: Actor Scheduler
        • Case Study: MultiLane - a concurrent blocking multiset
        • General Recipe
        • Introduction
        • Lightweight Actor Scheduler
        • Links
        • Parallel Disk IO
          • The Solution
        • Task Scheduling Strategies
          • Scheduler Example
        • Wide Finder 2
      • Tools
        • AMD CodeAnalyst
        • Intel Parallel Studio XE
        • PVS-Studio

Intel TBB

http://www.threadingbuildingblocks.org

If not stated otherwise, all non-source-code text and images on this site are provided under the terms of the Creative Commons Attribution-NonCommercial-ShareAlike 3.0 Unported License. Source code is covered by the Simplified BSD License and by Apache License, Version 2.0. The opinions expressed on this site are my own and do not necessarily reflect the views of Google.

Report abuse
Page details
Page updated
Google Sites
Report abuse