Sciweavers

350 search results - page 56 / 70
» Branching Programs for Tree Evaluation
Sort
View
MICRO
2006
IEEE
117views Hardware» more  MICRO 2006»
14 years 1 months ago
PathExpander: Architectural Support for Increasing the Path Coverage of Dynamic Bug Detection
Dynamic software bug detection tools are commonly used because they leverage run-time information. However, they suffer from a fundamental limitation, the Path Coverage Problem: t...
Shan Lu, Pin Zhou, Wei Liu, Yuanyuan Zhou, Josep T...
ASPLOS
2006
ACM
14 years 1 months ago
Understanding prediction-based partial redundant threading for low-overhead, high- coverage fault tolerance
Redundant threading architectures duplicate all instructions to detect and possibly recover from transient faults. Several lighter weight Partial Redundant Threading (PRT) archite...
Vimal K. Reddy, Eric Rotenberg, Sailashri Parthasa...
MICRO
1999
IEEE
98views Hardware» more  MICRO 1999»
13 years 12 months ago
Access Region Locality for High-Bandwidth Processor Memory System Design
This paper studies an interesting yet less explored behavior of memory access instructions, called access region locality. Unlike the traditional temporal and spatial data localit...
Sangyeun Cho, Pen-Chung Yew, Gyungho Lee
PCI
2005
Springer
14 years 1 months ago
Initial Experiences Porting a Bioinformatics Application to a Graphics Processor
Bioinformatics applications are one of the most relevant and compute-demanding applications today. While normally these applications are executed on clusters or dedicated parallel ...
Maria Charalambous, Pedro Trancoso, Alexandros Sta...
SC
1994
ACM
13 years 11 months ago
A parallel formulation of interior point algorithms
In recent years, interior point algorithms have been used successfully for solving mediumto large-size linear programming LP problems. In this paper we describe a highly parallel ...
George Karypis, Anshul Gupta, Vipin Kumar