default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDoddaballapur Narasimha-Murthy Jayasimha
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2007
[j10]John D. Owens, William J. Dally, Ron Ho, Doddaballapur Narasimha-Murthy Jayasimha, Stephen W. Keckler, Li-Shiuan Peh:
Research Challenges for On-Chip Interconnection Networks. IEEE Micro 27(5): 96-108 (2007)- 2003
- [j9]Doddaballapur Narasimha-Murthy Jayasimha, Loren Schwiebert
, D. Manivannan, Jeff A. May:
A foundation for designing deadlock-free routing algorithms in wormhole networks. J. ACM 50(2): 250-275 (2003) - [c17]Nachum Dershowitz, Doddaballapur Narasimha-Murthy Jayasimha, Seungjoon Park:
Bounded Fairness. Verification: Theory and Practice 2003: 304-317 - 2001
- [j8]N. S. Sundar, Doddaballapur Narasimha-Murthy Jayasimha, Dhabaleswar K. Panda:
Hybrid Algorithms for Complete Exchange in 2D Meshes. IEEE Trans. Parallel Distributed Syst. 12(12): 1201-1218 (2001)
1990 – 1999
- 1997
- [j7]Doddaballapur Narasimha-Murthy Jayasimha, M. E. Hayder, Sasi Kumar Pillay:
An Evaluation of Architectural Platforms for Parallel Navier-Stokes Computations. J. Supercomput. 11(1): 41-60 (1997) - [c16]David Raymond Lutz, Doddaballapur Narasimha-Murthy Jayasimha:
The Half-Adder Form and Early Branch Condition Resolution. IEEE Symposium on Computer Arithmetic 1997: 266-273 - [c15]Loren Schwiebert, Doddaballapur Narasimha-Murthy Jayasimha:
On measuring the performance of adaptive wormhole routing. HiPC 1997: 336-341 - 1996
- [j6]Loren Schwiebert, Doddaballapur Narasimha-Murthy Jayasimha:
A Necessary and Sufficient Condition for Deadlock-Free Wormhole Routing. J. Parallel Distributed Comput. 32(1): 103-117 (1996) - [j5]Doddaballapur Narasimha-Murthy Jayasimha:
Fault tolerance in multisensor networks. IEEE Trans. Reliab. 45(2) (1996) - [c14]David Raymond Lutz, Doddaballapur Narasimha-Murthy Jayasimha:
Early Zero Detection. ICCD 1996: 545- - [c13]N. S. Sundar, Doddaballapur Narasimha-Murthy Jayasimha, Dhabaleswar K. Panda, P. Sadayappan:
Hybrid Algorithms for Complete Exchange in 2D Meshes. International Conference on Supercomputing 1996: 181-188 - [c12]Doddaballapur Narasimha-Murthy Jayasimha, D. Manivannan, Jeff A. May, Loren Schwiebert, Stephen L. Hary:
A foundation for designing deadlock-free routing algorithms in wormhole networks. SPDP 1996: 190-197 - 1995
- [j4]Loren Schwiebert, Doddaballapur Narasimha-Murthy Jayasimha:
Optimal Fully Adaptive Minimal Wormhole Routing for Meshes. J. Parallel Distributed Comput. 27(1): 56-70 (1995) - [j3]David Raymond Lutz, Doddaballapur Narasimha-Murthy Jayasimha:
Do Fixed-Processor Communication-Time Tradeoffs Exist? Parallel Process. Lett. 5: 311-320 (1995) - [c11]Doddaballapur Narasimha-Murthy Jayasimha, M. E. Hayder, Sasi Kumar Pillay:
Parallelizing Navier-Stokes Computations on a Variety of Architectural Platforms. SC 1995: 68 - [c10]Loren Schwiebert, Doddaballapur Narasimha-Murthy Jayasimha:
A Universal Proof Technique for Deadlock-Free Routing in Interconnection Networks. SPAA 1995: 175-184 - 1994
- [j2]S. Sitharama Iyengar, Doddaballapur Narasimha-Murthy Jayasimha, D. Nadig:
A Versatile Architecture for the Distributed Sensor Integration Problem. IEEE Trans. Computers 43(2): 175-185 (1994) - [c9]Doddaballapur Narasimha-Murthy Jayasimha:
Fault Tolerance in a Multisensor Environment. SRDS 1994: 2-11 - 1993
- [c8]Jeff D. Martens, Doddaballapur Narasimha-Murthy Jayasimha:
Compiling for Hierarchical Shared Memory Multiprocessors. ICPP (2) 1993: 107-110 - [c7]Loren Schwiebert, Doddaballapur Narasimha-Murthy Jayasimha:
Mapping to Reduce Contention in Multiprocessor Architectures. IPPS 1993: 248-253 - [c6]Loren Schwiebert, Doddaballapur Narasimha-Murthy Jayasimha:
Optimal fully adaptive wormhole routing for meshes. SC 1993: 782-791 - 1992
- [c5]Doddaballapur Narasimha-Murthy Jayasimha, Jeff D. Martens:
Some Architectural and Compilation Issues in the Design of Hierarchical Shared-Memory Multiprocessors. IPPS 1992: 567-572 - 1991
- [j1]Doddaballapur Narasimha-Murthy Jayasimha, S. Sitharama Iyengar, Rangasami L. Kashyap:
Information integration and synchronization in distributed sensor networks. IEEE Trans. Syst. Man Cybern. 21(5): 1032-1043 (1991) - [c4]David Raymond Lutz, Doddaballapur Narasimha-Murthy Jayasimha:
What is an effective schedule? SPDP 1991: 158-161 - 1990
- [c3]Jeff D. Martens, Doddaballapur Narasimha-Murthy Jayasimha:
A Tree Structured Hierarchical Memory Multiprocessor. ICPP (1) 1990: 561-562
1980 – 1989
- 1988
- [b1]Doddaballapur Narasimha-Murthy Jayasimha:
Communication and Synchronization in Parallel Computation. University of Illinois Urbana-Champaign, USA, 1988 - [c2]Doddaballapur Narasimha-Murthy Jayasimha:
Distributed Synchronizers. ICPP (1) 1988: 23-27 - 1987
- [c1]Doddaballapur Narasimha-Murthy Jayasimha:
Parallel Access to Synchronization Variables. ICPP 1987: 97-100
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 2025-01-09 13:10 CET 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:
