Using Distributed Data Structures for Constructing Cluster-Based Services
暂无分享,去创建一个
[1] Paul Hudak,et al. Memory coherence in shared virtual memory systems , 1989, TOCS.
[2] Scott Dawson. Probing and Fault Injection of Distributed Protocol Implementations , 1994 .
[3] Anoop Gupta,et al. The SPLASH-2 programs: characterization and methodological considerations , 1995, ISCA.
[4] Frank B. Schmuck,et al. Agreeing on Processor Group Membership in Timed Asynchronous Distributed Systems , 1995 .
[5] Andrea C. Arpaci-Dusseau,et al. Fast Parallel Sorting Under LogP: Experience with the CM-5 , 1996, IEEE Trans. Parallel Distributed Syst..
[6] Maurice Yarrow,et al. Communication Improvement for the LU NAS Parallel Benchmark: A Model for Efficient Parallel Relaxation Schemes , 1997 .
[7] M LevyHenry,et al. Manageability, availability and performance in Porcupine , 1999 .
[8] Eric A. Brewer,et al. Harvest, yield, and scalable tolerant systems , 1999, Proceedings of the Seventh Workshop on Hot Topics in Operating Systems.
[9] Erik Ruf,et al. Marmot: an optimizing compiler for Java , 2000, Softw. Pract. Exp..
[10] Stephen J. Fink,et al. The Jalapeño virtual machine , 2000, IBM Syst. J..
[11] Dawson R. Engler,et al. Checking system rules using system-specific, programmer-written compiler extensions , 2000, OSDI.
[12] David E. Culler,et al. Scalable, distributed data structures for internet service construction , 2000, OSDI.
[13] Allan Kuchinsky,et al. Integrating user-perceived quality into Web server design , 2000, Comput. Networks.
[14] Eric A. Brewer,et al. Lessons from Giant-Scale Services , 2001, IEEE Internet Comput..