Sciweavers

339 search results - page 46 / 68
» Reducing Memory Ordering Overheads in Software Transactional...
Sort
View
ICCAD
1994
IEEE
109views Hardware» more  ICCAD 1994»
14 years 24 days ago
Efficient breadth-first manipulation of binary decision diagrams
We propose new techniques for efficient breadth-first iterative manipulation of ROBDDs. Breadth-first iterative ROBDD manipulation can potentially reduce the total elapsed time by...
Pranav Ashar, Matthew Cheong
TON
2008
125views more  TON 2008»
13 years 8 months ago
Two techniques for fast computation of constrained shortest paths
Abstract-- Computing constrained shortest paths is fundamental to some important network functions such as QoS routing, which is to find the cheapest path that satisfies certain co...
Shigang Chen, Meongchul Song, Sartaj Sahni
FASE
2010
Springer
14 years 3 months ago
A Lightweight and Portable Approach to Making Concurrent Failures Reproducible
Multithreaded concurrent programs often exhibit bugs due to unintended interferences among the concurrent threads. Such bugs are often hard to reproduce because they typically hap...
Qingzhou Luo, Sai Zhang, Jianjun Zhao, Min Hu
CASES
2007
ACM
14 years 20 days ago
A simplified java bytecode compilation system for resource-constrained embedded processors
Embedded platforms are resource-constrained systems in which performance and memory requirements of executed code are of critical importance. However, standard techniques such as ...
Carmen Badea, Alexandru Nicolau, Alexander V. Veid...
ISCAS
2003
IEEE
126views Hardware» more  ISCAS 2003»
14 years 1 months ago
Low power block based FIR filtering cores
— The authors present a number of complete cores which are specially tailored for the low power implementation of FIR filters executed using block processing. The paper reveals t...
Ahmet T. Erdogan, Tughrul Arslan