Processable Bulk Data Transfer (PBDT) tasks are resource intensive concurrent tasks which involve transfer of a very large amount of data that has to be processed in some way before it can be used at a remote set of destination nodes called the sink nodes. A distributed computing environment, such as the Grid is a popular way to perform these tasks. Focusing on the execution of PBDT tasks in a Grid computing environment, this paper presents an efficient resource allocation mechanism. Due to the resource thirsty nature of these tasks, an efficient resource allocation is essential to perform these tasks while achieving satisfactory performance. The time-complexity of the resource allocation algorithm rises sharply as the available number of resources in the given Grid computing environment is increased making efficient resource allocation a challenge. To meet this challenge, this paper investigates the use of approximate algorithms for the resource allocation. The benefits obtained by using the reduced complexity of the algorithm are weighed against the increased costs incurred during the task execution (due to the inaccuracies in resource allocation introduced by the approximations). This paper describes a number of approximations and discusses under which circumstances such approximations are to be used. The techniques presented in this research can be extended to non-PBDT tasks and other distributed computing environments. Copyright 2008 ACM.

Additional Metadata
Keywords Distributed systems, Grid computing, High performance computing, Resource management
Persistent URL dx.doi.org/10.1145/1383559.1383583
Conference 7th International Workshop on Software and Performance 2008, WOSP'08
Citation
Ahmad, I. (Imran), & Majumdar, S. (2008). Performance of resource management algorithms for "processable bulk data transfer" tasks in grid environments. Presented at the 7th International Workshop on Software and Performance 2008, WOSP'08. doi:10.1145/1383559.1383583