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

New bounds on time and number of processors for multiprocessor optimal schedules

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

DOI10.1007/BF02900854zbMATH Open0919.68022OpenAlexW2086009270MaRDI QIDQ4229565FDOQ4229565


Authors: Wei Sun, Shaohan Ma Edit this on Wikidata


Publication date: 23 August 1999

Published in: Wuhan University Journal of Natural Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02900854




Recommendations

  • Publication:3489452
  • scientific article; zbMATH DE number 4001519
  • scientific article; zbMATH DE number 2088035
  • A parallel alpha/beta tree searching algorithm
  • scientific article; zbMATH DE number 895355


zbMATH Keywords

DDS\(^*\)game tree search algorithm


Mathematics Subject Classification ID

Searching and sorting (68P10) Parallel algorithms in computer science (68W10)


Cites Work

  • Optimal Scheduling Strategies in a Multiprocessor System


Cited In (4)

  • A Parallel Game Tree Search Algorithm With A Linear Speedup
  • Fundamentals of Computation Theory
  • Title not available (Why is that?)
  • Title not available (Why is that?)





This page was built for publication: New bounds on time and number of processors for multiprocessor optimal schedules

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

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