A cluster-M based mapping methodology
暂无分享,去创建一个
[1] David Fernández-Baca,et al. Allocating Modules to Processors in a Distributed System , 1989, IEEE Trans. Software Eng..
[2] Jake K. Aggarwal,et al. A Mapping Strategy for Parallel Processing , 1987, IEEE Transactions on Computers.
[3] Virginia Mary Lo,et al. Heuristic Algorithms for Task Assignment in Distributed Systems , 1988, IEEE Trans. Computers.
[4] Gul A. Agha,et al. Distributed Execution of Actor Programs , 1991, LCPC.
[5] Nicholas Carriero,et al. Distributed data structures in Linda , 1986, POPL '86.
[6] Wesley W. Chu,et al. Task Allocation in Distributed Data Processing , 1980, Computer.
[7] A. Klein,et al. Tuple space integrated into Modula-2, implementation of the Linda concept on a hierarchical multiprocessor , 1989 .
[8] R. F. Freund,et al. Cluster-M Paradigms for High-Order Heterogeneous Procedural Specification Computing , 1992, Proceedings. Workshop on Heterogeneous Processing.
[9] Mary Mehrnoosh Eshaghian-Wilner. Cluster-M parallel programming model , 1992, Proceedings Sixth International Parallel Processing Symposium.
[10] M. M. Eshaghian. Cluster-M parallel programming model , 1992 .
[11] Shahid H. Bokhari. Partitioning Problems in Parallel, Pipelined, and Distributed Computing , 1988, IEEE Trans. Computers.