![]() ![]() ![]() | ![]() |
|
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
Note: Links lead to the DBLP on the Web. Kaladhar Voruganti Aameek Singh , Sandeep Gopisetty , Kaladhar Voruganti, David Pease , Ling Liu : A Hybrid Access Model for Storage Area Networks. MSST 2005 : 181-188 Aameek Singh , Sandeep Gopisetty , Linda Duyanovich , Kaladhar Voruganti, David Pease , Ling Liu : Security vs Performance: Tradeoffs using a Trust Framework. MSST 2005 : 270-277 Sandeep Uttamchandani , Kaladhar Voruganti, Sudarshan M. Srinivasan , John Palmer , David Pease : Polus: Growing Storage QoS Management Beyond a "4-Year Old Kid". FAST 2004 : 31-44 Dakshi Agrawal , James Giles , Kang-Won Lee , Kaladhar Voruganti, Khalid Filali-Adib : Policy-Based Validation of SAN Configuration. POLICY 2004 : 77-86 Kaladhar Voruganti, M. Tamer Özsu , Ronald C. Unrau : An Adaptive Data-Shipping Architecture for Client Caching Data Management Systems. Distributed and Parallel Databases 15 (2): 137-177 (2004) Kaladhar Voruganti, Jai Menon , Sandeep Gopisetty : Land below a DBMS. SIGMOD Record 33 (1): 64-70 (2004) Prasenjit Sarkar , Sandeep Uttamchandani , Kaladhar Voruganti: Storage Over IP: When Does Hardware Support Help? FAST 2003 Prasenjit Sarkar , Kaladhar Voruganti, Kalman Z. Meth , Ofer Biran , Julian Satran : Internet Protocol storage area networks. IBM Systems Journal 42 (2): 218-231 (2003) Kenneth A. Ross , Flip Korn , Renée J. Miller , Kaladhar Voruganti: Reminiscences on Influential Papers. SIGMOD Record 31 (1): 107-108 (2002) Kaladhar Voruganti, M. Tamer Özsu , Ronald C. Unrau : An Adaptive Hybrid Server Architecture for Client Caching ODBMSs. VLDB 1999 : 150-161 M. Tamer Özsu , Kaladhar Voruganti, Ronald C. Unrau : An Asynchronous Avoidance-Based Cache Consistency Algorithm for Client Caching DBMSs. VLDB 1998 : 440-451 1 [ 8 ] 2 [ 4 ] 3 [ 10 ] 4 [ 8 ] 5 [ 8 ] 6 [ 6 ] [ 10 ] [ 11 ] 7 [ 3 ] 8 [ 8 ] 9 [ 10 ] [ 11 ] 10 [ 6 ] 11 [ 4 ] 12 [ 3 ] 13 [ 1 ] [ 2 ] [ 7 ] 14 [ 9 ] 15 [ 9 ] [ 10 ] [ 11 ] 16 [ 3 ] 17 [ 4 ] [ 5 ] 18 [ 4 ] 19 [ 10 ] [ 11 ] 20 [ 9 ] 21 [ 1 ] [ 2 ] [ 7 ] 22 [ 5 ] [ 9 ] ![]() ©2005 Association for Computing Machinery |