Sciweavers

1628 search results - page 207 / 326
» Dynamically Adaptive Parallel Programs
Sort
View
ASAP
2007
IEEE
136views Hardware» more  ASAP 2007»
14 years 4 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
ISPDC
2008
IEEE
14 years 4 months ago
Token Loss Detection for Random Walk based Algorithm
Self-stabilizing token circulation algorithms are not always adapted for dynamic networks. Random walks are well known to play a crucial role in the design of randomized algorithm...
Thibault Bernard, Alain Bui, Devan Sohier
IPPS
2003
IEEE
14 years 3 months ago
Task Pool Teams for Implementing Irregular Algorithms on Clusters of SMPs
The characteristics of irregular algorithms make a parallel implementation difficult, especially for PC clusters or clusters of SMPs. These characteristics may include an unpredi...
Judith Hippold, Gudula Rünger
TC
1998
13 years 10 months ago
An Efficient Solution to the Cache Thrashing Problem Caused by True Data Sharing
—When parallel programs are executed on multiprocessors with private caches, a set of data may be repeatedly used and modified by different threads. Such data sharing can often r...
Guohua Jin, Zhiyuan Li, Fujie Chen
HPCA
2007
IEEE
14 years 4 months ago
An Adaptive Cache Coherence Protocol Optimized for Producer-Consumer Sharing
Shared memory multiprocessors play an increasingly important role in enterprise and scientific computing facilities. Remote misses limit the performance of shared memory applicat...
Liqun Cheng, John B. Carter, Donglai Dai