Open Access. Powered by Scholars. Published by Universities.®

Engineering Commons

Open Access. Powered by Scholars. Published by Universities.®

Electrical and Computer Engineering

University of Texas Rio Grande Valley

Series

2005

Articles 1 - 2 of 2

Full-Text Articles in Engineering

A Study For Branch Predictors To Alleviate The Aliasing Problem, Tieling Xie, Robert Evans, Yul Chu Jan 2005

A Study For Branch Predictors To Alleviate The Aliasing Problem, Tieling Xie, Robert Evans, Yul Chu

Electrical and Computer Engineering Faculty Publications and Presentations

Modern processors usually have a deep pipeline, superscalar architecture to obtain higher performance. As pipelines are getting deeper, accurate branch prediction is critical to achieve high performance, since fetched instructions after a branch have to be flushed from inside the pipeline when the prediction is wrong. This paper studies the performance of several types of branch predictors, starting from local branch predictor and global branch predictor. Simulation results show that the global history predictor outperforms the local history predictor due to the characteristic that branches tend to be correlated. However, the global history predictor still suffers an aliasing problem that …


An Enhanced Dynamic Packet Buffer Management, Vinod Rajan, Yul Chu Jan 2005

An Enhanced Dynamic Packet Buffer Management, Vinod Rajan, Yul Chu

Electrical and Computer Engineering Faculty Publications and Presentations

A packet buffer for a protocol processor is a large shared memory space that holds incoming data packets in a computer network. This paper investigates four packet buffer management algorithms for a protocol processor including dynamic algorithm with different thresholds (DADT), which is proposed to reduce the packet loss ratio efficiently. The proposed algorithm takes the advantage of different packet sizes for each application by allocating buffer space for each queue proportionally. According to our simulation results, the DADT algorithm works well in reducing packet loss ratio compared to other three algorithms.