Full metadata record
DC FieldValueLanguage
dc.contributor.authorShann, CHen_US
dc.contributor.authorHuang, TLen_US
dc.contributor.authorChen, Cen_US
dc.date.accessioned2014-12-08T15:27:01Z-
dc.date.available2014-12-08T15:27:01Z-
dc.date.issued2000en_US
dc.identifier.isbn0-7695-0568-6en_US
dc.identifier.urihttp://hdl.handle.net/11536/19241-
dc.description.abstractMany nonblocking algorithms have been proposed for shared queues. Previous studies indicate that link-based algorithms perform best. However, these algorithms have a memory management problem. a dequeued node can not be freed or reused without problem: handling. The problem is usually overloaded; one just assumes the existence of a lower level mechanism, which takes care of all the details of handling the problem. Employing such a mechanism incurs significant overheads, and consequently the link-based queues may not perform as well as claimed. A new nonblocking queue algorithm based on a finite array is proposed in this paper. Comparing with the link-based algorithms. the nerv algorithm provides the same degree of concurrency without being subject to the memory problem, hence suggests a good performance.en_US
dc.language.isoen_USen_US
dc.subjectconcurrent queueen_US
dc.subjectnonblockingen_US
dc.subjectcompare-and-swapen_US
dc.subjectlinearizabilityen_US
dc.titleA practical nonblocking queue algorithm using compare-and-swapen_US
dc.typeProceedings Paperen_US
dc.identifier.journalSEVENTH INTERNATIONAL CONFERENCE ON PARALLEL AND DISTRIBUTED SYSTEMS, PROCEEDINGSen_US
dc.citation.spage470en_US
dc.citation.epage475en_US
dc.contributor.department資訊工程學系zh_TW
dc.contributor.departmentDepartment of Computer Scienceen_US
dc.identifier.wosnumberWOS:000089422500055-
Appears in Collections:Conferences Paper