Sciweavers

202 search results - page 30 / 41
» Dynamic and Redundant Data Placement
Sort
View
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
ICMCS
1995
IEEE
157views Multimedia» more  ICMCS 1995»
13 years 11 months ago
A Scalable Video-on-Demand Service for the Provision of VCR-Like Functions
– One approach to supporting continuous media traffic is via resource reservation at connection establishment time. The shortcomings of this approach are the lack of flexibility...
Huang-Jen Chen, A. Krishnamurthy, Thomas D. C. Lit...
JODL
2006
88views more  JODL 2006»
13 years 7 months ago
BroadScale: Efficient scaling of heterogeneous storage systems
Abstract Scalable storage architectures enable digital libraries and archives for the addition or removal of storage devices to increase storage capacity and bandwidth or retire ol...
Shu-Yuen Didi Yao, Cyrus Shahabi, Roger Zimmermann
POPL
2010
ACM
13 years 6 months ago
S-Net for multi-memory multicores
S-NET is a declarative coordination language and component technology aimed at modern multi-core/many-core architectures and systems-on-chip. It builds on the concept of stream pr...
Clemens Grelck, Jukka Julku, Frank Penczek
DEXA
2004
Springer
98views Database» more  DEXA 2004»
14 years 1 months ago
On Improving the Performance Dependability of Unstructured P2P Systems via Replication
Abstract. The ever-increasing popularity of peer-to-peer (P2P) systems provides a strong motivation for designing a dependable P2P system. Dependability in P2P systems can be viewe...
Anirban Mondal, Yi Lifu, Masaru Kitsuregawa