Implementing a caching service a distributed COBRA objects
IFIP/ACM International Conference on Distributed systems platforms
A CORBA cooperative cache approach with popularity admission and routing mechanism
ADC '02 Proceedings of the 13th Australasian database conference - Volume 5
A framework for caching multimedia objects in the Internet
M3W Proceedings of the 2001 international workshop on Multimedia middleware
Automatic re-scheduling of dependencies in a RPC-based grid
Proceedings of the 18th annual international conference on Supercomputing
A Services Oriented Framework for Next Generation Data Analysis Centers
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 10 - Volume 11
Re-scheduling invocations of services for RPC grids
Computer Languages, Systems and Structures
| Hi-index | 0.00 |
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 lead to a 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 scaleable 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 favorably 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 microseconds.