Communications of the ACM
Wide area traffic: the failure of Poisson modeling
IEEE/ACM Transactions on Networking (TON)
Self-similarity in file systems
SIGMETRICS '98/PERFORMANCE '98 Proceedings of the 1998 ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems
ASCI Queuing Systems: Overview and Comparisons
IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
The EASY - LoadLeveler API Project
IPPS '96 Proceedings of the Workshop on Job Scheduling Strategies for Parallel Processing
HPDC '03 Proceedings of the 12th IEEE International Symposium on High Performance Distributed Computing
Segment-based adaptive hyper-Erlang model for long-tailed network traffic approximation
The Journal of Supercomputing
| Hi-index | 0.00 |
We report on a model of the distribution of job submission interarrival times in supercomputers.Interarrival times are modeled as a consequence of a complicated set of decisions between users, the queuing algorithm, and other policies.This cascading hierarchy of decision-making processes leads to a particular kind of heavy-tailed distribution.Specifically, hierarchically constrained systems suggest that fatter tails are due to more levels coming into play in the overall decision-making process.The key contribution of this paper is that heavier tials resulting from more complex decision-making processes, that ismore hierarchical levels, will lead to overall worse performance, even when the average interarrival time is the same.Finally, we offer some suggestions for how to overcome these issues and the tradeoffs involved.