 | 2008 |
|---|
| 12 |       | Lu Peng,
Jih-Kwon Peir,
Tribuvan K. Prakash,
Carl Staelin,
Yen-Kuang Chen,
David M. Koppelman:
Memory hierarchy performance measurement of commercial dual-core desktop processors.
Journal of Systems Architecture - Embedded Systems Design 54(8): 816-828 (2008) |
| 2007 |
|---|
| 11 | | Lu Peng,
Jih-Kwon Peir,
Tribuvan K. Prakash,
Yen-Kuang Chen,
David M. Koppelman:
Memory Performance and Scalability of Intel's and AMD's Dual-Core Processors: A Case Study.
IPCCC 2007: 55-64 |
| 2000 |
|---|
| 10 | | David M. Koppelman:
Neighborhood Prefetching on Multiprocessors Using Instruction History.
IEEE PACT 2000: 123-132 |
| 1997 |
|---|
| 9 |  | David M. Koppelman:
Sticky States in Banyan Network Queues and Their Application to Analysis.
J. Parallel Distrib. Comput. 40(2): 147-161 (1997) |
| 1996 |
|---|
| 8 | | David M. Koppelman:
A Family of Interconnection Networks for Nonuniform Traffic.
IEEE Trans. Parallel Distrib. Syst. 7(5): 486-492 (1996) |
| 7 | | David M. Koppelman:
Congested Banyan network analysis using congested-queue states and neighboring-queue effects.
IEEE/ACM Trans. Netw. 4(1): 106-111 (1996) |
| 6 | | David M. Koppelman:
A Lower Bound on the Average Physical Length of Edges in the Physical Realization of Graphs.
Parallel Processing Letters 6(1): 137-143 (1996) |
| 1994 |
|---|
| 5 | | David M. Koppelman:
Reducing PE/Memory Traffic in Multiprocessors by the Difference Coding of Memory Addresses.
IEEE Trans. Parallel Distrib. Syst. 5(11): 1156-1168 (1994) |
| 4 | | David M. Koppelman,
A. Yavuz Oruç:
The complexity of routing in Clos permutation networks.
IEEE Transactions on Information Theory 40(1): 278- (1994) |
| 1992 |
|---|
| 3 | | David M. Koppelman:
Reducing PE/Memory Traffic in Shared Memory Multiprocessors by the Difference Coding of Addresses.
ICPP (1) 1992: 53-56 |
| 1990 |
|---|
| 2 | | David M. Koppelman,
A. Yavuz Oruç:
A Self-Routing Permutation Network.
J. Parallel Distrib. Comput. 10(2): 140-151 (1990) |
| 1989 |
|---|
| 1 | | David M. Koppelman,
A. Yavuz Oruç:
A Self-Routing Permutation Network.
ICPP (1) 1989: 288-295 |
