Sciweavers

1050 search results - page 151 / 210
» Online scheduling in grids
Sort
View
CCGRID
2007
IEEE
14 years 3 months ago
Reparallelization and Migration of OpenMP Programs
Typical computational grid users target only a single cluster and have to estimate the runtime of their jobs. Job schedulers prefer short-running jobs to maintain a high system ut...
Michael Klemm, Matthias Bezold, Stefan Gabriel, Ro...
WEBI
2004
Springer
14 years 2 months ago
Incentive-Compatible Social Choice
Many situations present a social choice problem where different self-interested agents have to agree on joint, coordinated decisions. For example, power companies have to agree o...
Boi Faltings
CONCURRENCY
2004
99views more  CONCURRENCY 2004»
13 years 8 months ago
A performance study of job management systems
Job Management Systems (JMSs) efficiently schedule and monitor jobs in parallel and distributed computing environments. Therefore, they are critical for improving the utilization ...
Tarek A. El-Ghazawi, Kris Gaj, Nikitas A. Alexandr...
INFOCOM
2006
IEEE
14 years 3 months ago
Generalized Proportional Fair Scheduling in Third Generation Wireless Data Networks
—In 3G data networks, network operators would like to balance system throughput while serving users in a fair manner. This is achieved using the notion of proportional fairness. ...
Tian Bu, L. Li, Ramachandran Ramjee
IPPS
2008
IEEE
14 years 3 months ago
Large-scale experiment of co-allocation strategies for Peer-to-Peer supercomputing in P2P-MPI
High Performance computing generally involves some parallel applications to be deployed on the multiples resources used for the computation. The problem of scheduling the applicat...
Stéphane Genaud, Choopan Rattanapoka