Sciweavers

2778 search results - page 449 / 556
» Limit complexities revisited
Sort
View
ASPLOS
2006
ACM
15 years 8 months ago
Tradeoffs in fine-grained heap memory protection
Different uses of memory protection schemes have different needs in terms of granularity. For example, heap security can benefit from chunk separation (by using protected "pa...
Jianli Shen, Guru Venkataramani, Milos Prvulovic
CF
2005
ACM
15 years 8 months ago
An efficient wakeup design for energy reduction in high-performance superscalar processors
In modern superscalar processors, the complex instruction scheduler could form the critical path of the pipeline stages and limit the clock cycle time. In addition, complex schedu...
Kuo-Su Hsiao, Chung-Ho Chen
FPGA
2008
ACM
136views FPGA» more  FPGA 2008»
15 years 7 months ago
A complexity-effective architecture for accelerating full-system multiprocessor simulations using FPGAs
Functional full-system simulators are powerful and versatile research tools for accelerating architectural exploration and advanced software development. Their main shortcoming is...
Eric S. Chung, Eriko Nurvitadhi, James C. Hoe, Bab...
BCS
2008
15 years 7 months ago
Beatbox - A Computer Simulation Environment for Computational Biology of the Heart
Despite over a century's study, the trigger mechanisms of cardiac arrhythmias are poorly understood. Even modern experimental methods do not provide sufficient temporal and s...
Ross McFarlane, Irina V. Biktasheva
DAGSTUHL
2007
15 years 7 months ago
Programming self developing blob machines for spatial computing.
: This is a position paper introducing blob computing: A Blob is a generic primitive used to structure a uniform computing substrate into an easier-to-program parallel virtual mach...
Frédéric Gruau, Christine Eisenbeis