A.-A. Ivan, J. Harman, M. Allen, and V. Karamcheti. Partitionable Services: A Framework for Seamlessly Adapting Distributed Applications to Heterogeneous Environments. In Proceedings of the 11th IEEE International Symposium on High Performance Distributed Computing, 2002. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
SODA: a Service-On-Demand Architecture for Application Service.. - Jiang, Xu (2003) (2 citations) (Correct)
....isolation. Currently, SODA only supports fully replicated services, i.e. the same service image is mapped to every virtual service node. However, a more flexible service image mapping is desirable, in order to accommodate a wider spectrum of services for example, a partitionable service [25] where different service components are mapped to different virtual service nodes. SODA currently focuses on a local HUP rather than a wide area HUP. One way to construct a wide area HUP is to federate multiple local HUPs, each having its own SODA Agent and Master. However, we will need to ....
A. Ivan, J. Harman, M. Allen, and V. Karamcheti. Partitionable Services: A Framework for Seamlessly Adapting Distributed Applications to Heterogeneous Environments. Proceedings of the IEEE HPDC-11, July 2002.
Using Views for Customizing Reusable Components In.. - Ivan, Karamcheti (2003) (1 citation) Self-citation (Ivan Karamcheti) (Correct)
....a common substrate that provides basic services discovery, resource management, security. Although most such frameworks rely on static component linkages, a growing number of systems (Active Frames [23] Eager Handlers [33] Ninja [28] Active Streams [4] CANS [12] Partitionable Services [16], Conductor [21] and a recent version of Globus [9] advocate a more dynamic model, where components are combined at run time, based on the current state of the environment and QoS requirements of the clients. This dynamic model enables applications to flexibly and dynamically adapt to changes in ....
....trusts. We believe that frameworks that provide flexibility in component selection and expressiveness for cross domain constraints are likely to see wider usage than others. This paper describes our solutions to these issues, developed in the context of the Partitionable Services Framework (PSF) [16]. PSF is a dynamic component based framework which allows applications to flexibly adapt to heterogeneous environments by assembling and deploying their constituent components as required by the network characteristics and the client s QoS requirements. In this paper, we integrate a decentralized ....
[Article contains additional citation context not shown here]
A. Ivan, J. Harman, M. Allen, and V. Karamcheti. Partitionable Services: A Framework for Seamlessly Adapting Distributed Applications to Heterogenous Environments. In HPDC, 2002.
Constrained Component Deployment in Wide-Area Networks.. - Kichkaylo, Ivan.. (2003) Self-citation (Ivan Karamcheti) (Correct)
....in components possibly running across multiple administrative domains. Although most such frameworks have traditionally relied upon a static model of component linkages, a growing number of approaches (e.g. Active Frames [16] Eager Handlers [26] Active Streams [3] Ninja [23] CANS [8] Smock [9], Conductor [22] and recent work on Globus [7] have advocated a more dynamic model, where the selection of components that make up the application and their location in the network ( deployment ) are decisions that are deferred to run time. Dynamic component based frameworks allow distributed ....
....problems in parallel and distributed systems, which tend to focus on a subset of the concerns of requirement (ii) above. This complexity is also the reason that existing dynamic frameworks have either completely ignored the planning problem [16, 26, 3] or have addressed only a very limited case [23, 8, 9, 22, 7]. This paper addresses this shortcoming by proposing a model for the general planning problem, referred to as the Component Placement Problem (CPP) and describing an algorithm for solving it. The model aims for expressiveness: component behavior is modeled in terms of implemented and required ....
[Article contains additional citation context not shown here]
A. Ivan, J. Harman, M. Allen, and V. Karamcheti. Partitionable Services: A framework for seamlessly adapting distributed applications to heterogenous environments. In HPDC-11, 2002.
Building Self-configuring Services Using Service-specific.. - An-Cheng Huang And (2004) (Correct)
No context found.
A.-A. Ivan, J. Harman, M. Allen, and V. Karamcheti. Partitionable Services: A Framework for Seamlessly Adapting Distributed Applications to Heterogeneous Environments. In Proceedings of the 11th IEEE International Symposium on High Performance Distributed Computing, 2002.
Towards an Integrated Multimedia Service Hosting Overlay - Dongyan Xu Purdue (Correct)
No context found.
A. Ivan, J. Harman, M. Allen, and V. Karamcheti. Partitionable Services: A Framework for Seamlessly Adapting Distributed Applications to Heterogeneous Environments. IEEE HPDC-11, July 2002.
Large-Scale Service Overlay Networking with Distance-Based.. - Jin, Nahrstedt (2003) (1 citation) (Correct)
No context found.
A. Ivan, J. Harman, M. Allen, and V. Karamcheti. Partitionable Services: A Framework for Seamlessly Adapting Distributed Applications to Heterogeneous Environments. In Proc. of IEEE International Conference on High Performance Distributed Computing (HPDC), Edinburgh, Scotland, Jul 2002.
Grid Support for Collaborative Clinical and.. - Hastings, Gray.. (Correct)
No context found.
Ivan, A., Harman, J., Allen, M., and Karamcheti, V. Partitionable Services: A Framework for Seamlessly Adapting Distributed Applications to Heterogeneous Environments. 2002.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC