Author:
Simon Jens,Wierum Jens-Michael
Publisher
Springer Berlin Heidelberg
Reference16 articles.
1. B. Alpern, L. Carter, E. Feig, and T. Selker. The uniform memory hierarchy model of computation. Algorithmica, 12:72–109, 1994.
2. R. Bianchini, M.E. Crovella, L. Kontothanassis, and T.J. LeBlanc. Alleviating memory contention in matrix computations on large-scale sharedmemory multiprocessors. Proceedings of the Sixth IEEE Symposium on Parallel and Distributed Processing, pages 56–65, October 1994.
3. D. Culler, R. Karp, D. Patterson, A. Sahay, K.E. Schauser, E. Santos, R. Subramonian, and T. van Eicken. LogP: Towards a realistic model of parallel computation. Proceedings of the Fourth ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, May 1993.
4. S. Fortune and J.Wyllie. Parallism in random access machines. Proceedings of the 10th Annual Symosium on Theory of Computing, pages 114–118, 1978.
5. S.E. Hambrush and A.A. Khokhar. C3: A parallel model for coarse-grained machines. Technical report, Purdue, University, January 1995.
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献