Adaptive load sharing in heterogeneous distributed systems
Journal of Parallel and Distributed Computing
An introduction to simulation using GPSS/H
An introduction to simulation using GPSS/H
The Jini architecture for network-centric computing
Communications of the ACM
The Jini architecture: dynamic services in a flexible network
Proceedings of the 36th annual ACM/IEEE Design Automation Conference
The design and implementation of an intentional naming system
Proceedings of the seventeenth ACM symposium on Operating systems principles
Adaptive Location Policies for Global Scheduling
IEEE Transactions on Software Engineering
Pay As You Go-Associating Costs with Jini Leases
EDOC '00 Proceedings of the 4th International conference on Enterprise Distributed Object Computing
2K: A Distributed Operating System for Dynamic Heterogeneous Environments
HPDC '00 Proceedings of the 9th IEEE International Symposium on High Performance Distributed Computing
Using Jini for High-Performance Network Computing
PARELEC '00 Proceedings of the International Conference on Parallel Computing in Electrical Engineering
Multi-language programming environments for high performance Java computing
Scientific Programming
Dreamer: A resource management architecture for Jini federation
Information and Software Technology
| Hi-index | 0.00 |
This paper introduces and compares different schemes for assignment of replicated services in Jini - an object-oriented middleware architecture for network-centric computing. Each client in Jini has to be assigned a service selected from the pool of available services, which have joined the Jini federation and registered with the lookup service. Both early and delayed assignments are considered as basic options in our evaluation. The information for the system load can be collected at four different levels of detail in order to be used in the process of assignment decisions. In our analysis, we concentrate on the scenario where the requests for service generated by the clients follow independent user-initiated or machine-initiated transactions. The performance evaluation of the assignment schemes follows the queuing systems methodology. The comparisons are done with regard to the mean residence time of the clients in the system as well as the control overhead imposed by the assignment schemes. A case study of the scheme using the lowest information level proves the effectiveness, applicability and limitations of the delayed assignment in comparison to the early one. These results are a first step towards developing a methodology for building large-scale applications for Jini-based distributed systems.