Back to Results
First PageMeta Content
Scheduling algorithms / Concurrency control / Abstract data types / Queue / Linked list / FIFO / Compare-and-swap / Double-ended queue / Pointer / Computing / Computer programming / Concurrent computing


Distrib. Comput:323–341 DOIs00446An optimistic approach to lock-free FIFO queues Edya Ladan-Mozes · Nir Shavit
Add to Reading List

Document Date: 2008-11-02 20:16:09


Open Document

File Size: 1,08 MB

Share Result on Facebook

City

Cambridge / Tel Aviv / /

Company

N. Shavit Sun Microsystems Laboratories / /

Country

United States / Israel / /

/

Facility

Tel-Aviv University / /

IndustryTerm

queue algorithm / performance algorithms / optimistic queue algorithm / out-of-thebox solution / lock-free deque algorithms / lock-free queue algorithm / recent algorithms / lockfree dynamic-memory queue algorithms / non-blocking algorithms / /

Organization

N. Shavit School of Computer Science / MIT / Tel-Aviv University / /

Person

Scott / Fig / Michael / /

Position

N. Shavit tail head / CAS head / tail head / current head / /

ProgrammingLanguage

Java / C / /

ProvinceOrState

Massachusetts / /

Technology

dynamic-memory lock-free FIFO queue algorithm / blocking algorithm / non-blocking algorithms / resulting algorithm / FIFO queue algorithm / Java / lockfree FIFO queue algorithm / two 400MHz UltraSparc processors / lockfree dynamic-memory queue algorithms / lock-free FIFO queue algorithm / dynamic-memory concurrent lock-free FIFO queue algorithm / 16 processor / lock-free queue algorithm / operating system / shared memory / optimistic queue algorithm / two algorithms / MS-Queue algorithm / performance algorithms / 123 lock-free deque algorithms / /

SocialTag