An algorithmic model for heterogeneous hyper-clusters: rationale and experience
暂无分享,去创建一个
[1] Viktor K. Prasanna,et al. Adaptive Communication Algorithms for Distributed Heterogeneous Systems , 1999, J. Parallel Distributed Comput..
[2] Larry Carter,et al. Scheduling strategies for master-slave tasking on heterogeneous processor platforms , 2004, IEEE Transactions on Parallel and Distributed Systems.
[3] Charles E. Leiserson,et al. Space-Efficient Scheduling of Multithreaded Computations , 1998, SIAM J. Comput..
[4] Yves Robert,et al. The master-slave paradigm with heterogeneous processors , 2001, Proceedings 42nd IEEE Symposium on Foundations of Computer Science.
[5] Arnold L. Rosenberg,et al. An Optimal Strategies for Cycle-Stealing in Networks of Workstations , 1997, IEEE Trans. Computers.
[6] Arnold L. Rosenberg. Optimal Schedules for Cycle-Stealing in a Network of Workstations with a Bag-of-Tasks Workload , 2002, IEEE Trans. Parallel Distributed Syst..
[7] Ramesh Subramonian,et al. LogP: a practical model of parallel computation , 1996, CACM.
[8] David E. Culler,et al. A case for NOW (networks of workstation) , 1995, PODC '95.
[9] Paul D. Gader,et al. Image algebra techniques for parallel image processing , 1987 .
[10] Leslie G. Valiant,et al. A bridging model for parallel computation , 1990, CACM.
[11] Mihalis Yannakakis,et al. Towards an Architecture-Independent Analysis of Parallel Algorithms , 1990, SIAM J. Comput..