Year |
Citation |
Score |
2011 |
Wang J, Varman PJ, Xie C. Optimizing storage performance in public cloud platforms Journal of Zhejiang University Science C. 12: 951-964. DOI: 10.1631/Jzus.C1100097 |
0.382 |
|
2011 |
Lu L, Varman PJ, Doshi K. Decomposing workload bursts for efficient storage resource management Ieee Transactions On Parallel and Distributed Systems. 22: 860-873. DOI: 10.1109/Tpds.2010.129 |
0.451 |
|
2008 |
Varman P, Wang J. Storage and I/O virtualization, performance, energy, evaluation and dependability (SPEED08) Operating Systems Review. 42: 1-2. DOI: 10.1145/1453775.1453777 |
0.437 |
|
2008 |
Hon WK, Varman PJ, Shah R, Vitter JS. Tight competitive ratios for parallel disk prefetching and caching Annual Acm Symposium On Parallelism in Algorithms and Architectures. 352-361. DOI: 10.1145/1378533.1378593 |
0.635 |
|
2007 |
Gulati A, Merchant A, Varman PJ. pClock: An arrival curve based approach for QoS guarantees in shared storage systems Performance Evaluation Review. 35: 13-24. DOI: 10.1145/1269899.1254885 |
0.336 |
|
2005 |
Anastasiadis SV, Varman P, Vitter JS, Yi K. Optimal lexicographic shaping of aggregate streaming data Ieee Transactions On Computers. 54: 398-408. DOI: 10.1109/Tc.2005.67 |
0.368 |
|
2005 |
Kallahalla M, Varman PJ. Optimal read-once parallel disk scheduling Algorithmica (New York). 43: 309-343. DOI: 10.1007/S00453-004-1129-7 |
0.796 |
|
2005 |
Shah R, Varman PJ, Vitter JS. Brief announcement: On competitive online read-many parallel disks scheduling Annual Acm Symposium On Parallelism in Algorithms and Architectures. 217. |
0.492 |
|
2004 |
Kallahalla M, Varman PJ. Analysis of simple randomized buffer management for parallel I/O Information Processing Letters. 90: 47-52. DOI: 10.1016/J.Ipl.2004.01.009 |
0.787 |
|
2004 |
Shah R, Varman PJ, Vitter JS. Online algorithms for prefetching and caching on parallel disks Annual Acm Symposium On Parallel Algorithms and Architectures. 16: 255-264. |
0.577 |
|
2002 |
Kallahalla M, Varman PJ. PC-OPT: Optimal offline prefetching and caching for parallel I/O systems Ieee Transactions On Computers. 51: 1333-1344. DOI: 10.1109/Tc.2002.1047757 |
0.813 |
|
2002 |
Lee KK, Kallahalla M, Lee BS, Varman PJ. Performance comparison of prefetching and placement policies for parallel I/O International Journal of Parallel and Distributed Systems and Networks. 5: 76-84. |
0.762 |
|
2001 |
Kallahalla M, Varman PJ. Optimal prefetching and caching for parallel I/O systems Annual Acm Symposium On Parallel Algorithms and Architectures. 219-228. |
0.823 |
|
2000 |
Barve R, Kallahalla M, Varman PJ, Vitter JS. Competitive Parallel Disk Prefetc Buffer Management Journal of Algorithms. 36: 152-181. DOI: 10.1006/Jagm.2000.1089 |
0.804 |
|
2000 |
Ertug O, Kallahalla M, Varman PJ. Real-Time Parallel IO Stream Scheduling Proceedings of the Joint Conference On Information Sciences. 5: 441-444. |
0.786 |
|
1999 |
Varman PJ, Verma RM. Tight bounds for prefetching and buffer management algorithms for parallel I/O systems Ieee Transactions On Parallel and Distributed Systems. 10: 1262-1275. DOI: 10.1109/71.819948 |
0.633 |
|
1998 |
Kallahalla M, Varman PJ. Red-black prefetching: An approximation algorithm for parallel disk scheduling Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 1530: 66-77. DOI: 10.1007/978-3-540-49382-2_7 |
0.82 |
|
1998 |
Varman PJ. Randomized parallel prefetching and buffer management Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 1388: 363-372. |
0.531 |
|
1997 |
Varman PJ, Verma RM. An efficient multiversion access structure Ieee Transactions On Knowledge and Data Engineering. 9: 391-409. DOI: 10.1109/69.599929 |
0.321 |
|
1994 |
Sinclair JB, Tang J, Varman PJ. Instability in parallel I/O systems Acm Sigarch Computer Architecture News. 22: 11-16. DOI: 10.1145/190787.190790 |
0.517 |
|
1994 |
Pai VS, Schäffer AA, Varman PJ. Markov analysis of multiple-disk prefetching strategies for external merging Theoretical Computer Science. 128: 211-239. DOI: 10.1016/0304-3975(94)90170-8 |
0.477 |
|
1992 |
Varman PJ, Doshi K. Sorting with Linear Speedup on a Pipelined Hypercube Ieee Transactions On Computers. 41: 97-103. DOI: 10.1109/12.123384 |
0.454 |
|
1991 |
Varman PJ, Scheufler SD, Iyer BR, Ricard GR. Merging multiple lists on hierarchical-memory multiprocessors Journal of Parallel and Distributed Computing. 12: 171-177. DOI: 10.1016/0743-7315(91)90022-2 |
0.494 |
|
1990 |
Varman PJ, Iyer BR, Haderle DJ, Dunn SM. Parallel merging: algorithm and implementation results Parallel Computing. 15: 165-177. DOI: 10.1016/0167-8191(90)90040-G |
0.476 |
|
1989 |
Varman PJ, Ramakrishnan IV. Optimal Matrix Multiplication on Faulttolerant VLSI Arrays Ieee Transactions On Computers. 38: 278-283. DOI: 10.1109/12.16505 |
0.479 |
|
1988 |
Lu M, Varman P. Optimal algorithms for rectangle problems on a mesh-connected computer Journal of Parallel and Distributed Computing. 5: 154-171. DOI: 10.1016/0743-7315(88)90026-3 |
0.541 |
|
1988 |
Varman P, Doshi K. An efficient parallel algorithm for updating minimum spanning trees Theoretical Computer Science. 58: 379-397. DOI: 10.1016/0304-3975(88)90035-7 |
0.619 |
|
1988 |
Lu M, Varman P. Geometric problems on two-dimensional array processors Circuits Systems and Signal Processing. 7: 191-211. DOI: 10.1007/Bf01602097 |
0.491 |
|
1987 |
Doshi KA, Varman PJ. Optimal Graph Algorithms on a Fixed-Size Linear Array Ieee Transactions On Computers. 460-470. DOI: 10.1109/TC.1987.1676928 |
0.319 |
|
1987 |
Varman PJ, Ramakrishnan IV, Fussell DS. Fault-tolerant VLSI sorters Circuits, Systems, and Signal Processing. 6: 153-174. DOI: 10.1007/Bf01598957 |
0.534 |
|
1986 |
Varman PJ, Ramakrishnan IV. Synthesis of an Optimal Family of Matrix Multiplication Algorithms on Linear Arrays Ieee Transactions On Computers. 989-996. DOI: 10.1109/TC.1986.1676700 |
0.392 |
|
1985 |
Ramakrishnan IV, Varman PJ. OPTIMAL FAMILY OF MATRIX MULTIPLICATION ALGORITHMS ON LINEAR ARRAYS Proceedings of the International Conference On Parallel Processing. 376-383. |
0.421 |
|
1985 |
Varman PJ, Ramakrishnan IV. SPEEDING UP SORTING ON AN ARRAY PROCESSOR . 604-606. |
0.392 |
|
1984 |
Ramakrishnan IV, Varman PJ. Modular Matrix Multiplication on a Linear Array Ieee Transactions On Computers. 952-958. DOI: 10.1109/TC.1984.1676369 |
0.405 |
|
1984 |
Varman PJ, Ramakrishnan IV, Fussell DS. A Robust Matrix-Multiplication Array Ieee Transactions On Computers. 919-922. DOI: 10.1109/TC.1984.1676353 |
0.309 |
|
1984 |
Ramakrishnan IV, Varman PJ, Chakravarthy US. SYNTHESIS OF FAULT-TOLERANT PARALLEL MATRIX COMPUTATIONS . 268-272. |
0.326 |
|
1984 |
Varman PJ, Ramakrishnan IV. DYNAMIC PROGRAMMING AND TRANSITIVE CLOSURE ON LINEAR PIPELINES Proceedings of the International Conference On Parallel Processing. 359-364. |
0.417 |
|
1984 |
Varman PJ, Ramakrishnan IV. TREE ALGORITHM FOR TWO-DIMENSIONAL CONVOLUTION Proceedings - International Conference On Pattern Recognition. 358-360. |
0.452 |
|
1983 |
Varman PJ, Ramakrishnan IV, Fussell DS, Silberschatz A. ROBUST SYSTOLIC ALGORITHMS FOR RELATIONAL DATABASE OPERATIONS . 220-229. |
0.316 |
|
Show low-probability matches. |