Embarrassingly parallel jobs are not embarrassingly easy to schedule on the grid
Embarrassingly parallel jobs are not embarrassingly easy to schedule on the grid
复制标题
在网格上调度并行作业并不容易
DOI：
10.1109/mtags.2008.4777910
复制
发表时间：
2008
期刊：
影响因子：
--
通讯作者：
P. Bangalore
中科院分区：
文献类型：
--
作者：
E. Afgan;P. Bangalore
令人尴尬的是，并行应用程序是当今网格环境中的一个重要工作负载。这类应用程序的调度和执行通常被认为是同构集群上的一个微不足道且易于理解的过程。然而，虽然网格环境提供了必要的计算资源，相关的资源异构性代表了一个新的挑战，有效的任务执行这些类型的应用程序跨多个资源。本文提出了一组示例，说明了如何执行特性的个别任务，因此一个作业，任务执行资源的选择，任务调用参数和任务输入数据属性的影响。这项工作的目的是突出应用程序和执行资源之间的这种关系，以促进更好的网格元数据交换技术的发展。通过利用这种关系，应用程序吞吐量可以最大化，也导致更高的资源利用率。为了实现这样的好处，一组作业调度和执行的关注点，导致在网格环境中的并行应用程序调度的计算流水线。
Embarrassingly parallel applications represent an important workload in today's grid environments. Scheduling and execution of this class of applications is considered mostly a trivial and well-understood process on homogeneous clusters. However, while grid environments provide the necessary computational resources, associated resource heterogeneity represents a new challenge for efficient task execution for these types of applications across multiple resources. This paper presents a set of examples illustrating how execution characteristics of individual tasks, and consequently a job, are affected by the choice of task execution resources, task invocation parameters, and task input data attributes. It is the aim of this work to highlight this relationship between an application and an execution resource to promote development of better metascheduling techniques for the grid. By exploiting this relationship, application throughput can be maximized, also resulting in higher resource utilization. In order to achieve such benefits, a set of job scheduling and execution concerns is derived leading toward a computational pipeline for scheduling embarrassingly parallel applications in grid environments.