Author:
Bampis E.,Delorme C.,König J. -C.
Publisher
Springer Berlin Heidelberg
Reference17 articles.
1. A. Aggarwal, A. K. Chandra, M. Snir, Communication complexity of PRAMs, Theoretical Computer Science 71 3–28 (1990).
2. A. V. Aho, J. E. Hopcroft, J. D. UllmanThe Design and Analysis of Computer Algorithms, Addison-Wesley, Reading, MA (1974).
3. R.J. Anderson, P. Beame, W. Ruzzo, Low overhead parallel schedules for task graphs, Proc. ACM Symp. Parallel Algorithms and Architectures 66–75 (1990).
4. E. Bampis, C. Delorme, J-C. König, Optimal Schedules for d-D Grid Graphs with Communication Delays, Technical Report N∘ 4, LaMI, University of Evry.
5. E. Bampis, J-C. König, D. Trystram, A Low overhead schedule for a 3D-Grid Graph, Parallel Processing Letters 2 4 363–372 (1992).
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献