default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSivarama P. Dandamudi
Person information
- affiliation: Carleton University, Ottawa, Canada
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Books and Theses
- 2005
[b4]Sivarama P. Dandamudi:
Guide to RISC processors - for programmers and engineers. Springer 2005, ISBN 978-0-387-21017-9, pp. I-XV, 1-387- [b3]Sivarama P. Dandamudi:
Introduction to Assembly Language Programming - For Pentium and RISC Processors, Second Edition. Texts in Computer Science, Springer 2005, ISBN 978-0-387-20636-3, pp. i-xxiii, 1-690 - 2003
- [b2]Sivarama P. Dandamudi:
Fundamentals of Computer Organization and Design. Texts in Computer Science, Springer 2003, ISBN 978-0-387-95211-6, pp. i-xxviii, 1-1060 - 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
Journal Articles
- 2006
- [j26]Abdolreza Abhari, Sivarama P. Dandamudi, Shikharesh Majumdar:
Web object-based storage management in proxy caches. Future Gener. Comput. Syst. 22(1-2): 16-31 (2006) - 2004
- [j25]Sivarama P. Dandamudi, Zhengao Zhou:
Performance of adaptive space-sharing policies in dedicated heterogeneous cluster systems. Future Gener. Comput. Syst. 20(5): 895-906 (2004) - [j24]Jemal H. Abawajy, Sivarama P. Dandamudi:
Fault-tolerant Grid Resource Management Infrastructure. Neural Parallel Sci. Comput. 12(3): 289-306 (2004) - 2003
- [j23]Cyrus Soleimany, Sivarama P. Dandamudi:
Performance of a distributed architecture for query processing on workstation clusters. Future Gener. Comput. Syst. 19(4): 463-478 (2003) - 2002
- [j22]Abdolreza Abhari, Sivarama P. Dandamudi, Shikharesh Majumdar:
Structural Characterization of Popular Web Documents. Int. J. Comput. Their Appl. 9(1) (2002) - [j21]Yuet-Ning Chan, Sivarama P. Dandamudi, Shikharesh Majumdar:
Performance Comparison of Processor Scheduling Strategies in a Distributed-Memory Multicomputer System. Int. J. Comput. Their Appl. 9(4): 227-240 (2002) - 2001
- [j20]Thyagaraj Thanalapati, Sivarama P. Dandamudi:
An Efficient Adaptive Scheduling Scheme for Distributed Memory Multicomputers. IEEE Trans. Parallel Distributed Syst. 12(7): 758-768 (2001) - 2000
- [j19]Kamala Kotapati, Sivarama P. Dandamudi:
Buffer management in wormhole-routed torus multicomputer networks. Future Gener. Comput. Syst. 16(5): 483-491 (2000) - 1999
- [j18]Sheldon Clarke, Sivarama P. Dandamudi:
Usefulness of adaptive load sharing for parallel processing on networks of workstations. Concurr. Pract. Exp. 11(8): 387-405 (1999) - [j17]Sivarama P. Dandamudi:
Reducing hot-spot contention in shared-memory multiprocessor systems. IEEE Concurr. 7(1): 48-59 (1999) - [j16]Sivarama P. Dandamudi, Hai Yu:
Performance of Adaptive Space Sharing Processor Allocation Policies for Distributed-Memory Multicomputers. J. Parallel Distributed 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 Perform. Evaluation Rev. 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) - 1998
- [j13]Sivarama P. Dandamudi:
Sensitivity evaluation of dynamic load sharing in distributed systems. IEEE Concurr. 6(3): 62-72 (1998) - 1997
- [j12]Sivarama P. Dandamudi:
Reducing Run Queue Contention in Shared Memory Multiprocessors. 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. J. Syst. Archit. 43(6-7): 491-511 (1997) - 1995
- [j10]Sivarama P. Dandamudi, Philip S. P. Cheng:
A Hierarchical Task Queue Organization for Shared-Memory Multiprocessor Systems. IEEE Trans. Parallel Distributed Syst. 6(1): 1-16 (1995) - 1992
- [j9]Sivarama P. Dandamudi, Derek L. Eager:
Hot-Spot Contention in Binary Hypercube Networks. IEEE Trans. Computers 41(2): 239-244 (1992) - 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 Distributed Comput. 12(3): 283-289 (1991) - [j6]Sivarama P. Dandamudi:
Performance Analysis of a Class of Hierarchical Hypercube Multicomputer Networks. Perform. Evaluation 13(3): 159-179 (1991) - 1990
- [j5]Sivarama P. Dandamudi:
Derel L. Eager: The Influence of Locality in Routing on Queuing Networks. Perform. Evaluation 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) - 1988
- [j3]Sivarama P. Dandamudi, Paul G. Sorenson:
Performance Analysis of Particle-match Search Algorithms for BD Trees. Softw. Pract. Exp. 18(1): 83-105 (1988) - 1986
- [j2]Sivarama P. Dandamudi, Paul G. Sorenson:
Algorithms for BD Trees. Softw. Pract. Exp. 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. Int. J. Parallel Program. 14(3): 135-159 (1985)
Conference and Workshop Papers
- 2005
- [c41]Liuhong Wang, Sivarama P. Dandamudi:
Performance Sensitivity of Adaptive Space Sharing to Parallel Job Structure and I/O Models. PDCS 2005: 1-8 - [c40]Kenji Imasaki, Hong Nguyen, Sivarama P. Dandamudi:
Performance of Pipelined Hash Join Algorithms with the Internet Transfer Delay. PDCS 2005: 191-198 - [c39]Tasmeia Yousaf, Sivarama P. Dandamudi:
Pipelined Query Execution on a Linux Cluster System Using MySQL. PDCS 2005: 294-300 - [c38]Archana Kodaypak, Sivarama P. Dandamudi:
One-Timer and Non-One-Timer Characterization of Web Traffic. IASSE 2005: 106-111 - [c37]Kenji Imasaki, Sivarama P. Dandamudi:
A New Join Algorithm for Cluster-Based Database Systems. ISPDC 2005: 267-274 - [c36]Kenji Imasaki, Sivarama P. Dandamudi:
A New Algorithm for Join Processing with the Internet Transfer Delays. PARCO 2005: 499-506 - 2004
- [c35]Abha Mittal, Sivarama P. Dandamudi:
Dynamic versus Static Locking in Real-Time Parallel Database Systems. IPDPS 2004 - 2003
- [c34]Jemal H. Abawajy, Sivarama P. Dandamudi:
A Unified Resource Scheduling Approach on Cluster Computing Systems. PDCS 2003: 43-48 - [c33]Jemal H. Abawajy, Sivarama P. Dandamudi:
Parallel Job Scheduling on Multicluster Computing Systems. CLUSTER 2003: 11-18 - [c32]Jemal H. Abawajy, Sivarama P. Dandamudi:
Scheduling Parallel Jobs with CPU and I/O Resource Requirements in Cluster Computing Systems. MASCOTS 2003: 336-343 - [c31]Jemal H. Abawajy, Sivarama P. Dandamudi:
A Reconfigurable Multi-Layered Grid Scheduling Infrastructure. PDPTA 2003: 138-144 - 2002
- [c30]Abdolreza Abhari, Sivarama P. Dandamudi, Shikharesh Majumdar:
Exploiting Web Document Structure to Improve Storage Management in Proxy Caches. HiPC 2002: 89-101 - [c29]Kenji Imasaki, Hong Nguyen, Sivarama P. Dandamudi:
Performance Comparison of Pipelined Hash Joins on Workstation Clusters. HiPC 2002: 264-278 - [c28]Kenji Imasaki, Sivarama P. Dandamudi:
An Adaptive Hash Join Algorithm on a Network of Workstations. IPDPS 2002 - 2001
- [c27]Susheel Jalali, Sivarama P. Dandamudi:
Pipelined Hash Joins Using Network of Workstations. PDCS 2001: 422-429 - [c26]Zhengao Zhou, Sivarama P. Dandamudi:
An Adaptive Space-Sharing Policy for Heterogeneous Parallel Systems. HPCN Europe 2001: 353-362 - 2000
- [c25]Jemal H. Abawajy, Sivarama P. Dandamudi:
Parallel Job Scheduling Policy for Workstation Cluster Environments. CLUSTER 2000: 351-352 - [c24]Cyrus Soleimany, Sivarama P. Dandamudi:
Distributed Parallel Query Processing on Networks of Workstations. HPCN Europe 2000: 427-436 - [c23]Kenji Imasaki, Sivarama P. Dandamudi:
Performance Evaluation of Nested-Loop Join Processing on Networks of Workstations. ICPADS 2000: 537-544 - [c22]Jemal H. Abawajy, Sivarama P. Dandamudi:
Distributed Hierarchical Workstation Cluster Co-Ordination Scheme. PARELEC 2000: 111-115 - [c21]Jemal H. Abawajy, Sivarama P. Dandamudi:
Time/Space Sharing Distributed Job Scheduling Policy in a Workstation Cluster Environment. PARELEC 2000: 116-120 - 1999
- [c20]Kamala Kotapati, Sivarama P. Dandamudi:
Buffer Management in Wormhole-Routed Torus Multicomputer Networks. HPCN Europe 1999: 483-492 - [c19]Sijun Zeng, Sivarama P. Dandamudi:
Centralized Architecture for Parallel Query Processing on Networks of Workstations. HPCN Europe 1999: 683-692 - [c18]Jemal H. Abawajy, Sivarama P. Dandamudi:
An Approach to Scheduling Parallel Applications on Networks of Workstations. PDPTA 1999: 2580-2586 - 1998
- [c17]Sivarama P. Dandamudi, Michael Kwok, Cheong Lo:
A comparative study of adaptive and hierarchical load sharing policies for distributed systems. CATA 1998: 136-141 - [c16]Boquan Xie, Sivarama P. Dandamudi:
Hierarchical architecture for parallel query processing on networks of workstations. HiPC 1998: 351-358 - [c15]Sivarama P. Dandamudi, Hai Yu:
Performance Sensitivity of Space Sharing Processor Scheduling in Distributed-Memory Multicomputers. IPPS/SPDP 1998: 403-409 - [c14]S. Takkar, Sivarama P. Dandamudi:
Performance of Hard Real-Time Transaction Scheduling Policies in Parallel Database Systems. MASCOTS 1998: 176-184 - 1997
- [c13]Sivarama P. Dandamudi, Thyagaraj Thanalapati:
A hierarchical processor scheduling policy for distributed-memory multicomputer systems. HiPC 1997: 218-223 - [c12]Yuet-Ning Chan, Sivarama P. Dandamudi, Shikharesh Majumdar:
Performance Comparison of Processor Scheduling Strategies in a Distributed-Memory Multicomputer System. IPPS 1997: 139-145 - [c11]Sivarama P. Dandamudi, K. C. Michael Lo:
A Hierarchical Load Sharing Policy for Distributed Systems. MASCOTS 1997: 3-10 - [c10]Sivarama P. Dandamudi:
The Effect of Scheduling Discipline on Dynamic Load Sharing in Heterogeneous Distributed Systems. MASCOTS 1997: 17- - 1996
- [c9]Samir Ayachi, Sivarama P. Dandamudi:
A hierarchical processor scheduling policy for multiprocessor systems. SPDP 1996: 100-109 - 1995
- [c8]Sivarama P. Dandamudi:
Performance Impact of Scheduling Discipline on Adaptive Load Sharing in Homogeneous Distributed Systems. ICDCS 1995: 484-492 - 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
- [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
- [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
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:16 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
