🗊Презентация EranConcurrent Stacks

Категория: Образование
Нажмите для полного просмотра!
EranConcurrent Stacks, слайд №1EranConcurrent Stacks, слайд №2EranConcurrent Stacks, слайд №3EranConcurrent Stacks, слайд №4EranConcurrent Stacks, слайд №5EranConcurrent Stacks, слайд №6EranConcurrent Stacks, слайд №7EranConcurrent Stacks, слайд №8EranConcurrent Stacks, слайд №9EranConcurrent Stacks, слайд №10EranConcurrent Stacks, слайд №11EranConcurrent Stacks, слайд №12EranConcurrent Stacks, слайд №13EranConcurrent Stacks, слайд №14EranConcurrent Stacks, слайд №15EranConcurrent Stacks, слайд №16EranConcurrent Stacks, слайд №17EranConcurrent Stacks, слайд №18EranConcurrent Stacks, слайд №19EranConcurrent Stacks, слайд №20EranConcurrent Stacks, слайд №21EranConcurrent Stacks, слайд №22EranConcurrent Stacks, слайд №23EranConcurrent Stacks, слайд №24EranConcurrent Stacks, слайд №25EranConcurrent Stacks, слайд №26EranConcurrent Stacks, слайд №27EranConcurrent Stacks, слайд №28EranConcurrent Stacks, слайд №29EranConcurrent Stacks, слайд №30EranConcurrent Stacks, слайд №31EranConcurrent Stacks, слайд №32EranConcurrent Stacks, слайд №33EranConcurrent Stacks, слайд №34EranConcurrent Stacks, слайд №35EranConcurrent Stacks, слайд №36EranConcurrent Stacks, слайд №37EranConcurrent Stacks, слайд №38EranConcurrent Stacks, слайд №39EranConcurrent Stacks, слайд №40EranConcurrent Stacks, слайд №41EranConcurrent Stacks, слайд №42EranConcurrent Stacks, слайд №43EranConcurrent Stacks, слайд №44EranConcurrent Stacks, слайд №45EranConcurrent Stacks, слайд №46EranConcurrent Stacks, слайд №47EranConcurrent Stacks, слайд №48EranConcurrent Stacks, слайд №49
Скачать
Вы можете ознакомиться и скачать презентацию на тему EranConcurrent Stacks. Доклад-сообщение содержит 49 слайдов. Презентации для любого класса можно скачать бесплатно. Если материал и наш сайт презентаций Mypresentation Вам понравились – поделитесь им с друзьями с помощью социальных кнопок и добавьте в закладки в своем браузере.

Слайды и текст этой презентации

Слайд 1


EranConcurrent Stacks, слайд №1
Описание слайда:

Слайд 2


Outline Quick reminder of the Stack structure. The Unbounded Lock-Free Stack. The Elimination Backoff Stack.
Описание слайда:
Outline Quick reminder of the Stack structure. The Unbounded Lock-Free Stack. The Elimination Backoff Stack.

Слайд 3


Concurrent Stack The Stack<T> class is a collection of items (of type T) that provides the following methods: push(x) pop() Satisfying the Last-In-First-Out (LIFO) property: The last item pushed is the first popped.
Описание слайда:
Concurrent Stack The Stack<T> class is a collection of items (of type T) that provides the following methods: push(x) pop() Satisfying the Last-In-First-Out (LIFO) property: The last item pushed is the first popped.

Слайд 4


Empty Stack
Описание слайда:
Empty Stack

Слайд 5


Push
Описание слайда:
Push

Слайд 6


Push
Описание слайда:
Push

Слайд 7


Push
Описание слайда:
Push

Слайд 8


Push
Описание слайда:
Push

Слайд 9


Push
Описание слайда:
Push

Слайд 10


Push
Описание слайда:
Push

Слайд 11


Push
Описание слайда:
Push

Слайд 12


Pop
Описание слайда:
Pop

Слайд 13


Pop
Описание слайда:
Pop

Слайд 14


Pop
Описание слайда:
Pop

Слайд 15


Pop
Описание слайда:
Pop

Слайд 16


Pop
Описание слайда:
Pop

Слайд 17


The LockfreeStack class The lock-free stack is a linked list, where the top field points to the first node (or null if the stack is empty). A pop() call uses compareAndSet() to try to remove the first node from the stack. A push() call uses compareAndSet() to try to insert a new node into the top of the stack.
Описание слайда:
The LockfreeStack class The lock-free stack is a linked list, where the top field points to the first node (or null if the stack is empty). A pop() call uses compareAndSet() to try to remove the first node from the stack. A push() call uses compareAndSet() to try to insert a new node into the top of the stack.

Слайд 18


