Dynamic distributed scheduling algorithm for state space search

international conference on parallel processing, Volume 7484, 2012, Pages 141-154.

Cited by: 7|Views9
EI

Abstract:

Petascale computing requires complex runtime systems that need to consider load balancing along with low time and message complexity for scheduling massive scale parallel computations. Simultaneous consideration of these objectives makes online distributed scheduling a very challenging problem. For state space search applications such as ...More

Code:

Data:

Get fulltext within 24h
Bibtex
Your rating :
0

 

Tags
Comments