Job Scheduling Using Successive Linear Programming Approximations of a Sparse Model
暂无分享,去创建一个
[1] Pierre-François Dutot,et al. Scheduling on hierarchical clusters using malleable tasks , 2001, SPAA '01.
[2] Stephen P. Boyd,et al. Enhancing Sparsity by Reweighted ℓ1 Minimization , 2007, 0711.1612.
[3] Shikharesh Majumdar,et al. Scheduling in multiprogrammed parallel systems , 1988, SIGMETRICS 1988.
[4] Leslie G. Valiant,et al. A bridging model for parallel computation , 1990, CACM.
[5] Henri Casanova,et al. SimGrid: A Generic Framework for Large-Scale Distributed Experiments , 2008, Tenth International Conference on Computer Modeling and Simulation (uksim 2008).
[6] Dror G. Feitelson,et al. The workload on parallel supercomputers: modeling the characteristics of rigid jobs , 2003, J. Parallel Distributed Comput..
[7] Jean-Marc Nicod,et al. Using Virtualization and Job Folding for Batch Scheduling , 2011, 2011 10th International Symposium on Parallel and Distributed Computing.
[8] Emmanuel J. Candès,et al. Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information , 2004, IEEE Transactions on Information Theory.
[9] Wotao Yin,et al. Iteratively reweighted algorithms for compressive sensing , 2008, 2008 IEEE International Conference on Acoustics, Speech and Signal Processing.
[10] Tom Goldstein,et al. The Split Bregman Method for L1-Regularized Problems , 2009, SIAM J. Imaging Sci..
[11] Dror G. Feitelson,et al. Job Scheduling in Multiprogrammed Parallel Systems , 1997 .
[12] Evripidis Bampis,et al. Scheduling Independent Multiprocessor Tasks , 2002, Algorithmica.
[13] David L Donoho,et al. Compressed sensing , 2006, IEEE Transactions on Information Theory.
[14] Guochuan Zhang,et al. On-line scheduling of parallel jobs in a list , 2007, J. Sched..
[15] Fabio Kon,et al. Scheduling Moldable BSP Tasks , 2005, JSSPP.
[16] Klaus Jansen,et al. Scheduling to Minimize the Average Completion Time of Dedicated Tasks , 2000, FSTTCS.
[17] Pierre-François Dutot,et al. Bi-criteria algorithm for scheduling jobs on cluster platforms , 2004, SPAA '04.
[18] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[19] Philip S. Yu,et al. Approximate algorithms scheduling parallelizable tasks , 1992, SPAA '92.
[20] Dror G. Feitelson,et al. On the definition of "on-line" in job scheduling problems , 2005, SIGA.
[21] E.L. Lawler,et al. Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey , 1977 .