| 2006 | ||
|---|---|---|
| j25 | Abdolreza Abhari, Sivarama P. Dandamudi, Shikharesh Majumdar: Web object-based storage management in proxy caches. Future Generation Comp. Syst. 22(1-2): 16-31 (2006) | |
| 2005 | ||
| b2 | Sivarama P. Dandamudi: Guide to RISC processors - for programmers and engineers. Springer 2005, isbn 978-0-387-21017-9, pp. I-XV, 1-387 | |
| c38 | Liuhong Wang, Sivarama P. Dandamudi: Performance Sensitivity of Adaptive Space Sharing to Parallel Job Structure and I/O Models. ISCA PDCS 2005: 1-8 | |
| c37 | Kenji Imasaki, Hong Nguyen, Sivarama P. Dandamudi: Performance of Pipelined Hash Join Algorithms with the Internet Transfer Delay. ISCA PDCS 2005: 191-198 | |
| c36 | Tasmeia Yousaf, Sivarama P. Dandamudi: Pipelined Query Execution on a Linux Cluster System Using MySQL. ISCA PDCS 2005: 294-300 | |
| c35 | Archana Kodaypak, Sivarama P. Dandamudi: One-Timer and Non-One-Timer Characterization of Web Traffic. IASSE 2005: 106-111 | |
| c34 | Kenji Imasaki, Sivarama P. Dandamudi: A New Join Algorithm for Cluster-Based Database Systems. ISPDC 2005: 267-274 | |
| c33 | Kenji Imasaki, Sivarama P. Dandamudi: A New Algorithm for Join Processing with the Internet Transfer Delays. PARCO 2005: 499-506 | |
| 2004 | ||
| j24 | Sivarama P. Dandamudi, Zhengao Zhou: Performance of adaptive space-sharing policies in dedicated heterogeneous cluster systems. Future Generation Comp. Syst. 20(5): 895-906 (2004) | |
| j23 | Jemal H. Abawajy, Sivarama P. Dandamudi: Fault-tolerant Grid Resource Management Infrastructure. Neural Parallel & Scientific Comp. 12(3): 289-306 (2004) | |
| c32 | Abha Mittal, Sivarama P. Dandamudi: Dynamic versus Static Locking in Real-Time Parallel Database Systems. IPDPS 2004 | |
| 2003 | ||
| j22 | Cyrus Soleimany, Sivarama P. Dandamudi: Performance of a distributed architecture for query processing on workstation clusters. Future Generation Comp. Syst. 19(4): 463-478 (2003) | |
| c31 | Jemal H. Abawajy, Sivarama P. Dandamudi: A Unified Resource Scheduling Approach on Cluster Computing Systems. ISCA PDCS 2003: 43-48 | |
| c30 | Jemal H. Abawajy, Sivarama P. Dandamudi: Parallel Job Scheduling on Multicluster Computing Systems. CLUSTER 2003: 11-18 | |
| c29 | Jemal H. Abawajy, Sivarama P. Dandamudi: Scheduling Parallel Jobs with CPU and I/O Resource Requirements in Cluster Computing Systems. MASCOTS 2003: 336-343 | |
| c28 | Jemal H. Abawajy, Sivarama P. Dandamudi: A Reconfigurable Multi-Layered Grid Scheduling Infrastructure. PDPTA 2003: 138-144 | |
| 2002 | ||
| j21 | Abdolreza Abhari, Sivarama P. Dandamudi, Shikharesh Majumdar: Structural Characterization of Popular Web Documents. I. J. Comput. Appl. 9(1) (2002) | |
| j20 | Yuet-Ning Chan, Sivarama P. Dandamudi, Shikharesh Majumdar: Performance Comparison of Processor Scheduling Strategies in a Distributed-Memory Multicomputer System. I. J. Comput. Appl. 9(4): 227-240 (2002) | |
| c27 | Abdolreza Abhari, Sivarama P. Dandamudi, Shikharesh Majumdar: Exploiting Web Document Structure to Improve Storage Management in Proxy Caches. HiPC 2002: 89-101 | |
| c26 | Kenji Imasaki, Hong Nguyen, Sivarama P. Dandamudi: Performance Comparison of Pipelined Hash Joins on Workstation Clusters. HiPC 2002: 264-278 | |
| c25 | Kenji Imasaki, Sivarama P. Dandamudi: An Adaptive Hash Join Algorithm on a Network of Workstations. IPDPS 2002 | |
| 2001 | ||
| j19 | Thyagaraj Thanalapati, Sivarama P. Dandamudi: An Efficient Adaptive Scheduling Scheme for Distributed Memory Multicomputers. IEEE Trans. Parallel Distrib. Syst. 12(7): 758-768 (2001) | |
| c24 | Susheel Jalali, Sivarama P. Dandamudi: Pipelined Hash Joins Using Network of Workstations. ISCA PDCS 2001: 422-429 | |
| c23 | Zhengao Zhou, Sivarama P. Dandamudi: An Adaptive Space-Sharing Policy for Heterogeneous Parallel Systems. HPCN Europe 2001: 353-362 | |
| 2000 | ||
| j18 | Kamala Kotapati, Sivarama P. Dandamudi: Buffer management in wormhole-routed torus multicomputer networks. Future Generation Comp. Syst. 16(5): 483-491 (2000) | |
| c22 | Jemal H. Abawajy, Sivarama P. Dandamudi: Parallel Job Scheduling Policy for Workstation Cluster Environments. CLUSTER 2000: 351-352 | |
| c21 | Cyrus Soleimany, Sivarama P. Dandamudi: Distributed Parallel Query Processing on Networks of Workstations. HPCN Europe 2000: 427-436 | |
| c20 | Kenji Imasaki, Sivarama P. Dandamudi: Performance Evaluation of Nested-Loop Join Processing on Networks of Workstations. ICPADS 2000: 537-544 | |
| c19 | Jemal H. Abawajy, Sivarama P. Dandamudi: Distributed Hierarchical Workstation Cluster Co-Ordination Scheme. PARELEC 2000: 111-115 | |
| c18 | Jemal H. Abawajy, Sivarama P. Dandamudi: Time/Space Sharing Distributed Job Scheduling Policy in a Workstation Cluster Environment. PARELEC 2000: 116-120 | |
| 1999 | ||
| j17 | Sheldon Clarke, Sivarama P. Dandamudi: Usefulness of adaptive load sharing for parallel processing on networks of workstations. Concurrency - Practice and Experience 11(8): 387-405 (1999) | |
| j16 | Sivarama P. Dandamudi, Hai Yu: Performance of Adaptive Space Sharing Processor Allocation Policies for Distributed-Memory Multicomputers. J. Parallel Distrib. Comput. 58(1): 109-125 (1999) | |
| j15 | Yuet-Ning Chan, Sivarama P. Dandamudi, Shikharesh Majumdar: Experiences with parallel job scheduling on a transputer system. SIGMETRICS Performance Evaluation Review 26(4): 40-51 (1999) | |
| j14 | Sivarama P. Dandamudi, Samir Ayachi: Performance of Hierarchical Processor Scheduling in Shared-Memory Multiprocessor Systems. IEEE Trans. Computers 48(11): 1202-1213 (1999) | |
| c17 | Kamala Kotapati, Sivarama P. Dandamudi: Buffer Management in Wormhole-Routed Torus Multicomputer Networks. HPCN Europe 1999: 483-492 | |
| c16 | Sijun Zeng, Sivarama P. Dandamudi: Centralized Architecture for Parallel Query Processing on Networks of Workstations. HPCN Europe 1999: 683-692 | |
| c15 | Jemal H. Abawajy, Sivarama P. Dandamudi: An Approach to Scheduling Parallel Applications on Networks of Workstations. PDPTA 1999: 2580-2586 | |
| 1998 | ||
| b1 | Sivarama P. Dandamudi: Introduction to assembly language programming - from 8086 to Pentium processors. Undergraduate texts in computer science, Springer 1998, isbn 978-0-387-98530-5, pp. I-XXII, 1-644 | |
| j13 | Sivarama P. Dandamudi: Sensitivity evaluation of dynamic load sharing in distributed systems. IEEE Concurrency 6(3): 62-72 (1998) | |
| c14 | Sivarama P. Dandamudi, Michael Kwok, Cheong Lo: A comparative study of adaptive and hierarchical load sharing policies for distributed systems. Computers and Their Applications 1998: 136-141 | |
| c13 | Sivarama P. Dandamudi, Hai Yu: Performance Sensitivity of Space Sharing Processor Scheduling in Distributed-Memory Multicomputers. IPPS/SPDP 1998: 403-409 | |
| c12 | S. Takkar, Sivarama P. Dandamudi: Performance of Hard Real-Time Transaction Scheduling Policies in Parallel Database Systems. MASCOTS 1998: 176-184 | |
| 1997 | ||
| j12 | Sivarama P. Dandamudi: Reducing Run Queue Contention in Shared Memory Multiprocessors. IEEE Computer 30(3): 82-89 (1997) | |
| j11 | Sivarama P. Dandamudi, Philip S. P. Cheng: Performance impact of run queue organization and synchronization on large-scale NUMA multiprocessor systems. Journal of Systems Architecture 43(6-7): 491-511 (1997) | |
| c11 | Yuet-Ning Chan, Sivarama P. Dandamudi, Shikharesh Majumdar: Performance Comparison of Processor Scheduling Strategies in a Distributed-Memory Multicomputer System. IPPS 1997: 139-145 | |
| c10 | Sivarama P. Dandamudi, K. C. Michael Lo: A Hierarchical Load Sharing Policy for Distributed Systems. MASCOTS 1997: 3-10 | |
| c9 | Sivarama P. Dandamudi: The Effect of Scheduling Discipline on Dynamic Load Sharing in Heterogeneous Distributed Systems. MASCOTS 1997: 17- | |
| 1995 | ||
| j10 | Sivarama P. Dandamudi, Philip S. P. Cheng: A Hierarchical Task Queue Organization for Shared-Memory Multiprocessor Systems. IEEE Trans. Parallel Distrib. Syst. 6(1): 1-16 (1995) | |
| c8 | Sivarama P. Dandamudi: Performance Impact of Scheduling Discipline on Adaptive Load Sharing in Homogeneous Distributed Systems. ICDCS 1995: 484-492 | |
| 1992 | ||
| j9 | Sivarama P. Dandamudi, Derek L. Eager: Hot-Spot Contention in Binary Hypercube Networks. IEEE Trans. Computers 41(2): 239-244 (1992) | |
| c7 | S. P. Cheng, Sivarama P. Dandamudi: Performance Analysis of a Hierarchical Task Queue Organization for Parallel Systems. ICDCS 1992: 286-293 | |
| c6 | S. P. Cheng, Sivarama P. Dandamudi: Scheduling in parallel systems with a hierarchical organization of tasks. ICS 1992: 377-386 | |
| 1991 | ||
| j8 | Sivarama P. Dandamudi, Paul G. Sorenson: Improved Partial-Match Search Algorithms for BD Trees. Comput. J. 34(5): 415-422 (1991) | |
| j7 | Sivarama P. Dandamudi, Derek L. Eager: On Hypercube-Based Hierarchical Interconnected Network Design. J. Parallel Distrib. Comput. 12(3): 283-289 (1991) | |
| j6 | Sivarama P. Dandamudi: Performance Analysis of a Class of Hierarchical Hypercube Multicomputer Networks. Perform. Eval. 13(3): 159-179 (1991) | |
| c5 | Sivarama P. Dandamudi, Siu-Lun Au: Locking Granularity in Multiprocessor Database Systems. ICDE 1991: 268-277 | |
| c4 | Sivarama P. Dandamudi, James C. Y. Chow: Scheduling in Parallel Database Systems. ICPP (1) 1991: 616-620 | |
| c3 | Sivarama P. Dandamudi: A comparison of task scheduling strategies for multiprocessor systems. SPDP 1991: 423-426 | |
| 1990 | ||
| j5 | Sivarama P. Dandamudi: Derel L. Eager: The Influence of Locality in Routing on Queuing Networks. Perform. Eval. 11(2): 93-106 (1990) | |
| j4 | Sivarama P. Dandamudi, Derek L. Eager: Hierarchical Interconnection Networks for Multicomputer Systems. IEEE Trans. Computers 39(6): 786-797 (1990) | |
| c2 | Sivarama P. Dandamudi: A Performance Comparison of Routing Algorithms for Hierarchical Hypercube Multicomputer Networks. ICPP (1) 1990: 281-285 | |
| c1 | Sivarama P. Dandamudi, Derek L. Eager: The Effectiveness of Combining in Reducing Hot-Spot Contention in Hypercube Multicomputers. ICPP (1) 1990: 291-295 | |
| 1988 | ||
| j3 | Sivarama P. Dandamudi, Paul G. Sorenson: Performance Analysis of Particle-match Search Algorithms for BD Trees. Softw., Pract. Exper. 18(1): 83-105 (1988) | |
| 1986 | ||
| j2 | Sivarama P. Dandamudi, Paul G. Sorenson: Algorithms for BD Trees. Softw., Pract. Exper. 16(12): 1077-1096 (1986) | |
| 1985 | ||
| j1 | Sivarama P. Dandamudi, Paul G. Sorenson: An empirical performance comparison of some variations of thek-d Tree andBD tree. International Journal of Parallel Programming 14(3): 135-159 (1985) | |
Colors in the list of coauthors
Last update Mon May 20 21:00:39 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page