Sciweavers

301 search results - page 4 / 61
» Job Sequencing with Exponential Functions of Processing Time...
Sort
View
PE
2007
Springer
137views Optimization» more  PE 2007»
14 years 9 months ago
A prediction method for job runtimes on shared processors: Survey, statistical analysis and new avenues
Grid computing is an emerging technology by which huge numbers of processors over the world create a global source of processing power. Their collaboration makes it possible to pe...
Menno Dobber, Robert D. van der Mei, Ger Koole
HPDC
2010
IEEE
14 years 10 months ago
A hybrid Markov chain model for workload on parallel computers
This paper proposes a comprehensive modeling architecture for workloads on parallel computers using Markov chains in combination with state dependent empirical distribution functi...
Anne Krampe, Joachim Lepping, Wiebke Sieben
PE
2010
Springer
137views Optimization» more  PE 2010»
14 years 7 months ago
Tail-robust scheduling via limited processor sharing
From a rare events perspective, scheduling disciplines that work well under light (exponential) tailed workload distributions do not perform well under heavy (power) tailed worklo...
Jayakrishnan Nair, Adam Wierman, Bert Zwart
RSA
2010
118views more  RSA 2010»
14 years 7 months ago
Weight of a link in a shortest path tree and the Dedekind Eta function
The weight of a randomly chosen link in the shortest path tree on the complete graph with exponential i.i.d. link weights is studied. The corresponding exact probability generatin...
Piet Van Mieghem
AI
1999
Springer
14 years 9 months ago
An Affective Mobile Robot Educator with a Full-Time Job
Sage is a robot that has been installed at the Carnegie Museum of Natural History as a full-time autonomous member of the staff. Its goal is to provide educational content to muse...
Illah R. Nourbakhsh