Programming is hard. Building a large program is like constructing a steam locomotive
through a hole the size of a postage stamp. An artefact that is the fruit of hundreds of person …

Nested parallel programming models, where the task graph associated to a computation is
series-parallel are easy to program and show good analysis properties. These can be …

Task scheduling is a key element in achieving high performance from multicomputer
systems. Efficient scheduling algorithms reduce the interprocessor communication and …

The unconstrained global programming problem is addressed using an efficient multi-start
algorithm, in which parallel local searches contribute towards a Bayesian global stop** …

This paper discusses algorithms for scheduling task-graphs G=(V, E, τ) to LogP-machines.
These algorithms depend on the granularity of G, ie, on the ratio of computation τ (v) and …

While the NP-complete problem of scheduling weighted arbitrary directed acyclic graphs
under the delay model has been studied extensively, comparatively little work exists for this …

While the task scheduling problem under the delay model has been studied extensively,
relatively little research exists for more realistic communication models such as the LogP …

While the problem of scheduling weighted arbitrary DAGs under the delay model has been
studied extensively, comparatively little work exists for this problem under a more realistic …

While the task scheduling problem under the delay model has been studied extensively,
relatively little research exists for more realistic communication models such as the LogP …

This paper briefly describes the mechanisms used to reduce the number of processors
required by a class of task replication-based scheduling heuristics for the LogP model …