Sciweavers

75 search results - page 14 / 15
» Start Globally, Optimize Locally, Predict Globally: Improvin...
Sort
View
SOSP
2009
ACM
14 years 4 months ago
Quincy: fair scheduling for distributed computing clusters
This paper addresses the problem of scheduling concurrent jobs on clusters where application data is stored on the computing nodes. This setting, in which scheduling computations ...
Michael Isard, Vijayan Prabhakaran, Jon Currey, Ud...
CORR
2007
Springer
95views Education» more  CORR 2007»
13 years 7 months ago
Scheduling in Data Intensive and Network Aware (DIANA) Grid Environments
In Grids scheduling decisions are often made on the basis of jobs being either data or computation intensive: in data intensive situations jobs may be pushed to the data and in co...
Richard McClatchey, Ashiq Anjum, Heinz Stockinger,...
CVPR
2005
IEEE
14 years 9 months ago
Subspace Analysis Using Random Mixture Models
In [1], three popular subspace face recognition methods, PCA, Bayes, and LDA were analyzed under the same framework and an unified subspace analysis was proposed. However, since t...
Xiaogang Wang, Xiaoou Tang
ICS
2005
Tsinghua U.
14 years 1 months ago
Lightweight reference affinity analysis
Previous studies have shown that array regrouping and structure splitting significantly improve data locality. The most effective technique relies on profiling every access to eve...
Xipeng Shen, Yaoqing Gao, Chen Ding, Roch Archamba...
INFOCOM
2009
IEEE
14 years 2 months ago
Mobility-Driven Scheduling in Wireless Networks
—The design of scheduling policies for wireless data systems has been driven by a compromise between the objectives of high overall system throughput and the degree of fairness a...
Sem C. Borst, Nidhi Hegde, Alexandre Proutiere