Lea Hwang Lee
Motorola
Network
Latest external collaboration on country level. Dive into details by clicking on the dots.
Publication
Featured researches published by Lea Hwang Lee.
international symposium on low power electronics and design | 1999
Lea Hwang Lee; Bill Moyer; John Arends
A fair amount of work has been done in recent years on reducing power consumption in caches by using a small instruction buffer placed between the execution pipe and a larger main cache. These techniques, however, often degrade the overall system performance. In this paper, we propose using a small instruction buffer, also called a loop cache, to save power. A loop cache has no address tag store. It consists of a direct-mapped data array and a loop cache controller. The loop cache controller knows precisely whether the next instruction request will hit in the loop cache, well ahead of time. As a result, there is no performance degradation.
international symposium on microarchitecture | 1999
Lea Hwang Lee; Jeff Scott; Bill Moyer; John Arends
Many portable and embedded applications are characterized by spending a large fraction of execution time on small program loops. To improve performance many embedded systems use special instructions to handle program loop executions. These special instructions, however, consume opcode space, which is valuable in the embedded computing environments. In this paper, we propose a hardware technique for folding our branches when executing these small loops. This technique does not require any special branch instructions. It is based on the detection and utilization of certain short backward branch instructions (sbb). A sbb is any PC-relative branch instruction with a limited backward branch distance. Once an sbb is detected, its displacement field is used by the hardware to identify the actual program loop size. It does so by loading this negative displacement field into a counter and incrementing the counter for each instruction sequentially executed. As the count approaches zero, the hardware folds out the sbb by predicting that it is always taken. The hardware overhead for this technique is minimal. Using a 5-bit increment counter, the performance improvement over a set of embedded applications is about 7.5%.
international conference on computer design | 1999
Jeff Scott; Lea Hwang Lee; A. Chin; B. Moyer
The M/spl middot/CORE microRISC architecture has been developed to address the growing need for long battery life among todays portable applications. In this paper we present the architectural enhancements of the M3 processor the successor to the original M/spl middot/CORE M2 architecture. Specifically, we discuss the instruction buffer and pipeline enhancements, the branch prediction algorithm, branch folding for small program loops, the fast integer multiplier and several new instructions. We present performance comparisons between the M2 and M3 M/spl middot/CORE processors. Finally, we also discuss two system implementations utilizing the M/spl middot/CORE M3 processor.
Archive | 1996
William C. Moyer; John Arends; Lea Hwang Lee
Archive | 1999
Lea Hwang Lee; William C. Moyer; Jeffrey W. Scott; John Arends
Archive | 1996
William C. Moyer; Lea Hwang Lee; John Arends
Archive | 2006
William C. Moyer; Lea Hwang Lee
Archive | 1998
Jeff Scott; Lea Hwang Lee; John Arends; Bill Moyer
Archive | 2004
William C. Moyer; Lea Hwang Lee; Afzal Malik
international conference on computer design | 1999
Jeff Scott; Lea Hwang Lee; Anne Chin; John Arends; Bill Moyer