Relaxation Phenomena in Supercomputer Jobs

Simple item page
dc.creatorClearwater, Scott H.
dc.creatorKleban, Stephen D.
dc.date2002-08-27
dc.date2002-08-28
dc.date.accessioned2026-07-07T02:47:00Z
dc.date.available2026-07-07T02:47:00Z
dc.descriptionWe 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.
dc.descriptionRevTex 5 pages, 3 figures
dc.identifierhttps://arxiv.org/abs/cond-mat/0208531
dc.identifierhttp://arxiv.org/abs/cond-mat/0208531
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/19845
dc.subjectDisordered Systems and Neural Networks
dc.titleRelaxation Phenomena in Supercomputer Jobs
dc.typetext

Files

Collections

arXiv