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 language||English (US)|
|Number of pages||6|
|Journal||Proceedings - IEEE Computer Society's International Computer Software & Applications Conference|
|State||Published - Dec 1 1989|
|Event||Proceedings of the Thirteenth Annual International Computer Software & Applications Conference - COMPSAC 89 - Orlando, FL, USA|
Duration: Sep 20 1989 → Sep 22 1989