2007 |
22 | EE | John D. Owens,
William J. Dally,
Ron Ho,
D. N. Jayasimha,
Stephen W. Keckler,
Li-Shiuan Peh:
Research Challenges for On-Chip Interconnection Networks.
IEEE Micro 27(5): 96-108 (2007) |
2003 |
21 | EE | Nachum Dershowitz,
D. N. Jayasimha,
Seungjoon Park:
Bounded Fairness.
Verification: Theory and Practice 2003: 304-317 |
20 | EE | D. N. 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) |
2001 |
19 | EE | N. S. Sundar,
D. N. Jayasimha,
Dhabaleswar K. Panda:
Hybrid Algorithms for Complete Exchange in 2D Meshes.
IEEE Trans. Parallel Distrib. Syst. 12(12): 1201-1218 (2001) |
1997 |
18 | EE | David R. Lutz,
D. N. Jayasimha:
The Half-Adder Form and Early Branch Condition Resolution.
IEEE Symposium on Computer Arithmetic 1997: 266-273 |
17 | EE | D. N. Jayasimha,
M. E. Hayder,
S. K. Pillay:
An Evaluation of Architectural Platforms for Parallel Navier-Stokes Computations.
The Journal of Supercomputing 11(1): 41-60 (1997) |
1996 |
16 | EE | David R. Lutz,
D. N. Jayasimha:
Early Zero Detection.
ICCD 1996: 545- |
15 | EE | N. S. Sundar,
D. N. Jayasimha,
Dhabaleswar K. Panda,
P. Sadayappan:
Hybrid Algorithms for Complete Exchange in 2D Meshes.
International Conference on Supercomputing 1996: 181-188 |
14 | | Loren Schwiebert,
D. N. Jayasimha:
A Necessary and Sufficient Condition for Deadlock-Free Wormhole Routing.
J. Parallel Distrib. Comput. 32(1): 103-117 (1996) |
1995 |
13 | EE | D. N. Jayasimha,
M. E. Hayder,
S. K. Pillay:
Parallelizing Navier-Stokes Computations on a Variety of Architectural Platforms.
SC 1995 |
12 | EE | Loren Schwiebert,
D. N. Jayasimha:
A Universal Proof Technique for Deadlock-Free Routing in Interconnection Networks.
SPAA 1995: 175-184 |
11 | | Loren Schwiebert,
D. N. Jayasimha:
Optimal Fully Adaptive Minimal Wormhole Routing for Meshes.
J. Parallel Distrib. Comput. 27(1): 56-70 (1995) |
10 | | David R. Lutz,
D. N. Jayasimha:
Do Fixed-Processor Communication-Time Tradeoffs Exist?
Parallel Processing Letters 5: 311-320 (1995) |
1994 |
9 | | D. N. Jayasimha:
Fault Tolerance in a Multisensor Environment.
SRDS 1994: 2-11 |
8 | | S. Sitharama Iyengar,
D. N. Jayasimha,
D. Nadig:
A Versatile Architecture for the Distributed Sensor Integration Problem.
IEEE Trans. Computers 43(2): 175-185 (1994) |
1993 |
7 | | Jeff D. Martens,
D. N. Jayasimha:
Compiling for Hierarchical Shared Memory Multiprocessors.
ICPP 1993: 107-110 |
6 | | Loren Schwiebert,
D. N. Jayasimha:
Mapping to Reduce Contention in Multiprocessor Architectures.
IPPS 1993: 248-253 |
5 | EE | Loren Schwiebert,
D. N. Jayasimha:
Optimal fully adaptive wormhole routing for meshes.
SC 1993: 782-791 |
1992 |
4 | | D. N. Jayasimha,
Jeff D. Martens:
Some Architectural and Compilation Issues in the Design of Hierarchical Shared-Memory Multiprocessors.
IPPS 1992: 567-572 |
1990 |
3 | | Jeff D. Martens,
D. N. Jayasimha:
A Tree Structured Hierarchical Memory Multiprocessor.
ICPP (1) 1990: 561-562 |
1988 |
2 | | D. N. Jayasimha:
Distributed Synchronizers.
ICPP (1) 1988: 23-27 |
1987 |
1 | | D. N. Jayasimha:
Parallel Access to Synchronization Variables.
ICPP 1987: 97-100 |