Daniel H. Friendly

According to our database, Daniel H. Friendly authored at least 4 papers between 1997 and 1999.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

1999

Evaluation of Design Options for the Trace Cache Fetch Mechanism.

Sanjay J. Patel, Daniel H. Friendly, Yale N. Patt

IEEE Trans. Computers, 1999

1998

Putting the Fill Unit to Work: Dynamic Optimizations for Trace Cache Microprocessors.

Daniel H. Friendly, Sanjay J. Patel, Yale N. Patt

Proceedings of the 31st Annual IEEE/ACM International Symposium on Microarchitecture, 1998

1997

One Billion Transistors, One Uniprocessor, One Chip.

Yale N. Patt, Sanjay J. Patel, Marius Evers, Daniel H. Friendly, Jared Stark

Computer, 1997

Alternative Fetch and Issue Policies for the Trace Cache Fetch Mechanism.

Daniel H. Friendly, Sanjay J. Patel, Yale N. Patt

Proceedings of the Thirtieth Annual IEEE/ACM International Symposium on Microarchitecture, 1997