Scheduling Parallel Task Graphs on (Almost) Homogeneous Multicluster Platforms

Applications structured as parallel task graphs exhibit both data and task parallelism and arise in many domains. Scheduling these applications efficiently on parallel platforms has been a long-standing challenge. In the case of a single homogeneous platform, such as a cluster, results have been obtained both in theory, i.e., guaranteed algorithms, and, in practice, i.e., pragmatic heuristics. Due to task parallelism, these applications are well suited for execution on distributed platforms that span multiple clusters possibly in multiple institutions.

Provided by: Institute of Electrical & Electronic Engineers Topic: Big Data Date Added: Mar 2009 Format: PDF

Find By Topic