1301 search results - page 32 / 261 » Performance Analysis of Parallel Job Scheduling in Distribut... |
147
click to vote
EUROPAR
1998
Springer
15 years 9 months ago
1998
Springer
Instruction Balanced Time Slicing IBTS allows multiple parallel jobs to be scheduled in a manner akin to the well-known gang scheduling scheme in parallel computers. IBTS however a...
144
click to vote
GCC
2006
Springer
15 years 9 months ago
2006
Springer
In this paper, we propose a new scheduling algorithm with economic theory, called Black Scholes Market (BSM) algorithm for a class of Dynamic Jobs (DJ). BSM is based on the classi...
165
click to vote
IPPS
2005
IEEE
15 years 11 months ago
2005
IEEE
We propose a cluster-based web server where a few computing nodes are separately reserved for high-performance computing applications, such as multimedia, SSL, and CGI. As an exam...
136
click to vote
ESCIENCE
2006
IEEE
15 years 9 months ago
2006
IEEE
: E-Science often requires access to remote Grid computing platforms. Current authorization systems on these remote systems have largely based decisions solely on the identity of t...
139
click to vote
IOR
2002
15 years 5 months ago
2002
We describe a simple on-line heuristic for scheduling job-shops. We assume there is a fixed set of routes for the jobs, and many jobs, say N, on each route. The heuristic uses saf...