Titlebook: ;

有發(fā)明天才

A Scheduling Approach with Respect to Overlap of Computing and Data Transferring in Grid Computingsferring. On the basis of network status, node load, and the relation between task execution and task data access, data transferring and computing can occur concurrently in the following three cases: a) A task is being executed on a part of its dataset when the other of its dataset is being replicat

antiandrogen

公共汽車(chē)

A Load Balancing Algorithm for Web Based Server Gridsines the queuing theory and hydro-dynamic theory, to model load balance in server grids. Base on the BLQ model, we claim that if the system is in the state of global fairness, then the performance of the whole system is the best. We propose a load balanced algorithm based on the model: the algorithm

Nonflammable

欲望

Palter

A New Task Scheduling Algorithm in Distributed Computing Environmentsracterizing task’s precedence is DAG (directed acyclic graph). In [2], a novel model called TTIG (Temporal Task In Interaction Graph)that is more realistic and universal than DAG and its corresponding algorithm called MATE are presented. This paper extends TTIG model and proposes a new static schedu

讓你明白

運(yùn)動(dòng)吧

散開(kāi)

J?rg Feldhusen,Karl-Heinrich Grotey schedule these tasks to processing elements that communicate data between each other by means of a network. In this paper, we consider task graphs that take into account both, computation and communication costs. For a homogeneous computing system with a fixed number of processing elements we comp

alleviate