Toward a method of object-oriented concurrent programming
Communications of the ACM
Implementing a caching service a distributed COBRA objects
IFIP/ACM International Conference on Distributed systems platforms
A Parallel CORBA Component Model for Numerical Code Coupling
GRID '02 Proceedings of the Third International Workshop on Grid Computing
Ninf: A Network Based Information Library for Global World-Wide Computing Infrastructure
HPCN Europe '97 Proceedings of the International Conference and Exhibition on High-Performance Computing and Networking
A Scalable Approach to Network Enabled Servers (Research Note)
Euro-Par '02 Proceedings of the 8th International Euro-Par Conference on Parallel Processing
High Performance Distributed Objects Using Caching Proxies for Large Scale Applications
DOA '99 Proceedings of the International Symposium on Distributed Objects and Applications
Parallelism in random access machines
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
PARDIS: A Parallel Approach to CORBA
HPDC '97 Proceedings of the 6th IEEE International Symposium on High Performance Distributed Computing
A Component Based Services Architecture for Building Distributed Applications
HPDC '00 Proceedings of the 9th IEEE International Symposium on High Performance Distributed Computing
Athapascan-1: On-Line Building Data Flow Graph in a Parallel Language
PACT '98 Proceedings of the 1998 International Conference on Parallel Architectures and Compilation Techniques
Re-scheduling invocations of services for RPC grids
Computer Languages, Systems and Structures
Hi-index | 0.00 |
RPC-based Grid infrastructures emphasize on the composition of services on a large number of computing resources. The key issue to reach high performance is to enable exploitation of parallelism on services invocations and communications. Moreover, this process should be transparent to reuse legacy codes. In this paper we present Homa an IDL compiler and a run-time support for automatic detection of the parallelism of invocations and their data dependencies on a set of CORBA objects. On homogeneous computational grids, such as clusters, Homa is accompanied by a predictable cost model. For instance, in the case of a application with a small parallel time, among p processors the speed up of Homa versus CORBA is asymptotically O(p). Also we describe how Homa can efficiently use data parallel objects. The illustrations on a case study in computational chemistry validate the cost model on a computational grid. For service-based Metacomputing, Homa offers high automation and transparency to detect parallelism for scheduling algorithms.