Sciweavers

312 search results - page 16 / 63
» Scheduling Jobs on Grid Processors
Sort
View
SASO
2008
IEEE
15 years 3 months ago
On the Feasibility of Decentralized Grid Scheduling
Many authors recognize the limitations of hierarchical Grid scheduling in scalable environments, and proposed peer-to-peer solutions to this problem. However, most peerto-peer gri...
Marco Fiscato, Paolo Costa, Guillaume Pierre
HPDC
2006
IEEE
15 years 3 months ago
Effective Prediction of Job Processing Times in a Large-Scale Grid Environment
Grid applications that use a considerable number of processors for their computations need effective predictions of the expected computation times on the different nodes. Currentl...
Menno Dobber, Robert D. van der Mei, Ger Koole
MIDDLEWARE
2007
Springer
15 years 3 months ago
Using checkpointing to recover from poor multi-site parallel job scheduling decisions
Recent research in multi-site parallel job scheduling leverages user-provided estimates of job communication characteristics to effectively partition the job across multiple clus...
William M. Jones
CORR
2007
Springer
125views Education» more  CORR 2007»
14 years 9 months ago
A Study of Grid Applications: Scheduling Perspective
: As the Grid evolves from a high performance cluster middleware to a multipurpose utility computing framework, a good understanding of Grid applications, their statistics and util...
Aleksandar Lazarevic, Lionel Sacks
73
Voted
AICCSA
2007
IEEE
99views Hardware» more  AICCSA 2007»
15 years 1 months ago
An Efficient Processor Allocation Strategy that Maintains a High Degree of Contiguity among Processors in 2D Mesh Connected Mult
Two strategies are used for the allocation of jobs to processors connected by mesh topologies: contiguous allocation and non-contiguous allocation. In noncontiguous allocation, a ...
Saad Bani-Mohammad, Mohamed Ould-Khaoua, Ismail Ab...