Parallel asynchronous algorithms for discrete data

DOI10.1145/79147.79162zbMath0698.68052OpenAlexW2092144207MaRDI QIDQ3476277

Aydin Üresin, Michel Dubois

Publication date: 1990

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/79147.79162

zbMATH Keywords

fixed pointiterative algorithmssynchronizationmultiprocessorsparallel processorsheuristic methodsconsistent labelingasynchronous algorithmspath and circuit problemsmultiple-data-stream processors (MIMD)multiple-instruction-stream

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Theory of software (68N99)

Related Items (3)

A relaxation of Üresin and Dubois' asynchronous fixed-point theory in Agda ⋮ Some aspects of parallel and distributed iterative algorithms - a survey ⋮ Self-stabilization with path algebra

This page was built for publication: Parallel asynchronous algorithms for discrete data