Person:
Pande, Santosh

Permanent Link
https://hdl.handle.net/1853/71573
Associated Organization(s)
Organizational Unit
ORCID
ArchiveSpace Name Record

Filters

2002 - 2010 3
3
3
3
3
Reset filters

Settings
search.filters.applied.f.isOrgUnitOfPublicationTitle: College of Computing ×

Publication Search Results

Now showing 1 - 3 of 3
  • Thumbnail Image
    Item
    CT-ISG: Intrusion tolerant software: Achieving confidentiality, availability, and integrity simultaneously
    (Georgia Institute of Technology, 2010-07-26) Pande, Santosh ; Zhang, Kun
  • Thumbnail Image
    Item
    Method Partitioning - Runtime Customization of Pervasive Programs without Design-time Application Knowledge
    (Georgia Institute of Technology, 2002) Zhou, Dong ; Pande, Santosh ; Schwan, Karsten
    Heterogeneity, decoupling, and dynamics in distributed, component-based applications indicate the need for dynamic program customization and adaptation. Method Partitioning is a dynamic unit placement based technique for customizing performance-critical message-based interactions between program components, at runtime and without the need for design-time application knowledge. The technique partitions message handling functions, and offers high customizability and low-cost adaptation of such partitioning. It consists of (a) static analysis of message handling methods to produce candidate partitioning plans for the methods, (b) cost models for evaluating the cost/benefits of different partitioning plans, (c) a Remote Continuation mechanism that "connects" the distributed parts of a partitioned method at runtime, and (d) Runtime Profiling and Reconfiguration Units that monitor actual costs of candidate partitioning plans and that dynamically select "best" plans from candidates. A prototypical implementation of Method Partitioning the JECho distributed event system is applied to two distributed applications: (1) a communication-bound application running on a wireless-connected mobile platform, and (2) a compute-intensive code mapped to power- and therefore, computationally limited embedded processors. Experiments with method Partitioning demonstrate significant performance improvements for both types of applications, derived from the fine-grain, low overhead adaptation actions applied whenever necessitated by changes in program behavior or environment characteristics.
  • Thumbnail Image
    Item
    Optimizing Dynamic Producer/Consumer Style Applications in Embedded Environments
    (Georgia Institute of Technology, 2002) Zhou, Dong ; Pande, Santosh ; Schwan, Karsten
    Many applications in pervasive computing environments are subject to resource constraints in terms of limited bandwidth and processing power. As such applications grow in scale and complexity, these constraints become increasingly difficult to predict at design and deployment times. Runtime adaptation is hence required for the dynamics in such constraints. However, to maintain the lightweightness of such adaptation it is important to statically gather relevant program information to reduce the runtime overhead of dynamic adaptation. This paper presents methods that use both static program analysis and runtime profiling to support the adaptation of producer/consumer-style pervasive applications. It demonstrates these methods with a network traffic-centric cost model and a program execution time-centric cost model. A communication bandwidth critical application and a computation intensive application are used to demonstrate the significant performance improvement opportunities offered by these methods under the presence of respective resource constraints.