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

Maximum principle for the realization of the minimum computing time for parallel algorithms

From MaRDI portal
Publication:1363083
Jump to:navigation, search

zbMATH Open0881.68060MaRDI QIDQ1363083FDOQ1363083


Authors: Stefan Węgrzyn, Pierre-Paul Vidal Edit this on Wikidata


Publication date: 7 August 1997

Published in: Bulletin of the Polish Academy of Sciences. Technical Sciences (Search for Journal in Brave)





Recommendations

  • A parallel algorithm for finding the maximum value
  • Your favorite parallel algorithms might not be as fast as you think
  • scientific article; zbMATH DE number 559227
  • scientific article; zbMATH DE number 709668


zbMATH Keywords

parallel algorithms


Mathematics Subject Classification ID

Distributed algorithms (68W15)



Cited In (1)

  • A parallel cost-optimal algorithm to compute the supremum of max-min powers





This page was built for publication: Maximum principle for the realization of the minimum computing time for parallel algorithms

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

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