EranConcurrent Stacks, слайд №18
Описание слайда:

Слайд 19


EranConcurrent Stacks, слайд №19
Описание слайда:

Слайд 20


Lock-free Stack Good No locking Bad huge contention at top No parallelism
Описание слайда:
Lock-free Stack Good No locking Bad huge contention at top No parallelism

Слайд 21


Elimination-Backoff Stack Ways to solve it : exponential backoff (reduces contention but does not solve the bottleneck problem). elimination backoff
Описание слайда:
Elimination-Backoff Stack Ways to solve it : exponential backoff (reduces contention but does not solve the bottleneck problem). elimination backoff

Слайд 22


Observation
Описание слайда:
Observation

Слайд 23


Idea: Elimination Array
Описание слайда:
Idea: Elimination Array

Слайд 24


Push Collides With Pop
Описание слайда:
Push Collides With Pop

Слайд 25


No Collision
Описание слайда:
No Collision

Слайд 26


Elimination-Backoff Stack A union of the LockFreeStack class with the elimination array Access Lock-free stack, If uncontended, apply operation if contended, back off to elimination array and attempt elimination
Описание слайда:
Elimination-Backoff Stack A union of the LockFreeStack class with the elimination array Access Lock-free stack, If uncontended, apply operation if contended, back off to elimination array and attempt elimination

Слайд 27


Elimination-Backoff Stack
Описание слайда:
Elimination-Backoff Stack

Слайд 28


Dynamic Range and Delay
Описание слайда:
Dynamic Range and Delay

Слайд 29


Linearizability The combined data structure, array, and shared stack, is linearizable because the shared stack is linearizable, and the eliminated calls can be ordered as if they happened at the point in which they exchanged values. Un-eliminated calls linearized as before Eliminated calls: linearize pop() immediately after matching push() Combination is a linearizable stack
Описание слайда:
Linearizability The combined data structure, array, and shared stack, is linearizable because the shared stack is linearizable, and the eliminated calls can be ordered as if they happened at the point in which they exchanged values. Un-eliminated calls linearized as before Eliminated calls: linearize pop() immediately after matching push() Combination is a linearizable stack

Слайд 30


Un-Eliminated Linearizability
Описание слайда:
Un-Eliminated Linearizability

Слайд 31


Eliminated Linearizability
Описание слайда:
Eliminated Linearizability

Слайд 32


Backoff Has Dual Effect Elimination introduces parallelism Backoff onto array cuts contention on lock-free stack Elimination in array cuts down total number of threads ever accessing lock-free stack
Описание слайда:
Backoff Has Dual Effect Elimination introduces parallelism Backoff onto array cuts contention on lock-free stack Elimination in array cuts down total number of threads ever accessing lock-free stack

Слайд 33


Elimination Array
Описание слайда:
Elimination Array

Слайд 34


A Lock-Free Exchanger
Описание слайда:
A Lock-Free Exchanger

Слайд 35


Atomic Stamped Reference
Описание слайда:
Atomic Stamped Reference

Слайд 36


Exchanger Status
Описание слайда:
Exchanger Status

Слайд 37


Lock-free Exchanger
Описание слайда:
Lock-free Exchanger

Слайд 38


Lock-free Exchanger
Описание слайда:
Lock-free Exchanger

Слайд 39


Lock-free Exchanger
Описание слайда:
Lock-free Exchanger

Слайд 40


Lock-free Exchanger
Описание слайда:
Lock-free Exchanger

Слайд 41


Lock-free Exchanger
Описание слайда:
Lock-free Exchanger

Слайд 42


Lock-free Exchanger
Описание слайда:
Lock-free Exchanger

Слайд 43


Lock-free Exchanger
Описание слайда:
Lock-free Exchanger

Слайд 44


The Exchanger Slot Exchanger is lock-free Because the only way an exchange can fail is if others repeatedly succeeded or no-one showed up
Описание слайда:
The Exchanger Slot Exchanger is lock-free Because the only way an exchange can fail is if others repeatedly succeeded or no-one showed up

Слайд 45


Elimination Array
Описание слайда:
Elimination Array

Слайд 46


Elimination Stack Push
Описание слайда:
Elimination Stack Push

Слайд 47


Elimination Stack Pop
Описание слайда:
Elimination Stack Pop

Слайд 48


Summary Quick reminder of the Stack structure. The Unbounded Lock-Free Stack. The Elimination Backoff Stack.
Описание слайда:
Summary Quick reminder of the Stack structure. The Unbounded Lock-Free Stack. The Elimination Backoff Stack.

Слайд 49


EranConcurrent Stacks, слайд №49
Описание слайда:

Скачать

Похожие презентации
Mypresentation.ru
Загрузить презентацию