Login / Signup

Scheduling Fork Graphs under LogP with an Unbounded Number of Processors.

Iskander KortDenis Trystram
Published in: Euro-Par (1998)
Keyphrases
  • communication delays
  • small number
  • scheduling problem
  • information systems
  • special case
  • memory requirements
  • parallel processing
  • state space search