Task scheduling scheme based on resource clustering in desktop grids

Abstract

Desktop grids are platforms for grid computing that incorporate desktop resources into a grid infrastructure. The purpose of this computing paradigm is to process a massive computational tasks by exploiting the donated resources connected over the Internet. In desktop grids, it is important to guarantee fast turnaround time in the presence of dynamic properties, such as volatility and heterogeneity. To achieve this objective, we propose a task scheduling scheme based on resource clustering that can selectively allocate tasks to those resources that are most suitable for the current situation of a desktop grid environment. As a classifier of resources, the k-means clustering algorithm is introduced to classify resources according to their own task execution availability and result-return probability. The experimental results show that our scheduling scheme is more efficient than existing scheduling schemes with respect to reducing both the turnaround time and the quantity of resources consumed. TASK SCHEDULING SCHEME BASED ON RESOURCE CLUSTERING IN DESKTOP GRIDS 919 grid computing [1], each resources in a desktop grid can freely join and leave during task execution. Accordingly, task execution can be volatile at any time, and thus task failures inevitably occur. Desktop grids are also based on heterogeneous resources from different types of CPUs, OSs, memory capacity, and so on [16]. Task completion time can be vary greatly depending on the performance of resources. Therefore, task scheduling in desktop grids must positively consider the dynamic properties that arise from these volatility and heterogeneity.Task scheduling is the process of assigning tasks to the most suitable resources [17][18][19]. Unlike traditional approach in grids, task scheduling in desktop grids should consider the type of resources, resource trust, execution failures, applications, and so on [20]. Tasks can be allocated to resources either statically or dynamically [17]. When tasks are statically allocated, all of the information needed for scheduling, such as task execution time, resource performance, and the number of resources participating, should be known in advance. Thus, tasks can be deterministically allocated to resources before task execution is started. On the other hand, dynamic task scheduling is based on a continuous request of incoming tasks, and thus a decision for task allocation is postponed until run time; tasks should be allocated to resources, taking into account the current environmental information such as available resources, the number of uncompleted tasks, the network situation, and so on.Static task scheduling is not suitable for desktop grids due to the dynamic characteristics caused by volatility and heterogeneity. Thus, dynamic task scheduling using the current environmental information should be used in desktop grids. However, the existing desktop grid systems have mainly used static task scheduling such as first-come first-served (FCFS) scheduling [21,22] and eager scheduling [11,23]. Such systems cannot gua...

Fault tolerance in grid computing by resource clustering

“…Indeed, for problems involving large data sets, very few resources may be able to store the data associated to a task, and therefore may be able to participate to the computations. In this context, several distributed algorithms are proposed for a large set of resources that enables to build clusters, where each cluster will be responsible for processing tasks and storing associated data (Gil et al, 2014;Beaumont et al, 2008).…”

Trust model for reliable node allocation based on daily computer usage behavior

“…This process typically involves the use of many resources (e.g., computer, data, I/O, and instruments) to solve a large problem that cannot be solved on a single resource. In desktop grid computing, millions of desktop PCs with idle cycles that can be exploited to run grid applications are connected to wide‐area networks both in homes and in enterprises to collectively execute high‐throughput applications . The efficiency of desktop grids has been demonstrated in real‐world projects, such as SETI@home.…”

Minimizing data access latency in data grids by neighborhood‐based data replication and job scheduling

“…Job scheduling strategies determine a suitable site for the execution of a given job. 6 Data Replication is a widely used technique to decrease access latency, response time, network resource consumption, and network traffic 7 in database management systems (DBMS), mobile, Data Grid, cloud, peer-to-peer (p2p) fog, and smart-city 8,9 by increasing data availability, transparency, reliability, and fault tolerance. 10 Replication copies the file at different nodes (sites) to increase the data access locality and decrease the data access delay.…”