Sciweavers

1758 search results - page 162 / 352
» Schedule processes, not VCPUs
Sort
View
ICPADS
2007
IEEE
16 years 1 months ago
On the relative value of local scheduling versus routing in parallel server systems
We consider a system with a dispatcher and several identical servers in parallel. Task processing times are known upon arrival. We first study the impact of the local scheduling ...
Rong Wu, Douglas G. Down
WIOPT
2011
IEEE
14 years 10 months ago
Lower bounds on the success probability for ad hoc networks with local FDMA scheduling
—This paper studies the performance of ad hoc networks with local FDMA scheduling using stochastic point processes. In such networks, the Poisson assumption is not justified due...
Ralph Tanbourgi, Jens P. Elsner, Holger Jäkel...
EUROPAR
2007
Springer
16 years 29 days ago
Negotiation Strategies Considering Opportunity Functions for Grid Scheduling
In Grid systems, nontrivial qualities of service have to be provided to users by the resource providers. However, resource management in a decentralized infrastructure is a complex...
Jiadao Li, Kwang Mong Sim, Ramin Yahyapour
KBSE
2006
IEEE
16 years 24 days ago
Integrating and Scheduling an Open Set of Static Analyses
To improve the productivity of the development process, more and more tools for static software analysis are tightly integrated into the incremental build process of an IDE. If mu...
Michael Eichberg, Mira Mezini, Sven Kloppenburg, K...
JSSPP
2001
Springer
15 years 11 months ago
Metrics for Parallel Job Scheduling and Their Convergence
The arrival process of jobs submitted to a parallel system is bursty, leading to fluctuations in the load at many time scales. In particular, rare events of extreme load may occu...
Dror G. Feitelson