A comparative analysis of different arbitration protocols for multiple-bus multiprocessors
暂无分享,去创建一个
[1] Kishor S. Trivedi. Probability and Statistics with Reliability, Queuing, and Computer Science Applications , 1984 .
[2] Jeffrey A. Brumfield. Computer Performance Modeling Handbook (Stephen S. Lavenberg, ed.) , 1986 .
[3] U. Manber,et al. Distributed round-robin and first-come first-serve protocols and their application to multiprocessor bus arbitrary , 1988, [1988] The 15th Annual International Symposium on Computer Architecture. Conference Proceedings.
[4] San Francisco,et al. Analysis of Packet-Switched Multiple-Bus Multiprocessor Systems , 1991 .
[5] Chita R. Das,et al. Bandwidth availability of multiple-bus multiprocessors , 1985, IEEE Transactions on Computers.
[6] Keki B. Irani,et al. A Closed-Form Solution for the Perfornance Analysis of Multiple-Bus Multiprocessor Systems , 1984, IEEE Transactions on Computers.
[7] Marco Ajmone Marsan,et al. Comparative Performance Analysis of Single Bus Multiprocessor Architectures , 1982, IEEE Transactions on Computers.
[8] Laxmi N. Bhuyan,et al. Analysis and Comparison of Cache Coherence Protocols for a Packet-Switched Multiprocessor , 1989, IEEE Trans. Computers.
[9] John P. Hayes,et al. Analysis of Multiple-Bus Interconnection Networks , 1986, J. Parallel Distributed Comput..
[10] Mateo Valero,et al. Bandwidth of Crossbar and Multiple-Bus Connections for Multiprocessors , 1982, IEEE Transactions on Computers.