Sciweavers

7648 search results - page 1314 / 1530
» A Data Locality Optimizing Algorithm
Sort
View
PAM
2011
Springer
14 years 6 months ago
Evolution of Cache Replacement Policies to Track Heavy-Hitter Flows
Several important network applications cannot easily scale to higher data rates without requiring focusing just on the large traffic flows. Recent works have discussed algorithmic...
Martin Zádník, Marco Canini
ARC
2012
Springer
317views Hardware» more  ARC 2012»
13 years 11 months ago
A High Throughput FPGA-Based Implementation of the Lanczos Method for the Symmetric Extremal Eigenvalue Problem
Iterative numerical algorithms with high memory bandwidth requirements but medium-size data sets (matrix size ∼ a few 100s) are highly appropriate for FPGA acceleration. This pap...
Abid Rafique, Nachiket Kapre, George A. Constantin...
WWW
2008
ACM
16 years 3 months ago
Facetnet: a framework for analyzing communities and their evolutions in dynamic networks
We discover communities from social network data, and analyze the community evolution. These communities are inherent characteristics of human interaction in online social network...
Yu-Ru Lin, Yun Chi, Shenghuo Zhu, Hari Sundaram, B...
SIGSOFT
2006
ACM
15 years 9 months ago
Bit level types for high level reasoning
Bitwise operations are commonly used in low-level systems code to access multiple data fields that have been packed into a single word. Program analysis tools that reason about s...
Ranjit Jhala, Rupak Majumdar
HPDC
1999
IEEE
15 years 7 months ago
Remote Application Scheduling on Metacomputing Systems
Efficient and robust metacomputing requires the decomposition of complex jobs into tasks that must be scheduled on distributed processing nodes. There are various ways of creating...
Heath A. James, Kenneth A. Hawick
« Prev « First page 1314 / 1530 Last » Next »