Koustuv Dasgupta
Research Subjects
Koustuv Dasgupta has a total of 6 co-authors. Here are the top co-authors by number of shared publications:
- Akshat Verma
IBM India Research Lab
1 shared publication - Amit Purohit
IBM India Research Lab
1 shared publication - Balaji Vishwanathan
IBM India Research Lab
1 shared publication - Gaargi Banerjee Dasgupta
IBM Research-India
1 shared publication - Rohit Jain
IBM India Research Lab
1 shared publication - Upendra Sharma
IBM India Research Lab
1 shared publication
Latest Publications
- 1 May 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 50-59
Compass: Cost of Migration-aware Placement in Storage Systems
We investigate methodologies for placement and migration of logical data stores in virtualized storage systems leading to optimum system configuration in a dynamic workload scenario. The aim is to optimize the tradeoff between the performance or operational cost improvement resulting from changes in store placement, and the cost imposed by the involved data migration step. We propose a unified economic utility based framework in which the tradeoff can be formulated as a utility maximization problem where the utility of a configuration is defined as the difference between the benefit of a configuration and the cost of moving to the configuration. We present a storage management middleware framework and architecture Compass that allows systems designers to plug-in different placement as well as migration techniques for estimation of utilities associated with different configurations. The biggest obstacle in optimizing the placement benefit and migration cost tradeoff is the exponential number of possible configurations that one may have to evaluate. We present algorithms that explore the configuration space efficiently and compute a candidate set of configurations that optimize this cost-benefit tradeoff. Our algorithms have many desirable properties including local optimality. Comprehensive experimental studies demonstrate the efficacy of the proposed framework and exploration algorithms, as our algorithms outperform migration cost-oblivious placement strategies by up to 40% on real OLTP traces for many settings.
- 1 May 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 50-59
Compass: Cost of Migration-aware Placement in Storage Systems
We investigate methodologies for placement and migration of logical data stores in virtualized storage systems leading to optimum system configuration in a dynamic workload scenario. The aim is to optimize the tradeoff between the performance or operational cost improvement resulting from changes in store placement, and the cost imposed by the involved data migration step. We propose a unified economic utility based framework in which the tradeoff can be formulated as a utility maximization problem where the utility of a configuration is defined as the difference between the benefit of a configuration and the cost of moving to the configuration. We present a storage management middleware framework and architecture Compass that allows systems designers to plug-in different placement as well as migration techniques for estimation of utilities associated with different configurations. The biggest obstacle in optimizing the placement benefit and migration cost tradeoff is the exponential number of possible configurations that one may have to evaluate. We present algorithms that explore the configuration space efficiently and compute a candidate set of configurations that optimize this cost-benefit tradeoff. Our algorithms have many desirable properties including local optimality. Comprehensive experimental studies demonstrate the efficacy of the proposed framework and exploration algorithms, as our algorithms outperform migration cost-oblivious placement strategies by up to 40% on real OLTP traces for many settings.
- 1 June 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE) in 2008 16th Interntional Workshop on Quality of Service
- No. 1548615X,p. 281-283
QoS-GRAF: A Framework for QoS based Grid Resource Allocation with Failure provisioning
In this paper, it describes the QoS-GRAF, a framework for providing revenue maximization in a utility computing grid where jobs have multiple resource dependencies and differentiated QoS pricing. To solve the revenue maximization problem the linear relaxation based algorithms, MRPA and MLBA, that achieve performance within 1-5% of the optimal solution and significantly outperform alternative approaches are used. Both show better revenue earnings across small, medium and large jobs, with efficient resource utilization. As a part ongoing work, the backup algorithms for multiple failures is developed. Scheduling algorithms are incorporated to produce maximum profitable schedule considering job deadlines
- 1 June 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE) in 2008 16th Interntional Workshop on Quality of Service
- No. 1548615X,p. 281-283
QoS-GRAF: A Framework for QoS based Grid Resource Allocation with Failure provisioning
In this paper, it describes the QoS-GRAF, a framework for providing revenue maximization in a utility computing grid where jobs have multiple resource dependencies and differentiated QoS pricing. To solve the revenue maximization problem the linear relaxation based algorithms, MRPA and MLBA, that achieve performance within 1-5% of the optimal solution and significantly outperform alternative approaches are used. Both show better revenue earnings across small, medium and large jobs, with efficient resource utilization. As a part ongoing work, the backup algorithms for multiple failures is developed. Scheduling algorithms are incorporated to produce maximum profitable schedule considering job deadlines