Sciweavers

47 search results - page 6 / 10
» Strategies for Branch Target Buffers
Sort
View
CGF
2008
138views more  CGF 2008»
13 years 8 months ago
Geometry-Aware Framebuffer Level of Detail
This paper introduces a framebuffer level of detail algorithm for controlling the pixel workload in an interactive rendering application. Our basic strategy is to evaluate the sha...
Lei Yang, Pedro V. Sander, Jason Lawrence
VLSID
2002
IEEE
114views VLSI» more  VLSID 2002»
14 years 1 months ago
Minimizing Energy Consumption for High-Performance Processing
Power consumption is becoming an increasingly important constraint in the design of microprocessors. This paper examines the use of multiple constrained processors running at lowe...
Eric F. Weglarz, Kewal K. Saluja, Mikko H. Lipasti
RTCSA
2007
IEEE
14 years 2 months ago
A NOR Emulation Strategy over NAND Flash Memory
This work is motivated by a strong market demand in the replacement of NOR flash memory with NAND flash memory to cut down the cost in many embedded-system designs, such as mobi...
Jian-Hong Lin, Yuan-Hao Chang, Jen-Wei Hsieh, Tei-...
SPAA
2009
ACM
14 years 9 months ago
Dynamic external hashing: the limit of buffering
Hash tables are one of the most fundamental data structures in computer science, in both theory and practice. They are especially useful in external memory, where their query perf...
Zhewei Wei, Ke Yi, Qin Zhang
ICRA
2000
IEEE
89views Robotics» more  ICRA 2000»
14 years 28 days ago
A Leaping Maneuver for a Brachiating Robot
We report on a control strategy for the "leap" problem arising from an ape's fast brachiation when the next branch is far out of reach and the task involves a signi...
Jun Nakanishi, Toshio Fukuda