Sciweavers

874 search results - page 142 / 175
» On Advantages of Grid Computing for Parallel Job Scheduling
Sort
View
IPPS
2002
IEEE
14 years 1 months ago
Variable Partitioning and Scheduling of Multiple Memory Architectures for DSP
Multiple memory module architecture enjoys higher memory access bandwidth and thus higher performance. Two key problems in gaining high performance in this kind of architecture ar...
Qingfeng Zhuge, Bin Xiao, Edwin Hsing-Mean Sha
CCGRID
2005
IEEE
14 years 2 months ago
Continuous resources allocation in Internet data centers
Internet data centers (IDCs) perform multi-customer hosting on a virtualized collection of resources while Grid computing generalizes distributed computing by focusing on large sc...
Youssef Hamadi
IPPS
2007
IEEE
14 years 3 months ago
Implementing OLAP Query Fragment Aggregation and Recombination for the OLAP Enabled Grid
In this paper we propose a new query processing method for the OLAP Enabled Grid, which blends sophisticated cache extraction techniques and data grid scheduling to efficiently s...
Michael Lawrence, Frank K. H. A. Dehne, Andrew Rau...
ISAAC
2010
Springer
291views Algorithms» more  ISAAC 2010»
13 years 6 months ago
A Tighter Analysis of Work Stealing
Abstract. Classical list scheduling is a very popular and efficient technique for scheduling jobs in parallel platforms. However, with the increasing number of processors, the cost...
Marc Tchiboukdjian, Nicolas Gast, Denis Trystram, ...
HPDC
2007
IEEE
14 years 3 months ago
A fast topology inference: a building block for network-aware parallel processing
Adapting to the network is the key to achieving high performance for communication-intensive applications, including scientific computing, data intensive computing, and multicast...
Tatsuya Shirai, Hideo Saito, Kenjiro Taura