Sciweavers

185 search results - page 6 / 37
» Parallel Sorting with Limited Bandwidth
Sort
View
HOTI
2005
IEEE
14 years 1 months ago
Challenges in Building a Flat-Bandwidth Memory Hierarchy for a Large-Scale Computer with Proximity Communication
Memory systems for conventional large-scale computers provide only limited bytes/s of data bandwidth when compared to their flop/s of instruction execution rate. The resulting bo...
Robert J. Drost, Craig Forrest, Bruce Guenin, Ron ...
IPPS
2000
IEEE
13 years 12 months ago
The Memory Bandwidth Bottleneck and its Amelioration by a Compiler
As the speed gap between CPU and memory widens, memory hierarchy has become the primary factor limiting program performance. Until now, the principal focus of hardware and softwar...
Chen Ding, Ken Kennedy
TVLSI
2010
13 years 2 months ago
Bandwidth Adaptive Hardware Architecture of K-Means Clustering for Video Analysis
K-Means is a clustering algorithm that is widely applied in many fields, including pattern classification and multimedia analysis. Due to real-time requirements and computational-c...
Tse-Wei Chen, Shao-Yi Chien
ICASSP
2009
IEEE
14 years 2 months ago
Bandwidth adaptive hardware architecture of K-Means clustering for intelligent video processing
K-Means is a clustering algorithm that is widely applied in many elds, including pattern classi cation and multimedia analysis. Due to real-time requirements and computational-cos...
Tse-Wei Chen, Shao-Yi Chien
HIPC
2005
Springer
14 years 29 days ago
Cost-Optimal Job Allocation Schemes for Bandwidth-Constrained Distributed Computing Systems
Abstract. This paper formulates the job allocation problem in distributed systems with bandwidth-constrained nodes. The bandwidth limitations of the nodes play an important role in...
Preetam Ghosh, Kalyan Basu, Sajal K. Das