arXiv · cond-mat/0208531
Relaxation Phenomena in Supercomputer Jobs
Abstract
We show that the distribution of supercomputer job submission interarrival times can be understood as a relaxation process. The process of deciding when to submit a job involves a complicated set of interactions between the users themselves, the queuing algorithm, the supercomputer, and a hierarchy of other decision makers. This is analogous to the hierarchically constrained dynamics found in glassy relaxation modelled by a stretched exponential. Empirical supercomputer log data shows that the tails of the distributions are well fit by a stretched exponential.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Scott H. Clearwater, Stephen D. Kleban. 2002-08-28. Relaxation Phenomena in Supercomputer Jobs. https://arxiv.org/abs/cond-mat/0208531
Cite the original work for its findings. Save a collection to share your selection of sources.