Sciweavers

273 search results - page 40 / 55
» Two Level Job-Scheduling Strategies for a Computational Grid
Sort
View
ICS
1999
Tsinghua U.
13 years 11 months ago
Improving memory hierarchy performance for irregular applications
The performance of irregular applications on modern computer systems is hurt by the wide gap between CPU and memory speeds because these applications typically underutilize multi-...
John M. Mellor-Crummey, David B. Whalley, Ken Kenn...
NCA
2005
IEEE
14 years 1 months ago
Decentralized Schemes for Size Estimation in Large and Dynamic Groups
Large-scale and dynamically changing distributed systems such as the Grid, peer-to-peer overlays, etc., need to collect several kinds of global statistics in a decentralized manne...
Dionysios Kostoulas, Dimitrios Psaltoulis, Indrani...
TRECVID
2008
13 years 9 months ago
National Institute of Informatics, Japan at TRECVID 2008
This paper reports our experiments for TRECVID 2008 tasks: high level feature extraction, search and contentbased copy detection. For the high level feature extraction task, we use...
Duy-Dinh Le, Xiaomeng Wu, Shin'ichi Satoh, Sheetal...
SIGCSE
2008
ACM
132views Education» more  SIGCSE 2008»
13 years 7 months ago
A case study of retention practices at the University of Illinois at Urbana-Champaign
Computer science is seeing a decline in enrollment at all levels of education. One key strategy for reversing this decline is to improve methods of student retention. This paper, ...
Tanya L. Crenshaw, Erin W. Chambers, Heather Metca...
TSP
2010
13 years 2 months ago
Optimization and analysis of distributed averaging with short node memory
Distributed averaging describes a class of network algorithms for the decentralized computation of aggregate statistics. Initially, each node has a scalar data value, and the goal...
Boris N. Oreshkin, Mark Coates, Michael G. Rabbat