Non-Clairvoyant Multiprocessor Scheduling of Jobs with Changing Execution Characteristics
暂无分享,去创建一个
[1] Philip S. Yu,et al. Smart SMART Bounds for Weighted Response Time Scheduling , 1999, SIAM J. Comput..
[2] Bala Kalyanasundaram,et al. Speed is as powerful as clairvoyance [scheduling problems] , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.
[3] Robert E. Tarjan,et al. Amortized efficiency of list update and paging rules , 1985, CACM.
[4] Bala Kalyanasundaram,et al. Speed is as powerful as clairvoyance , 2000, JACM.
[5] Raj Vaswani,et al. A dynamic processor allocation policy for multiprogrammed shared-memory multiprocessors , 1993, TOCS.
[6] Kenneth C. Sevcik,et al. Application Scheduling and Processor Allocation in Multiprogrammed Parallel Processing Systems , 1994, Perform. Evaluation.
[7] Mary K. Vernon,et al. The performance of multiprogrammed multiprocessor scheduling algorithms , 1990, SIGMETRICS '90.
[8] Xiaotie Deng,et al. Preemptive Scheduling of Parallel Jobs on Multiprocessors , 1996, SIAM J. Comput..
[9] John Zahorjan,et al. Scheduling memory constrained jobs on distributed memory parallel computers , 1995, SIGMETRICS '95/PERFORMANCE '95.
[10] Mary K. Vernon,et al. Use of application characteristics and limited preemption for run-to-completion parallel processor scheduling policies , 1994, SIGMETRICS.
[11] Mary K. Vernon,et al. Qualitative Behavior of the EQS Parallel Processor Allocation Policy , 1993 .
[12] Xiaotie Deng,et al. On Multiprocessor System Scheduling , 1996, SPAA '96.
[13] Lyle A. McGeoch,et al. Competitive algorithms for on-line problems , 1988, STOC '88.
[14] DengXiaotie,et al. Non-clair voy ant multiprocessor scheduling of jobs with changing execution characteristics , 2003 .
[15] Xiaotie Deng,et al. Competitive Implementation of Parallel Programs , 1993, SODA '93.
[16] Jeff Edmonds,et al. Scheduling in the dark , 1999, STOC '99.
[17] Thu D. Nguyen,et al. Maximizing speedup through self-tuning of processor allocation , 1996, Proceedings of International Conference on Parallel Processing.
[18] Anoop Gupta,et al. Process control and scheduling issues for multiprogrammed shared-memory multiprocessors , 1989, SOSP '89.
[19] Manoj Kumar,et al. Measuring Parallelism in Computation-Intensive Scientific/Engineering Applications , 1988, IEEE Trans. Computers.
[20] Anna R. Karlin,et al. Competitive snoopy caching , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).
[21] Tim Brecht,et al. Using Parallel Program Characteristics in Dynamic Processor Allocation Policies , 1996, Perform. Evaluation.
[22] John Zahorjan,et al. Processor scheduling in shared memory multiprocessors , 1990, SIGMETRICS '90.
[23] Philip S. Yu,et al. Scheduling parallel tasks to minimize average response time , 1994, SODA '94.
[24] Rajeev Motwani,et al. Non-clairvoyant scheduling , 1994, SODA '93.
[25] Philip S. Yu,et al. Scheduling parallelizable tasks to minimize average response time , 1994, SPAA '94.