- Processor scheduling in distributed-memory systems has received considerable attention in recent years. Several commercial distributed-memory systems use spacesharing processor s...
We consider the problem of scheduling unit-length jobs on identical parallel machines such that the makespan of the resulting schedule is minimized. Precedence constraints impose ...
Daniel W. Engels, Jon Feldman, David R. Karger, Ma...
Abstract--Scheduling algorithm for batch-mode dataintensive jobs is a key issue in data-intensive Grid applications. It focuses on how to minimize the overhead of transferring the ...
Jianhua Jiang, Huifang Ji, Gaochao Xu, Xiaohui Wei
In this paper, we study the problem of cost constrained fixed job scheduling (CCFJS). In this problem, there are a number of processors, each of which belongs to one of several cla...
In [12] we introduce a novel architecture for data processing, based on a functional fusion between a data and a computation layer. In this demo we show how this architecture is le...
Radu Sion, Ramesh Natarajan, Inderpal Narang, Thom...