Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Peter J. Varman
2010 – today
- 2013
[c51]Ellis Giles, Kshitij Doshi, Peter J. Varman: Bridging the programming gap between persistent and volatile memory using WrAP. Conf. Computing Frontiers 2013: 30
[c50]Ganesha Shanmuganathan, Ajay Gulati, Peter J. Varman: Defragmenting the cloud using demand-based resource allocation. SIGMETRICS 2013: 67-80- 2012
[c49]Ahmed Elnably, Kai Du, Peter J. Varman: Reward Scheduling for QoS in Cloud Applications. CCGRID 2012: 98-106
[c48]Kai Du, Peter J. Varman, Kartik Mohanram: High performance reliable variable latency carry select addition. DATE 2012: 1257-1262
[c47]Jianzong Wang, Weijiao Gong, Peter J. Varman, Changsheng Xie: Reducing Storage Overhead with Small Write Bottleneck Avoiding in Cloud RAID System. GRID 2012: 174-183
[c46]Ajay Gulati, Arif Merchant, Mustafa Uysal, Pradeep Padala, Peter J. Varman: Workload dependent IO scheduling for fairness and efficiency in shared storage systems. HiPC 2012: 1-10
[c45]Ahmed Elnably, Peter J. Varman: Brief announcement: application-sensitive QoS scheduling in storage servers. SPAA 2012: 185-187- 2011
[j23]Jianzong Wang, Peter J. Varman, Changsheng Xie: Optimizing storage performance in public cloud platforms. Journal of Zhejiang University - Science C 12(12): 951-964 (2011)
[j22]Lanyue Lu, Peter J. Varman, Kshitij Doshi: Decomposing Workload Bursts for Efficient Storage Resource Management. IEEE Trans. Parallel Distrib. Syst. 22(5): 860-873 (2011)
[c44]Hui Wang, Peter J. Varman: A flexible approach to efficient resource sharing in virtualized environments. Conf. Computing Frontiers 2011: 39
[c43]Kai Du, Peter J. Varman, Kartik Mohanram: Static window addition: A new paradigm for the design of variable latency adders. ICCD 2011: 455-456- 2010
[c42]Jianzong Wang, Peter J. Varman, Changsheng Xie: Avoiding performance fluctuation in cloud storage. HiPC 2010: 1-9
[c41]Ajay Gulati, Arif Merchant, Peter J. Varman: mClock: Handling Throughput Variability for Hypervisor IO Scheduling. OSDI 2010: 437-450
2000 – 2009
- 2009
[j21]Ajay Gulati, Arif Merchant, Mustafa Uysal, Pradeep Padala, Peter J. Varman: Efficient and adaptive proportional share I/O scheduling. SIGMETRICS Performance Evaluation Review 37(2): 79-80 (2009)
[c40]
[c39]Lanyue Lu, Peter J. Varman, Kshitij Doshi: Graduated QoS by Decomposing Bursts: Don't Let the Tail Wag Your Server. ICDCS 2009: 12-21- 2008
[j20]Peter J. Varman, Jun Wang: Storage and I/O virtualization, performance, energy, evaluation and dependability (SPEED08). Operating Systems Review 42(6): 1-2 (2008)
[c38]
[c37]Lanyue Lu, Kshitij Doshi, Peter J. Varman: Workload decomposition for QoS in hosted storage services. MW4SOC 2008: 19-24
[c36]Wing-Kai Hon, Rahul Shah, Peter J. Varman, Jeffrey Scott Vitter: Tight competitive ratios for parallel disk prefetching and caching. SPAA 2008: 352-361- 2007
[j19]Ajay Gulati, Peter J. Varman, Arif Merchant, Mustafa Uysal: Towards fairness and efficiency in storage systems. SIGMETRICS Performance Evaluation Review 35(3): 56-58 (2007)
[c35]Lanyue Lu, Peter J. Varman, Jun Wang: DiskGroup: Energy Efficient Disk Layout for RAID1 Systems. IEEE NAS 2007: 233-242
[c34]Ajay Gulati, Arif Merchant, Peter J. Varman: d-clock: distributed QoS in heterogeneous resource environments. PODC 2007: 330-331
[c33]Ajay Gulati, Arif Merchant, Peter J. Varman: pClock: an arrival curve based approach for QoS guarantees in shared storage systems. SIGMETRICS 2007: 13-24- 2005
[j18]Mahesh Kallahalla, Peter J. Varman: Optimal Read-Once Parallel Disk Scheduling. Algorithmica 43(4): 309-343 (2005)
[j17]Stergios V. Anastasiadis, Peter J. Varman, Jeffrey Scott Vitter, Ke Yi: Optimal Lexicographic Shaping of Aggregate Streaming Data. IEEE Trans. Computers 54(4): 398-408 (2005)
[c32]
[c31]
[c30]Rahul Shah, Peter J. Varman, Jeffrey Scott Vitter: On competitive online read-many parallel disks scheduling. SPAA 2005: 217- 2004
[j16]Mahesh Kallahalla, Peter J. Varman: Analysis of simple randomized buffer management for parallel I/O. Inf. Process. Lett. 90(1): 47-52 (2004)
[c29]Rahul Shah, Peter J. Varman, Jeffrey Scott Vitter: Online algorithms for prefetching and caching on parallel disks. SPAA 2004: 255-264- 2002
[j15]Mahesh Kallahalla, Peter J. Varman: PC-OPT: Optimal Offline Prefetching and Caching for Parallel I/O Systems. IEEE Trans. Computers 51(11): 1333-1344 (2002)
[c28]Stergios V. Anastasiadis, Peter J. Varman, Jeffrey Scott Vitter, Ke Yi: Lexicographically optimal smoothing for broadband traffic multiplexing. PODC 2002: 68-77- 2001
[c27]Mahesh Kallahalla, Peter J. Varman: Optimal prefetching and caching for parallel I/O sytems. SPAA 2001: 219-228- 2000
[j14]Rakesh D. Barve, Mahesh Kallahalla, Peter J. Varman, Jeffrey Scott Vitter: Competitive Parallel Disk Prefetching and Buffer Management. J. Algorithms 36(2): 152-181 (2000)
1990 – 1999
- 1999
[j13]Peter J. Varman, Rakesh M. Verma: Tight Bounds for Prefetching and Buffer Management Algorithms for Parallel I/O Systems. IEEE Trans. Parallel Distrib. Syst. 10(12): 1262-1275 (1999)
[c26]- 1998
[c25]Mahesh Kallahalla, Peter J. Varman: Red-Black Prefetching: An Approximation Algorithm for Parallel Disk Scheduling. FSTTCS 1998: 66-77
[c24]Mahesh Kallahalla, Peter J. Varman: Improving Parallel-Disk Buffer Management using Randomized Writeback. ICPP 1998: 270-277
[c23]Peter J. Varman: Randomized Parallel Prefetching and Buffer Management. IPPS/SPDP Workshops 1998: 363-372- 1997
[j12]Peter J. Varman, Rakesh M. Verma: An Efficient Multiversion Access STructure. IEEE Trans. Knowl. Data Eng. 9(3): 391-409 (1997)
[c22]Rakesh D. Barve, Mahesh Kallahalla, Peter J. Varman, Jeffrey Scott Vitter: Competitive Parallel Disk Prefetching and Buffer Management. IOPADS 1997: 47-56- 1996
[c21]Peter J. Varman, Rakesh M. Verma: Tight Bounds for Prefetching and Buffer Management Algorithms for Parallel I/O Systems. FSTTCS 1996: 200-211
[c20]Wentong Cai, Alfred Heng, Peter J. Varman: Benchmarking IBM SP1 system for SPMD programming. ICPADS 1996: 430-- 1995
[c19]Keok-Kee Lee, Peter J. Varman: Prefetching and I/O Parallelism in Multiple Disk Systems. ICPP (3) 1995: 160-163- 1994
[j11]Vinay S. Pai, Alejandro A. Schäffer, Peter J. Varman: Markov Analysis of Multiple-Disk Prefetching Strategies for External Merging. Theor. Comput. Sci. 128(1&2): 211-239 (1994)- 1993
[c18]J. Bartlett Sinclair, J. Tang, Peter J. Varman, Balakrishna R. Iyer: Impact of Data Placement on Parallel I/O Systems. ICPP 1993: 276-279- 1992
[j10]Peter J. Varman, Kshitij Doshi: Sorting with Linear Speedup on a Pipelined Hypercube. IEEE Trans. Computers 41(1): 97-103 (1992)
[c17]Vinay S. Pai, Peter J. Varman: Prefetching with Multiple Disks for External Mergesort: Simulation and Analysis. ICDE 1992: 273-282
[c16]Vinay S. Pai, Alejandro A. Schäffer, Peter J. Varman: Markov Analysis of Multiple-Disk Prefetching for External Mergesort. ICPP (3) 1992: 272-279- 1991
[j9]Peter J. Varman, Scott D. Scheufler, Balakrishna R. Iyer, Gary R. Ricard: Merging Multiple Lists on Hierarchical-Memory Multiprocessors. J. Parallel Distrib. Comput. 12(2): 171-177 (1991)- 1990
[j8]Peter J. Varman, Balakrishna R. Iyer, Donald J. Haderle, Stephen M. Dunn: Parallel merging: algorithm and implementation results. Parallel Computing 15(1-3): 165-177 (1990)
[c15]Peter J. Varman, Balakrishna R. Iyer, Scott D. Scheufler: A Multiprocessor Algorithm for Merging Multiple Sorted Lists. ICPP (3) 1990: 22-26
[c14]Peter J. Varman, Balakrishna R. Iyer, Donald J. Haderle: Parallel Merging on Shared and Distributed Memory Computers. PARBASE / Architectures 1990: 231-249
1980 – 1989
- 1989
[j7]Peter J. Varman, I. V. Ramakrishnan: Optimal Matrix Multiplication on Fault-Tolerant VLSI Arrays. IEEE Trans. Computers 38(2): 278-283 (1989)
[c13]Balakrishna R. Iyer, Gary R. Ricard, Peter J. Varman: Percentile Finding Algorithm for Multiple Sorted Runs. VLDB 1989: 135-144- 1988
[j6]Mi Lu, Peter J. Varman: Optimal Algorithms for Rectangle Problems on a Mesh-Connected Computer. J. Parallel Distrib. Comput. 5(2): 154-171 (1988)
[j5]Peter J. Varman, Kshitij Doshi: An Efficient Parallel Algorithm for Updating Minimum Spanning Trees. Theor. Comput. Sci. 58: 379-397 (1988)- 1987
[j4]Kshitij Doshi, Peter J. Varman: Optimal Graph Algorithms on a Fixed-Size Linear Array. IEEE Trans. Computers 36(4): 460-470 (1987)
[c12]Peter J. Varman, Kshitij Doshi: Improved parallel algorithms for the depth-first search and monotone circuit value problems. ACM Conference on Computer Science 1987: 175-182
[c11]
[c10]Kshitij Doshi, Peter J. Varman: A Modular Systolic Architecture for Image Convolutions. ISCA 1987: 56-63
[c9]Kshitij Doshi, Peter J. Varman: Efficient Graph Algorithm Using Limited Communication on a Fixed-Size Array of Processors. STACS 1987: 76-87- 1986
[j3]Peter J. Varman, I. V. Ramakrishnan: Synthesis of an Optimal Family of Matrix Multiplication Algorithms on Linear Arrays. IEEE Trans. Computers 35(11): 989-996 (1986)
[c8]Peter J. Varman, Kshitij Doshi: A Parallel Vertex Insertion Algorithm For Minimum Spanning Trees. ICALP 1986: 424-433
[c7]
[c6]- 1985
[c5]Peter J. Varman, I. V. Ramakrishnan: On Matrix Multiplication Using Array Processors. ICALP 1985: 487-496
[c4]I. V. Ramakrishnan, Peter J. Varman: An Optimal Family of Matrix Multiplication Algorithms on Linear Arrays. ICPP 1985: 376-383- 1984
[j2]Peter J. Varman, I. V. Ramakrishnan, Donald S. Fussell: A Robust Matrix-Multiplication Array. IEEE Trans. Computers 33(10): 919-922 (1984)
[j1]I. V. Ramakrishnan, Peter J. Varman: Modular Matrix Multiplication on a Linear Array. IEEE Trans. Computers 33(11): 952-958 (1984)
[c3]I. V. Ramakrishnan, Peter J. Varman: Modular Matrix Multiplication on a Linear Array. ISCA 1984: 232-238- 1983
[c2]- 1982
[c1]Donald S. Fussell, Peter J. Varman: Fault-tolerant wafer-scale architectures for VLSI. ISCA 1982: 190-198
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-06-18 22:42 CEST by the dblp team



