Sciweavers

7 search results - page 1 / 2
» Modelling job allocation where service duration is unknown
Sort
View
IPPS
2006
IEEE
13 years 10 months ago
Modelling job allocation where service duration is unknown
In this paper a novel job allocation scheme in distributed systems (TAG) is modelled using the Markovian process algebra PEPA. This scheme requires no prior knowledge of job size ...
Nigel Thomas
AMC
2006
114views more  AMC 2006»
13 years 4 months ago
A multi-objective resource allocation problem in dynamic PERT networks
We develop a multi-objective model for the resource allocation problem in a dynamic PERT network, where the activity durations are exponentially distributed random variables and t...
Amir Azaron, Reza Tavakkoli-Moghaddam
SPAA
2003
ACM
13 years 10 months ago
A proportionate fair scheduling rule with good worst-case performance
In this paper we consider the following scenario. A set of n jobs with different threads is being run concurrently. Each job has an associated weight, which gives the proportion ...
Micah Adler, Petra Berenbrink, Tom Friedetzky, Les...
QEST
2006
IEEE
13 years 10 months ago
Load Balancing for Performance Differentiation in Dual-Priority Clustered Servers
Size-based policies have been known to successfully balance load and improve performance in homogeneous cluster environments where a dispatcher assigns a job to a server strictly ...
Ningfang Mi, Qi Zhang, Alma Riska, Evgenia Smirni
ICSOC
2004
Springer
13 years 10 months ago
An OGSA-based accounting system for allocation enforcement across HPC centers
In this paper, we present an Open Grid Services Architecture (OGSA)-based decentralized allocation enforcement system, developed with an emphasis on a consistent data model and ea...
Thomas Sandholm, Peter Gardfjäll, Erik Elmrot...