Parallel linked list for shared-memory multiprocessors

Peiyi Tang, Pen Chung Yew, Chuan Qi Zhu

Research output: Contribution to journalConference articlepeer-review

2 Scopus citations


Concurrent algorithms for a parallel linked list in a shared-memory parallel computer are proposed. The deletion of entries in a linked list can be executed concurrently in any order. In particular, the deletion of nonadjacent entries can be executed simultaneously without interfering with each other. The appending of a new entry to the list and the deletion of the entries other than the last one in the list can also be executed simultaneously. Parallel linked lists are very useful tools for parallel computers in processor scheduling memory management and sparse matrix computations. The machine model and the synchronization instruction used are described.

Original languageEnglish (US)
Pages (from-to)130-135
Number of pages6
JournalProceedings - IEEE Computer Society's International Computer Software & Applications Conference
StatePublished - Dec 1 1989
EventProceedings of the Thirteenth Annual International Computer Software & Applications Conference - COMPSAC 89 - Orlando, FL, USA
Duration: Sep 20 1989Sep 22 1989


Dive into the research topics of 'Parallel linked list for shared-memory multiprocessors'. Together they form a unique fingerprint.

Cite this