Sciweavers

227 search results - page 11 / 46
» Graph Rewriting for Hardware Dependent Program Optimizations
Sort
View
PASTE
2005
ACM
14 years 1 months ago
LANCET: a nifty code editing tool
This paper presents Lancet, a multi-platform software visualization tool that enables the inspection of programs at the binary code level. Implemented on top of the linktime rewri...
Ludo Van Put, Bjorn De Sutter, Matias Madou, Bruno...
ASAP
2007
IEEE
136views Hardware» more  ASAP 2007»
14 years 1 months ago
0/1 Knapsack on Hardware: A Complete Solution
We present a memory efficient, practical, systolic, parallel architecture for the complete 0/1 knapsack dynamic programming problem, including backtracking. This problem was inte...
K. Nibbelink, S. Rajopadhye, R. McConnell
RANDOM
1998
Springer
13 years 11 months ago
Using Approximation Hardness to Achieve Dependable Computation
Abstract. Redundancy has been utilized to achieve fault tolerant computation and to achieve reliable communication in networks of processors. These techniques can only be extended ...
Mike Burmester, Yvo Desmedt, Yongge Wang
ICPP
1993
IEEE
13 years 11 months ago
A Concurrent Dynamic Task Graph
Task graphs are used for scheduling tasks on parallel processors when the tasks have dependencies. If the execution of the program is known ahead of time, then the tasks can be st...
Theodore Johnson
CPE
1994
Springer
170views Hardware» more  CPE 1994»
13 years 11 months ago
Automatic Scalability Analysis of Parallel Programs Based on Modeling Techniques
When implementingparallel programs forparallel computer systems the performancescalability of these programs should be tested and analyzed on different computer configurations and...
Allen D. Malony, Vassilis Mertsiotakis, Andreas Qu...