{"title":"为大规模应用程序使用缓存代理的高性能分布式对象","authors":"Paul Martin, V. Callaghan, A. Clark","doi":"10.1109/DOA.1999.793995","DOIUrl":null,"url":null,"abstract":"Initial implementations of middleware based on standards such as CORBA have concentrated on host and language transparency issues in order to demonstrate interoperability. They have largely adopted a no-replication approach and have frequently neglected performance-at-scale issues. This has led to continuing deployment of either non-scalable full-replication approaches or ad-hoc messaging-based middleware for applications such as intelligent networks, WWW applications and collaborative virtual reality. These applications require millions of objects globally distributed across hundreds of hosts and demand a very high throughput of low-latency method invocations. Our main research aim is to be able to reason about the performance of such applications when using scalable partial-replication and object-oriented approaches to middleware. Our approach is to use a simulator to explore potential design and implemention choices. Our current simulator-driven design, called \"MinORB\", has been fully implemented and tested. MinORB supports scalable high performance by a combination of techniques, including weak and application-specified consistency and partial replication using fine-grained proxy caching. Experimental results show that our work compares very favourably with other leading implementations, such as OmniORB. Scalability is unparalleled, with up to 1,000,000,000 objects per address space, a maximum throughput of 42,000 invocations per second and service times as low as 4 ms.","PeriodicalId":360176,"journal":{"name":"Proceedings of the International Symposium on Distributed Objects and Applications","volume":"28 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1999-09-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"15","resultStr":"{\"title\":\"High performance distributed objects using caching proxies for large scale applications\",\"authors\":\"Paul Martin, V. Callaghan, A. Clark\",\"doi\":\"10.1109/DOA.1999.793995\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Initial implementations of middleware based on standards such as CORBA have concentrated on host and language transparency issues in order to demonstrate interoperability. They have largely adopted a no-replication approach and have frequently neglected performance-at-scale issues. This has led to continuing deployment of either non-scalable full-replication approaches or ad-hoc messaging-based middleware for applications such as intelligent networks, WWW applications and collaborative virtual reality. These applications require millions of objects globally distributed across hundreds of hosts and demand a very high throughput of low-latency method invocations. Our main research aim is to be able to reason about the performance of such applications when using scalable partial-replication and object-oriented approaches to middleware. Our approach is to use a simulator to explore potential design and implemention choices. Our current simulator-driven design, called \\\"MinORB\\\", has been fully implemented and tested. MinORB supports scalable high performance by a combination of techniques, including weak and application-specified consistency and partial replication using fine-grained proxy caching. Experimental results show that our work compares very favourably with other leading implementations, such as OmniORB. Scalability is unparalleled, with up to 1,000,000,000 objects per address space, a maximum throughput of 42,000 invocations per second and service times as low as 4 ms.\",\"PeriodicalId\":360176,\"journal\":{\"name\":\"Proceedings of the International Symposium on Distributed Objects and Applications\",\"volume\":\"28 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1999-09-05\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"15\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the International Symposium on Distributed Objects and Applications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/DOA.1999.793995\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the International Symposium on Distributed Objects and Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/DOA.1999.793995","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
High performance distributed objects using caching proxies for large scale applications
Initial implementations of middleware based on standards such as CORBA have concentrated on host and language transparency issues in order to demonstrate interoperability. They have largely adopted a no-replication approach and have frequently neglected performance-at-scale issues. This has led to continuing deployment of either non-scalable full-replication approaches or ad-hoc messaging-based middleware for applications such as intelligent networks, WWW applications and collaborative virtual reality. These applications require millions of objects globally distributed across hundreds of hosts and demand a very high throughput of low-latency method invocations. Our main research aim is to be able to reason about the performance of such applications when using scalable partial-replication and object-oriented approaches to middleware. Our approach is to use a simulator to explore potential design and implemention choices. Our current simulator-driven design, called "MinORB", has been fully implemented and tested. MinORB supports scalable high performance by a combination of techniques, including weak and application-specified consistency and partial replication using fine-grained proxy caching. Experimental results show that our work compares very favourably with other leading implementations, such as OmniORB. Scalability is unparalleled, with up to 1,000,000,000 objects per address space, a maximum throughput of 42,000 invocations per second and service times as low as 4 ms.