Anticipated distributed task scheduling for grid environments
Thomas Rauber · 1995
Heterogeneous distributed environments or grid en-vironments provide large computing resources for the execution of large scientific applications. The effective use of those platforms requires a suitable representa-tion of the application algorithm which makes a distri-bution of parts of the application across the distributed environment possible. A representation of an applica-tion algorithm in form of interacting tasks has been shown to be a suitable programming model for those distributed environments, where tasks can be shipped to remote computing resources for execution. The ef-ficient execution of an application also depends on the time for sending tasks and data to remote resoures, which adds an additional overhead to the distributed execution time. In this paper, we propose a method to overlap the execution of current tasks with the ship-ping time for tasks to be executed later. The efficient overlapping is achieved by an anticipated scheduling al-gorithm for the placement of future task executions. 1