Comparing barrier algorithms
type: Item
instance of: scholarly article
title: Comparing barrier algorithms
zbMATH Open document ID: 0689.68021
DOI: 10.1016/0167-8191(89)90050-1
author: Norbert S. Arenstorf
author: Harry F. Jordan
published in: Parallel Computing
publication date: 1989-01-01T00:00:00Z
full work available at URL: http://hdl.handle.net/2060/19880003552
Mathematics Subject Classification ID: 68N25
Mathematics Subject Classification ID: 68M20
zbMATH DE Number: 4129973
zbMATH Keywords: barrier algorithms
zbMATH Keywords: MIMD computer
zbMATH Keywords: shared memory
zbMATH Keywords: speedup
zbMATH Keywords: concurrent processes
zbMATH Keywords: synchronization
zbMATH Keywords: graphical model
zbMATH Keywords: parallel programming
MaRDI profile type: Publication
OpenAlex ID: W2038149966
Recommended article: Algorithms for covering multiple barriers
Recommended article: Q5384952
Recommended article: Algorithm of Barrier Objective Penalty Function
Recommended article: Two algorithms for barrier synchronization
Recommended article: Approximation Algorithms for Barrier Sweep Coverage
Recommended article: Comparison of optimization algorithms
Recommended article: Barriers for Rank Methods in Arithmetic Complexity
Recommended article: Q4449747
description: scientific article; zbMATH DE number 4129973