Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
Special pages
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

Synchronization costs on multiprocessors

From MaRDI portal
Jump to:navigation, search

DOI10.1016/0167-8191(89)90073-2zbMATH Open0673.68017OpenAlexW1991839689MaRDI QIDQ1121003FDOQ1121003


Authors: Anne Greenbaum Edit this on Wikidata


Publication date: 1989

Published in: Parallel Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-8191(89)90073-2




Recommendations

  • High speed synchronization of processors using fuzzy barriers
  • Comparing barrier algorithms
  • Time/contention trade-offs for multiprocessor synchronization
  • Two algorithms for barrier synchronization
  • Analysis of delays caused by local synchronization


zbMATH Keywords

multiprocessorswaiting timebarrieranalysis of execution andneighbor and boundary synchronizationsynchronization costs


Mathematics Subject Classification ID

Theory of software (68N99) Theory of operating systems (68N25)



Cited In (6)

  • A complexity-based classification for multiprocessor synchronization
  • Title not available (Why is that?)
  • Analysis of delays caused by local synchronization
  • Title not available (Why is that?)
  • Two-phase barrier: A synchronization primitive for improving the processor utilization
  • Arbitration-free synchronization





This page was built for publication: Synchronization costs on multiprocessors

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1121003)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1121003&oldid=13166031"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 31 January 2024, at 02:51. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki