Scheduling an application in data grid was significantly complex and very challenging because of its heterogeneous in nature of the grid system. When the Divisible Load Theory (DLT) model had emerged as a powerful model for modeling data-intensive grid problem, Task Data Present(TDP) model was proposed based on it. This study presented a new Adaptive TDP (ATDP) for scheduling the intensive grid applications. New closed form solution for obtaining the load allocation was derived while computation speeds and communication links are heterogeneous. Experimental results showed that the proposed model can balance the load efficiently
To date solutions for optimal finish time and job allocation in divisible load theory are largely ob...
International audienceDivisible load applications consist of an amount of data and associated comput...
制度:新 ; 報告番号:甲2691号 ; 学位の種類:博士(国際情報通信学) ; 授与年月日:2008/7/30 ; 早大学位記番号:新4866textthesi
Abstract: Scheduling an application in data grid was significantly complex and very challenging beca...
Scheduling an application in data grid is significantly complex and very challenging because of its ...
Problem statement: In many data grid applications, data can be decomposed into multiple independent ...
Scheduling an application in data grid is significantly complex and very challenging because of its ...
In many data grid applications, data can be decomposed into multiple independent sub-datasets and di...
In many data grid applications, data can be decomposed into multiple independent sub datasets and d...
In many data grid applications, data can be decomposed into multiple independent sub datasets and di...
According to the special features of the dynamic heterogeneous grid environment, a loose-coupled and...
In many data grid applications, data can be decomposed into multiple independent sub datasets and d...
In many data grid applications, data can be decomposed into multiple independent sub data sets and d...
Divisible load applications have received a lot of attention in recentscheduling literature. These a...
(eng) Divisible load applications consist of an amount of data and associated computation that can b...
To date solutions for optimal finish time and job allocation in divisible load theory are largely ob...
International audienceDivisible load applications consist of an amount of data and associated comput...
制度:新 ; 報告番号:甲2691号 ; 学位の種類:博士(国際情報通信学) ; 授与年月日:2008/7/30 ; 早大学位記番号:新4866textthesi
Abstract: Scheduling an application in data grid was significantly complex and very challenging beca...
Scheduling an application in data grid is significantly complex and very challenging because of its ...
Problem statement: In many data grid applications, data can be decomposed into multiple independent ...
Scheduling an application in data grid is significantly complex and very challenging because of its ...
In many data grid applications, data can be decomposed into multiple independent sub-datasets and di...
In many data grid applications, data can be decomposed into multiple independent sub datasets and d...
In many data grid applications, data can be decomposed into multiple independent sub datasets and di...
According to the special features of the dynamic heterogeneous grid environment, a loose-coupled and...
In many data grid applications, data can be decomposed into multiple independent sub datasets and d...
In many data grid applications, data can be decomposed into multiple independent sub data sets and d...
Divisible load applications have received a lot of attention in recentscheduling literature. These a...
(eng) Divisible load applications consist of an amount of data and associated computation that can b...
To date solutions for optimal finish time and job allocation in divisible load theory are largely ob...
International audienceDivisible load applications consist of an amount of data and associated comput...
制度:新 ; 報告番号:甲2691号 ; 学位の種類:博士(国際情報通信学) ; 授与年月日:2008/7/30 ; 早大学位記番号:新4866textthesi