A Simple, Fast and Scalable Non-Blocking Concurrent FIFO queue for Shared Memory Multiprocessor Systems

Philippas Tsigas; Yi Zhang

A Simple, Fast and Scalable Non-Blocking Concurrent FIFO queue for Shared Memory Multiprocessor Systems
Paper in proceeding, 2001

Author

Philippas Tsigas

Distributed Computing and Systems

Other publications Research

Yi Zhang

Distributed Computing and Systems

Other publications Research

Proceedings of the 13th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA '01)

134-143
1-58113-409-6 (ISBN)

Subject Categories

Computer and Information Science

ISBN

1-58113-409-6

More information

Created

10/6/2017

If you have questions, need help, find a bug or just want to give us feedback you may use this form, or contact us per e-mail research.lib@chalmers.se.

Message

Your email address

Research.chalmers.se contains research information from Chalmers University of Technology, Sweden. It includes information on projects, publications, research funders and collaborations.

More about coverage period and what is publicly available

Privacy and cookies

Accessibility

Citation Style Language
citeproc-js (Frank Bennett)

Chalmers Library

Chalmers Research

Chalmers Student Theses

SE-412 96 GOTHENBURG, SWEDEN
PHONE: +46 (0)31-772 10 00
WWW.CHALMERS.SE

A Simple, Fast and Scalable Non-Blocking Concurrent FIFO queue for Shared Memory Multiprocessor Systems Paper in proceeding, 2001