Publisher
Springer Berlin Heidelberg
Reference22 articles.
1. G. Alverson, S. Kahan, R. Korry, C. McCann, and B. Smith, “Scheduling on the Tera MTA”. In Job Scheduling Strategies for Parallel Processing, D. G. Feitelson and L. Rudolph (eds.), pp. 19–44, Springer-Verlag, 1995. Lecture Notes in Computer Science Vol. 949.
2. G. M. Amdahl, “Validity of the single processor approach to achieving large scale computer capabilities”. In AFIPS Spring Joint Comput. Conf., vol. 30, pp. 483–485, Apr 1967.
3. D. C. Burger, R. S. Hyder, B. P. Miller, and D. A. Wood, “Paging tradeoffs in distributed-shared-memory multiprocessors”. J. Supercomput. 10(1), pp. 87–104, 1996.
4. J. J. Dongarra, H. W. Meuer, and E. Strohmaier, “Top500 supercomputer sites”. http://www.netlib.org/benchmark/top500.html. (updated every 6 months).
5. D. G. Feitelson, “Packing schemes for gang scheduling”. In Job Scheduling Strategies for Parallel Processing, D. G. Feitelson and L. Rudolph (eds.), pp. 89–110, Springer-Verlag, 1996. Lecture Notes in Computer Science Vol. 1162.
Cited by
17 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献